← Back to directory

Modular exponentiation base^exp mod m for big integers, decimal or 0x hex, up to...

https://crypto-math.x402tookit.com/mod-pow

Overview

Modular exponentiation base^exp mod m for big integers, decimal or 0x hex, up to 4096 bits.

Protocol x402
Price $0.02
Payment Asset USD Coin
Payment Network eip155:8453
Category uncategorized
Provider Crypto Math
Source bazaar
Indexed 2026-10-20 21:22:37

Health

Status healthy
Latency (p50) 505ms
Uptime (30d) 80.0%
Reliability Score 80/100
Last Checked 2026-10-28 06:40:24
Last Healthy 2026-10-28 06:40:24
Consecutive Failures 0

x402 Payment Validation

Payment Requirements Valid
Asset Verified Known USDC
Facilitator —

Input Schema

{ "method": "GET", "queryParams": { "base": "4", "exp": "13", "mod": "497" }, "type": "http" }

Output Schema

{ "example": { "asOf": "2026-10-11T23:46:29.288Z", "degraded": false, "disclaimer": "Screening signal computed from the named public source. Not financial, legal or investment advice; provided as is. Verify at the source before acting.", "exponentBits": 4, "modulusBits": 9, "notChecked": [ "whether the modulus is prime or the base is a unit", "side channels: this is not constant-time, so never use it with a secret exponent", "…1 more" ], "reasons": [ "Computed by square-and-multiply; a negative base is first reduced into 0..m-1." ], "result": { "bits": 9, "decimal": "445", "hex": "0x1bd" }, "source": "square-and-multiply on JavaScript BigInt, computed locally", "summary": "base^exp mod m = 445.", "verdict": "COMPUTED" }, "type": "json" }