io.github.daedalus/mcp-parigp
PYPI · MCP-PARIGP · SCANNED SEP 20
MCP server exposing cypari2 (PARI/GP) number theory library
Available components
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 Security100
- No malware found by supply-chain analysis.Pass
- No known CVEs affecting this package version or its production dependencies.Pass
- Runs hatchling.build at install time, a recognised native-build step with no shell scripting around it. View diagnostics → Pass
- 1 of 17 dependencies flagged as unhealthy. View diagnostics → Partial
Provenance & Transparency45
- Source repository is publicly reachable at the declared URL. View diagnostics → Pass
- Provenance check failed: no build-provenance attestation is published. See how to fix → View diagnostics → Fail
- Clear OSI-approved license (MIT).Pass
- Actively maintained (last published 174 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 5180 tokens (~36/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 Management0
- Stability not yet verified: two runs of the same published version returned different tool surfaces, so we cannot tell a change in the package from a difference in our own sandbox run.Unverified
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
Unverified: 1 category
A category scored 0 because we could not verify it: a data source with nothing on this package, evidence we could not reach, or a check we could not run. We only credit what we can confirm.
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
{
"mcpServers": {
"daedalus-mcp-parigp": {
"command": "uvx",
"args": [
"mcp-parigp"
]
}
}
} {
"servers": {
"daedalus-mcp-parigp": {
"command": "uvx",
"args": [
"mcp-parigp"
]
}
}
} codex mcp add daedalus-mcp-parigp -- uvx mcp-parigp
{
"$schema": "https://opencode.ai/config.json",
"mcp": {
"daedalus-mcp-parigp": {
"type": "local",
"command": [
"uvx",
"mcp-parigp"
],
"enabled": true
}
}
} openclaw mcp add daedalus-mcp-parigp --command uvx --arg mcp-parigp
mcp_servers:
daedalus-mcp-parigp:
command: "uvx"
args: ["mcp-parigp"] {
"McpServers": {
"daedalus-mcp-parigp": {
"Transport": "stdio",
"Command": "uvx",
"Arguments": [
"mcp-parigp"
]
}
}
} assistant mcp add daedalus-mcp-parigp -t stdio -c uvx -a mcp-parigp
{
"mcpServers": {
"daedalus-mcp-parigp": {
"command": "uvx",
"args": [
"mcp-parigp"
]
}
}
} 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.
- 15 Sept 26 +15
- Malware scan: unverified → pass ▲ security
- 14 Sept 26 −15
- Malware scan: pass → unverified ▼ security
- 9 Sept 26 −12
- Stability: 0.87 → unverified ▼ security
- Tool coverage: 43% → 29% ▼ functional
- 7 Sept 26 +1
No change was recorded against any check on this day. Stability & Change Management went from 80 to 83. That category is still filling its 30-day observation window: 24 days of observed history at the previous scan, 25 at this one. The score rises as the window fills, whether or not the server changes.
- 5 Sept 26 −3
- Stability: pass → 0.77 functional
- 4 Sept 26 0
- Stability: 0.97 → pass security
- 3 Sept 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.
- 2 Sept 26 0
- MCP protocol: Implements a current MCP spec version (2026-07-28). functional
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 20 Sept 2026 · Analysed pypi/mcp-parigp@0.1.0
Provenance No attestation
The registry publishes no build provenance for this version, so there is nothing to verify.
| Result | No attestation |
|---|---|
| Ecosystem | pypi |
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 →
pi Pi ~24
Get the value of pi.
| Name | Type | Req | Description |
|---|---|---|---|
| precision | integer | – | Optional precision in bits. |
| Name | Type | Req | Description |
|---|---|---|---|
| result | number | yes | – |
No examples provided.
Pol ~31
Convert to a polynomial.
| Name | Type | Req | Description |
|---|---|---|---|
| v | string | – | Variable name. |
| x | – | yes | Vector of coefficients or scalar. |
No output schema declared.
No examples provided.
polchebyshev Polchebyshev ~45
Compute the nth Chebyshev polynomial of the first kind.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | Non-negative integer. |
| v | string | – | Variable name (default 'x'). |
No output schema declared.
No examples provided.
polcyclo Polcyclo ~39
Compute the nth cyclotomic polynomial.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | Positive integer. |
| v | string | – | Variable name (default 'x'). |
No output schema declared.
No examples provided.
polhermite Polhermite ~45
Compute the nth Hermite polynomial (probabilists' version).
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | Non-negative integer. |
| v | string | – | Variable name (default 'x'). |
No output schema declared.
No examples provided.
pollegendre Pollegendre ~39
Compute the nth Legendre polynomial.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | Non-negative integer. |
| v | string | – | Variable name (default 'x'). |
No output schema declared.
No examples provided.
Polrev ~37
Convert to a polynomial (reverse order).
| Name | Type | Req | Description |
|---|---|---|---|
| v | string | – | Variable name. |
| x | – | yes | Vector of coefficients (constant term first). |
No output schema declared.
No examples provided.
polroots Polroots ~38
Compute the complex roots of a polynomial.
| Name | Type | Req | Description |
|---|---|---|---|
| pol | string | yes | Polynomial as a string (e.g., "x^3 - 1"). |
No output schema declared.
No examples provided.
polrootsmod Polrootsmod ~38
Compute the roots of a polynomial modulo p.
| Name | Type | Req | Description |
|---|---|---|---|
| p | integer | yes | Prime modulus. |
| pol | string | yes | Polynomial as a string. |
No output schema declared.
No examples provided.
polrootspadic Polrootspadic ~51
Compute the p-adic roots of a polynomial.
| 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.
polsubcyclo Polsubcyclo ~51
Compute sub-cyclotomic polynomials.
| Name | Type | Req | Description |
|---|---|---|---|
| d | integer | yes | Degree of subfield. |
| n | integer | yes | Cyclotomic field order. |
| v | string | – | Variable name. |
No output schema declared.
No examples provided.
prevprime Prevprime ~26
Find the previous prime before n.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | Integer > 2. |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
prime Prime ~31
Return the nth prime (1-indexed).
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | Which prime to return (1-indexed). |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
primes Primes ~57
Return prime numbers.
| Name | Type | Req | Description |
|---|---|---|---|
| end | integer | – | End of prime range if n is a start value. |
| n | integer | – | Either an integer (first n primes), or a list [a,b] for range, or start of range. |
No output schema declared.
No examples provided.
Qfb ~56
Create a binary quadratic form.
| Name | Type | Req | Description |
|---|---|---|---|
| D | integer | – | Optional Shanks' distance. |
| a | integer | yes | – |
| b | integer | yes | – |
| c | integer | yes | – |
| precision | integer | – | Optional precision. |
No output schema declared.
No examples provided.
qfbclassno Qfbclassno ~59
Compute the class number of binary quadratic form discriminant D.
| Name | Type | Req | Description |
|---|---|---|---|
| D | integer | yes | Discriminant (D ≡ 0, 1 mod 4, D > 0). |
| flags | integer | – | Computation flags. |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
qfbsolve Qfbsolve ~39
Solve Q(x) = n for binary quadratic form Q.
| Name | Type | Req | Description |
|---|---|---|---|
| Q | – | yes | Binary quadratic form. |
| n | integer | yes | Integer to represent. |
No output schema declared.
No examples provided.
quadratic_forms Quadratic Forms ~46
Compute reduced binary quadratic forms of discriminant D.
| Name | Type | Req | Description |
|---|---|---|---|
| D | integer | yes | Discriminant (D ≡ 0, 1 mod 4, D ≠ 0). |
No output schema declared.
No examples provided.
quadregulator Quadregulator ~40
Compute the regulator of real quadratic field.
| Name | Type | Req | Description |
|---|---|---|---|
| D | integer | yes | Discriminant of real quadratic field. |
| precision | integer | – | Optional precision. |
No output schema declared.
No examples provided.
removeprimes Removeprimes ~34
Remove primes from the factorisation table.
| Name | Type | Req | Description |
|---|---|---|---|
| primes | array | – | List of primes to remove (or None to clear). |
No output schema declared.
No examples provided.
resultant Resultant ~44
Compute the resultant of two polynomials.
| Name | Type | Req | Description |
|---|---|---|---|
| pol1 | string | yes | First polynomial. |
| pol2 | string | yes | Second polynomial. |
| v | string | – | Variable name. |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
Ser ~42
Convert to a power series.
| Name | Type | Req | Description |
|---|---|---|---|
| d | integer | – | Precision (number of terms). |
| v | string | – | Variable name. |
| x | – | yes | Polynomial or vector. |
No output schema declared.
No examples provided.
Set ~20
Convert to a set.
| Name | Type | Req | Description |
|---|---|---|---|
| x | – | yes | Object to convert. |
No output schema declared.
No examples provided.
set_real_precision Set Real Precision ~33
Set the PARI default real precision in decimal digits.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | Number of decimal digits for precision. |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
set_real_precision_bits Set Real Precision Bits ~32
Set the PARI default real precision in bits.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | Number of bits of precision. |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
setrand Setrand ~37
Set PARI's random number seed.
| Name | Type | Req | Description |
|---|---|---|---|
| seed | integer | yes | A positive integer or a GEN of type t_VECSMALL. |
No output schema declared.
No examples provided.
sigma Sigma ~42
Compute the sum of k-th powers of divisors of n.
| Name | Type | Req | Description |
|---|---|---|---|
| k | integer | – | Power exponent (default 1). |
| n | integer | yes | Positive integer. |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
sin Sin ~28
Compute sine.
| Name | Type | Req | Description |
|---|---|---|---|
| precision | integer | – | Optional precision. |
| x | – | yes | Number (in radians). |
No output schema declared.
No examples provided.
sinh Sinh ~28
Compute hyperbolic sine.
| Name | Type | Req | Description |
|---|---|---|---|
| precision | integer | – | Optional precision. |
| x | – | yes | Number. |
No output schema declared.
No examples provided.
sqrt Sqrt ~26
Compute square root.
| Name | Type | Req | Description |
|---|---|---|---|
| precision | integer | – | Optional precision. |
| x | – | yes | Number. |
No output schema declared.
No examples provided.
stacksize Stacksize ~38
Get the current PARI stack size in bytes. Returns: Current stack size. Example: >>> stacksize() 8000000
Input schema present but exposes no named parameters.
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
stacksizemax Stacksizemax ~40
Get the maximum PARI stack size in bytes. Returns: Maximum stack size. Example: >>> stacksizemax() 536870912
Input schema present but exposes no named parameters.
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
subst Subst ~40
Substitute a variable in a polynomial.
| Name | Type | Req | Description |
|---|---|---|---|
| expr | – | yes | Expression to substitute. |
| pol | string | yes | Polynomial. |
| v | string | yes | Variable to replace. |
No output schema declared.
No examples provided.
tan Tan ~28
Compute tangent.
| Name | Type | Req | Description |
|---|---|---|---|
| precision | integer | – | Optional precision. |
| x | – | yes | Number (in radians). |
No output schema declared.
No examples provided.
tanh Tanh ~29
Compute hyperbolic tangent.
| Name | Type | Req | Description |
|---|---|---|---|
| precision | integer | – | Optional precision. |
| x | – | yes | Number. |
No output schema declared.
No examples provided.
theta Theta ~40
Compute the theta function theta(z, tau).
| Name | Type | Req | Description |
|---|---|---|---|
| precision | integer | – | Optional precision. |
| tau | – | yes | Lattice parameter. |
| z | – | yes | Complex parameter. |
No output schema declared.
No examples provided.
trace Trace ~37
Compute the trace 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.
Vec ~31
Convert to a row vector.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | – | Optional length specification. |
| x | – | yes | Object to convert. |
No output schema declared.
No examples provided.
vector Vector ~34
Create a vector of length n.
| Name | Type | Req | Description |
|---|---|---|---|
| entries | array | – | List of entries (optional). |
| n | integer | yes | Length. |
No output schema declared.
No examples provided.
weber Weber ~47
Compute the Weber function.
| Name | Type | Req | Description |
|---|---|---|---|
| flag | integer | – | Which variant (0, 1, or 2). |
| precision | integer | – | Optional precision. |
| z | – | yes | Complex parameter. |
No output schema declared.
No examples provided.
zero Zero ~30
Get the integer 0. Returns: Integer 0. Example: >>> zero() 0
Input schema present but exposes no named parameters.
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
znorder Znorder ~40
Compute the multiplicative order of x modulo n.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | Positive integer. |
| x | integer | yes | Integer coprime to n. |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
znstar Znstar ~27
Compute the structure of (Z/nZ)*.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | Positive integer. |
No output schema declared.
No examples provided.
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 67 out of 100 on VerifyMCP. We found no known CVEs affecting it as of 20 September 2026. 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 5,180 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 20 September 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.