{
 "host": "numtheory.openverbs.com",
 "slug": "numtheory.openverbs.com",
 "resources": 6,
 "probed": 0,
 "live": 0,
 "dead": 0,
 "templated": 0,
 "verdict": "unverified",
 "statuses": {
  "unprobed": 6
 },
 "methods": {
  "POST": 6
 },
 "networks": {
  "base": 6
 },
 "testnet_only": false,
 "catalogs": {
  "cdp": 6
 },
 "categories": {
  "other/unknown": 5,
  "dev-tools/utilities": 1
 },
 "price_min": 0.004,
 "price_max": 0.004,
 "price_median": 0.004,
 "payTos": [
  "0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A"
 ],
 "shared_payto_hosts": [
  "airport.openverbs.com",
  "astro.openverbs.com",
  "bitwise.openverbs.com",
  "braille.openverbs.com",
  "chain.openverbs.com",
  "checkdigit.openverbs.com",
  "checksum.openverbs.com",
  "chem.openverbs.com",
  "chemeq.openverbs.com",
  "color.openverbs.com",
  "combinatorics.openverbs.com",
  "creditcard.openverbs.com"
 ],
 "shared_payto_hosts_count": 90,
 "onchain": {
  "resolved": true,
  "payTos_resolved": 1,
  "payTos_total": 1,
  "payers": 5,
  "payments": 197,
  "usd": 1.353,
  "first": "2026-09-09T06:14:21.000000Z",
  "last": "2026-09-30T21:31:07.000000Z",
  "sampler_share": 1,
  "sources": [
   "forensics-2026-09-30"
  ],
  "note": "the payTo also receives for 90 other hosts; on-chain totals are per address, not per host"
 },
 "files": null,
 "files_checked_at": null,
 "first_seen_catalog": "2026-09-06T08:14:11.081Z",
 "last_updated_catalog": "2026-09-14T19:59:41.866Z",
 "cdp_quality": {
  "calls30": 19,
  "payers30": 7,
  "rows": 6,
  "note": "CDP catalog's own 30-day counters, summed over rows; catalog-reported, not settlement"
 },
 "curated": 0,
 "is_us": false,
 "resources_list": [
  {
   "id": "ae84585fd15d",
   "url": "https://numtheory.openverbs.com/v1/lcm",
   "method": "POST",
   "price_usd": 0.004,
   "net": "base",
   "status": "unprobed",
   "valid_402": false,
   "description": "Least common multiple of two or more positive integers (arbitrary precision).",
   "catalogs": [
    "cdp"
   ],
   "payers": 5,
   "first_seen_catalog": "2026-09-14T19:59:41.866Z",
   "last_updated_catalog": "2026-09-14T19:59:41.866Z"
  },
  {
   "id": "eacb23ee36e8",
   "url": "https://numtheory.openverbs.com/v1/modpow",
   "method": "POST",
   "price_usd": 0.004,
   "net": "base",
   "status": "unprobed",
   "valid_402": false,
   "description": "Compute (base ^ exponent) mod modulus efficiently for arbitrary-precision integers. The modulus must",
   "catalogs": [
    "cdp"
   ],
   "payers": 5,
   "first_seen_catalog": "2026-09-06T08:14:21.849Z",
   "last_updated_catalog": "2026-09-06T08:14:21.849Z"
  },
  {
   "id": "49ec19958ad4",
   "url": "https://numtheory.openverbs.com/v1/totient",
   "method": "POST",
   "price_usd": 0.004,
   "net": "base",
   "status": "unprobed",
   "valid_402": false,
   "description": "Euler's totient φ(n) — the count of integers in [1, n] coprime to n — for a positive integer ≤ 10^15",
   "catalogs": [
    "cdp"
   ],
   "payers": 5,
   "first_seen_catalog": "2026-09-06T08:14:19.818Z",
   "last_updated_catalog": "2026-09-06T08:14:19.818Z"
  },
  {
   "id": "a9c538191062",
   "url": "https://numtheory.openverbs.com/v1/is-prime",
   "method": "POST",
   "price_usd": 0.004,
   "net": "base",
   "status": "unprobed",
   "valid_402": false,
   "description": "Miller-Rabin primality test (with witnesses that are exact for all 64-bit integers) on an arbitrary-",
   "catalogs": [
    "cdp"
   ],
   "payers": 5,
   "first_seen_catalog": "2026-09-06T08:14:17.838Z",
   "last_updated_catalog": "2026-09-06T08:14:17.838Z"
  },
  {
   "id": "cb039148a2ed",
   "url": "https://numtheory.openverbs.com/v1/factorize",
   "method": "POST",
   "price_usd": 0.004,
   "net": "base",
   "status": "unprobed",
   "valid_402": false,
   "description": "Prime-factorize a positive integer (≤ 10^15 so the computation is always fast). Returns the prime fa",
   "catalogs": [
    "cdp"
   ],
   "payers": 5,
   "first_seen_catalog": "2026-09-06T08:14:15.724Z",
   "last_updated_catalog": "2026-09-06T08:14:15.724Z"
  },
  {
   "id": "b2939137abef",
   "url": "https://numtheory.openverbs.com/v1/gcd",
   "method": "POST",
   "price_usd": 0.004,
   "net": "base",
   "status": "unprobed",
   "valid_402": false,
   "description": "Greatest common divisor of two or more non-negative integers (arbitrary precision).",
   "catalogs": [
    "cdp"
   ],
   "payers": 5,
   "first_seen_catalog": "2026-09-06T08:14:11.081Z",
   "last_updated_catalog": "2026-09-06T08:14:11.081Z"
  }
 ],
 "live_reprobes": {
  "eacb23ee36e8": {
   "at": "2026-10-01T02:13:18.000Z",
   "head_status": 402,
   "get_status": 402,
   "is_402": true,
   "status": "live",
   "dead": false,
   "valid_402": true,
   "body_json": true,
   "has_accepts": true,
   "accepts_count": 1,
   "accepts0": {
    "scheme": "exact",
    "network": "eip155:8453",
    "amount": "4000",
    "payTo": "0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A",
    "asset": "0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913",
    "maxTimeoutSeconds": 300,
    "extra": {
     "name": "USD Coin",
     "version": "2"
    }
   },
   "price_matches_catalog": true,
   "payto_matches_catalog": null,
   "x402Version": 2,
   "has_bazaar_ext": true,
   "has_payment_required_header": true,
   "mpp_header": "Payment id=\"rr45ozqWHuBTCRRK-4kzu-uqorLy",
   "channel": "header",
   "content_type": "application/problem+json",
   "latency_ms": 3601,
   "error": null,
   "error_text": "Payment is required (Compute (base ^ exponent) mod modulus efficiently for arbitrary-precision integers. The modulus mus",
   "id": "eacb23ee36e8",
   "url": "https://numtheory.openverbs.com/v1/modpow",
   "via": "cron",
   "prev_status": "unprobed",
   "census_status": "unprobed",
   "changed": true
  },
  "49ec19958ad4": {
   "at": "2026-10-01T02:13:18.000Z",
   "head_status": 402,
   "get_status": 402,
   "is_402": true,
   "status": "live",
   "dead": false,
   "valid_402": true,
   "body_json": true,
   "has_accepts": true,
   "accepts_count": 1,
   "accepts0": {
    "scheme": "exact",
    "network": "eip155:8453",
    "amount": "4000",
    "payTo": "0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A",
    "asset": "0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913",
    "maxTimeoutSeconds": 300,
    "extra": {
     "name": "USD Coin",
     "version": "2"
    }
   },
   "price_matches_catalog": true,
   "payto_matches_catalog": null,
   "x402Version": 2,
   "has_bazaar_ext": true,
   "has_payment_required_header": true,
   "mpp_header": "Payment id=\"Bg9rYd0LGoos3Rr8olTwRJPpffka",
   "channel": "header",
   "content_type": "application/problem+json",
   "latency_ms": 3680,
   "error": null,
   "error_text": "Payment is required (Euler's totient φ(n) — the count of integers in [1, n] coprime to n — for a positive integer ≤ 10^1",
   "id": "49ec19958ad4",
   "url": "https://numtheory.openverbs.com/v1/totient",
   "via": "cron",
   "prev_status": "unprobed",
   "census_status": "unprobed",
   "changed": true
  },
  "a9c538191062": {
   "at": "2026-10-01T02:13:18.000Z",
   "head_status": 402,
   "get_status": 402,
   "is_402": true,
   "status": "live",
   "dead": false,
   "valid_402": true,
   "body_json": true,
   "has_accepts": true,
   "accepts_count": 1,
   "accepts0": {
    "scheme": "exact",
    "network": "eip155:8453",
    "amount": "4000",
    "payTo": "0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A",
    "asset": "0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913",
    "maxTimeoutSeconds": 300,
    "extra": {
     "name": "USD Coin",
     "version": "2"
    }
   },
   "price_matches_catalog": true,
   "payto_matches_catalog": null,
   "x402Version": 2,
   "has_bazaar_ext": true,
   "has_payment_required_header": true,
   "mpp_header": "Payment id=\"n0n74malVJSk8RL0gddsqH3o8otA",
   "channel": "header",
   "content_type": "application/problem+json",
   "latency_ms": 3426,
   "error": null,
   "error_text": "Payment is required (Miller-Rabin primality test (with witnesses that are exact for all 64-bit integers) on an arbitrary",
   "id": "a9c538191062",
   "url": "https://numtheory.openverbs.com/v1/is-prime",
   "via": "cron",
   "prev_status": "unprobed",
   "census_status": "unprobed",
   "changed": true
  },
  "cb039148a2ed": {
   "at": "2026-10-01T02:13:18.000Z",
   "head_status": 402,
   "get_status": 402,
   "is_402": true,
   "status": "live",
   "dead": false,
   "valid_402": true,
   "body_json": true,
   "has_accepts": true,
   "accepts_count": 1,
   "accepts0": {
    "scheme": "exact",
    "network": "eip155:8453",
    "amount": "4000",
    "payTo": "0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A",
    "asset": "0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913",
    "maxTimeoutSeconds": 300,
    "extra": {
     "name": "USD Coin",
     "version": "2"
    }
   },
   "price_matches_catalog": true,
   "payto_matches_catalog": null,
   "x402Version": 2,
   "has_bazaar_ext": true,
   "has_payment_required_header": true,
   "mpp_header": "Payment id=\"_Z0dxdlRyZ5h9uMP8ONN39tf_FTc",
   "channel": "header",
   "content_type": "application/problem+json",
   "latency_ms": 3462,
   "error": null,
   "error_text": "Payment is required (Prime-factorize a positive integer (≤ 10^15 so the computation is always fast). Returns the prime f",
   "id": "cb039148a2ed",
   "url": "https://numtheory.openverbs.com/v1/factorize",
   "via": "cron",
   "prev_status": "unprobed",
   "census_status": "unprobed",
   "changed": true
  },
  "b2939137abef": {
   "at": "2026-10-01T02:13:18.000Z",
   "head_status": 402,
   "get_status": 402,
   "is_402": true,
   "status": "live",
   "dead": false,
   "valid_402": true,
   "body_json": true,
   "has_accepts": true,
   "accepts_count": 1,
   "accepts0": {
    "scheme": "exact",
    "network": "eip155:8453",
    "amount": "4000",
    "payTo": "0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A",
    "asset": "0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913",
    "maxTimeoutSeconds": 300,
    "extra": {
     "name": "USD Coin",
     "version": "2"
    }
   },
   "price_matches_catalog": true,
   "payto_matches_catalog": null,
   "x402Version": 2,
   "has_bazaar_ext": true,
   "has_payment_required_header": true,
   "mpp_header": "Payment id=\"VwqTzDE3OCrdQH1lm2Ov4-Hz8sWu",
   "channel": "header",
   "content_type": "application/problem+json",
   "latency_ms": 3221,
   "error": null,
   "error_text": "Payment is required (Greatest common divisor of two or more non-negative integers (arbitrary precision).).",
   "id": "b2939137abef",
   "url": "https://numtheory.openverbs.com/v1/gcd",
   "via": "cron",
   "prev_status": "unprobed",
   "census_status": "unprobed",
   "changed": true
  }
 },
 "page": "https://bazaar.agentexchange.work/seller/numtheory.openverbs.com",
 "badge": "https://bazaar.agentexchange.work/seller/numtheory.openverbs.com.svg",
 "paid": {
  "report_now": {
   "url": "https://bazaar.agentexchange.work/seller/numtheory.openverbs.com/report.json",
   "price_usd": 0.05,
   "protocol": "x402"
  }
 },
 "license": "CC BY 4.0"
}