numtheory.openverbs.com publishes 3 machine-payable endpoints over the x402 protocol, priced from $0.004 to $0.004 per call. Each was probed directly; the response code below is what it returned.
| Endpoint | Method | Price | Probe |
|---|---|---|---|
| /v1/factorize | GET | $0.004 | 402 |
| /v1/is-prime | GET | $0.004 | 402 |
| /v1/totient | GET | $0.004 | 402 |
Prime-factorize a positive integer (≤ 10^15 so the computation is always fast). Returns the prime factors with exponents, the divisor count, and whether n is prime.
Miller-Rabin primality test (with witnesses that are exact for all 64-bit integers) on an arbitrary-precision integer. Returns { prime }.
Euler's totient φ(n) — the count of integers in [1, n] coprime to n — for a positive integer ≤ 10^15 (it is computed from the prime factorization).