{"uid":"cap_HMGGprnKMWLKeOIRTylpu","slug":"numora-modular-exponentiation-api-7f378dda","name":"Numora Modular Exponentiation API","description":"100 pure math computation endpoints for AI agents. Statistics, financial math, linear algebra, equation solving, calculus, number theory, sequence generation, and unit conversions. Zero external dependencies. x402 micropayments on Base.","url":"https://numormo.vercel.app/api/number/modular-exp","method":"POST","headers":{},"bodySchema":{"type":"object","required":["exp","mod","base"],"properties":{"exp":{"type":"integer"},"mod":{"type":"integer"},"base":{"type":"integer"}}},"responseSchema":{"type":"object","required":["success","result","computation"],"properties":{"result":{"type":"object","description":"Computation result varies by endpoint"},"success":{"type":"boolean","description":"Always true on success"},"computation":{"type":"string","description":"Human-readable description of what was computed"}}},"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.1","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"registry","requiresHandshake":false,"reviewCount":0,"rating":{"score":"0.00","successRate":"0.00","reviews":0,"stars":null,"state":"unrated"},"availabilityStatus":"unknown","priceObserved":null,"sessionDeposit":null,"pricing":{"kind":"static","summary":"$0.1/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.1","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.1","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_tiXw2-W7zJAb_rLmUpmYD","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.1","costPer":"request","priority":0,"asset":null,"unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Computes modular exponentiation (base^exp mod m) for integers, useful in cryptography and number theory","exampleAgentPrompt":"Calculate 7 to the power of 256 modulo 1000000007 for me using Numora's modular exponentiation endpoint — base is 7, exponent is 256, and mod is 1000000007.","exampleUseCases":[{"title":"RSA cryptography key verification","prompt":"I need to verify an RSA computation — can you compute 65537 to the power of 3233 modulo 3233 and tell me the result?"},{"title":"Number theory homework check","prompt":"Can you confirm what 2 raised to the power of 100 mod 97 equals? I'm working through Fermat's little theorem and want to verify my answer."},{"title":"Diffie-Hellman key exchange step","prompt":"For a Diffie-Hellman key exchange, compute 5 to the power of 17 modulo 23 — base is 5, exponent is 17, mod is 23."}],"resultDescription":"Returns a JSON object with success (boolean), result (object containing the computed integer value of base^exp mod modulus), and computation (a human-readable string describing what was calculated).","failureModes":["Missing required fields (base, exp, or mod) returns a validation error","Modulus of zero causes a division-by-zero error","Non-integer inputs fail schema validation","Very large integers may hit platform computation limits","x402 payment failure if USDC balance is insufficient"],"whenToPreferThis":"Choose this endpoint when you need to compute base^exp mod m for large integers without relying on local code execution, or when working within an agentic pipeline that requires deterministic, dependency-free math over x402 micropayments. Prefer it over general-purpose code execution tools when you want a lightweight, paid computation call with a predictable JSON response.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-14T19:07:26.906Z","isFirstParty":false}