Verify AI-agent revenue: recompute a Merkle proof and check it against an on-chain anchor.
Maintain this server? Claim it
Call this server's tools from your browser. Nothing to install.
Requests go through mcptry because browsers can't call most MCP servers directly. Header values are sent to the server for that request only and are never stored or logged.
Tool list from our last check. Connect live to refresh it.
Fetch Dokimo's public A2A agent card — the discovery document describing what it can verify (skills, endpoints, supported A2A versions).
This tool takes no arguments.
Fetch Dokimo's public A2A agent card — the discovery document describing what it can verify (skills, endpoints, supported A2A versions).
No arguments.
{
"type": "object",
"title": "dokimo_agent_cardArguments",
"properties": {}
}Trustlessly recompute a dokimo-merkle-v1 root — LOCAL, no network, no trust. Hash ``leaf`` in the leaf domain (H(0x00 ‖ leaf)) and replay ``proof_path`` — a list of ``[sibling_hash, side]`` where side is "L" or "R" — hashing internal nodes as H(0x01 ‖ left ‖ right). Compare the returned root to the ``root`` in an evidence package yourself; if it differs, the package was tampered with. Returns ``{recomputed_root, merkle_scheme, steps}``.
| Argument | Type | Description |
|---|---|---|
| leaf* | string | The raw leaf value (e.g. a JSON string like '{"k":"total_assets","v":"..."}'). Hashed in the leaf domain as H(0x00 ‖ leaf). |
| proof_path* | array | Ordered Merkle proof path: a list of [sibling_hash_hex, side] pairs, where side is "L" if the sibling is on the left or "R" if on the right. Empty list for a single-leaf tree. |
{
"type": "object",
"title": "recompute_merkle_rootArguments",
"required": [
"leaf",
"proof_path"
],
"properties": {
"leaf": {
"type": "string",
"title": "Leaf",
"description": "The raw leaf value (e.g. a JSON string like '{\"k\":\"total_assets\",\"v\":\"...\"}'). Hashed in the leaf domain as H(0x00 ‖ leaf)."
},
"proof_path": {
"type": "array",
"items": {},
"title": "Proof Path",
"description": "Ordered Merkle proof path: a list of [sibling_hash_hex, side] pairs, where side is \"L\" if the sibling is on the left or \"R\" if on the right. Empty list for a single-leaf tree."
}
}
}Fully verify a Dokimo evidence package against the LIVE on-chain anchor. Sends the package to Dokimo's public A2A endpoint, which recomputes the Merkle proof AND checks the compound commitment (root + rule version) against the anchor on Base. ``package`` must contain: ``leaf`` (str), ``root`` (str), ``proof_path`` (list of [sibling_hash, "L"|"R"]), and ``rule_version_commitment`` (str); ``close_id`` is optional/echoed. Returns the verdict: ``{verified, checks:{recompute, onchain_anchor, rule_version_bound}, ...}``. ``verified`` is true only if the proof recomputes AND the commitment is anchored on-chain.
| Argument | Type | Description |
|---|---|---|
| package* | object | The Dokimo evidence package to verify. Required keys: 'leaf' (str), 'root' (str), 'proof_path' (list of [sibling_hash, "L"|"R"]), and 'rule_version_commitment' (str). 'close_id' (str) is optional and echoed back. |
{
"type": "object",
"title": "verify_evidence_packageArguments",
"required": [
"package"
],
"properties": {
"package": {
"type": "object",
"title": "Package",
"description": "The Dokimo evidence package to verify. Required keys: 'leaf' (str), 'root' (str), 'proof_path' (list of [sibling_hash, \"L\"|\"R\"]), and 'rule_version_commitment' (str). 'close_id' (str) is optional and echoed back.",
"additionalProperties": true
}
}
}