numtheory.openverbs.com
Route probed: GET https://numtheory.openverbs.com/v1/gcd
Category: survive:identity/trust/verify (tags: verification) · Status: listing listed, probe active · Listing: 0.004 USD, 2 payers / 2 calls (30d, Bazaar) · Listed in: agentic-market, cdp-bazaar
Last probe: 2026-10-23T15:16:29Z (2 h ago) · Recent valid 402: 2/2 · p50 928 ms
probe-only: no paid test-buys yet. No index until 3 paid buys on 3 different days.
Badge: 
Paid test-buys
None yet.
402 challenge checks (since 2026-10-23T15:16:29Z)
1 valid 402s checked: terms consistent 1, Base USDC offered 1, price matches listing 1 (differs 0), payTo changed vs previous probe 0.
Unpaid probes (newest first, up to 200; raw receipts are kept 7 days, then in the archive)
| Receipt | UTC time | Method | Status | Valid 402 | ms | Listed amount (atomic) | Quoted amount (atomic) | Quoted payTo | Header bytes | Response sha256 | Signed | Route | Checks |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| b18a6b83f45f0d09a591 | 2026-10-23T15:16:29Z | GET | 402 | yes | 928 | 4000 | 4000 | 0xb3f4de10… | 2000 | 3f7196241025c2ec | per-receipt | primary | terms ok · Base USDC |
| 30e7b2dcdc9c53c392db | 2026-10-23T12:44:09Z | GET | 402 | yes | 148 | 4000 | 4000 | 0xb3f4de10… | 2000 | 9371c809d531d976 | snapshot | primary |
Other listed routes
https://numtheory.openverbs.com/v1/gcdGreatest common divisor of two or more non-negative integers (arbitrary precision). (cdp-bazaar)https://numtheory.openverbs.com/v1/factorizePrime-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 pr (cdp-bazaar)https://numtheory.openverbs.com/v1/lcmLeast common multiple of two or more positive integers (arbitrary precision). (cdp-bazaar)https://numtheory.openverbs.com/v1/modpowCompute (base ^ exponent) mod modulus efficiently for arbitrary-precision integers. The modulus must be positive. (cdp-bazaar)https://numtheory.openverbs.com/v1/totientEuler'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). (cdp-bazaar)https://numtheory.openverbs.com/v1/is-primeMiller-Rabin primality test (with witnesses that are exact for all 64-bit integers) on an arbitrary-precision integer. Returns { prime }. (cdp-bazaar)
Seller? Reply or dispute. Amounts are in the asset's atomic units (USDC: 6 decimals).