THE MERKLE TREE hash the leaves in pairs to one root — the seal the corpus itself uses
A Merkle tree hashes data blocks in pairs, then hashes the hashes, up to a single root that fingerprints everything below. Change one leaf and the root changes; and any single leaf can be proved to belong under the root with just the sibling hashes along its path — a proof logarithmic in the number of leaves. It is the tamper-evidence under Git, blockchains, certificate transparency, and BitTorrent. It is also, precisely, how this corpus seals World V: every inhabitant’s sha256(name|slug|blurb) folds pairwise to ROOT_0, and each leaf carries its own proof back.
THE TECHNIQUE pairwise hash to a root; a leaf + its path proves membership
The demo builds a 4-leaf tree, verifies leaf 2’s proof reaches the root, then tampers a leaf and shows the root changes: live demo
HISTORY & CREDIT Ralph Merkle · 1979
“To trust a big dataset you must re-read all of it.” — a Merkle proof checks one item against the root with a handful of hashes. cited
the fold · root = H(H(l₀,l₁), H(l₂,l₃)) — leaves hashed in pairs up to one value. the proof · a leaf + its sibling hashes along the path recompute the root — O(log n). 1979 · Ralph Merkle — the hash tree; the corpus’s own .dlw seal is one.
A whole dataset compressed to one root, each item provable by its path — the tamper-evidence the corpus itself is sealed with. verification
RECOMMEND FOR I-13 proof and tamper, on the compiler
On the canonical compiler, leaf 2’s sibling+uncle path recomputes the root (proof OK); tampering a leaf yields a different root:
$ i13 run zd_merkletree.i13 # 4 leaves, toy hash H
RUN OK · 130 step(s) · peak stack 5 · call depth 1
n01 = 4462 n23 = 10358 root = 3515
proof_ok = 1 -- leaf-2 path recomputes the root
roott = 85395
tamper_detected = 1 -- one changed leaf -> different root
Recommend as a NULL — verification, and self-referential to the corpus. The Merkle root is a hash (a pinned value; any correct implementation agrees), and the proof mechanism checks membership rather than generating an invariant — that is the recognizer gate (B41), the same reason a validity-checker is not a keeper. It is doubly interesting here because it is the corpus’s own seal (ROOT_0), but being the seal does not make it a sixth axis. NULL — a witness, beautifully, of everything beneath it.