
Mcp Parigp
io.github.daedalusPublished by GitHub account daedalusv0.1.0Updated Nov 10, 2026
MCP server exposing cypari2 (PARI/GP) number theory library
Overview
Local MCP server that exposes the cypari2 (PARI/GP) number theory library, letting an assistant run exact mathematical computations.
- What you can do
- Factor integers, test primality, and compute GCDs, totients, divisor sums, Jacobi symbols, orders and prime sequences
- Work with polynomials: find roots, build cyclotomic polynomials, differentiate and substitute
- Set up number fields and their ideals, and initialize elliptic curves with Frobenius traces, torsion and heights
- Compute with matrices: identity, determinant, inverse and rank
- Evaluate elementary trigonometric, hyperbolic, exponential, logarithmic and constant functions
- When to use it
- Useful when an assistant needs exact or symbolic number theory and algebra results — factoring, primality checks, polynomial and number field work, elliptic curves — rather than approximate numeric answers.
- Requirements
- Runs as a local process on the desktop, installed from PyPI with pip (mcp-parigp) and started with the mcp-parigp command; it depends on the cypari2/PARI library. No accounts, API keys, environment variables or headers are declared.
Installation
In SourceWeft
- Open Mcp Parigp in the dashboard and add it to a workspace.
- Enable the server for the chats that should use its tools.
Desktop only via STDIO. STDIO servers start a local process, so they need the SourceWeft desktop host.
Other MCP clients
Follow the launch instructions in the repository.
README
mcp-parigp
MCP server exposing cypari2 (PARI/GP) number theory library
[PyPI] [Python] [Coverage] [Ruff]
mcp-name: io.github.daedalus/mcp-parigp
Install
Usage
As MCP Server
Run directly:
Or use with an MCP client by configuring in your settings:
In Python
API
Number Theory
factor(n)- Factor an integerisprime(n)- Test if n is primegcd(a, b)- Greatest common divisorphi(n)- Euler's totient functionsigma(n, k)- Sum of k-th power of divisorsjacobi(a, n)- Jacobi symbolznorder(x, n)- Multiplicative order modulo nprimes(n)- First n primesnextprime(n)- Next prime after n
Polynomials
polroots(pol)- Find roots of polynomialpolcyclo(n)- n-th cyclotomic polynomialderiv(pol)- Derivative of polynomialsubst(pol, v, expr)- Substitute in polynomial
Number Fields
nfinit(pol)- Initialize number fieldbnfinit(pol)- Initialize with Buchmann's algorithmidealadd(nf, a, b)- Add idealsidealmul(nf, a, b)- Multiply ideals
Elliptic Curves
ellinit(eq)- Initialize elliptic curveellap(E, p)- Trace of Frobenius at pelltors(E)- Torsion subgroupellheight(E, P)- Canonical height
Matrices
matid(n)- n×n identity matrixmatdet(m)- Matrix determinantmatinv(m)- Matrix inversematrank(m)- Matrix rank
Elementary Functions
sin,cos,tan,asin,acos,atansinh,cosh,tanh,asinh,acosh,atanhexp,log,sqrt,abspi(),euler(),I()
Development
Source: README.md at commit 3a8a1b6
Tools
0Version history
1- v0.1.0LatestSep 16, 2026
Score
50% of the applicable checks met
How complete this listing is, computed from the registry entry, the endpoint and public sources. Not a rating of the server and not a statement that it is safe or working today: reachability is a dated check, and no installs or reviews go into the score.
- Reached in the last 30 days25 pts
Keep the endpoint answering the MCP handshake; SourceWeft probes it every 30 days.
- Auth declared10 pts
Declare the credential headers in the registry entry, or keep the endpoint answering the probe so its auth can be classified.
- Tools listed15 pts
Answer tools/list without a credential, or ship a package that starts in a sandbox without one.
- DescriptionRequired15 pts
- Logo10 pts
- Documentation15 pts
- License10 pts