Merkle Proof
A cryptographic proof that a specific data element is included in a Merkle tree.
Last Updated
2026-03-29
Related Concepts
What is Merkle Proof?
A Merkle proof is a small set of hashes that proves a specific piece of data exists in a larger dataset without needing the full dataset.
How does Merkle Proof work?
The prover provides the target data and its sibling hashes up the tree. The verifier recomputes the path to the root if it matches the known Merkle root, the proof is valid.
Why does Merkle Proof matter?
It enables light clients to verify blockchain data without downloading the full chain, and powers cross-chain bridges and Layer 2 verification.
Key features of Merkle Proof
- Proves data inclusion without the full dataset
- Logarithmic size only a few hashes needed
- Enables secure light client operation
- Foundational for Layer 2 and bridge designs
Examples of Merkle Proof
A Bitcoin light client verifies a single transaction using ~15 hashes instead of downloading the full block. Cross-chain bridges use Merkle proofs to confirm deposits on a separate network.