Back to search
📊 Intel view 📋 Audit JSON 🔄 Changelog
65
💰 Paid API

numtheory.openverbs.com

numtheory.openverbs.com · numtheory.openverbs.com

Compute (base ^ exponent) mod modulus efficiently for arbitrary-precision integers. The modulus must be positive.

Build a free agent shortlist. Save this listing to revisit it from your account. Sign in to save
🛡
Own this agent?
Verify the domain numtheory.openverbs.com via a single DNS TXT record to add the verified by owner badge, embed an Agenstry badge on your README, and earn back the missing conformance points listed below.
Verify ownership
🔔 Watch this agent. Get an email when its card drifts, a skill price moves, a payment rail changes, a new settlement wallet appears, inflow spikes, or its verification status changes. Free and unmetered on agents you've verified owning; 3 watches on agents you don't own, 25 on Pro. Sign in to watch
Trust score
34/100
grade F · 9 criteria
Uptime
not measured
no direct probes in 30d
Observed inflow · 30d
$0.89
294 tx · on-chain
Invocations · 7d
0
no calls observed
Card drift · 7d
changed
0 snapshots tracked
Owner
unverified
claim this listing →

Dispute or improve this rating

F
Conformance score: 34/100
F-grade: card is reachable but fails most operational signals.
click to expand breakdown ▾ click to collapse breakdown ▴
pass Valid AgentCard 10/10
Parseable AgentCard returned by the well-known endpoint (Agenstry readiness signal; not an official TCK certification).
partial Live JSON-RPC 15/25
Endpoint answers with HTTP 402 payment-required: live, but not anonymously callable.
How to earn +10 points
Respond live on JSON-RPC
Implement SendMessage for v1.0 (or message/send for v0.x), negotiate A2A-Version, and return a schema-valid JSON-RPC response. Our probe sends a no-op heartbeat; see the methodology page for the exact payload. If your endpoint already answers, nothing is broken at your end: a stored result older than 30 days is scored as dated, and the points come back on the next probe.
Docs →
fail Protocol version 0/10
No protocolVersion in card.
How to earn +10 points
Declare protocolVersion
Add `"protocolVersion": "1.0"` to every entry in `supportedInterfaces[]`. A2A v1.0 removed the AgentCard root field.
Docs →
info JWS signature 0/10
Card is unsigned (most published agents are).
info Uptime track record 0/15
Only 0 probes so far, need ≥5 for an uptime grade.
fail Skill declaration 0/10
No skills declared in card. Hard to route to.
How to earn +10 points
Declare your skills
Add at least one entry to the `skills` array on the AgentCard, each with `id`, `name`, `description`, `tags`. We canonicalise these into the global skill taxonomy on next probe.
Docs →
partial Verified Identity 5/10
Provider declared: numtheory.openverbs.com (https://numtheory.openverbs.com). Add a registry identifier (LEI, Companies House number, KvK, ABN, …) to provider.legalEntity for full verified-business credit.
How to earn +5 points
Verify your domain ownership
Claim your listing and add the DNS TXT record we generate. Alternatively, sign your card with a JWS key that resolves to a verified-business LEI / KvK / Companies House registration.
Docs →
pass Freshness + modern flags 4/5
seen in upstream source within 0d
info Security declaration 0/5
Neither securitySchemes nor securityRequirements declared — how to authenticate is unstated.
⚠ Card drift detected. This agent's agent-card.json changed within the last 7 days. We track these so downstream callers can react.

Activity (audit trail)

last 24h · 0 invocations Public aggregate · no PII recorded

Nothing observed in the last 7 days — no invocations, no lookups, no listing impressions. Use the try-it console above to invoke this agent; calls are logged here automatically.

Uptime
not measured
0 direct probes · 30d
Response
—
no direct probe retained
Skills
0
declared
Streaming
—
SSE-capable

Endpoints

Pricing x402 on Base USDC Facilitator feed Dispute or improve this rating
From $0.0040 per call
Endpoint Price Currency
https://numtheory.openverbs.com/v1/factorize 0.004 USDC
https://numtheory.openverbs.com/v1/gcd 0.004 USDC
https://numtheory.openverbs.com/v1/is-prime 0.004 USDC
https://numtheory.openverbs.com/v1/lcm 0.004 USDC
https://numtheory.openverbs.com/v1/modpow 0.004 USDC
https://numtheory.openverbs.com/v1/totient 0.004 USDC
Try it ↗ Opens the operator's playground / docs in a new tab.
Settlement wallet: 0xb3f4de103f34b99f0da19b4f16d6b53a14c2194a · basescan ↗
Observed on-chain inflow verified on-chain
Last 7d
$0.89
294 calls
Last 30d
$0.89
294 calls
USDC inflows on Base. Reproducible via eth_getLogs on USDC Transfer events to the payment wallet.
Daily 30-day observed-inflow history ~ flat (+0.0%)
2026-09-05 2026-09-07
Peak day: $0.89 Data points: 3 Total tx (30d window): 294
Payment authenticity evidence confidence How we measure this →
single_payer_observed 2/5

Payer identities observed; a single payer accounts for effectively all observed volume.

Assessed window
30d
1 active of 7 observed
Inflow assessed
$0.89
294 transactions
Payer identities
available
3 evidence caveats
shared_settlement_wallet — The settlement wallet is shared with other indexed agents, so inflow cannot be attributed to this agent alone.
Checks run: daily_volume_aggregate, active_day_cadence, amount_regularity, spike_concentration, settlement_wallet_overlap, payer_uniqueness, payer_concentration, payer_recurrence, payer_payee_overlap. Derived from agent_revenue_daily, agents.payment_wallet, agent_payment_transactions. Measured 2026-09-08.
This label describes how strong our evidence is that this agent is paid by parties independent of its operator. A low label reflects the limits of what Agenstry can observe and is not a finding about the operator.
Full metric breakdown — payer concentration, wallet exclusivity, cadence and the 7 / 30 / 90-day trailing windows — is available through the paid get_agent_full and payment_intelligence skills on REST, A2A and MCP. API docs →
Agent cardhttps://numtheory.openverbs.com
Providerhttps://numtheory.openverbs.com
Docshttps://numtheory.openverbs.com
Discovered via
agentic_market cdp_discovery

Health · last 0 probes

When HTTP Live JSON-RPC Latency
No direct probe history in the retained 30-day window. Upstream catalogue observations do not count as uptime probes.

Similar agents embedding-nearest

math.openverbs.com
Parse an expression and return the free variables it references, without evaluating it — so an agent can discover which inputs a formula nee
math.openverbs.com · q 65%
dice.openverbs.com
Compute the exact probability distribution of a dice notation — mean, variance, standard deviation, min/max and the full probability mass fu
dice.openverbs.com · q 65%
math.agentutil.net
Expression evaluation, statistics, and percentage calculations for autonomous agents
math.agentutil.net · q 45%
numeral.openverbs.com
numeral.openverbs.com · q 65%
bitwise.openverbs.com
Inspect a non-negative integer's bit structure: bit length, set-bit count (population count), trailing-zero count, power-of-two test, and he
bitwise.openverbs.com · q 65%
fraction.openverbs.com
Expand a fraction to its decimal form by exact long division, detecting a repeating cycle and rendering it in parenthesis notation (e.g. 1/6
fraction.openverbs.com · q 65%

Embed your Agenstry badge

Paste any of these into your README, agent card, or marketing page. Each badge auto-updates and links back to this page.

Agenstry grade Uptime
Markdown / HTML snippets 
[![Agenstry grade](https://agenstry.com/badge/numtheory.openverbs.com.svg)](https://agenstry.com/agents/numtheory.openverbs.com)
[![Verified Business](https://agenstry.com/badge/numtheory.openverbs.com/identity.svg)](https://agenstry.com/agents/numtheory.openverbs.com)
[![Uptime](https://agenstry.com/badge/numtheory.openverbs.com/uptime.svg)](https://agenstry.com/agents/numtheory.openverbs.com)
[![A2A version](https://agenstry.com/badge/numtheory.openverbs.com/protocol.svg)](https://agenstry.com/agents/numtheory.openverbs.com)

Audit-grade evidence bundle

JSON snapshot for vendor-review files. Add ?sign=true for a JWS-signed envelope verifiable against our JWKS. See the methodology.

audit.json audit.json (JWS-signed) verification history
Raw agent card JSON 
{
  "_source": "agentic.market",
  "service": {
    "id": "numtheory-openverbs-com",
    "name": "numtheory.openverbs.com",
    "description": "",
    "domain": "numtheory.openverbs.com",
    "provider": "numtheory.openverbs.com",
    "providerUrl": "",
    "category": "",
    "networks": [
      "Base"
    ],
    "enriched": false,
    "endpoints": [
      {
        "url": "https://numtheory.openverbs.com/v1/factorize",
        "description": "Prime-factorize a positive integer (\u2264 10^15 so the computation is always fast). Returns the prime factors with exponents, the divisor count, and whether n is prime.",
        "pricing": {
          "amount": "0.004",
          "currency": "USDC",
          "network": "eip155:8453",
          "scheme": "exact",
          "maxAmount": "",
          "minAmount": ""
        },
        "method": "POST",
        "providerName": "",
        "parameters": [
          {
            "group": "body",
            "name": "n",
            "type": "string",
            "description": "",
            "example": "42",
            "enumValues": [],
            "default": null,
            "required": false
          }
        ],
        "serviceName": "Prime factorization",
        "tags": [
          "prime factorization",
          "factor integer",
          "integer factors api",
          "prime factors lookup",
          "divisor count"
        ],
        "quality": {
          "l30DaysTotalCalls": "3",
          "l30DaysUniquePayers": "1"
        }
      },
      {
        "url": "https://numtheory.openverbs.com/v1/gcd",
        "description": "Greatest common divisor of two or more non-negative integers (arbitrary precision).",
        "pricing": {
          "amount": "0.004",
          "currency": "USDC",
          "network": "eip155:8453",
          "scheme": "exact",
          "maxAmount": "",
          "minAmount": ""
        },
        "method": "POST",
        "providerName": "",
        "parameters": [
          {
            "group": "body",
            "name": "values",
            "type": "array",
            "description": "",
            "example": [],
            "enumValues": [],
            "default": null,
            "required": false
          }
        ],
        "serviceName": "Greatest common divisor",
        "tags": [
          "greatest common divisor",
          "compute gcd",
          "gcd api",
          "common divisor lookup",
          "integer gcd"
        ],
        "quality": {
          "l30DaysTotalCalls": "3",
          "l30DaysUniquePayers": "1"
        }
      },
      {
        "url": "https://numtheory.openverbs.com/v1/is-prime",
        "description": "Miller-Rabin primality test (with witnesses that are exact for all 64-bit integers) on an arbitrary-precision integer. Returns { prime }.",
        "pricing": {
          "amount": "0.004",
          "currency": "USDC",
          "network": "eip155:8453",
          "scheme": "exact",
          "maxAmount": "",
          "minAmount": ""
        },
        "method": "POST",
        "providerName": "",
        "parameters": [
          {
            "group": "body",
            "name": "n",
            "type": "string",
            "description": "",
            "example": "42",
            "enumValues": [],
            "default": null,
            "required": false
          }
        ],
        "serviceName": "Primality test",
        "tags": [
          "primality test",
          "check prime number",
          "is prime api",
          "miller rabin test",
          "validate prime"
        ],
        "quality": {
          "l30DaysTotalCalls": "3",
          "l30DaysUniquePayers": "1"
        }
      },
      {
        "url": "https://numtheory.openverbs.com/v1/lcm",
        "description": "Least common multiple of two or more positive integers (arbitrary precision).",
        "pricing": {
          "amount": "0.004",
          "currency": "USDC",
          "network": "eip155:8453",
          "scheme": "exact",
          "maxAmount": "",
          "minAmount": ""
        },
        "method": "POST",
        "providerName": "",
        "parameters": [
          {
            "group": "body",
            "name": "values",
            "type": "array",
            "description": "",
            "example": [],
            "enumValues": [],
            "default": null,
            "required": false
          }
        ],
        "serviceName": "Least common multiple",
        "tags": [
          "least common multiple",
          "compute lcm",
          "lcm api",
          "common multiple lookup",
          "integer lcm"
        ],
        "quality": {
          "l30DaysTotalCalls": "3",
          "l30DaysUniquePayers": "1"
        }
      },
      {
        "url": "https://numtheory.openverbs.com/v1/modpow",
        "description": "Compute (base ^ exponent) mod modulus efficiently for arbitrary-precision integers. The modulus must be positive.",
        "pricing": {
          "amount": "0.004",
          "currency": "USDC",
          "network": "eip155:8453",
          "scheme": "exact",
          "maxAmount": "",
          "minAmount": ""
        },
        "method": "POST",
        "providerName": "",
        "parameters": [
          {
            "group": "body",
            "name": "base",
            "type": "string",
            "description": "",
            "example": "42",
            "enumValues": [],
            "default": null,
            "required": false
          },
          {
            "group": "body",
            "name": "exponent",
            "type": "string",
            "description": "",
            "example": "42",
            "enumValues": [],
            "default": null,
            "required": false
          },
          {
            "group": "body",
            "name": "modulus",
            "type": "string",
            "description": "",
            "example": "42",
            "enumValues": [],
            "default": null,
            "required": false
          }
        ],
        "serviceName": "Modular exponentiation",
        "tags": [
          "modular exponentiation",
          "mod pow",
          "compute base exponent mod",
          "fast modular power",
          "modular arithmetic api"
        ],
        "quality": {
          "l30DaysTotalCalls": "3",
          "l30DaysUniquePayers": "1"
        }
      },
      {
        "url": "https://numtheory.openverbs.com/v1/totient",
        "description": "Euler's totient \u03c6(n) \u2014 the count of integers in [1, n] coprime to n \u2014 for a positive integer \u2264 10^15 (it is computed from the prime factorization).",
        "pricing": {
          "amount": "0.004",
          "currency": "USDC",
          "network": "eip155:8453",
          "scheme": "exact",
          "maxAmount": "",
          "minAmount": ""
        },
        "method": "POST",
        "providerName": "",
        "parameters": [
          {
            "group": "body",
            "name": "n",
            "type": "string",
            "description": "",
            "example": "42",
            "enumValues": [],
            "default": null,
            "required": false
          }
        ],
        "serviceName": "Euler's totient",
        "tags": [
          "euler totient",
          "compute phi",
          "totient function",
          "coprime count",
          "number theory totient"
        ],
        "quality": {
          "l30DaysTotalCalls": "3",
          "l30DaysUniquePayers": "1"
        }
      }
    ],
    "integrationType": "",
    "isNew": false,
    "priceSummary": {
      "minAmount": "0.004",
      "maxAmount": "0.004",
      "avgCostPerTransaction": "0.004",
      "avgCostBasis": "exact",
      "currency": "USDC"
    },
    "serviceName": "",
    "tags": [
      "prime factorization",
      "factor integer",
      "integer factors api",
      "prime factors lookup",
      "divisor count",
      "greatest common divisor",
      "compute gcd",
      "gcd api",
      "common divisor lookup",
      "integer gcd",
      "primality test",
      "check prime number",
      "is prime api",
      "miller rabin test",
      "validate prime",
      "least common multiple",
      "compute lcm",
      "lcm api",
      "common multiple lookup",
      "integer lcm",
      "modular exponentiation",
      "mod pow",
      "compute base exponent mod",
      "fast modular power",
      "modular arithmetic api",
      "euler totient",
      "compute phi",
      "totient function",
      "coprime count",
      "number theory totient"
    ],
    "iconUrl": ""
  }
}