How do you fingerprint a million files with ONE number, and prove any single file belongs without shipping the rest? Hash the files in pairs, then hash the hashes, up to a single ROOT. Change any leaf and the change ripples all the way up — the root changes. And you can prove a leaf’s membership with just the log-many hashes along its path. It’s the spine of Git, blockchains, and this corpus’s own seal-chain. Slide to tamper a leaf.
A Merkle (hash) tree hashes data blocks into leaves, then repeatedly hashes adjacent pairs up to a single ROOT hash that commits to ALL the data. Any change to any leaf changes its parent, and so on to the root — making tampering detectable with one comparison. Membership of a leaf is proved with only the O(log n) sibling hashes on its root-path (a ‘Merkle proof’), without revealing the other leaves. It underlies Git, Bitcoin/blockchains, certificate transparency, and this corpus’s [[the-chain|.dlw seal-chain]]. A fail-loud self-check throws unless changing a leaf changes the root. ◆ real cryptography, node-verified.
Shown with a small mixing hash for legibility (real trees use SHA-256); the STRUCTURE — pairwise hashing to a root, change-propagation, log-size proofs — is exact. Tamper-evidence detects change; it does not by itself say who changed it.