Evidence row 770924

What was observed

{
  "count": 13,
  "tools": [
    {
      "description": "Run up to 10 primitive calls in one round trip. One x402 payment of $0.40 (=$0.04 per call, 20% off the single-call price). Each request specifies an `endpoint` (normalize, validate, extract, redact, classify, dedupe, diff, chunk, extract_custom, validate_json, slugify, hash) and the input for it; the response carries 10 results in the same order. Single-call batch — no streaming. $0.40 USDC per successful call (x402, client-paid); failed calls are not charged.",
      "inputSchema": {
        "type": "object"
      },
      "name": "batch"
    },
    {
      "description": "Split long text into pieces for RAG retrieval. Strategies: 'sentence' packs whole sentences into a size budget and never splits mid-sentence; 'paragraph' prefers \\n\\n boundaries; 'fixed' is a hard char window with overlap. The highest-value endpoint for agents that build retrieval pipelines. $0.005 USDC per successful call (x402, client-paid); failed calls are not charged.",
      "inputSchema": {
        "type": "object"
      },
      "name": "chunk"
    },
    {
      "description": "Rule-based multi-label text classification over a fixed taxonomy (urgency, financial_promise, credential_request, crypto_mention, cta, legal_offer, medical_claim, seo_spam, url_shortener, press_release, question, has_contact). Deterministic - identical text always yields identical labels. $0.003 USDC per successful call (x402, client-paid); failed calls are not charged.",
      "inputSchema": {
        "type": "object"
      },
      "name": "classify"
    },
    {
      "description": "Near-duplicate detection across a batch of documents. Exact Jaccard similarity over word-3-shingle sets decides duplication; a 64-bit SimHash is returned per document as a compact content fingerprint. Up to 200 documents per call. $0.01 USDC per successful call (x402, client-paid); failed calls are not charged.",
      "inputSchema": {
        "type": "object"
      },
      "name": "dedupe"
    },
    {
      "description": "Line-level LCS diff of two text blobs. Returns a structured edit script with insertions, deletions, unchanged line counts and per-operation metadata; with format='unified' also returns a unified-diff string. $0.005 USDC per successful call (x402, client-paid); failed calls are not charged.",
      "inputSchema": {
        "type": "object"
      },
      "name": "diff"
    },
    {
      "description": "Extract structured fields from unstructured text with byte offsets and normalized values: emails, URLs, IPv4, phones, money amounts, ISO dates, UUIDs, EVM addresses, SKUs, semver. $0.005 USDC per successful call (x402, client-paid); failed calls are not charged.",
      "inputSchema": {
        "type": "object"
      },
      "name": "extract"
    },
    {
      "description": "Pull caller-defined structured fields from text using regex patterns with deterministic type coercion. Supported types: string, bool, date, url, email, number. Returns {fields: {name: value|null}, found, missing}. Pure deterministic — no LLM call. $0.005 USDC per successful call (x402, client-paid); failed calls are not charged.",
      "inputSchema": {
        "type": "object"
      },
      "name": "extract_custom"
    },
    {
      "description": "Content-addressable hashing for caching and dedup. Three algorithms: sha256 (via node:crypto / Web Crypto), xxhash64 and murmur3 (inline pure-JS, deterministic across runs). Returns hex digest + algorithm + byte count. $0.002 USDC per successful call (x402, client-paid); failed calls are not charged.",
      "inputSchema": {
        "type": "object"
      },
      "name": "hash"
    },
    {
      "description": "Deterministic text normalization: Unicode NFKC, zero-width/bidi stripping, smart-quote and dash folding, whitespace collapse, case folding. Returns a stable content hash so two texts can be compared for exact equality. $0.002 USDC per successful call (x402, client-paid); failed calls are not charged.",
      "inputSchema": {
        "type": "object"
      },
      "name": "normalize"
    },
    {
      "description": "Redact PII from text before it is stored or logged. Returns redacted text plus exact byte spans and counts per class: credit_card, iban, email, private_key, evm_address, phone, ipv4, url. $0.005 USDC per successful call (x402, client-paid); failed calls are not charged.",
      "inputSchema": {
        "type": "object"
      },
      "name": "redact"
    },
    {
      "description": "URL-safe slug from arbitrary text. NFKD-decomposes unicode (é -> e), lowercases, replaces every non-[a-z0-9] run with a separator, strips leading/trailing separators, truncates on separator boundaries (never mid-word). $0.002 USDC per successful call (x402, client-paid); failed calls are not charged.",
      "inputSchema": {
        "type": "object"
      },
      "name": "slugify"
    },
    {
      "description": "Validate and canonicalize one identifier: email, URL, E.164 phone, IBAN (mod-97), payment card (Luhn), UUID, SHA-256, git SHA, EVM address (EIP-55) or domain. Returns {valid, canonical, fingerprint}. $0.002 USDC per successful call (x402, client-paid); failed calls are not charged.",
      "inputSchema": {
        "type": "object"
      },
      "name": "validate"
    },
    {
      "description": "Deterministic JSON-Schema subset validator. Catches malformed JSON before it breaks a pipeline. Supports: type, required, properties, items, minLength, maxLength, pattern, enum, minimum, maximum, additionalProperties. No external dependencies. $0.003 USDC per successful call (x402, client-paid); failed calls are not charged.",
      "inputSchema": {
        "type": "object"
      },
      "name": "validate_json"
    }
  ]
}

