addrbookFor publishers
← The evidence ledger

Evidence row 236596

Observed , by probe.mcp/1.

Kind
mcp.tools
About
endpoint 429b309e-44c0-4a7b-b215-6c111488f8ee
Recorded
Previous row
None: the first of its kind about this subject
Body SHA-256
21334cea9f8fc9e0bf608a1bc2a78c598c6e7d23bdc30ecb162c829c094af4d3
Leaf
0xececc6b487c8bfcd6bad28cd5ec3b9c570f6e6f3e875aee5fc46c8b1b40114d8

What was observed

{
  "count": 3,
  "tools": [
    {
      "description": "Full due-diligence report for one domain: registration age/expiry/status (live RDAP), backlinks & authority from our own Common Crawl link graph, toxic-linker audit, website history (Wayback), trademark search links, and optional blacklist when configured. Use before buying a domain. No composite appraisal score — flags + per-section detail only.",
      "inputSchema": {
        "properties": {
          "domain": {
            "description": "Domain to check, e.g. 'example.com'.",
            "type": "string"
          }
        },
        "required": [
          "domain"
        ],
        "type": "object"
      },
      "name": "check_domain"
    },
    {
      "description": "Generate brandable .com domain names for a business idea and return ONLY the ones that are currently AVAILABLE to register (checked against the Verisign RDAP registry through a caching proxy; an available answer can be up to 10 minutes old). Give a keyword and, ideally, a short description of the business for better names.",
      "inputSchema": {
        "properties": {
          "count": {
            "description": "How many names to return (1-24). Default 12.",
            "maximum": 24,
            "minimum": 1,
            "type": "integer"
          },
          "description": {
            "description": "Optional. What the business does, e.g. 'a cozy late-night coffee roaster'.",
            "type": "string"
          },
          "keyword": {
            "description": "Core keyword or seed word, e.g. 'coffee'.",
            "type": "string"
          }
        },
        "required": [
          "keyword"
        ],
        "type": "object"
      },
      "name": "find_available_domains"
    },
    {
      "description": "Exhaustively enumerate EVERY available domain matching a keyword PATTERN, across TLDs — the thing most domain tools/MCPs can't do. Give a keyword (or several) and a position: 'starts' (keyword+word, e.g. Bearoak), 'ends' (word+keyword, e.g. Oakbear), 'contains' (keyword inside a longer invented word, e.g. Oakbearen), or 'all'. Every candidate is checked against the registry (cached answers up to 10 minutes old); only AVAILABLE domains are returned, grouped by TLD. Checks .com and .net by default.",
      "inputSchema": {
        "properties": {
          "keyword": {
            "description": "Keyword(s) to build around, e.g. 'bear' or 'bear, bigbear' (comma/or-separated for several).",
            "type": "string"
          },
          "limit": {
            "description": "Max available domains to return (1-200). Default 60.",
            "maximum": 200,
            "minimum": 1,
            "type": "integer"
          },
          "position": {
            "description": "Where the keyword sits: starts-with, ends-with, contains, or all. Default 'all'.",
            "enum": [
              "starts",
              "ends",
              "contains",
              "all"
            ],
            "type": "string"
          },
          "tlds": {
            "description": "Which TLDs to enumerate (up to 6, any real TLD: com, net, org, io, ai, co, app, dev, xyz, store, shop, tech, blog, me, de, uk...). Default ['com','net'].",
            "items": {
              "type": "string"
            },
            "maxItems": 6,
            "type": "array"
          }
        },
        "required": [
          "keyword"
        ],
        "type": "object"
      },
      "name": "find_available_domains_by_pattern"
    }
  ]
}

What the leaf hashes

{"body":"21334cea9f8fc9e0bf608a1bc2a78c598c6e7d23bdc30ecb162c829c094af4d3","id":236596,"kind":"mcp.tools","method":"probe.mcp/1","observed_us":1793028871612805,"prev":null,"subject":"429b309e-44c0-4a7b-b215-6c111488f8ee","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. 0xecece24c7e2d04b62e1acb68373ed1a622f8e07a3e2b93892933c5f4e40ab39d
  2. 0x9286dbd1c1a4b782166a01408bbf1c36b86f506340151fb41fe4bc6084167a7f
  3. 0xe04208dcc7258f724f5bf384074e737c958e46ab21a5230e4e4540ad11f31d45
  4. 0x1f1ba70c5a4d83fc5988e8a4f05f0a09e101f22eb0bf460cf9abc0c634f7351f
  5. 0x723a9a5f48dc548befe748aa8a4762626d47efa22c8e68c3a45553642f1b91b2
  6. 0xba25a2b6e87219bd6217d85d6ae203d1cca1d987078cc7b6e455d26deac5d041
  7. 0xb29a95e6bece497b0303f9790a62d925c5ba2f243c855cb5ba24f3a11ca09adb
  8. 0x0c70abb3af5ff53ba6886b632aba2668d90949e1976959b7d62e74c62ee518b7
  9. 0x8c91c245df8c0f29a1f183f723aa393ea8ddb939bda6e40565b124a1cfbfff4e
  10. 0xf333b1fb4291fc66aba3c2430863d37b43610cc7bcfcad50c56770f5a796facc
  11. 0x3f07a2115848067024e2992cb2c05a86eb8d02df5abfcead8bc47854e501603e
  12. 0xe158f09cdbfb4f7be1bfd45fce3afcad32c2b3bb2fc2e181dadc193bbf194bfc
  13. 0x746e9e5b6765727b6b96f41204cc115b0302259f6c67be0cf0efbf245601d500
  14. 0x614d844c9e0509d9f9e63697aa2935555bce5f13695a8dc0047aa9e9898d70b3
  15. 0x95657a7d540ed6cac0bde9995782333b2562a9a6641853269ac95148827410f0
  16. 0x5fb5dda563336cd1bc1b9f44c52b76237ae72ed2145cb9290f39f304ca7dd678
  17. 0x74a0a08e4e7ab9aa5bfbead33dec7e1c7e8e364cff69a63720d764bbe987aadc
Day root
0xf43e8dcc3d451a4788b26be904c55e8c4c0fa75c9666796c51db38d37e2c0df8
Chained
0x702d5ac508f08b0d1accf36af25822d8e5660367494edd17a642fb61e158a57a
Published
On Arc Testnet, block 69251483: 0x495162f8936e19f0039918feebe6c307f327cd6bf8c37219620b1970041fa9ae

How to check it · This row as JSON