Home▸Computer Science▸Merkle Tree Proof Visualizer

🌳 Merkle Trees: How a Single Hash Verifies Millions of Records

Interactive 3D binary tree of hashed data blocks where selecting a leaf record highlights the minimal sibling-hash path needed to verify it against the root hash.

Computer Science3DModerate60 FPS

An interactive 3D binary tree of hashed data blocks. Selecting any leaf record highlights the minimal chain of sibling hashes needed to recompute the root and verify that record belongs to the dataset — without touching any other record.

🔬 What It Demonstrates

Every internal node is the hash of its two children, all the way up to a single root hash. Proving a leaf's inclusion only requires the sibling hash at each level — log₂(n) hashes for n leaves — not the whole dataset.

🎮 How to Use

Pick a leaf count and drag the leaf slider (or click a block) to select a record. Watch the cyan recomputed path and gold sibling hashes light up. Tamper with a leaf's data to see the root hash diverge from the trusted root.

💡 Did You Know?

Bitcoin block headers store only a Merkle root. A light client can verify a transaction is in a block containing thousands of others using roughly 11–12 hashes instead of downloading the entire block.

⚙ Under the hood

Interactive 3D binary hash tree where selecting a leaf and generating its proof path shows how a single root hash verifies millions of underlying records.

merkle-treeshash-proofscryptographydata-integrityblockchainbinary-treescomputer-science

3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install