io.github.daedalus/mcp-number-theory
PYPI · MCP-NUMBER-THEORY
MCP server exposing number theory functions and factorization algorithms
Available components
Last scanned (18 hours ago)
Scores higher than 71% of PyPI servers
Category Security
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 16 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-number-theory). View diagnostics → Pass
- Clear OSI-approved license (MIT).Pass
- Actively maintained (last published 220 days ago).Pass
- Disclosure check failed: no security disclosure policy was found in the source repository. See how to fix → Fail
Schema Quality & AI Usability63
- AI-judged instruction clarity (good).Pass
- Tool/resource definitions use about 1849 tokens (~33/item across 55 items; 55 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 Coverage71
- 100% of tools have a non-trivial description (not blank, and not just the tool's name).Pass
- 0% of tool parameters carry a description.Fail
- Structured output schemas are declared (100% of tools); any adoption earns full credit.Pass
Tool Safety100
- No prompt-injection markers were found in the server instructions, tool names or descriptions we captured.Pass
- We read all 55 captured tool definition(s), and no name or description among them implies an irreversible operation.Pass
- An AI judge read all 55 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
- Stability: 0.97 → pass security
- 30 Oct 26 −14
- Malware scan: pass → unverified ▼ security
- 29 Oct 26 −1
- Stability: pass → 0.93 functional
- 24 Oct 26 +15
- Malware scan: unverified → pass ▲ security
- 23 Oct 26 0
- Stability: 0.97 → pass security
- 22 Oct 26 0
- Stability: pass → 0.97 functional
- 19 Oct 26 −15
- Malware scan: pass → unverified ▼ 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-number-theory@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-number-theory |
| Certificate issuer | https://token.actions.githubusercontent.com |
| Certificate SAN | https://github.com/daedalus/mcp-number-theory/.github/workflows/pypi-publish.yml@refs/tags/v0.1.0 |
| Rekor log index | 1191544809 |
| Predicate type | PyPI publish attestation https://docs.pypi.org/attestations/publish/v1 |
| Subject digest | sha256:e8b20a01e6d3e706176d4b528627377f49d31cf479d00dab0b7dbaf3fe4e88be |
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 16 packages
| Packages resolved | 16 |
|---|---|
| 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 →
brent Brent ~33
Factor n using Brent's algorithm (Pollard rho with optimizations). Returns a factor.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
carmichael Carmichael ~30
Factor n using Carmichael's method. Returns list of factor pairs.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | array | yes | – |
No examples provided.
chinese_remainder Chinese Remainder ~57
Solve the Chinese Remainder Theorem. Given moduli m and remainders a, find x such that x ≡ a[i] (mod m[i]).
| Name | Type | Req | Description |
|---|---|---|---|
| a | array | yes | – |
| m | array | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
close_factor Close Factor ~38
Factor n using close factor algorithm. Returns (p, q) if found.
| Name | Type | Req | Description |
|---|---|---|---|
| b | integer | yes | – |
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | – | yes | – |
No examples provided.
contfrac_to_rational Contfrac To Rational ~25
Convert continued fraction to rational number.
| Name | Type | Req | Description |
|---|---|---|---|
| frac | array | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | array | yes | – |
No examples provided.
difference_of_powers_factor Difference Of Powers Factor ~30
Factor using difference of powers method. Returns list of factors.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | array | yes | – |
No examples provided.
dixon Dixon ~33
Factor n using Dixon's factorization method. Returns (p, q) if found.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | – | yes | – |
No examples provided.
dlp_bruteforce Dlp Bruteforce ~55
Solve discrete logarithm by brute force: find x such that g^x ≡ h (mod p).
| Name | Type | Req | Description |
|---|---|---|---|
| g | integer | yes | – |
| h | integer | yes | – |
| p | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | – | yes | – |
No examples provided.
euler_factorization Euler Factorization ~35
Factor n using Euler's factorization method. Returns (p, q) if found.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | – | yes | – |
No examples provided.
fac Fac ~20
Compute the factorial of n.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
factor_2PN Factor 2Pn ~43
Factor n with P prime > 2. Returns (p, q) if found.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| p_val | integer | – | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | – | yes | – |
No examples provided.
factor_high_and_low_bits_equal Factor High And Low Bits Equal ~46
Factor when high and low bits are equal. Returns (p, q) if found.
| Name | Type | Req | Description |
|---|---|---|---|
| max_middle_bits | integer | – | – |
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | – | yes | – |
No examples provided.
factor_XYXZ Factor Xyxz ~45
Factor integer of form x^y * x^z. Returns (p, q) if found.
| Name | Type | Req | Description |
|---|---|---|---|
| base | integer | – | – |
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | – | yes | – |
No examples provided.
fermat Fermat ~31
Factor n using Fermat's factorization method. Returns (p, q).
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | array | yes | – |
No examples provided.
fib Fib ~21
Compute the n-th Fibonacci number.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
find_period Find Period ~24
Find the period of n in binary representation.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
gcd Gcd ~31
Compute the greatest common divisor of a and b.
| Name | Type | Req | Description |
|---|---|---|---|
| a | integer | yes | – |
| b | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
gcdext Gcdext ~47
Compute the extended GCD of a and b. Returns dict with g, x, y where g = ax + by.
| Name | Type | Req | Description |
|---|---|---|---|
| a | integer | yes | – |
| b | integer | yes | – |
Structured output declared, but exposes no named fields.
No examples provided.
getpubkeysz Getpubkeysz ~24
Get public key size in bits.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
hart Hart ~30
Factor n using Hart's one-line factorization. Returns (p, q).
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | array | yes | – |
No examples provided.
ilog Ilog ~25
Compute the integer log of n (natural log).
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
ilog10 Ilog10 ~26
Compute the integer log base 10 of n.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
ilog2 Ilog2 ~26
Compute the integer log base 2 of n.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
introot Introot ~41
Compute the integer r-th root of n. Returns None if not a perfect r-th power.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| r | integer | – | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | – | yes | – |
No examples provided.
inverseinversesqrt2exp Inverseinversesqrt2Exp ~37
Compute modular inverse square root approximation with k bits.
| Name | Type | Req | Description |
|---|---|---|---|
| k | integer | yes | – |
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
invert Invert ~36
Compute the modular inverse of a modulo b using Fermat's little theorem.
| Name | Type | Req | Description |
|---|---|---|---|
| a | integer | yes | – |
| b | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
invmod Invmod ~31
Compute the modular inverse of a modulo m.
| Name | Type | Req | Description |
|---|---|---|---|
| a | integer | yes | – |
| m | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
is_cube Is Cube ~23
Check if n is a perfect cube.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | boolean | yes | – |
No examples provided.
is_lucas Is Lucas ~25
Check if n is a Lucas number.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | boolean | yes | – |
No examples provided.
is_prime Is Prime ~25
Test if n is prime using probabilistic methods.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | boolean | yes | – |
No examples provided.
is_square Is Square ~23
Check if n is a perfect square.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | boolean | yes | – |
No examples provided.
isqrt Isqrt ~23
Compute the integer square root of n.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
kraitchik Kraitchik ~31
Factor n using Kraitchik factorization. Returns (p, q).
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | array | yes | – |
No examples provided.
lcm Lcm ~32
Compute the least common multiple of x and y.
| Name | Type | Req | Description |
|---|---|---|---|
| x | integer | yes | – |
| y | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
legendre Legendre ~31
Compute the Legendre symbol (a/p).
| Name | Type | Req | Description |
|---|---|---|---|
| a | integer | yes | – |
| p | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
lehman Lehman ~33
Factor n using Lehman's factorization algorithm. Returns (p, q) if found.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | – | yes | – |
No examples provided.
lehmer_machine Lehmer Machine ~34
Factor n using Lehmer's machine (fermat-based). Returns (p, q).
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | array | yes | – |
No examples provided.
lucas Lucas ~22
Compute the n-th Lucas number.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
neg_pow Neg Pow ~40
Calculate a^b mod n when b is negative.
| Name | Type | Req | Description |
|---|---|---|---|
| a | integer | yes | – |
| b | integer | yes | – |
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
next_prime Next Prime ~22
Find the next prime after n.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
phi Phi ~37
Compute Euler's totient function phi(n) given the prime factors of n.
| Name | Type | Req | Description |
|---|---|---|---|
| factors | array | yes | – |
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
pollard_P_1 Pollard P 1 ~38
Factor n using Pollard's P-1 algorithm. Returns (p, q) if found.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | – | yes | – |
No examples provided.
pollard_rho Pollard Rho ~30
Factor n using Pollard's rho algorithm. Returns a factor.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
pollard_strassen Pollard Strassen ~35
Factor n using Pollard-Strassen algorithm. Returns (p, q) if found.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | – | yes | – |
No examples provided.
powmod Powmod ~40
Compute b^e mod m using modular exponentiation.
| Name | Type | Req | Description |
|---|---|---|---|
| b | integer | yes | – |
| e | integer | yes | – |
| m | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | integer | yes | – |
No examples provided.
powmod_base_list Powmod Base List ~41
Compute powmod for a list of bases.
| Name | Type | Req | Description |
|---|---|---|---|
| base_lst | array | yes | – |
| exp | integer | yes | – |
| mod | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | array | yes | – |
No examples provided.
powmod_exp_list Powmod Exp List ~42
Compute powmod for a list of exponents.
| Name | Type | Req | Description |
|---|---|---|---|
| base | integer | yes | – |
| exp_lst | array | yes | – |
| mod | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | array | yes | – |
No examples provided.
primes Primes ~23
Return a list of the first n primes.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | array | yes | – |
No examples provided.
repunit_factor Repunit Factor ~32
Factor n using repunit properties. Returns (p, q) if found.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | – | yes | – |
No examples provided.
shor Shor ~36
Factor n using Shor's algorithm (classical part). Returns (p, q) if found.
| Name | Type | Req | Description |
|---|---|---|---|
| n | integer | yes | – |
| Name | Type | Req | Description |
|---|---|---|---|
| result | – | yes | – |
No examples provided.
How do I install the io.github.daedalus/mcp-number-theory server?
io.github.daedalus/mcp-number-theory runs locally as a PyPI package, launched with uvx mcp-number-theory. 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-number-theory
claude mcp add daedalus-mcp-number-theory -- uvx mcp-number-theory
What is the io.github.daedalus/mcp-number-theory server?
io.github.daedalus/mcp-number-theory is listed in the public MCP registry as io.github.daedalus/mcp-number-theory. MCP server exposing number theory functions and factorization algorithms. This page covers its PyPI package (mcp-number-theory).
Is the io.github.daedalus/mcp-number-theory server safe to use?
io.github.daedalus/mcp-number-theory scores 75 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-number-theory server expose?
io.github.daedalus/mcp-number-theory exposes 55 tools: gcd, isqrt, introot, invmod, gcdext, and 50 more. Their descriptions and schemas cost roughly 1,849 tokens of context every time the server is loaded.
Is the io.github.daedalus/mcp-number-theory server still maintained?
io.github.daedalus/mcp-number-theory 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-number-theory server under?
io.github.daedalus/mcp-number-theory declares the MIT licence, which is OSI-approved. That covers the source only, and says nothing about the cost of any service it calls.