MCP.Market

Number Theory MCP server

by daedalus·io.github.daedalus/mcp-number-theory·v0.1.0
No reviews yet

MCP server exposing number theory functions and factorization algorithms

B82/100grade B
Write a reviewInstall
What users say
No reviews yet
Be the first
Safety scan
B82/100

full report

Adoption
New

0 stars12 downloads/wk

Reviews

Write one

Nobody has reviewed Number Theory yet.

If you have run it, two minutes of your experience saves the next person an afternoon.

Number Theory tools (55)

write = sends, deletes, buys or posts

Read from the package source without running it. The installed server may list more.

  • SQUFOF

    Factor n using Shanks' Square Forms Factorization. Returns (p, q) if found.

  • brent

    Factor n using Brent's algorithm (Pollard rho with optimizations). Returns a factor.

  • carmichael

    Factor n using Carmichael's method. Returns list of factor pairs.

  • chinese_remainder

    Solve the Chinese Remainder Theorem. Given moduli m and remainders a, find x such that x ≡ a[i] (mod m[i]).

  • close_factor

    Factor n using close factor algorithm. Returns (p, q) if found.

  • contfrac_to_rational

    Convert continued fraction to rational number.

  • difference_of_powers_factor

    Factor using difference of powers method. Returns list of factors.

  • dixon

    Factor n using Dixon's factorization method. Returns (p, q) if found.

  • dlp_bruteforce

    Solve discrete logarithm by brute force: find x such that g^x ≡ h (mod p).

  • euler_factorization

    Factor n using Euler's factorization method. Returns (p, q) if found.

  • fac

    Compute the factorial of n.

  • factor_2PN

    Factor n with P prime > 2. Returns (p, q) if found.

  • factor_XYXZ

    Factor integer of form x^y * x^z. Returns (p, q) if found.

  • factor_high_and_low_bits_equal

    Factor when high and low bits are equal. Returns (p, q) if found.

  • fermat

    Factor n using Fermat's factorization method. Returns (p, q).

  • fib

    Compute the n-th Fibonacci number.

  • find_period

    Find the period of n in binary representation.

  • gcd

    Compute the greatest common divisor of a and b.

  • gcdext

    Compute the extended GCD of a and b. Returns dict with g, x, y where g = ax + by.

  • getpubkeysz

    Get public key size in bits.

  • hart

    Factor n using Hart's one-line factorization. Returns (p, q).

  • ilog

    Compute the integer log of n (natural log).

  • ilog10

    Compute the integer log base 10 of n.

  • ilog2

    Compute the integer log base 2 of n.

  • introot

    Compute the integer r-th root of n. Returns None if not a perfect r-th power.

  • inverseinversesqrt2exp

    Compute modular inverse square root approximation with k bits.

  • invert

    Compute the modular inverse of a modulo b using Fermat's little theorem.

  • invmod

    Compute the modular inverse of a modulo m.

  • is_cube

    Check if n is a perfect cube.

  • is_lucas

    Check if n is a Lucas number.

  • is_prime

    Test if n is prime using probabilistic methods.

  • is_square

    Check if n is a perfect square.

  • isqrt

    Compute the integer square root of n.

  • kraitchik

    Factor n using Kraitchik factorization. Returns (p, q).

  • lcm

    Compute the least common multiple of x and y.

  • legendre

    Compute the Legendre symbol (a/p).

  • lehman

    Factor n using Lehman's factorization algorithm. Returns (p, q) if found.

  • lehmer_machine

    Factor n using Lehmer's machine (fermat-based). Returns (p, q).

  • lucas

    Compute the n-th Lucas number.

  • neg_pow

    Calculate a^b mod n when b is negative.

  • next_prime

    Find the next prime after n.

  • phi

    Compute Euler's totient function phi(n) given the prime factors of n.

  • pollard_P_1

    Factor n using Pollard's P-1 algorithm. Returns (p, q) if found.

  • pollard_rho

    Factor n using Pollard's rho algorithm. Returns a factor.

  • pollard_strassen

    Factor n using Pollard-Strassen algorithm. Returns (p, q) if found.

  • powmod

    Compute b^e mod m using modular exponentiation.

  • powmod_base_list

    Compute powmod for a list of bases.

  • powmod_exp_list

    Compute powmod for a list of exponents.

  • primes

    Return a list of the first n primes.

  • repunit_factor

    Factor n using repunit properties. Returns (p, q) if found.

  • shor

    Factor n using Shor's algorithm (classical part). Returns (p, q) if found.

  • tonelli

    Compute the modular square root using Tonelli-Shanks algorithm. Returns x such that x^2 ≡ n (mod p).

  • trivial_factorization_with_n_phi

    Factor n given phi(n). Returns (p, q) if found, None otherwise.

  • wiener

    Attack RSA using Wiener's method given modulus n and public exponent e. Returns (p, q) if vulnerable.

  • williams_pp1

    Factor n using Williams' P+1 algorithm. Returns (p, q) if found.

Public scan report

scanner v0.1.9 · 2026-09-27 · same rubric, same numbers if you re-run it

no findings
  • Code scan6 source files scanned25/25
  • –Live reliabilityno gateway calls yet and no remote to proben/a
  • –Tool poisoningtools not inspected (local package is not executed); not countedn/a
  • Auth qualitylocal package, no credentials required12/15
  • Maintenancelast push 159 days ago8/15
  • Maintainer identityregistry namespace matches repository owner; GitHub account older than a year8/10
Overall 82/100. Components that don't apply are left out of the denominator. Any critical finding is an F.RubricAppeal a findingJSON

How Number Theory compares

Against every graded MCP server, from our own scans and uptime checks. Updated after each scan run.

Safety score
82/100
higher than 63% of 48,273 servers
Tools
55
the typical server has 7
Tools that change things
0%
typical: 0%. Fewer write tools means less an agent can break
Downloads a week
12
more than 3% of 11,915 servers with a package

What its tools let an agent do: 54 read · 1 change

Install Number Theory in Claude Code, Cursor or VS Code

claude mcp add mcp-number-theory -- uvx mcp-number-theory
Add to Cursor

What the publisher says

From the Number Theory repository's README, as published. We do not edit it. Read it on GitHub

mcp-number-theory

MCP server exposing number theory functions and factorization algorithms.

Install

pip install mcp-number-theory

Usage

from mcp_number_theory import number_theory as nt

# Compute GCD
result = nt.gcd(48, 18)  # Returns 6

# Factorize
from mcp_number_theory import algos
p, q = algos.fermat(1234567890123456789)

MCP Server

This package provides an MCP server that exposes number theory functions. Run with:

mcp-number-theory

mcp-name: io.github.daedalus/mcp-number-theory

Nothing above is checked by us. What we check is on the safety report.

Number Theory: common questions

Is Number Theory MCP server safe?
Mostly: it is graded B (82/100). Read the Number Theory safety report
How do I install Number Theory?
It runs on your machine. Copy the Claude Code, Cursor, VS Code or Claude Desktop config from the install section.
Does Number Theory need an API key?
Not as far as the registry entry and our scan can tell: no credentials are declared or required.
Is Number Theory maintained?
The last commit was 195 days ago (2026-04-21). The latest release is v0.1.0.
How does Number Theory compare with other MCP servers?
safety score 82/100 (higher than 63% of 48,273 servers); tools 55 (the typical server has 7); tools that change things 0% (typical: 0%. Fewer write tools means less an agent can break). Full comparison.

More from daedalus →