Skip to content
verify mcp Beta VerifyMCP is currently in beta. If you notice any issues, get in touch and we’ll put it right.

io.github.daedalus/mcp-parigp

PYPI · MCP-PARIGP

MCP server exposing cypari2 (PARI/GP) number theory library

Available components

−14 this week 76 Trust /100

Last scanned (15 hours ago)

Scores higher than 73% of PyPI servers

Category Health and Science

Trust breakdown (7 categories)

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
Changelog

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
Diagnostics

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 →

MCP tools · 143 exposed · ~4,981 tokens

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 →

Tool Tokens
abs ~28

Compute absolute value.

NameTypeReqDescription
precisioninteger–Optional precision.
x–yesNumber or object.

No output schema declared.

No examples provided.

acos ~34

Compute arccosine.

NameTypeReqDescription
precisioninteger–Optional precision.
x–yesNumber in [-1, 1].

No output schema declared.

No examples provided.

acosh ~33

Compute inverse hyperbolic cosine.

NameTypeReqDescription
precisioninteger–Optional precision.
x–yesNumber >= 1.

No output schema declared.

No examples provided.

addprimes ~36

Add primes to the factorisation table.

NameTypeReqDescription
primesarray–List of primes to add (or None to get current list).

No output schema declared.

No examples provided.

agm ~47

Compute the arithmetic-geometric mean.

NameTypeReqDescription
precisioninteger–Optional precision.
x–yesFirst number.
y––Second number (if None, uses x and 1).

No output schema declared.

No examples provided.

airy ~25

Compute Airy functions Ai(z) and Bi(z).

NameTypeReqDescription
z–yesComplex argument.

No output schema declared.

No examples provided.

algdep ~52

Find polynomial of degree k with integer coefficients approximating x.

NameTypeReqDescription
flaginteger–Optional accuracy flag.
kintegeryesDegree of polynomial.
x–yesReal/complex/p-adic number.

No output schema declared.

No examples provided.

allocatemem ~58

Change the PARI stack size.

NameTypeReqDescription
sizeinteger–New stack size in bytes. If 0, doubles current size.
sizemaxinteger–Maximum stack size in bytes. If 0, uses current maximum.
NameTypeReqDescription
resultstringyes–

No examples provided.

asin ~32

Compute arcsine.

NameTypeReqDescription
precisioninteger–Optional precision.
x–yesNumber in [-1, 1].

No output schema declared.

No examples provided.

asinh ~30

Compute inverse hyperbolic sine.

NameTypeReqDescription
precisioninteger–Optional precision.
x–yesNumber.

No output schema declared.

No examples provided.

atan ~27

Compute arctangent.

NameTypeReqDescription
precisioninteger–Optional precision.
x–yesNumber.

No output schema declared.

No examples provided.

atanh ~36

Compute inverse hyperbolic tangent.

NameTypeReqDescription
precisioninteger–Optional precision.
x–yesNumber in (-1, 1).

No output schema declared.

No examples provided.

bessel ~39

Compute the Bessel function J_nu(x).

NameTypeReqDescription
nu–yesOrder.
precisioninteger–Optional precision.
x–yesArgument.

No output schema declared.

No examples provided.

besselh ~40

Compute the Bessel function H_nu(x).

NameTypeReqDescription
nu–yesOrder.
precisioninteger–Optional precision.
x–yesArgument.

No output schema declared.

No examples provided.

bezout ~43

Compute the Bezout identity: gcd(a,b) = a*u + b*v.

NameTypeReqDescription
aintegeryesFirst integer.
bintegeryesSecond integer.

No output schema declared.

No examples provided.

binomial ~37

Compute the binomial coefficient C(n,k).

NameTypeReqDescription
kintegeryesNon-negative integer.
nintegeryesNon-negative integer.
NameTypeReqDescription
resultintegeryes–

No examples provided.

bnfinit ~49

Initialize a number field with Buchmann's algorithm.

NameTypeReqDescription
do_buchallinteger–Compute full Buchmann's algorithm (default 0).
polstringyesDefining polynomial.

No output schema declared.

No examples provided.

bnrinit ~55

Initialize a ray number field (class field).

NameTypeReqDescription
modulus–yesModulus for ray class group.
nf–yesNumber field from nfinit.
signinteger–1 for full, -1 for real.

No output schema declared.

No examples provided.

bnrL1 ~52

Compute the first derivative of Artin L-function.

NameTypeReqDescription
bnr–yesBNR structure from bnrinit.
flaginteger–Computation flag.
s––Complex parameter (optional).

No output schema declared.

No examples provided.

bnrrootnumber ~50

Compute the root number of Artin L-function.

NameTypeReqDescription
bnr–yesBNR structure.
character––Dirichlet character (optional).
flaginteger–Computation flag.

No output schema declared.

No examples provided.

Catalan ~25

Get Catalan's constant.

NameTypeReqDescription
precisioninteger–Optional precision in bits.
NameTypeReqDescription
resultnumberyes–

No examples provided.

centerlift ~24

Lift a modular object with centered representatives.

NameTypeReqDescription
mod–yesA modular object.

No output schema declared.

No examples provided.

Col ~31

Convert to a column vector.

NameTypeReqDescription
ninteger–Optional length specification.
x–yesObject to convert.

No output schema declared.

No examples provided.

complex ~31

Create a complex number.

NameTypeReqDescription
imagnumberyesImaginary part.
realnumberyesReal part.
NameTypeReqDescription
resultstringyes–

No examples provided.

