Merkle Tree

Overview

What it means and why it exists

A Merkle tree is a structure that combines hashes in layers so a short proof can show that one piece of data belongs to a larger collection. Blockchain systems use it to commit to sets of transactions or other state data.

How it works

Start with a hash for each item, combine neighboring hashes, hash each pair, and repeat until one root hash remains. To prove inclusion, provide the target leaf and the neighboring hashes on its path to the root. A verifier recomputes the path and compares the result with a trusted root, without downloading every other item.

Technical details worth understanding

In Bitcoin, block headers commit to a Merkle root of transaction IDs, while SegWit also includes a separate witness commitment mechanism. Different blockchains use related structures, sometimes with different hash functions, tree shapes or state commitments. A Merkle proof only has meaning when the root comes from a trusted and sufficiently finalized source.

What can go wrong

A valid Merkle proof does not establish that a payment is commercially correct, nor does it independently establish chain finality. A fabricated root can make fabricated items appear included. Implementations must also respect leaf encoding, ordering and any chain-specific proof rules.

Practical checks

When reviewing a Merkle proof, inspect which leaf encoding and hashing rule the protocol uses; Bitcoin's transaction tree is not identical to Ethereum's account-state structures. Verify the root against a trusted header, not one supplied by the same untrusted party as the proof. Then separately evaluate the confirmation or finality requirement.

Related concepts

Blockchain, Bitcoin (BTC), Transaction Hash.

Further reading

Bitcoin Developer Guide — Block Chain.