What the leaf hashes

{"body":"f38a2b3d7e27cb8e4bb9346013373c4c0adb9ac634640c43aae07043f151103c","id":770924,"kind":"mcp.tools","method":"probe.mcp/1","observed_us":1793188386134843,"prev":null,"subject":"6cc3a0f6-b14b-4c8b-9984-eee9ddad46d2","subject_kind":"endpoint"}

Proof

Fold these into the leaf in order, hashing each sorted pair with keccak256, to reach the root of 2026-10-28 (231336 rows).

1. 0xe84e18e685b40fff1a7d3bcbf92d58c10e0888f06082f9ec7cb1238bd348238b
2. 0xb75735f775bcc23b84e1efa005c2a72721c8cc68cfd0df2b8604b7d6618e252a
3. 0x8e26fcef2d0c384dc4a3eec99013485251e042e1386a0fa75f3061f48fd99df6
4. 0xf1ea68109ca45baa7d0e7365c8801bb163c0d1300eedf982cd22b09b17e42e8f
5. 0x41eb3a2a11196c142be9ea3e029c69691ca961f26ad70fb747da34ff99c664ba
6. 0x7d2078b811eda3c20c51eb5ed93e771fc32ac5dfd4e753687ecd7898ad298487
7. 0x23f5fcb61a18994ec64f38474c58054e495475d375c2f8bc95bb14f59cc01440
8. 0x07c1c9c2d4cff1444dbc56035e99f95ca301677d570918b1afc98309101cd17e
9. 0xecad4fba0420969c463d061c7c3a74ff4a47a7043198c0f283d140c05622ee28
10. 0xc9f643b6555d823123a2e556704cf110e936cd23bd3de6ca1d8a1063138c6d34
11. 0xa5eddaf2bd61ccb4eaf970907a60f2a764548efc6dc3f0ce7f607c0b5ae50342
12. 0x72ae11d66db4afe4de2044c5b5b64f7a6bdd78106aca4858fb7d4a5e23c608a2
13. 0x93734b8bff0a016dec91589fbdfc90085588c9ce3a15ef260e78280dd1028c89
14. 0xf43a767076988041f743c8dc00db52511a090e0e09c248c9cac00d7742dbc563
15. 0x334629b51e7dfb2339fa4fd14202e288d70dbaccb3e5b04d2d5fb8f0d489ce5e
16. 0xef2ebd45f2cfd41dc3eb213cc4cc144c46b7e9ead2de0b9f627463bad16e3ec8
17. 0x67e9ff3e48c515135fcf3df2675aa4996d35d4a328ce41588ee1a7d93347c823
18. 0xe6cfe00ae4e02bc12327e45b5f3334ea5850ba3bcc8e3101d30a8189856a95af

Day root

0x2c19037464cc4c493624565f01775d6446fc78eaa118fc6865bfe2bfca9ff78e

Chained

0xd1d7dee8322ceff8f4c8d83aa1fe4a4466825c2af1c97dbde3d35db61234f7be

Published

On Arc Testnet, block 69584042: 0x8bae2b1d097834c8b458513862d70d29ee807e98dc2e863b27250131c15b35ae