{"name":"io.github.daedalus/mcp-number-theory","slug":"daedalus-mcp-number-theory","title":null,"description":"MCP server exposing number theory functions and factorization algorithms","url":"https://mcp.market/server/daedalus-mcp-number-theory","rating":null,"grade":"B","score":82,"certified":false,"status":"active","category":"other","tags":[],"presence":{"score":12,"stars":0,"forks":0,"downloads_week":12,"last_push_at":"2026-04-21T19:27:13.000Z","license":"MIT"},"uptime":null,"claimed":false,"transport":"pypi","callable_via_gateway":false,"default_price_micros":0,"repository":"https://github.com/daedalus/mcp-number-theory","website":null,"version":"0.1.0","remotes":[],"packages":[{"registryType":"pypi","identifier":"mcp-number-theory","version":"0.1.0","transport":{"type":"stdio"}}],"tools":[{"name":"SQUFOF","description":"Factor n using Shanks' Square Forms Factorization. Returns (p, q) if found.","write_action":false,"price_micros":0,"input_schema":null},{"name":"brent","description":"Factor n using Brent's algorithm (Pollard rho with optimizations). Returns a factor.","write_action":false,"price_micros":0,"input_schema":null},{"name":"carmichael","description":"Factor n using Carmichael's method. Returns list of factor pairs.","write_action":false,"price_micros":0,"input_schema":null},{"name":"chinese_remainder","description":"Solve the Chinese Remainder Theorem. Given moduli m and remainders a, find x such that x ≡ a[i] (mod m[i]).","write_action":false,"price_micros":0,"input_schema":null},{"name":"close_factor","description":"Factor n using close factor algorithm. Returns (p, q) if found.","write_action":false,"price_micros":0,"input_schema":null},{"name":"contfrac_to_rational","description":"Convert continued fraction to rational number.","write_action":false,"price_micros":0,"input_schema":null},{"name":"difference_of_powers_factor","description":"Factor using difference of powers method. Returns list of factors.","write_action":false,"price_micros":0,"input_schema":null},{"name":"dixon","description":"Factor n using Dixon's factorization method. Returns (p, q) if found.","write_action":false,"price_micros":0,"input_schema":null},{"name":"dlp_bruteforce","description":"Solve discrete logarithm by brute force: find x such that g^x ≡ h (mod p).","write_action":false,"price_micros":0,"input_schema":null},{"name":"euler_factorization","description":"Factor n using Euler's factorization method. Returns (p, q) if found.","write_action":false,"price_micros":0,"input_schema":null},{"name":"fac","description":"Compute the factorial of n.","write_action":false,"price_micros":0,"input_schema":null},{"name":"factor_2PN","description":"Factor n with P prime > 2. Returns (p, q) if found.","write_action":false,"price_micros":0,"input_schema":null},{"name":"factor_XYXZ","description":"Factor integer of form x^y * x^z. Returns (p, q) if found.","write_action":false,"price_micros":0,"input_schema":null},{"name":"factor_high_and_low_bits_equal","description":"Factor when high and low bits are equal. Returns (p, q) if found.","write_action":false,"price_micros":0,"input_schema":null},{"name":"fermat","description":"Factor n using Fermat's factorization method. Returns (p, q).","write_action":false,"price_micros":0,"input_schema":null},{"name":"fib","description":"Compute the n-th Fibonacci number.","write_action":false,"price_micros":0,"input_schema":null},{"name":"find_period","description":"Find the period of n in binary representation.","write_action":false,"price_micros":0,"input_schema":null},{"name":"gcd","description":"Compute the greatest common divisor of a and b.","write_action":false,"price_micros":0,"input_schema":null},{"name":"gcdext","description":"Compute the extended GCD of a and b. Returns dict with g, x, y where g = ax + by.","write_action":false,"price_micros":0,"input_schema":null},{"name":"getpubkeysz","description":"Get public key size in bits.","write_action":false,"price_micros":0,"input_schema":null},{"name":"hart","description":"Factor n using Hart's one-line factorization. Returns (p, q).","write_action":false,"price_micros":0,"input_schema":null},{"name":"ilog","description":"Compute the integer log of n (natural log).","write_action":false,"price_micros":0,"input_schema":null},{"name":"ilog10","description":"Compute the integer log base 10 of n.","write_action":false,"price_micros":0,"input_schema":null},{"name":"ilog2","description":"Compute the integer log base 2 of n.","write_action":false,"price_micros":0,"input_schema":null},{"name":"introot","description":"Compute the integer r-th root of n. Returns None if not a perfect r-th power.","write_action":false,"price_micros":0,"input_schema":null},{"name":"inverseinversesqrt2exp","description":"Compute modular inverse square root approximation with k bits.","write_action":false,"price_micros":0,"input_schema":null},{"name":"invert","description":"Compute the modular inverse of a modulo b using Fermat's little theorem.","write_action":false,"price_micros":0,"input_schema":null},{"name":"invmod","description":"Compute the modular inverse of a modulo m.","write_action":false,"price_micros":0,"input_schema":null},{"name":"is_cube","description":"Check if n is a perfect cube.","write_action":false,"price_micros":0,"input_schema":null},{"name":"is_lucas","description":"Check if n is a Lucas number.","write_action":false,"price_micros":0,"input_schema":null},{"name":"is_prime","description":"Test if n is prime using probabilistic methods.","write_action":false,"price_micros":0,"input_schema":null},{"name":"is_square","description":"Check if n is a perfect square.","write_action":false,"price_micros":0,"input_schema":null},{"name":"isqrt","description":"Compute the integer square root of n.","write_action":false,"price_micros":0,"input_schema":null},{"name":"kraitchik","description":"Factor n using Kraitchik factorization. Returns (p, q).","write_action":false,"price_micros":0,"input_schema":null},{"name":"lcm","description":"Compute the least common multiple of x and y.","write_action":false,"price_micros":0,"input_schema":null},{"name":"legendre","description":"Compute the Legendre symbol (a/p).","write_action":false,"price_micros":0,"input_schema":null},{"name":"lehman","description":"Factor n using Lehman's factorization algorithm. Returns (p, q) if found.","write_action":false,"price_micros":0,"input_schema":null},{"name":"lehmer_machine","description":"Factor n using Lehmer's machine (fermat-based). Returns (p, q).","write_action":false,"price_micros":0,"input_schema":null},{"name":"lucas","description":"Compute the n-th Lucas number.","write_action":false,"price_micros":0,"input_schema":null},{"name":"neg_pow","description":"Calculate a^b mod n when b is negative.","write_action":false,"price_micros":0,"input_schema":null},{"name":"next_prime","description":"Find the next prime after n.","write_action":false,"price_micros":0,"input_schema":null},{"name":"phi","description":"Compute Euler's totient function phi(n) given the prime factors of n.","write_action":false,"price_micros":0,"input_schema":null},{"name":"pollard_P_1","description":"Factor n using Pollard's P-1 algorithm. Returns (p, q) if found.","write_action":false,"price_micros":0,"input_schema":null},{"name":"pollard_rho","description":"Factor n using Pollard's rho algorithm. Returns a factor.","write_action":false,"price_micros":0,"input_schema":null},{"name":"pollard_strassen","description":"Factor n using Pollard-Strassen algorithm. Returns (p, q) if found.","write_action":false,"price_micros":0,"input_schema":null},{"name":"powmod","description":"Compute b^e mod m using modular exponentiation.","write_action":false,"price_micros":0,"input_schema":null},{"name":"powmod_base_list","description":"Compute powmod for a list of bases.","write_action":false,"price_micros":0,"input_schema":null},{"name":"powmod_exp_list","description":"Compute powmod for a list of exponents.","write_action":false,"price_micros":0,"input_schema":null},{"name":"primes","description":"Return a list of the first n primes.","write_action":false,"price_micros":0,"input_schema":null},{"name":"repunit_factor","description":"Factor n using repunit properties. Returns (p, q) if found.","write_action":false,"price_micros":0,"input_schema":null},{"name":"shor","description":"Factor n using Shor's algorithm (classical part). Returns (p, q) if found.","write_action":false,"price_micros":0,"input_schema":null},{"name":"tonelli","description":"Compute the modular square root using Tonelli-Shanks algorithm. Returns x such that x^2 ≡ n (mod p).","write_action":false,"price_micros":0,"input_schema":null},{"name":"trivial_factorization_with_n_phi","description":"Factor n given phi(n). Returns (p, q) if found, None otherwise.","write_action":false,"price_micros":0,"input_schema":null},{"name":"wiener","description":"Attack RSA using Wiener's method given modulus n and public exponent e. Returns (p, q) if vulnerable.","write_action":false,"price_micros":0,"input_schema":null},{"name":"williams_pp1","description":"Factor n using Williams' P+1 algorithm. Returns (p, q) if found.","write_action":false,"price_micros":0,"input_schema":null}],"scan":{"score":82,"grade":"B","scanned_at":"2026-09-27T23:19:40.770Z","report":{"scannerVersion":"0.1.9","scannedAt":"2026-09-27T23:19:40.639Z","components":{"code":{"score":25,"max":25,"notes":["6 source files scanned"]},"reliability":{"score":-1,"max":20,"notes":["no gateway calls yet and no remote to probe"]},"poisoning":{"score":-1,"max":15,"notes":["tools not inspected (local package is not executed); not counted"]},"auth":{"score":12,"max":15,"notes":["local package, no credentials required"]},"maintenance":{"score":8,"max":15,"notes":["last push 159 days ago"]},"identity":{"score":8,"max":10,"notes":["registry namespace matches repository owner","GitHub account older than a year"]}},"findings":[],"inputs":{"packages":[{"registryType":"pypi","identifier":"mcp-number-theory","version":"0.1.0","found":true,"weeklyDownloads":12,"license":"MIT","dependencyCount":20,"publishedAt":"2026-03-28T19:41:33.725904Z","repositoryUrl":"https://github.com/daedalus/mcp-number-theory"}],"repo":{"found":true,"owner":"daedalus","repo":"mcp-number-theory","archived":false,"pushedAt":"2026-04-21T19:27:13Z","stars":0,"forks":0,"openIssues":0,"ownerType":"User","ownerAvatarUrl":"https://avatars.githubusercontent.com/u/115175?v=4","ownerCreatedAt":"2009-08-14T02:32:04Z","license":"MIT"},"icon":{"url":"https://avatars.githubusercontent.com/u/115175?v=4&s=128","source":"github"},"presence":{"stars":0,"forks":0,"downloadsWeek":12,"license":"MIT","lastPushAt":"2026-04-21T19:27:13.000Z","score":12}}}},"grade_history":[],"reviews":[]}