What it does
The server provides prime number testing, factorisation and prime searches. It works offline and uses BigInt arithmetic, with Miller-Rabin for primality testing and Pollard rho for factorisation.
Safety
Our team has not reviewed this resource. Only automated rules checked it; resources with high-risk signals are not published. These are signals, not a guarantee that installing it is safe. Try it in a sandbox project first.
- Runs code or changes an assistant's behaviour
Sources
- Official MCP Registry first seen 13 Nov 2026 · last seen 13 Nov 2026 · its page on the source
io.github.mrfentmen/primes-mcp
Prime testing, factorisation and searches offline with BigInt: Miller-Rabin and Pollard rho
v1.0.1As shown on registry.modelcontextprotocol.io when we last read it