addrbookFor publishers
← The evidence ledger

Evidence row 257433

Observed , by probe.mcp/1.

Kind
mcp.tools
About
endpoint d3153371-a12d-4e6c-8f4d-6715e6085e4e
Recorded
Previous row
None: the first of its kind about this subject
Body SHA-256
303c9c2b9a4558b6e431cb734e58864561235803b9fd9cde17db30200742c1b9
Leaf
0x52888a242b6c10bacd09b476862ea8d23f45d6d9bc3541e4715a9f97a6e142a0

What was observed

{
  "count": 4,
  "tools": [
    {
      "description": "Use when the user wants a domain name, is naming a business or project, or asks whether a domain is taken. Checks up to 20 full domain names (you can suggest variations and check them together) and returns whether each is available and its price.",
      "inputSchema": {
        "additionalProperties": false,
        "properties": {
          "domains": {
            "description": "Full domain names, e.g. [\"getrapp.ai\", \"getrapp.com\"]",
            "items": {
              "type": "string"
            },
            "maxItems": 20,
            "type": "array"
          }
        },
        "required": [
          "domains"
        ],
        "type": "object"
      },
      "name": "check_domain"
    },
    {
      "description": "Use when someone is naming a business, startup, product, brand, app, side hustle, shop, podcast or project. Brainstorm candidate names first, then check up to 8 at once: for each, which domains (.com, .co, .ai, .io, .app by default) are free with prices, and whether the GitHub name is free. Results are ranked, a free .com counts most. Suggest new candidates and check again if the best ones are taken.",
      "inputSchema": {
        "additionalProperties": false,
        "properties": {
          "endings": {
            "description": "Optional domain endings to check, e.g. [\"com\", \"shop\"]",
            "items": {
              "type": "string"
            },
            "maxItems": 5,
            "type": "array"
          },
          "names": {
            "description": "Candidate names, e.g. [\"Rise and Crumb\", \"Northwind Bakery\"]",
            "items": {
              "type": "string"
            },
            "maxItems": 8,
            "type": "array"
          }
        },
        "required": [
          "names"
        ],
        "type": "object"
      },
      "name": "check_names"
    },
    {
      "description": "Use when the user wants to buy an available domain. Explains how to register it: AI agents pay per call; people ask us and we register it for them. Nothing is bought by this tool.",
      "inputSchema": {
        "additionalProperties": false,
        "properties": {
          "domain": {
            "description": "The domain to register",
            "type": "string"
          }
        },
        "required": [
          "domain"
        ],
        "type": "object"
      },
      "name": "register_domain"
    },
    {
      "description": "Use when the person wants something none of these tools can do and says yes to passing the request on. Records only the request text they agree to send (no name or contact). Ask before calling it.",
      "inputSchema": {
        "additionalProperties": false,
        "properties": {
          "request": {
            "description": "What they want, in a sentence, as they agreed to send it",
            "type": "string"
          }
        },
        "required": [
          "request"
        ],
        "type": "object"
      },
      "name": "request_service"
    }
  ]
}

What the leaf hashes

{"body":"303c9c2b9a4558b6e431cb734e58864561235803b9fd9cde17db30200742c1b9","id":257433,"kind":"mcp.tools","method":"probe.mcp/1","observed_us":1793029744709000,"prev":null,"subject":"d3153371-a12d-4e6c-8f4d-6715e6085e4e","subject_kind":"endpoint"}

Proof

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

  1. 0x52884bee3ab49793d7df5e94642c3c06e979b6ba279803a3d98f4704b8c287cf
  2. 0xe0e6c994c8ddb0e6617e61d5f809159011f5aae9d8b8208be4f971c21bc19d67
  3. 0x52192b16bb7cf7c224d81cb84403e8798d13db19c5a7b1cec4eed4d50e653953
  4. 0xfd53b07765a9879511ebe8e93be00f01b3bb6ca3f24a02581a6085d683e57ae3
  5. 0x25746db06cfdc9461b9d5367fd5440622501ed7d0f6e25700dc9fcefb1f18f6d
  6. 0xdb7373feffca2025fcdf3aa0e12bed9b9d6da4e70d1afd31124471874fa0d1c7
  7. 0x88e6ba47118ea077fd1b6791b8f224e529532f84e53d51dc1b7415d23a2d297e
  8. 0x21c0ed66740821ddb62ccbe39bcaaa4277ae22f7eeb46b1328288a3320b8a536
  9. 0x3607751c77b1cabe074486d0fd53659a0e321fb7a8fd3bf133eaa6801af9c112
  10. 0xb8b1a249955b6487f765c3f074e474715f38edf3720c5c3ca9427be80aba6ea5
  11. 0x11ae5fc5d08fb7b25beace35e67656980e21edfc94e809110b5b9ecae306b6c8
  12. 0x94dd4ed7cf198df741ccda83eacc422aadb31119fc6e84c4a6d2f023453b7960
  13. 0xd830c52e1e8095e014510110592485afcb02b9c9a36f85653e4891a8de941246
  14. 0x0733993143f0230e79482cef2c38e95d98f9eafbe64a43cdc74a4545938a4167
  15. 0x2be1e80e065dd6b2cc75a7142be22225acd144ac975d70bf24b4f01fd76dc497
  16. 0x2e6a32eb32761c210560e852405e2f865f958ddbe01027894f8b9c1b3433b9f0
  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