Definition

Merkle tree

A cryptographic data structure where each leaf is a hash of data and each non-leaf is a hash of its children, allowing efficient proofs that an item belongs to a large set.

Merkle trees enable efficient verification: to prove that a transaction is in a block, you don't need the entire block — just the leaf hash plus the hashes of nodes along the path to the root. This compresses verification from O(n) to O(log n).

In Bitcoin, every block header contains the Merkle root of all transactions in that block. Light clients can verify a single transaction's inclusion with a few KB of proof data. Ethereum uses Merkle Patricia tries — a related structure — for state roots and storage.

Why it matters

Merkle trees underpin almost every blockchain and ZK proof system. Understanding them clarifies how on-chain data integrity works at scale.

How CryptoRadar24 tracks it

CryptoRadar24 references Merkle structures when explaining proof systems or audit reports.

Related terms

Zero-knowledge proof (ZK proof)
A cryptographic proof that lets one party prove they know a value without revealing the value itself.
Block reward
The newly minted coins paid to a miner or validator for proposing a valid block, plus the transaction fees in that block.
Smart contract
Self-executing code deployed on a blockchain that runs deterministically when called, without requiring an intermediary.

FAQ

Why are Merkle trees used in blockchains?

Verification efficiency. Without them, verifying transaction inclusion would require downloading full blocks. With them, a few hashes suffice.

What is a Merkle proof?

The set of intermediate hashes needed to recompute the root from a single leaf. If you can produce a valid proof, the leaf was definitely in the tree.

How does Ethereum use Merkle trees?

Three: transactions Merkle root (per block), receipts Merkle root, and state Merkle Patricia trie. Each block header contains all three roots.

Are Merkle trees used in airdrops?

Often yes. The full eligible-address list is published as a Merkle root; users prove their address was in the list with a small proof. Saves on-chain storage.