{"provider":{"host":"numtheory.openverbs.com","name":"Prime factorization","score":69.9,"live":true,"checkedAt":"2026-10-27T19:45:20.809Z","uptime72h":100,"lastCheck":{"httpStatus":402,"ms":567,"note":"valid x402 v2 terms"},"endpoints":6,"networks":["eip155:8453"],"cheapestUsd":"0.004","income7dUsd":"21.821","payers7d":28,"transfers7d":1470,"payoutAddressShared":true,"claimed":false,"page":"https://logicnodes.io/observatory/p/numtheory.openverbs.com"},"endpoints":[{"url":"https://numtheory.openverbs.com/v1/factorize","method":"POST","priceMicroUsd":4000,"networks":["eip155:8453"],"description":"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."},{"url":"https://numtheory.openverbs.com/v1/gcd","method":"POST","priceMicroUsd":4000,"networks":["eip155:8453"],"description":"Greatest common divisor of two or more non-negative integers (arbitrary precision)."},{"url":"https://numtheory.openverbs.com/v1/is-prime","method":"POST","priceMicroUsd":4000,"networks":["eip155:8453"],"description":"Miller-Rabin primality test (with witnesses that are exact for all 64-bit integers) on an arbitrary-precision integer. Returns { prime }."},{"url":"https://numtheory.openverbs.com/v1/lcm","method":"POST","priceMicroUsd":4000,"networks":["eip155:8453"],"description":"Least common multiple of two or more positive integers (arbitrary precision)."},{"url":"https://numtheory.openverbs.com/v1/modpow","method":"POST","priceMicroUsd":4000,"networks":["eip155:8453"],"description":"Compute (base ^ exponent) mod modulus efficiently for arbitrary-precision integers. The modulus must be positive."},{"url":"https://numtheory.openverbs.com/v1/totient","method":"POST","priceMicroUsd":4000,"networks":["eip155:8453"],"description":"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)."}]}