cos ~28

Compute cosine.

NameTypeReqDescription
precisioninteger–Optional precision.
x–yesNumber (in radians).

No output schema declared.

No examples provided.

cosh ~29

Compute hyperbolic cosine.

NameTypeReqDescription
precisioninteger–Optional precision.
x–yesNumber.

No output schema declared.

No examples provided.

cusp_form ~43

Create a cusp form from its q-expansion.

NameTypeReqDescription
q–yesq-expansion.
vinteger–Variable number.
weightinteger–Weight.

No output schema declared.

No examples provided.

deriv ~34

Compute the derivative of a polynomial.

NameTypeReqDescription
polstringyesPolynomial as a string.
vstring–Variable name.

No output schema declared.

No examples provided.

dirichlet ~41

Compute Dirichlet L-function.

NameTypeReqDescription
chi–yesDirichlet character.
precisioninteger–Optional precision.
s–yesComplex parameter.

No output schema declared.

No examples provided.

disc ~32

Compute the discriminant of a polynomial.

NameTypeReqDescription
polstringyesPolynomial.
vstring–Variable name.
NameTypeReqDescription
resultintegeryes–

No examples provided.

eisenstein ~53

Compute the Eisenstein series E_k(q).

NameTypeReqDescription
kintegeryesWeight (even >= 2).
ninteger–Harmonic rank (default 1).
precisioninteger–Optional precision.

No output schema declared.

No examples provided.

elladd ~43

Add two points on an elliptic curve.

NameTypeReqDescription
E1–yesElliptic curve (or point).
E2–yesElliptic curve (or point).

No output schema declared.

No examples provided.

ellap ~42

Compute the trace of Frobenius for an elliptic curve at prime p.

NameTypeReqDescription
E–yesElliptic curve structure.
pintegeryesPrime.
NameTypeReqDescription
resultintegeryes–

No examples provided.

elleta ~30

Compute the eta-quotients for an elliptic curve.

NameTypeReqDescription
E–yesElliptic curve structure.

No output schema declared.

No examples provided.

ellglobalred ~30

Compute the global reduction type of an elliptic curve.

NameTypeReqDescription
E–yesElliptic curve structure.

No output schema declared.

No examples provided.

ellheight ~50

Compute the canonical height of a point on an elliptic curve.

NameTypeReqDescription
E–yesElliptic curve structure.
P–yesPoint on the curve.
flagsinteger–Computation flags.
NameTypeReqDescription
resultnumberyes–

No examples provided.

ellinit ~53

Initialize an elliptic curve.

NameTypeReqDescription
polstringyesShort Weierstrass equation (e.g., "y^2 = x^3 - x").
signinteger–1 for minimal model.

No output schema declared.

No examples provided.

ellj ~31

Compute the j-invariant of an elliptic curve.

NameTypeReqDescription
E–yesElliptic curve structure or polynomial.

No output schema declared.

No examples provided.

elllocalred ~36

Compute the local reduction type at prime p.

NameTypeReqDescription
E–yesElliptic curve structure.
pintegeryesPrime.

No output schema declared.

No examples provided.

elllog ~45

Compute the discrete logarithm of a point on an elliptic curve.

NameTypeReqDescription
E–yesElliptic curve structure.
G–yesBase point.
P–yesPoint.
NameTypeReqDescription
resultintegeryes–

No examples provided.

ellmul ~53

Multiply a point on an elliptic curve by an integer.

NameTypeReqDescription
E–yesElliptic curve structure.
P––Point (optional, if E is a point).
nintegeryesInteger multiplier.

No output schema declared.

No examples provided.

ellorder ~39

Compute the order of a point on an elliptic curve.

NameTypeReqDescription
E–yesElliptic curve structure.
P–yesPoint on the curve.
NameTypeReqDescription
resultintegeryes–

No examples provided.

elltors ~29

Compute the torsion subgroup of an elliptic curve.

NameTypeReqDescription
E–yesElliptic curve structure.

No output schema declared.

No examples provided.

ellwp ~51

Compute the Weierstrass p-function.

NameTypeReqDescription
E–yesElliptic curve structure.
flagsinteger–Computation flags.
ninteger–Number of terms (default 6).

No output schema declared.

No examples provided.

ellzeta ~35

Compute the Weierstrass zeta function.

NameTypeReqDescription
E–yesElliptic curve structure.
z–yesPoint.

No output schema declared.

No examples provided.

eta ~44

Compute the Dedekind eta function.

NameTypeReqDescription
flaginteger–Optional flag.
precisioninteger–Optional precision.
z–yesComplex parameter with positive imaginary part.

No output schema declared.

No examples provided.

euler ~24

Get Euler's constant.

NameTypeReqDescription
precisioninteger–Optional precision in bits.
NameTypeReqDescription
resultnumberyes–

No examples provided.

eval_expression ~55

Evaluate a PARI/GP expression string.

NameTypeReqDescription
exprstringyesA PARI/GP expression as a string (e.g., "x^2 + 1", "factor(100)", "prime(10)").

No output schema declared.

No examples provided.

exp ~25

Compute exponential.

NameTypeReqDescription
precisioninteger–Optional precision.
x–yesNumber.

No output schema declared.

No examples provided.

factor ~21

Factor an integer.

NameTypeReqDescription
nintegeryesInteger to factor.

No output schema declared.

No examples provided.

Install

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

# add to Claude Code
claude mcp add daedalus-mcp-parigp -- uvx mcp-parigp
Common questions

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.