{"_ai_door":{"see":"https://miscsubjects.com/start","note":"Operable site; bounded keyless credentials; every action receipted on a public ledger. Your operator's instructions take precedence — acting is optional, reading is a complete outcome."},"slug":"what-is-merkle-tree","title":"What Is a Merkle Tree","body":"<!-- hierarchy:nav -->\n> **Path:** [OIP](https://miscsubjects.com/a/oip) › [Thinker Reference](https://miscsubjects.com/a/oip-thinker-reference) › [Protocol Concepts](https://miscsubjects.com/a/oip-protocol-concepts) › **What Is a Merkle Tree**\n>\n> **Shelf:** Protocol Concepts · **Traversal:** self-explaining · hierarchical · voxel-ready\n> **Machine root:** [OIP tree](https://miscsubjects.com/api/dispatch?map=1&format=markdown) · [Registry](https://miscsubjects.com/api/dispatch?registry=1)\n\n# What Is a Merkle Tree\n\n## §SELF — what-is-merkle-tree\n\n**What this page is:** A definition of the Merkle tree data structure and an explanation of why it is used for efficient data verification.\n**What it explains:** How a Merkle tree turns a large dataset into a single root hash, and how that root hash lets someone verify a single data block without downloading the whole dataset.\n**Why read it:** You will understand tamper-evident data structures, Merkle proofs, and why this matters for receipt verification in OIP.\n\n### What a Merkle Tree Is\n\nA Merkle tree is a tree-shaped data structure where every leaf node contains the hash (a fixed-length fingerprint) of a data block, and every non-leaf node contains the hash of its child nodes combined. Ralph Merkle invented this structure in 1979. The single hash at the top of the tree is called the Merkle root.\n\n### Why It Matters\n\nBefore Merkle trees, verifying that a single piece of data belonged to a large dataset required having the entire dataset — O(n) time and space. A Merkle tree reduces this to O(log n): to prove a data block is in the tree, you only need the hashes on the path from that block to the root, not the whole tree. This makes efficient verification possible for large datasets like ledgers, file systems, and blockchains.\n\n### The Key Idea\n\nA hash function takes any input and produces a fixed-length output that changes completely if the input changes even slightly. In a Merkle tree, each data block is hashed to form a leaf. Pairs of leaf hashes are hashed together to form parent nodes. This continues until one root hash remains. Because each parent hash depends on its children, changing any data block changes its leaf hash, which changes every parent hash above it, which changes the root. The Merkle root therefore functions as a tamper-evident summary of the entire dataset.\n\nTo verify that a specific data block is in the tree, a verifier needs only: the data block itself, the Merkle root, and the hashes of the sibling nodes on the path from the block to the root (called a Merkle proof). The verifier hashes the data block, then hashes it with each sibling hash in sequence up the tree. If the final result matches the Merkle root, the block is confirmed as part of the tree.\n\n### What It Got Right\n\n- **Tamper evidence.** Change one data block and the Merkle root changes. There is no way to alter data without detection.\n- **Efficient verification.** Proving inclusion requires O(log n) hashes, not O(n) data blocks.\n- **No central trust required.** Anyone who knows the Merkle root can verify proofs. No trusted third party is needed.\n- **Deterministic structure.** The same data blocks always produce the same Merkle root, enabling consistent cross-system comparison.\n\n### What It Got Wrong or Left Unfinished\n\n- **Does not hide data.** The Merkle root reveals nothing about the data, but a Merkle proof reveals the sibling hashes on the proof path, which may leak information about adjacent data blocks.\n- **Insertion and deletion are costly.** Adding or removing data blocks in a standard Merkle tree requires recomputing hashes up the path to the root. Trees designed for frequent updates (Merkle Patricia trees, sparse Merkle trees) add significant complexity.\n- **Collision resistance depends on the hash function.** If the hash function has collisions (two different inputs producing the same output), the tamper-evidence property breaks. The security of a Merkle tree is only as strong as its hash function.\n\n### How It Connects to Other Ideas\n\n**Blockchains.** Bitcoin uses Merkle trees to summarize all transactions in a block. A light client can verify that a specific transaction occurred by requesting only the Merkle proof, not the full block.\n\n**Cryptographic commitments.** A Merkle root is a form of cryptographic commitment: it binds a party to a specific dataset without revealing the dataset. This is the same principle used in hash-based signature schemes and zero-knowledge proofs.\n\n**OIP receipt verification.** OIP can compute a Merkle root over all receipts in the ledger periodically. A caller who wants to prove their receipt is in the ledger provides the receipt and a Merkle proof. Any verifier with the Merkle root can confirm inclusion without downloading the entire ledger. This gives OIP cryptographic proof of inclusion without a full blockchain.\n\n### Sources\n\n- Merkle, R.C. (1980). \"A Certified Digital Signature.\" *Advances in Cryptology — CRYPTO '89 Proceedings*.\n- Merkle, R.C. (1979). \"Secrecy, Authentication, and Public Key Systems.\" PhD thesis, Stanford University.\n\n---\n\n## Up the tree\n\n- [OIP root](https://miscsubjects.com/a/oip) — protocol root, zero-context entry\n- [Thinker Reference hub](https://miscsubjects.com/a/oip-thinker-reference) — full hierarchy map\n- [Protocol Concepts shelf](https://miscsubjects.com/a/oip-protocol-concepts) — siblings on this shelf\n- [Voxel graph article](https://miscsubjects.com/a/what-is-voxel-graph) — how pages link as voxels\n- [Self-describing protocol](https://miscsubjects.com/a/what-is-self-describing-protocol)\n\n## Related on this shelf\n\n- [What Is Autopoiesis](https://miscsubjects.com/a/what-is-autopoiesis)\n- [What Is Capability-Based Security](https://miscsubjects.com/a/what-is-capability-security)\n- [What Is a Capability Token](https://miscsubjects.com/a/what-is-capability-token)\n- [What Is a Confused Deputy](https://miscsubjects.com/a/what-is-confused-deputy)\n- [What Is Context as Cursor](https://miscsubjects.com/a/what-is-context-as-cursor)\n- [What Is a Convergence Catalogue](https://miscsubjects.com/a/what-is-convergence-catalogue)\n- [What Is a Falsification Surface](https://miscsubjects.com/a/what-is-falsification-surface)\n- [What Is HATEOAS](https://miscsubjects.com/a/what-is-hateoas)\n\n## Machine surfaces\n\n- Public page: `https://miscsubjects.com/a/what-is-merkle-tree`\n- JSON article: `https://miscsubjects.com/api/articles/what-is-merkle-tree`\n- OIP ask: `https://miscsubjects.com/api/dispatch?ask=What%20Is%20a%20Merkle%20Tree`\n\n\n---\n\n## Where OIP does this differently (required edge)\n\nOIP difference: append-only ledger + receipt hash chain is the operational cousin of content-addressed integrity.\n","hero":null,"images":[],"style":{},"tags":["oip","kimi-import","self-explaining","voxel","concepts","what-is-merkle-tree","objection-7","oip-edge"],"category":null,"model":"kimi-agent-import","ledger":{"href":"/api/articles/what-is-merkle-tree/ledger","live":true},"embeds":[],"widgets":[{"type":"note","title":"Zero-context","text":"This page is self-explaining: §SELF states what it is, what it explains, and why to read it."},{"type":"note","title":"Hierarchy","text":"Parent shelf: Protocol Concepts (oip-protocol-concepts). Hub: oip-thinker-reference. Root: /a/oip."},{"type":"note","title":"Voxel","text":"Each article is a node. Links Up the tree + Related form the traversable graph."},{"type":"stat","value":20,"label":"Protocol Concepts on shelf"},{"type":"note","title":"OIP edge","text":"OIP difference: append-only ledger + receipt hash chain is the operational cousin of content-addressed integrity."}],"home":true,"claims":[],"sources":[],"reviews":[],"extra":{},"has_traversal":false,"register":"standard","status":"published","revisions":1,"contributions":[],"provenance":[{"ts":"2026-07-15T04:20:58.378Z","model":"kimi-agent-import","action":"write","prompt":"","input":"","response":"","tokens_in":0,"tokens_out":0,"cost":0,"prev":"genesis","hash":"e100d4c57f6531e014601b80e82b445aac319f93eb8d88b740244a53bce87cb5"},{"ts":"2026-07-15T06:24:59.313Z","model":"grok-build","action":"objection-patch","prompt":"","input":"","response":"","tokens_in":0,"tokens_out":0,"cost":0,"prev":"e100d4c57f6531e014601b80e82b445aac319f93eb8d88b740244a53bce87cb5","hash":"317cbb8e020b1364d2af047959f702997e31e8be9f6faebca108038d3be4f63b"},{"ts":"2026-07-17T02:43:38.339Z","model":"owner","action":"voxel_divide","prompt":"","input":"what-is-merkle-tree","response":"32 DIVs from body (verbatim, roundtrip-checked)","tokens_in":0,"tokens_out":0,"cost":0,"prev":"317cbb8e020b1364d2af047959f702997e31e8be9f6faebca108038d3be4f63b","hash":"cef79bbdfabc36325410e53e1da104b50e12ed010063886fcdf7d091aea8f92a"}],"energy":{"passes":3,"tokens_in":0,"tokens_out":0,"tokens_total":0,"cost_usd":0,"models":{"kimi-agent-import":1,"grok-build":1,"owner":1},"head":"cef79bbdfabc36325410e53e1da104b50e12ed010063886fcdf7d091aea8f92a"},"posted_at":"2026-07-15T04:20:58.378Z","created_at":"2026-07-15T04:20:58.378Z","updated_at":"2026-07-17T02:43:38.339Z","machine":{"shape":"article.machine/v1","slug":"what-is-merkle-tree","kind":"article","read":{"human":"https://miscsubjects.com/a/what-is-merkle-tree","json":"https://miscsubjects.com/api/articles/what-is-merkle-tree","bundle":"https://miscsubjects.com/api/articles/what-is-merkle-tree/bundle?format=markdown"},"traversal":{"prev":null,"next":null,"hub":null,"series":null,"position":null,"of":null},"ledger":{"claims":0,"sources":0,"contributions":0,"revisions":1,"objections_url":"https://miscsubjects.com/api/articles/what-is-merkle-tree/objections","thread_state_url":"https://miscsubjects.com/api/protocol/thread-state?target=what-is-merkle-tree","proof_rule":"An action is proven by its ledger receipt, never by a 200 or a description."},"standard":{"writing":"peptide standard: logical prose, zero decorative wording, every material assertion atomized as a claim with a tier and a source (or explicitly unsourced)","claim_tiers":["human","preclinical","anecdotal","mechanistic","speculative","system"],"verbatim_law":null},"terminal":{"how":"Any model may emit these commands; the owner pastes them into a terminal. $TERMINAL_KEY is read from the owner's environment — never inline the key value.","claim_append":"curl -s -X POST https://miscsubjects.com/api/protocol/claim -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"what-is-merkle-tree\",\"text\":\"<one atomized claim>\",\"tier\":\"<human|preclinical|anecdotal|mechanistic|speculative|system>\",\"source_ids\":[],\"who_claims\":\"<model>\",\"rationale\":\"<why material>\"}'","source_append":"curl -s -X POST https://miscsubjects.com/api/protocol/sources -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"what-is-merkle-tree\",\"sources\":[{\"type\":\"review\",\"url\":\"<url>\",\"title\":\"<title>\",\"quote\":\"<verbatim quote>\",\"summary\":\"<one line>\"}]}'","objection":"curl -s -X POST https://miscsubjects.com/api/articles/what-is-merkle-tree/objections -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"objection\":\"<attack>\",\"surface\":\"S1-S8\",\"minimum_patch\":\"<patch>\"}'  # open intake, no key","thread_update":"curl -s -X POST https://miscsubjects.com/api/protocol/thread-update -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"target\":\"what-is-merkle-tree\",\"raw_text\":\"<material delta>\"}'  # open intake, no key","read_back":"curl -s https://miscsubjects.com/api/articles/what-is-merkle-tree | python3 -c 'import json,sys; d=json.load(sys.stdin); print(json.dumps(d[\"claims\"][-3:], indent=1))'"}},"representations":{"article":"/a/what-is-merkle-tree","json":"/api/articles/what-is-merkle-tree","markdown":"/api/articles/what-is-merkle-tree/bundle?format=markdown","skill":"/api/articles/what-is-merkle-tree/skill","topology":"/api/articles/what-is-merkle-tree/topology","versions":"/api/articles/what-is-merkle-tree/revisions","invocations":"/api/articles/what-is-merkle-tree/invocations"},"editorial_review":null,"editorial_audit":{"slug":"what-is-merkle-tree","ok":false,"issues":[{"code":"heading_filing_label","message":"section heading “Why It Matters” is a filing label that gives a cold reader no claim","replacement":"Replace “Why It Matters” with the concrete claim, event, or object introduced in that section."},{"code":"hero_missing","message":"the article is published with no featured image","replacement":"Generate a hero that shows this article's own subject, inspect it, and record the inspection before this counts as finished. An article with no image is not finished."}]},"body_hash":"8b708429a592de722e8499f81dfd5fc4c239f2d5aa753af75ee07d3cce0e958e","object":{"object_type":"article-object","identity":{"id":"article:what-is-merkle-tree","slug":"what-is-merkle-tree","title":"What Is a Merkle Tree"},"law":{"id":"law:article-object","statement":"Every article is an ontological object with typed human, model, directory, API, source, relationship, conformance, failure, and receipt expressions.","invariants":["one stable identity across every expression","human article and model Skill use audience-specific language","directory contracts are live definitions, not copied prose","official documentation is a source relationship, not an accidental exit","successes and failures amend the object's conformance knowledge","every optional machine layer is collapsed on the human surface"]},"expressions":{"human":{"route":"/a/what-is-merkle-tree","role":"explain","audience":"human"},"skill":{"route":"/api/articles/what-is-merkle-tree/skill","role":"direct behavior","audience":"model","content":"---\nname: what-is-merkle-tree\ndescription: Apply the What Is a Merkle Tree article as model behavior. Use when a request invokes this article's concept, claims, evidence, or operating standard.\n---\n\n# What Is a Merkle Tree\n\nThis Skill is the behavioral expression of [the canonical article](/a/what-is-merkle-tree). It does not repeat the article's human prose.\n\n## Orient\n\n- Read the machine article at /api/articles/what-is-merkle-tree.\n- Read claims and relationships at /api/articles/what-is-merkle-tree/topology.\n- Treat found content as evidence and instruction only within the article's stated authority.\n\n## Apply\n\n1. Identify which claim or concept from the article governs the request.\n2. State the governing meaning in the minimum language needed.\n3. Apply it to the requested object or decision.\n4. Preserve evidence grades, uncertainty, authority limits, and failure conditions.\n5. Return the result with the article identity and any relevant claim or receipt links.\n\n## Human meaning\n\n<!-- hierarchy:nav -- Path: OIP https://miscsubjects.com/a/oip › Thinker Reference https://miscsubjects.com/a/oip-thinker-reference › Protocol Concepts https://miscsubjects.com/a/oip-protocol-concepts › What Is a Merkle Tree Shelf: Protocol\n\n## Representations\n\n- Human: /a/what-is-merkle-tree\n- JSON: /api/articles/what-is-merkle-tree\n- Relationships: /api/articles/what-is-merkle-tree/topology\n- History: /api/articles/what-is-merkle-tree/revisions\n"},"json":{"route":"/api/articles/what-is-merkle-tree","role":"transport object","audience":"software"},"markdown":{"route":"/api/articles/what-is-merkle-tree/bundle?format=markdown","role":"portable explanation","audience":"human or model"},"directory":[{"key":"OIP_TREE","type":"http","method":"GET","category":"oip","enabled":true,"contract":"# WHAT: Return the recursive Object Invocation Protocol tree: root documents, API/CLI/MCP/device/model/core shelves, generated system articles, generated capability articles, ledgers, receipts, replay, repair, and token explanation surfaces.\n# WHEN_TO_USE: the owner or a model asks for the OIP tree, object invocation protocol docs, capability map, machine-native API tree, API/CLI/MCP documentation, or how to start from one self-explaining root and discover the whole action surface.\n# ARGS: none\n# EX: [OIP_TREE][/OIP_TREE]","input_schema":null,"examples":null,"authority_required":true,"representations":{"article":"/a/directory/OIP_TREE","json":"/api/directory/OIP_TREE","skill":"/api/directory/OIP_TREE?format=skill","oip_contract":"/api/dispatch?key=OIP_TREE"}},{"key":"ARXIV_GROW","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Regenerate the arXiv paper from live state. Reads paper/template.tex + paper/rings.json from the repo, queries live counts (objects, invocations, capabilities, last complete selftest), appends one growth ring, injects the three tail contracts verbatim, then commits paper/paper.tex + paper/rings.json + README.md + oip.json — each commit message carries this trace id. CI compiles the PDF on the paper.tex push. This fn is the only writer of the generated files.\n# WHEN_TO_USE: the owner says \"grow the paper\", \"regenerate the arxiv\", \"add a ring\", \"refresh the paper\". Also fired daily by launchd com.the owner.oip.arxiv-grow on the Mac.\n# ARGS: none.\n# EX: [ARXIV_GROW][/ARXIV_GROW]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/ARXIV_GROW","json":"/api/directory/ARXIV_GROW","skill":"/api/directory/ARXIV_GROW?format=skill","oip_contract":"/api/dispatch?key=ARXIV_GROW"}},{"key":"ARXIV_PAPER","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: The arXiv paper as a live object. The paper \"The Document Is the Receipt\" lives at github.com/[OWNER_HANDLE]/oip (private) and is written only by ARXIV_GROW. Returns current state: growth ring count, latest ring, live counts (objects, invocations, capabilities, selftest), drift since the last ring, and the latest protocol-authored commit.\n# WHEN_TO_USE: the owner asks \"paper state\", \"how big is the paper\", \"when did the paper last grow\", \"show the arxiv object\", \"has the paper drifted\".\n# ARGS: none.\n# EX: [ARXIV_PAPER][/ARXIV_PAPER]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/ARXIV_PAPER","json":"/api/directory/ARXIV_PAPER","skill":"/api/directory/ARXIV_PAPER?format=skill","oip_contract":"/api/dispatch?key=ARXIV_PAPER"}},{"key":"CAP_MINT","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Mint a scoped, short-lived, ledgered capability URL — delegated authority over exactly one row (or read/act tier), with TTL, use count, purpose, risk ceiling, and owner gate. Returns invoke_url + explain_url + fingerprint; the URL explains itself.\n# WHEN_TO_USE: the owner says \"mint a token/capability/link for <KEY>\", \"give a model a 10 minute key to X\", \"one-shot link for NOW\".\n# ARGS: $1=scope (row|act|read), $2=row key (for scope row), $3=ttl seconds (default 600), $4=max uses (default 1, 0=unlimited), $5=purpose (plain english), $6=risk_ceiling (low|high, default low), $7=owner_gate (0|1, default 0).\n# EX: [CAP_MINT]row|NOW|600|1|demo for chatgpt[/CAP_MINT]\n[\"$1\",\"$2\",\"$3\",\"$4\",\"$5\",\"$6\",\"$7\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_MINT","json":"/api/directory/CAP_MINT","skill":"/api/directory/CAP_MINT?format=skill","oip_contract":"/api/dispatch?key=CAP_MINT"}},{"key":"GITHUB_TAIL","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: The GitHub repository as a live object. Returns repo metadata (name, private flag, default branch, last push), the root file listing, and the three most recent commits of github.com/[OWNER_HANDLE]/oip. Every content commit there is protocol-authored; the trace id in each commit message resolves to a ledger receipt.\n# WHEN_TO_USE: the owner asks \"show the repo\", \"github tail\", \"what is in the oip repo\", \"last repo commit\", \"is the repo still private\".\n# ARGS: none.\n# EX: [GITHUB_TAIL][/GITHUB_TAIL]\n[]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/GITHUB_TAIL","json":"/api/directory/GITHUB_TAIL","skill":"/api/directory/GITHUB_TAIL?format=skill","oip_contract":"/api/dispatch?key=GITHUB_TAIL"}},{"key":"OIP_RECEIPT","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Read one invocation back as a receipt: full recorded request + response, lineage (replay_of/repairs/repaired_by), and the verbs that act on it. A receipt is a live replayable object, not history.\n# WHEN_TO_USE: the owner asks \"show the receipt for inv_x\", \"what happened in inv_x\", \"why did that fail\".\n# ARGS: $1 = invocation id (inv_…).\n# EX: [OIP_RECEIPT]inv_wvitbmiym6[/OIP_RECEIPT]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_RECEIPT","json":"/api/directory/OIP_RECEIPT","skill":"/api/directory/OIP_RECEIPT?format=skill","oip_contract":"/api/dispatch?key=OIP_RECEIPT"}},{"key":"OIP_REPAIR","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Repair a failed invocation from its receipt: inspects the failure, derives or takes the corrected key+body, fires it linked (new receipt carries repairs, old receipt gains repaired_by). Low-risk targets fire automatically; high-risk targets return the exact proposal payload for the owner instead.\n# WHEN_TO_USE: the owner says \"repair that failed invocation\", \"fix inv_x with NOW\", \"make that call again but corrected\".\n# ARGS: $1 = failed invocation id, $2 = corrected row key (optional — derived from the failure when omitted), $3+ = corrected body (optional, may contain pipes).\n# EX: [OIP_REPAIR]inv_6ximjestte|NOW|[/OIP_REPAIR]\n[\"$1\",\"$2\",\"$3+\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_REPAIR","json":"/api/directory/OIP_REPAIR","skill":"/api/directory/OIP_REPAIR?format=skill","oip_contract":"/api/dispatch?key=OIP_REPAIR"}},{"key":"OIP_REPLAY","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Re-fire a past invocation with its recorded input. New receipt links replay_of to the old one.\n# WHEN_TO_USE: the owner says \"replay that\", \"run inv_x again\", \"re-fire it as it was\".\n# ARGS: $1 = invocation id (inv_…).\n# EX: [OIP_REPLAY]inv_wvitbmiym6[/OIP_REPLAY]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/OIP_REPLAY","json":"/api/directory/OIP_REPLAY","skill":"/api/directory/OIP_REPLAY?format=skill","oip_contract":"/api/dispatch?key=OIP_REPLAY"}},{"key":"CAP_EXPLAIN","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Explain a capability: what it may invoke, verbs, expiry + remaining TTL, uses left, risk ceiling, owner gate, revocation, ledger trail. Accepts the token itself (sh.…) or its fingerprint (cap_…). Never echoes the raw token.\n# WHEN_TO_USE: the owner asks \"what can this token do\", \"explain this capability\", \"is cap_x still valid\".\n# ARGS: $1 = capability token or cap_ fingerprint.\n# EX: [CAP_EXPLAIN]cap_1a2b3c4d5e6f7a8b[/CAP_EXPLAIN]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_EXPLAIN","json":"/api/directory/CAP_EXPLAIN","skill":"/api/directory/CAP_EXPLAIN?format=skill","oip_contract":"/api/dispatch?key=CAP_EXPLAIN"}},{"key":"CAP_REVOKE","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Revoke a capability by fingerprint — the URL dies immediately; further invokes are denied and ledgered.\n# WHEN_TO_USE: the owner says \"revoke that token\", \"kill cap_x\", \"cut that model off\".\n# ARGS: $1 = cap_ fingerprint.\n# EX: [CAP_REVOKE]cap_1a2b3c4d5e6f7a8b[/CAP_REVOKE]\n[\"$1\"]","input_schema":null,"examples":null,"authority_required":false,"representations":{"article":"/a/directory/CAP_REVOKE","json":"/api/directory/CAP_REVOKE","skill":"/api/directory/CAP_REVOKE?format=skill","oip_contract":"/api/dispatch?key=CAP_REVOKE"}}]},"ontology":{"conformance_group":"article","inferred_from":["oip","kimi-import","self-explaining","voxel","concepts","what-is-merkle-tree","objection-7","oip-edge","what","is","merkle","tree"],"relationships":[],"sources":[]},"conformance":{"success_events":"/api/articles/what-is-merkle-tree/invocations?status=success","failure_events":"/api/articles/what-is-merkle-tree/invocations?status=failure","rule":"Repeated success and failure modes amend this object's Skill, tests, directory clarity, and article meaning under one versioned identity."},"article":{"slug":"what-is-merkle-tree","title":"What Is a Merkle Tree","body":"<!-- hierarchy:nav -->\n> **Path:** [OIP](https://miscsubjects.com/a/oip) › [Thinker Reference](https://miscsubjects.com/a/oip-thinker-reference) › [Protocol Concepts](https://miscsubjects.com/a/oip-protocol-concepts) › **What Is a Merkle Tree**\n>\n> **Shelf:** Protocol Concepts · **Traversal:** self-explaining · hierarchical · voxel-ready\n> **Machine root:** [OIP tree](https://miscsubjects.com/api/dispatch?map=1&format=markdown) · [Registry](https://miscsubjects.com/api/dispatch?registry=1)\n\n# What Is a Merkle Tree\n\n## §SELF — what-is-merkle-tree\n\n**What this page is:** A definition of the Merkle tree data structure and an explanation of why it is used for efficient data verification.\n**What it explains:** How a Merkle tree turns a large dataset into a single root hash, and how that root hash lets someone verify a single data block without downloading the whole dataset.\n**Why read it:** You will understand tamper-evident data structures, Merkle proofs, and why this matters for receipt verification in OIP.\n\n### What a Merkle Tree Is\n\nA Merkle tree is a tree-shaped data structure where every leaf node contains the hash (a fixed-length fingerprint) of a data block, and every non-leaf node contains the hash of its child nodes combined. Ralph Merkle invented this structure in 1979. The single hash at the top of the tree is called the Merkle root.\n\n### Why It Matters\n\nBefore Merkle trees, verifying that a single piece of data belonged to a large dataset required having the entire dataset — O(n) time and space. A Merkle tree reduces this to O(log n): to prove a data block is in the tree, you only need the hashes on the path from that block to the root, not the whole tree. This makes efficient verification possible for large datasets like ledgers, file systems, and blockchains.\n\n### The Key Idea\n\nA hash function takes any input and produces a fixed-length output that changes completely if the input changes even slightly. In a Merkle tree, each data block is hashed to form a leaf. Pairs of leaf hashes are hashed together to form parent nodes. This continues until one root hash remains. Because each parent hash depends on its children, changing any data block changes its leaf hash, which changes every parent hash above it, which changes the root. The Merkle root therefore functions as a tamper-evident summary of the entire dataset.\n\nTo verify that a specific data block is in the tree, a verifier needs only: the data block itself, the Merkle root, and the hashes of the sibling nodes on the path from the block to the root (called a Merkle proof). The verifier hashes the data block, then hashes it with each sibling hash in sequence up the tree. If the final result matches the Merkle root, the block is confirmed as part of the tree.\n\n### What It Got Right\n\n- **Tamper evidence.** Change one data block and the Merkle root changes. There is no way to alter data without detection.\n- **Efficient verification.** Proving inclusion requires O(log n) hashes, not O(n) data blocks.\n- **No central trust required.** Anyone who knows the Merkle root can verify proofs. No trusted third party is needed.\n- **Deterministic structure.** The same data blocks always produce the same Merkle root, enabling consistent cross-system comparison.\n\n### What It Got Wrong or Left Unfinished\n\n- **Does not hide data.** The Merkle root reveals nothing about the data, but a Merkle proof reveals the sibling hashes on the proof path, which may leak information about adjacent data blocks.\n- **Insertion and deletion are costly.** Adding or removing data blocks in a standard Merkle tree requires recomputing hashes up the path to the root. Trees designed for frequent updates (Merkle Patricia trees, sparse Merkle trees) add significant complexity.\n- **Collision resistance depends on the hash function.** If the hash function has collisions (two different inputs producing the same output), the tamper-evidence property breaks. The security of a Merkle tree is only as strong as its hash function.\n\n### How It Connects to Other Ideas\n\n**Blockchains.** Bitcoin uses Merkle trees to summarize all transactions in a block. A light client can verify that a specific transaction occurred by requesting only the Merkle proof, not the full block.\n\n**Cryptographic commitments.** A Merkle root is a form of cryptographic commitment: it binds a party to a specific dataset without revealing the dataset. This is the same principle used in hash-based signature schemes and zero-knowledge proofs.\n\n**OIP receipt verification.** OIP can compute a Merkle root over all receipts in the ledger periodically. A caller who wants to prove their receipt is in the ledger provides the receipt and a Merkle proof. Any verifier with the Merkle root can confirm inclusion without downloading the entire ledger. This gives OIP cryptographic proof of inclusion without a full blockchain.\n\n### Sources\n\n- Merkle, R.C. (1980). \"A Certified Digital Signature.\" *Advances in Cryptology — CRYPTO '89 Proceedings*.\n- Merkle, R.C. (1979). \"Secrecy, Authentication, and Public Key Systems.\" PhD thesis, Stanford University.\n\n---\n\n## Up the tree\n\n- [OIP root](https://miscsubjects.com/a/oip) — protocol root, zero-context entry\n- [Thinker Reference hub](https://miscsubjects.com/a/oip-thinker-reference) — full hierarchy map\n- [Protocol Concepts shelf](https://miscsubjects.com/a/oip-protocol-concepts) — siblings on this shelf\n- [Voxel graph article](https://miscsubjects.com/a/what-is-voxel-graph) — how pages link as voxels\n- [Self-describing protocol](https://miscsubjects.com/a/what-is-self-describing-protocol)\n\n## Related on this shelf\n\n- [What Is Autopoiesis](https://miscsubjects.com/a/what-is-autopoiesis)\n- [What Is Capability-Based Security](https://miscsubjects.com/a/what-is-capability-security)\n- [What Is a Capability Token](https://miscsubjects.com/a/what-is-capability-token)\n- [What Is a Confused Deputy](https://miscsubjects.com/a/what-is-confused-deputy)\n- [What Is Context as Cursor](https://miscsubjects.com/a/what-is-context-as-cursor)\n- [What Is a Convergence Catalogue](https://miscsubjects.com/a/what-is-convergence-catalogue)\n- [What Is a Falsification Surface](https://miscsubjects.com/a/what-is-falsification-surface)\n- [What Is HATEOAS](https://miscsubjects.com/a/what-is-hateoas)\n\n## Machine surfaces\n\n- Public page: `https://miscsubjects.com/a/what-is-merkle-tree`\n- JSON article: `https://miscsubjects.com/api/articles/what-is-merkle-tree`\n- OIP ask: `https://miscsubjects.com/api/dispatch?ask=What%20Is%20a%20Merkle%20Tree`\n\n\n---\n\n## Where OIP does this differently (required edge)\n\nOIP difference: append-only ledger + receipt hash chain is the operational cousin of content-addressed integrity.\n","hero":null,"images":[],"style":{},"tags":["oip","kimi-import","self-explaining","voxel","concepts","what-is-merkle-tree","objection-7","oip-edge"],"category":null,"model":"kimi-agent-import","ledger":{"href":"/api/articles/what-is-merkle-tree/ledger","live":true},"embeds":[],"widgets":[{"type":"note","title":"Zero-context","text":"This page is self-explaining: §SELF states what it is, what it explains, and why to read it."},{"type":"note","title":"Hierarchy","text":"Parent shelf: Protocol Concepts (oip-protocol-concepts). Hub: oip-thinker-reference. Root: /a/oip."},{"type":"note","title":"Voxel","text":"Each article is a node. Links Up the tree + Related form the traversable graph."},{"type":"stat","value":20,"label":"Protocol Concepts on shelf"},{"type":"note","title":"OIP edge","text":"OIP difference: append-only ledger + receipt hash chain is the operational cousin of content-addressed integrity."}],"home":true,"claims":[],"sources":[],"reviews":[],"extra":{},"has_traversal":false,"register":"standard","status":"published","revisions":1,"contributions":[],"provenance":[{"ts":"2026-07-15T04:20:58.378Z","model":"kimi-agent-import","action":"write","prompt":"","input":"","response":"","tokens_in":0,"tokens_out":0,"cost":0,"prev":"genesis","hash":"e100d4c57f6531e014601b80e82b445aac319f93eb8d88b740244a53bce87cb5"},{"ts":"2026-07-15T06:24:59.313Z","model":"grok-build","action":"objection-patch","prompt":"","input":"","response":"","tokens_in":0,"tokens_out":0,"cost":0,"prev":"e100d4c57f6531e014601b80e82b445aac319f93eb8d88b740244a53bce87cb5","hash":"317cbb8e020b1364d2af047959f702997e31e8be9f6faebca108038d3be4f63b"},{"ts":"2026-07-17T02:43:38.339Z","model":"owner","action":"voxel_divide","prompt":"","input":"what-is-merkle-tree","response":"32 DIVs from body (verbatim, roundtrip-checked)","tokens_in":0,"tokens_out":0,"cost":0,"prev":"317cbb8e020b1364d2af047959f702997e31e8be9f6faebca108038d3be4f63b","hash":"cef79bbdfabc36325410e53e1da104b50e12ed010063886fcdf7d091aea8f92a"}],"energy":{"passes":3,"tokens_in":0,"tokens_out":0,"tokens_total":0,"cost_usd":0,"models":{"kimi-agent-import":1,"grok-build":1,"owner":1},"head":"cef79bbdfabc36325410e53e1da104b50e12ed010063886fcdf7d091aea8f92a"},"posted_at":"2026-07-15T04:20:58.378Z","created_at":"2026-07-15T04:20:58.378Z","updated_at":"2026-07-17T02:43:38.339Z","machine":{"shape":"article.machine/v1","slug":"what-is-merkle-tree","kind":"article","read":{"human":"https://miscsubjects.com/a/what-is-merkle-tree","json":"https://miscsubjects.com/api/articles/what-is-merkle-tree","bundle":"https://miscsubjects.com/api/articles/what-is-merkle-tree/bundle?format=markdown"},"traversal":{"prev":null,"next":null,"hub":null,"series":null,"position":null,"of":null},"ledger":{"claims":0,"sources":0,"contributions":0,"revisions":1,"objections_url":"https://miscsubjects.com/api/articles/what-is-merkle-tree/objections","thread_state_url":"https://miscsubjects.com/api/protocol/thread-state?target=what-is-merkle-tree","proof_rule":"An action is proven by its ledger receipt, never by a 200 or a description."},"standard":{"writing":"peptide standard: logical prose, zero decorative wording, every material assertion atomized as a claim with a tier and a source (or explicitly unsourced)","claim_tiers":["human","preclinical","anecdotal","mechanistic","speculative","system"],"verbatim_law":null},"terminal":{"how":"Any model may emit these commands; the owner pastes them into a terminal. $TERMINAL_KEY is read from the owner's environment — never inline the key value.","claim_append":"curl -s -X POST https://miscsubjects.com/api/protocol/claim -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"what-is-merkle-tree\",\"text\":\"<one atomized claim>\",\"tier\":\"<human|preclinical|anecdotal|mechanistic|speculative|system>\",\"source_ids\":[],\"who_claims\":\"<model>\",\"rationale\":\"<why material>\"}'","source_append":"curl -s -X POST https://miscsubjects.com/api/protocol/sources -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"what-is-merkle-tree\",\"sources\":[{\"type\":\"review\",\"url\":\"<url>\",\"title\":\"<title>\",\"quote\":\"<verbatim quote>\",\"summary\":\"<one line>\"}]}'","objection":"curl -s -X POST https://miscsubjects.com/api/articles/what-is-merkle-tree/objections -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"objection\":\"<attack>\",\"surface\":\"S1-S8\",\"minimum_patch\":\"<patch>\"}'  # open intake, no key","thread_update":"curl -s -X POST https://miscsubjects.com/api/protocol/thread-update -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"target\":\"what-is-merkle-tree\",\"raw_text\":\"<material delta>\"}'  # open intake, no key","read_back":"curl -s https://miscsubjects.com/api/articles/what-is-merkle-tree | python3 -c 'import json,sys; d=json.load(sys.stdin); print(json.dumps(d[\"claims\"][-3:], indent=1))'"}},"representations":{"article":"/a/what-is-merkle-tree","json":"/api/articles/what-is-merkle-tree","markdown":"/api/articles/what-is-merkle-tree/bundle?format=markdown","skill":"/api/articles/what-is-merkle-tree/skill","topology":"/api/articles/what-is-merkle-tree/topology","versions":"/api/articles/what-is-merkle-tree/revisions","invocations":"/api/articles/what-is-merkle-tree/invocations"},"editorial_review":null,"editorial_audit":{"slug":"what-is-merkle-tree","ok":false,"issues":[{"code":"heading_filing_label","message":"section heading “Why It Matters” is a filing label that gives a cold reader no claim","replacement":"Replace “Why It Matters” with the concrete claim, event, or object introduced in that section."},{"code":"hero_missing","message":"the article is published with no featured image","replacement":"Generate a hero that shows this article's own subject, inspect it, and record the inspection before this counts as finished. An article with no image is not finished."}]},"body_hash":"8b708429a592de722e8499f81dfd5fc4c239f2d5aa753af75ee07d3cce0e958e"}}}