Merkle Proof

A Merkle proof is a small cryptographic proof that a specific piece of data is part of a larger dataset, without needing the whole dataset to check it. It works against a Merkle tree - a structure that hashes data in pairs, over and over, up to a single fingerprint at the top called the Merkle root. If you know the root, a short proof can show that one item was included in the tree that produced it.

The efficiency is the point. A dataset of a million entries still produces one small root, and proving any single entry takes only about twenty hashes - roughly the log of the dataset size - rather than the whole list. Because changing any entry changes the root, the proof is tamper-evident: a valid proof against a trusted root guarantees the item was in the exact dataset that root represents.

This is extremely useful on a blockchain, where storing and processing large datasets on-chain is expensive. A smart contract can store just the 32-byte root and let anyone submit a Merkle proof to verify membership cheaply.

For real-world assets, Merkle proofs show up in a few places. A whitelist of thousands of approved addresses can be committed as a single root on-chain, with each investor submitting a proof that their address is included - far cheaper than storing the full list. Token airdrops and distributions use the same pattern. And a proof of reserves can use a Merkle tree so each holder verifies their balance was counted in the attested total without the issuer publishing everyone's balances.

A Merkle proof shows membership in a committed dataset; it does not by itself prove that dataset is correct or current - that still depends on who produced the root and when.

Source: Ethereum docs (ethereum.org), as of 2026.