Merkle Tree

A Merkle tree is a data structure that condenses many pieces of data into one hash by pairing items, hashing each pair, then repeating until a single root remains. Ralph Merkle described the construction in 1979. Bitcoin uses a Merkle tree in every block to commit to all transactions with one 32-byte value.

Why it matters

Merkle trees make verification efficient. Proving that one transaction belongs to a block requires only a path of hashes from leaf to root, roughly the base-2 logarithm of the number of items: a block with 4,096 transactions needs a proof of just 12 hashes. This allows lightweight wallets to check payments without storing the full blockchain, which now exceeds 600 gigabytes.

The same structure appears throughout Bitcoin's design, from the script trees introduced by Taproot to the commitment schemes used in exchange proof-of-reserves audits.

In the gold vs bitcoin debate

The Merkle tree is part of why bitcoin's supply and history are cheap to audit. Verifying that the gold in a vault matches the paper claims on it requires physical inspection and trusted auditors. Verifying that a bitcoin transaction sits in the chain requires a few hundred bytes of hashes and open-source software, a difference in verification cost that bitcoin proponents place at the center of the debate.