io.github.daedalus/mcp-parigp
PYPI · MCP-PARIGP
MCP server exposing cypari2 (PARI/GP) number theory library
Available components
Last scanned (16 hours ago)
Scores higher than 73% of PyPI servers
Category Health and Science
How this component scores in each security and reliability category. Every signal is checked automatically from public evidence about the published package, including repeated runs of it in an isolated sandbox, and we only credit what we can confirm. How we score → Why this is hard to score →
Supply Chain Security50
- Malware scan not yet available for this package.Unverified
- No known CVEs affecting this package version or its production dependencies.Pass
- Runs hatchling.build at install time, a recognised build step with no custom scripting around it. View diagnostics → Pass
- 1 of 17 dependencies flagged as unhealthy. View diagnostics → Partial
Provenance & Transparency96
- Source repository is publicly reachable at the declared URL. View diagnostics → Pass
- Cryptographically verified build provenance (signed, bound to daedalus/mcp-parigp). View diagnostics → Pass
- Clear OSI-approved license (MIT).Pass
- Actively maintained (last published 219 days ago).Pass
- Disclosure check failed: no security disclosure policy was found in the source repository. See how to fix → Fail
Schema Quality & AI Usability65
- AI-judged instruction clarity (good).Pass
- Tool/resource definitions use about 4981 tokens (~34/item across 143 items; 143 tools + 0 resources), lean.Pass
- Usage-examples check failed: none of the tools include examples. See how to fix → Fail
Stability & Change Management100
- No destabilizing schema changes in the last 30 days.Pass
Tool Coverage100
- 100% of tools have a non-trivial description (not blank, and not just the tool's name).Pass
- 99% of tool parameters carry a description.Partial
- Structured output schemas are declared (29% of tools); any adoption earns full credit.Pass
Tool Safety75
- No prompt-injection markers were found in the server instructions, tool names or descriptions we captured.Pass
- 0 of 2 tool(s) whose name or description implies an irreversible operation declare an MCP destructiveHint annotation; "eval_expression" implies "eval" and declares no destructiveHint at all, which the MCP spec reads as destructive by default. See how to fix → Fail
- An AI judge read all 143 captured unit(s) of tool text and found none that tries to manipulate the model reading it.Pass
Capabilities100
- Implements a current MCP spec version (2026-07-28).Pass
Every change we have recorded for this component, newest first. Security-relevant changes are always shown. ▲ marks a change for the better, ▼ a change for the worse; unmarked changes are neutral.
- 3 Nov 26 −15
- Malware scan: pass → unverified ▼ security
- 31 Oct 26 +15
- Malware scan: unverified → pass ▲ security
- 30 Oct 26 −15
- Malware scan: pass → unverified ▼ security
- Stability: 0.97 → pass security
- 29 Oct 26 +1
No change was recorded against any check on this day. Stability & Change Management went from 93 to 97. That category is still filling its 30-day observation window: 28 days of observed history at the previous scan, 29 at this one. The score rises as the window fills, whether or not the server changes.
- 28 Oct 26 −1
- Stability: pass → 0.93 functional
- 27 Oct 26 +15
- Malware scan: unverified → pass ▲ security
- 26 Oct 26 −15
- Malware scan: pass → unverified ▼ security
- 25 Oct 26 +15
- Malware scan: unverified → pass ▲ security
Diagnostic detail from the automated scan of this channel: what the scanner observed at each step, so you can see exactly where a check passed or failed. It is informational only and never changes the trust score.
Captured 4 Nov 2026 · Analysed pypi/mcp-parigp@0.1.0
Provenance Verified
A signed build attestation was found and verified, binding this exact artifact to the source repository it claims to come from.
| Result | Verified |
|---|---|
| Ecosystem | pypi |
| Reason | Verified |
| Discovered via | Registry attestation endpoint |
| Source repo | daedalus/mcp-parigp |
| Certificate issuer | https://token.actions.githubusercontent.com |
| Certificate SAN | https://github.com/daedalus/mcp-parigp/.github/workflows/pypi-publish.yml@refs/tags/v0.1.0 |
| Rekor log index | 1197329692 |
| Predicate type | PyPI publish attestation https://docs.pypi.org/attestations/publish/v1 |
| Subject digest | sha256:d77786696ec5d7d3ba22c472e858d58b84ec63b7b170f62815c116934ebbd9ad |
Background: How many MCP packages publish verified provenance →
Install scripts 1 script
| Hook | Tier | Command |
|---|---|---|
| build_backend | allowlisted | hatchling.build |
Background: Why install scripts are a supply-chain risk →
Dependencies 17 packages
| Packages resolved | 17 |
|---|---|
| Stale | 1 |
| Tree resolution | Complete |
Background: SBOMs and build attestations, explained →
The tools this component advertises to a client, with an estimated token cost for each. Expand a tool to see its parameters and schema. The per-tool counts are indicative and are not scored directly; the schema's total context footprint is one signal in Schema Quality & AI Usability. A tool's description is untrusted text the model reads on every call, which is what makes this list a security surface and not just an inventory: how tool poisoning works →
factorial Factorial ~22
Compute the factorial n!.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | Non-negative integer. |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
factorpadic Factorpadic ~50
Factor a polynomial over the p-adic numbers.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | – | p-adic precision. |
| p | integer | yes | Prime p. |
| pol | string | yes | Polynomial as a string. |
No output schema declared.
No examples provided.
fibonacci Fibonacci ~23
Compute the nth Fibonacci number.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | Non-negative integer. |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
gcd Gcd ~34
Compute the greatest common divisor of two integers.
| Name | Type | Req | Description |
|---|---|---|---|
| a | integer | yes | First integer. |
| b | integer | yes | Second integer. |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
genus2red Genus2Red ~43
Reduce a genus 2 curve.
| Name | Type | Req | Description |
|---|---|---|---|
| P | – | yes | Hyperelliptic polynomial y^2 = P. |
| p | integer | – | Optional prime for local reduction. |
No output schema declared.
No examples provided.
get_pari_version Get Pari Version ~19
Get the PARI/GP version string.
Input schema present but exposes no named parameters.
| Name | Type | Req | Description |
|---|---|---|---|
| result | string | yes | – |
No examples provided.
get_real_precision Get Real Precision ~21
Get the current PARI default real precision in decimal digits.
Input schema present but exposes no named parameters.
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
get_real_precision_bits Get Real Precision Bits ~21
Get the current PARI default real precision in bits.
Input schema present but exposes no named parameters.
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
getrand Getrand ~17
Get PARI's current random number seed.
Input schema present but exposes no named parameters.
No output schema declared.
No examples provided.
hess Hess ~24
Compute the Hessenberg form of a matrix.
| Name | Type | Req | Description |
|---|---|---|---|
| m | – | yes | Square matrix. |
No output schema declared.
No examples provided.
hilbert Hilbert ~55
Compute the Hilbert symbol (n, m) or (n, m)_p.
| Name | Type | Req | Description |
|---|---|---|---|
| m | integer | yes | Integer. |
| n | integer | yes | Integer. |
| p | integer | – | Prime (0 for infinite place). |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
I ~12
Get the imaginary unit.
Input schema present but exposes no named parameters.
| Name | Type | Req | Description |
|---|---|---|---|
| imag | number | yes | – |
| real | number | yes | – |
No examples provided.
idealadd Idealadd ~40
Add two ideals in a number field.
| Name | Type | Req | Description |
|---|---|---|---|
| ideal1 | – | yes | First ideal. |
| ideal2 | – | yes | Second ideal. |
| nf | – | yes | Number field structure. |
No output schema declared.
No examples provided.
idealfactor Idealfactor ~32
Factor an ideal in a number field.
| Name | Type | Req | Description |
|---|---|---|---|
| ideal | – | yes | Ideal to factor. |
| nf | – | yes | Number field structure. |
No output schema declared.
No examples provided.
idealmul Idealmul ~40
Multiply two ideals in a number field.
| Name | Type | Req | Description |
|---|---|---|---|
| ideal1 | – | yes | First ideal. |
| ideal2 | – | yes | Second ideal. |
| nf | – | yes | Number field structure. |
No output schema declared.
No examples provided.
idealpow Idealpow ~40
Compute a power of an ideal.
| Name | Type | Req | Description |
|---|---|---|---|
| ideal | – | yes | Ideal to power. |
| n | integer | yes | Exponent. |
| nf | – | yes | Number field structure. |
No output schema declared.
No examples provided.
init_primes Init Primes ~28
Initialize the primes table up to M.
| Name | Type | Req | Description |
|---|---|---|---|
| M | integer | yes | Upper bound for primes. |
No output schema declared.
No examples provided.
integ Integ ~34
Compute the integral of a polynomial.
| Name | Type | Req | Description |
|---|---|---|---|
| pol | string | yes | Polynomial as a string. |
| v | string | – | Variable name. |
No output schema declared.
No examples provided.
is_square Is Square ~24
Test if n is a perfect square.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | Integer. |
| Name | Type | Req | Description |
|---|---|---|---|
| result | boolean | yes | – |
No examples provided.
ispower Ispower ~43
Test if n is a perfect k-th power.
| Name | Type | Req | Description |
|---|---|---|---|
| k | integer | – | Exponent (0 or omitted means test any power). |
| n | integer | yes | Integer. |
No output schema declared.
No examples provided.
isprime Isprime ~25
Test if an integer is prime.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | Integer to test. |
| Name | Type | Req | Description |
|---|---|---|---|
| result | boolean | yes | – |
No examples provided.
jacobi Jacobi ~35
Compute the Jacobi symbol (a/n).
| Name | Type | Req | Description |
|---|---|---|---|
| a | integer | yes | Integer. |
| n | integer | yes | Odd positive integer. |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
lcm Lcm ~35
Compute the least common multiple of two integers.
| Name | Type | Req | Description |
|---|---|---|---|
| a | integer | yes | First integer. |
| b | integer | yes | Second integer. |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
legendre Legendre ~34
Compute the Legendre symbol (a/p).
| Name | Type | Req | Description |
|---|---|---|---|
| a | integer | yes | Integer. |
| p | integer | yes | Odd prime. |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
lfun Lfun ~40
Compute general L-function.
| Name | Type | Req | Description |
|---|---|---|---|
| F | – | – | L-function data (optional). |
| r | integer | – | Derivative order. |
| s | – | yes | Complex parameter. |
No output schema declared.
No examples provided.
lfuntheta Lfuntheta ~40
Compute theta function of L-function.
| Name | Type | Req | Description |
|---|---|---|---|
| F | – | yes | L-function data. |
| precision | integer | – | Optional precision. |
| t | – | yes | Real parameter. |
No output schema declared.
No examples provided.
lift Lift ~24
Lift a modular object (remove Mod wrapper).
| Name | Type | Req | Description |
|---|---|---|---|
| mod | – | yes | A modular object. |
No output schema declared.
No examples provided.
List ~26
Create an empty list or convert to a list.
| Name | Type | Req | Description |
|---|---|---|---|
| x | – | – | Optional object to convert. |
No output schema declared.
No examples provided.
log Log ~28
Compute natural logarithm.
| Name | Type | Req | Description |
|---|---|---|---|
| precision | integer | – | Optional precision. |
| x | – | yes | Positive number. |
No output schema declared.
No examples provided.
lucas Lucas ~24
Compute the nth Lucas number.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | Non-negative integer. |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
Mat ~20
Convert to a matrix.
| Name | Type | Req | Description |
|---|---|---|---|
| x | – | yes | Object to convert. |
No output schema declared.
No examples provided.
matcharpoly Matcharpoly ~33
Compute the characteristic polynomial of a matrix.
| Name | Type | Req | Description |
|---|---|---|---|
| m | – | yes | Square matrix. |
| v | string | – | Variable name. |
No output schema declared.
No examples provided.
matdet Matdet ~22
Compute the determinant of a matrix.
| Name | Type | Req | Description |
|---|---|---|---|
| m | – | yes | Square matrix. |
No output schema declared.
No examples provided.
mateigen Mateigen ~23
Compute the eigenvalues of a matrix.
| Name | Type | Req | Description |
|---|---|---|---|
| m | – | yes | Square matrix. |
No output schema declared.
No examples provided.
matid Matid ~27
Create an n x n identity matrix.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | Size of the matrix. |
No output schema declared.
No examples provided.
matimage Matimage ~21
Compute the image of a matrix.
| Name | Type | Req | Description |
|---|---|---|---|
| m | – | yes | Matrix. |
No output schema declared.
No examples provided.
matinv Matinv ~25
Compute the inverse of a matrix.
| Name | Type | Req | Description |
|---|---|---|---|
| m | – | yes | Invertible square matrix. |
No output schema declared.
No examples provided.
matker Matker ~21
Compute the kernel of a matrix.
| Name | Type | Req | Description |
|---|---|---|---|
| m | – | yes | Matrix. |
No output schema declared.
No examples provided.
matrank Matrank ~21
Compute the rank of a matrix.
| Name | Type | Req | Description |
|---|---|---|---|
| m | – | yes | Matrix. |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
matrix Matrix ~57
Create an m x n matrix.
| Name | Type | Req | Description |
|---|---|---|---|
| entries | array | – | List of entries (optional). |
| m | integer | yes | Number of rows (or size if n=0). |
| n | integer | – | Number of columns (default 0). |
No output schema declared.
No examples provided.
matzero Matzero ~44
Create a zero matrix.
| Name | Type | Req | Description |
|---|---|---|---|
| m | integer | yes | Number of rows (or size if n=0). |
| n | integer | – | Number of columns (default 0). |
No output schema declared.
No examples provided.
Mod ~31
Create a modular number or polynomial.
| Name | Type | Req | Description |
|---|---|---|---|
| a | – | yes | Value. |
| b | – | yes | Modulus (integer or polynomial). |
No output schema declared.
No examples provided.
modular_lambda Modular Lambda ~39
Compute the modular lambda function.
| Name | Type | Req | Description |
|---|---|---|---|
| precision | integer | – | Optional precision. |
| tau | – | yes | Lattice parameter (Im(tau) > 0). |
No output schema declared.
No examples provided.
modulr_sym Modulr Sym ~38
Compute the modular symbol.
| Name | Type | Req | Description |
|---|---|---|---|
| g | integer | – | Weight. |
| precision | integer | – | Optional precision. |
| s | – | yes | Complex number. |
No output schema declared.
No examples provided.
moebius Moebius ~27
Compute the Möbius function mu(n).
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | Positive integer. |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
nextprime Nextprime ~23
Find the next prime after n.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | Integer. |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
nfinit Nfinit ~30
Initialize a number field defined by a polynomial.
| Name | Type | Req | Description |
|---|---|---|---|
| pol | string | yes | Defining polynomial as a string. |
No output schema declared.
No examples provided.
norm Norm ~37
Compute the norm of a polynomial/algebraic number.
| Name | Type | Req | Description |
|---|---|---|---|
| pol | – | yes | Polynomial or algebraic number. |
| v | string | – | Variable name. |
No output schema declared.
No examples provided.
one One ~13
Get the integer 1.
Input schema present but exposes no named parameters.
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
phi Phi ~25
Compute Euler's totient function phi(n).
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | Positive integer. |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
How do I install the io.github.daedalus/mcp-parigp server?
io.github.daedalus/mcp-parigp runs locally as a PyPI package, launched with uvx mcp-parigp. Ready-made configuration for Claude, Cursor, VS Code, Codex and 5 more is on this page, copied from each client's own documentation.
pypi · mcp-parigp
claude mcp add daedalus-mcp-parigp -- uvx mcp-parigp
What is the io.github.daedalus/mcp-parigp server?
io.github.daedalus/mcp-parigp is listed in the public MCP registry as io.github.daedalus/mcp-parigp. MCP server exposing cypari2 (PARI/GP) number theory library. This page covers its PyPI package (mcp-parigp).
Is the io.github.daedalus/mcp-parigp server safe to use?
io.github.daedalus/mcp-parigp scores 76 out of 100 on VerifyMCP. We found no known CVEs affecting it as of 4 November 2026. Its build provenance is signed and verified. That is a record of what we were able to check automatically, not an endorsement. The category breakdown on this page shows every signal behind the number, including the ones we could not confirm.
What tools does the io.github.daedalus/mcp-parigp server expose?
io.github.daedalus/mcp-parigp exposes 143 tools: eval_expression, get_pari_version, set_real_precision, get_real_precision, set_real_precision_bits, and 138 more. Their descriptions and schemas cost roughly 4,981 tokens of context every time the server is loaded.
Is the io.github.daedalus/mcp-parigp server still maintained?
io.github.daedalus/mcp-parigp is still listed as active in the MCP registry. We last reached this channel on 4 November 2026. Those dates come from our own scans of the registry and the channel itself, not from anything the publisher announced.
What licence is the io.github.daedalus/mcp-parigp server under?
io.github.daedalus/mcp-parigp declares the MIT licence, which is OSI-approved. That covers the source only, and says nothing about the cost of any service it calls.