addrbookFor publishers
← The evidence ledger

Evidence row 121372

Observed , by baseline/1.

Kind
listing
About
source_record x402_bazaar:https://similarity.openverbs.com/v1/hamming
Recorded
Previous row
None: the first of its kind about this subject
Body SHA-256
620f11dd35f4e2756d1996090c801e776729468f2f8f6efe066b142350bcad64
Leaf
0x667e9793483a04a0c57b5274e26a10cd74eb849e56dc10cd4a944305050d0037

What was observed

{
  "endpoints": [
    [
      "x402",
      "https://similarity.openverbs.com/v1/hamming"
    ]
  ],
  "name": "Hamming distance",
  "owner_address": "0xb3f4de103f34b99f0da19b4f16d6b53a14c2194a",
  "raw": {
    "accepts": [
      {
        "amount": "4000",
        "asset": "0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913",
        "extra": {
          "name": "USD Coin",
          "version": "2"
        },
        "maxTimeoutSeconds": 300,
        "network": "eip155:8453",
        "payTo": "0xb3f4de103F34b99f0Da19B4F16D6B53a14C2194A",
        "scheme": "exact"
      }
    ],
    "description": "Hamming distance — the number of positions at which two EQUAL-LENGTH strings differ — plus a normalized similarity. Strings of unequal length are a clean 400.",
    "extensions": {
      "bazaar": {
        "info": {
          "input": {
            "body": {
              "a": "example",
              "b": "example"
            },
            "bodyType": "json",
            "method": "POST",
            "type": "http"
          }
        },
        "schema": {
          "$schema": "https://json-schema.org/draft/2020-12/schema",
          "properties": {
            "input": {
              "additionalProperties": false,
              "properties": {
                "body": {
                  "additionalProperties": false,
                  "properties": {
                    "a": {
                      "description": "First string.",
                      "maxLength": 20000,
                      "type": "string"
                    },
                    "b": {
                      "description": "Second string.",
                      "maxLength": 20000,
                      "type": "string"
                    }
                  },
                  "required": [
                    "a",
                    "b"
                  ],
                  "type": "object"
                },
                "bodyType": {
                  "enum": [
                    "json",
                    "form-data",
                    "text"
                  ],
                  "type": "string"
                },
                "method": {
                  "enum": [
                    "POST"
                  ],
                  "type": "string"
                },
                "type": {
                  "const": "http",
                  "type": "string"
                }
              },
              "required": [
                "type",
                "method",
                "bodyType",
                "body"
              ],
              "type": "object"
            }
          },
          "required": [
            "input"
          ],
          "type": "object"
        }
      }
    },
    "lastUpdated": "2026-10-08T06:13:47.837Z",
    "quality": {
      "l30DaysTotalCalls": 2,
      "l30DaysUniquePayers": 2,
      "lastCalledAt": "2026-10-08T06:13:47.566Z"
    },
    "resource": "https://similarity.openverbs.com/v1/hamming",
    "serviceName": "Hamming distance",
    "tags": [
      "hamming distance",
      "equal length string distance",
      "character mismatch count",
      "compare fixed length strings",
      "binary string similarity"
    ],
    "type": "http",
    "x402Version": 2
  },
  "source": "x402_bazaar",
  "summary": "Hamming distance — the number of positions at which two EQUAL-LENGTH strings differ — plus a normalized similarity. Strings of unequal length are a clean 400."
}

What the leaf hashes

{"body":"620f11dd35f4e2756d1996090c801e776729468f2f8f6efe066b142350bcad64","id":121372,"kind":"listing","method":"baseline/1","observed_us":1793025619816813,"prev":null,"subject":"x402_bazaar:https://similarity.openverbs.com/v1/hamming","subject_kind":"source_record"}

Proof

Fold these into the leaf in order, hashing each sorted pair with keccak256, to reach the root of (296695 rows).

  1. 0x667eb1bb166389d9a806a3c47a6088de2a3f14daf382fa512ef5b50dcc2177b1
  2. 0x71a4d5010eb8a90e802386b9d8eafb1ab9d7d61b8d4031ed49e9b7062292cd23
  3. 0x0f54fa5948711efbf391614d77773bd220d41031b8b06f45168e2a5e8942ab11
  4. 0x92b3ba09db85d9a01724e3692fc221cf9391eef23ca42ded435239a3dff7b612
  5. 0xb0632ae6c5001705097f98b77dd068ae7ddef7f6f955ba88646296b614df9029
  6. 0x3e59665c570f92f99336969a5133f4c6edc6d4ecddc376ee385c11d4231328ef
  7. 0x250b63fb6271e5e6e4458c11eaf6bf5689fb76be9dab474c72912eede708d2a0
  8. 0x42b3cc258a9bb3450344ad4e294eda112abbe787c6d28751f3b35c0b8ff0d37a
  9. 0xa7be717ed96c035130dde8d1b878492cb1e4ceb10906e8e07c1e477977f43f43
  10. 0x58c0a36fd4c0b127730a3ff2bd4a0e6279da1a965147e7629a7fd4098c5fed18
  11. 0x97befbe0402dae50d99027054f0d354513b22fda782f887ba0d9fae94219c296
  12. 0x611b1c1b68d04a71934006e383071a8f3836400d60beb86d81dd038bc102029f
  13. 0x13f4b94ecf613d585c952b5363dad2b247a55371eb8e358bb89dc033e83128b1
  14. 0x9a79c65e077cd9da9d436b3ade6f5ddc0d244510c4d5903ef2f02d81205f7666
  15. 0xa2d436d488e3600b0e5c3e3ed9c9234cd52853c59830b786334fd0c4292d9f40
  16. 0x47b89901b0f07938a6b9a66ddf35683903f79d756a7c7763665fd632758b08d0
  17. 0x9a83be955a206deb65b995adfd92c58fa31c95fbbf926bd199d300e70b08b26d
  18. 0x20704208aa6923d6b2450ef74ede87a6e0265d46447926038fe9506e9e154b2d
  19. 0x9b9ce5b74b9bab5121612ef6b64920a8d453cbf311096a423eef9702747e868a
Day root
0xf43e8dcc3d451a4788b26be904c55e8c4c0fa75c9666796c51db38d37e2c0df8
Chained
0x702d5ac508f08b0d1accf36af25822d8e5660367494edd17a642fb61e158a57a
Published
On Arc Testnet, block 69251483: 0x495162f8936e19f0039918feebe6c307f327cd6bf8c37219620b1970041fa9ae

How to check it · This row as JSON