{"uid":"cap_AhqIam5A09Qt_ulBY3lJ6","slug":"numora-modular-exponentiation-api-05d5157b","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://numorapoi.orbonomy.xyz/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":"probe","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.03/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.03","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.03","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_0PRYcn1tOMLQNV8722Wzi","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.03","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Computes modular exponentiation (base^exp mod modulus) for integers, useful in cryptography and number theory","exampleAgentPrompt":"Can you calculate 7 raised to the power of 256, modulo 1000003? I need the modular exponentiation result.","exampleUseCases":null,"resultDescription":"Returns a JSON object with a boolean success flag, a result object containing the computed value of (base^exp) mod modulus, and a human-readable computation string describing what was calculated.","failureModes":["Missing required fields (base, exp, or mod) returns a validation error","mod value of 0 causes division by zero error","Non-integer inputs rejected with type error","Payment failure via x402 if insufficient USDC balance","Very large integers may cause timeout or overflow errors"],"whenToPreferThis":"Use this endpoint when you need to compute large integer modular exponentiation without setting up local math libraries, especially in cryptographic contexts (RSA, Diffie-Hellman), number theory problems, or when running in an environment with zero external dependencies. Prefer this over general-purpose compute services when you need a simple, pay-per-call math API with no setup.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-14T19:06:03.538Z","isFirstParty":false}