addrbookFor publishers
← The evidence ledger

Evidence row 993370

Observed , by probe.mcp/1.

Kind
mcp.tools
About
endpoint 1d5cf535-e22f-4e66-aaf8-598e9f2d6253
Recorded
Previous row
None: the first of its kind about this subject
Body SHA-256
474945d66f26ffd8ae779ea2bee8523602241995ce49b8be22a5de2d8e668964
Leaf
0x27faf72608ba4b25aee774ac286739f2bb52e4832149132d76646950f340eca3

What was observed

{
  "count": 3,
  "tools": [
    {
      "description": "Apply a single-file unified diff (patch) to text and return the patched text, or applied:false if a hunk does not match. Optional fuzz 0-2.",
      "inputSchema": {
        "properties": {
          "fuzz": {
            "maximum": 2,
            "minimum": 0,
            "type": "integer"
          },
          "patch": {
            "description": "Unified diff with @@ hunks.",
            "type": "string"
          },
          "text": {
            "type": "string"
          }
        },
        "required": [
          "text",
          "patch"
        ],
        "type": "object"
      },
      "name": "apply_patch"
    },
    {
      "description": "Compare text a with text b by lines (default), words or chars. Returns ops (equal/insert/delete), a unified diff (lines mode), optional escaped HTML redline, stats and similarity. Deterministic diff (Myers algorithm via jsdiff), not an AI or semantic comparison. Limits per side: lines mode 64 KB and 1,000 lines, words mode 8 KB, chars mode 4 KB. If the texts need more than 250 inserted plus deleted units, the API returns 422 too_different instead of a partial diff. Patches up to 64 KB apply to text up to 64 KB. No 3-way merge, no binary files. Stateless: text is not stored or logged; no URL fetching.",
      "inputSchema": {
        "properties": {
          "a": {
            "description": "Original text.",
            "type": "string"
          },
          "b": {
            "description": "Changed text.",
            "type": "string"
          },
          "context": {
            "maximum": 20,
            "minimum": 0,
            "type": "integer"
          },
          "formats": {
            "items": {
              "enum": [
                "ops",
                "unified",
                "html"
              ],
              "type": "string"
            },
            "type": "array"
          },
          "ignore_case": {
            "type": "boolean"
          },
          "ignore_whitespace": {
            "description": "lines mode only",
            "type": "boolean"
          },
          "label_a": {
            "type": "string"
          },
          "label_b": {
            "type": "string"
          },
          "mode": {
            "enum": [
              "lines",
              "words",
              "chars"
            ],
            "type": "string"
          }
        },
        "required": [
          "a",
          "b"
        ],
        "type": "object"
      },
      "name": "diff_text"
    },
    {
      "description": "Similarity ratio 0-1 between two texts (2 x unchanged chars / total chars) on chars (default), words or lines granularity, plus change stats.",
      "inputSchema": {
        "properties": {
          "a": {
            "description": "Original text.",
            "type": "string"
          },
          "b": {
            "description": "Changed text.",
            "type": "string"
          },
          "ignore_case": {
            "type": "boolean"
          },
          "mode": {
            "enum": [
              "lines",
              "words",
              "chars"
            ],
            "type": "string"
          }
        },
        "required": [
          "a",
          "b"
        ],
        "type": "object"
      },
      "name": "text_similarity"
    }
  ]
}

What the leaf hashes

{"body":"474945d66f26ffd8ae779ea2bee8523602241995ce49b8be22a5de2d8e668964","id":993370,"kind":"mcp.tools","method":"probe.mcp/1","observed_us":1793247180577875,"prev":null,"subject":"1d5cf535-e22f-4e66-aaf8-598e9f2d6253","subject_kind":"endpoint"}

Proof

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

  1. 0x27fb474ff4f530026d558c542437e704f9db48533585d0347dd2c0ea719078b0
  2. 0xb3a79e14d4785777fa54f8ce4707072277f91787d32c9e59ab7ecdfbea70a61d
  3. 0xa4bab744dc4da3c1b210871b91a0143071ba8e20b9543507f1ee1f9bbe36472e
  4. 0x4f65a38cc85a248dba058ec9f16dce5449e2ecc85706fe37daa2371bdf5f676c
  5. 0xf4be50eac29860af4b8eab89628f342ce9d593b18c642ab226e24467633019ff
  6. 0x907e6dba793dbe99fbcb2af4d4402ea66566f976c67fcd9e607a9e3af27bb723
  7. 0xfc682d1d378c85a9df7912f3cc7bcec34daef027f6d015490acea5f912748b1a
  8. 0xd1a86c688718b68be81b50d3ea77a4b8915e455715f277e5c1ba828881e54d45
  9. 0xc07b5f6de54836ba6df53e5ddd1dde088e826f6a8e5ac3057c76de0ae67b0298
  10. 0x3c99ebd821c68c26de9cefe900d8d40c96349d587a9f85007b7544c0f76c0d8f
  11. 0x2faa12cb35a7f746704eeee08d99b0799c5b3a6c630dff1d49ff9bc05004aea5
  12. 0xf30da75fe0e12b1668c26a6b3d0bb8e0c311e494aa0f674a84e8a5c6af4ebeaa
  13. 0x0578ac51015c13b031ebae2ad1327fb530b3c3e756fcd27ad5aec34155ce2a69
  14. 0xe5630d765942d2009587828da7f2d173776eecb52114ac282f05c7b772bfe337
  15. 0x00268e62f7d5ca6313e0e60afdc2bd4f52c6dbdb3b4b4d27e01e634b4bcb1d2c
  16. 0x1c3764b490d23b94e5ac838c89f8d3850dedb0819196f367da2479c7a88bf2c0
  17. 0xd76435ead496863d8b0bfab3434f54cd11da3c49d104fc4064b9cb3381567bbd
  18. 0xd56e61af23709ed9f460471e3c08400c0142ee83e1fd9057e46350d12edf9c07
Day root
0xc050555c6b023f2aefb6536efb9f0760b92c30a0d06c572b7daf63db259ea17c
Chained
0x4cde8bae2042512e1bec11650628f0293556311cc4ea74d99ffddf02b671a7d6
Published
On Arc Testnet, block 69753317: 0x9e85c340732f416e431b111fae72f7624870125f7f379af2732eb6c2ba8cf6a1

How to check it · This row as JSON