Merkle proof
Web3 / blockchain technology
A Merkle proof is a cryptographic technique that allows someone to efficiently prove that a specific piece of data exists within a larger dataset (such as a blockchain) without needing to reveal or download the entire dataset. The proof works by providing a chain of cryptographic hashes that connect a specific data element to the root hash of a Merkle tree, a tree structure where each node contains the hash of its child nodes. Instead of requiring verification of all data, a verifier only needs to check approximately log(n) hash computations where n is the total dataset size. Merkle proofs are fundamental to light clients and scalability solutions because they enable verification with minimal computational overhead. This efficiency is crucial for systems where participants have limited bandwidth or storage capacity. Example: Bitcoin light clients use Merkle proofs to verify that a specific transaction was included in a block without downloading the entire block's transaction history, enabling Bitcoin wallets to run on mobile phones. Why it matters for blockchain technology: Merkle proofs enable scalable blockchain verification by allowing nodes to prove transaction inclusion with minimal data. This is essential for light clients, rollup solutions, and cross-chain bridges, making blockchain technology practical for resource-constrained devices and reducing network bandwidth requirements.
Explore the full Web3 Glossary — 2,062+ expert-curated definitions. Need guidance? Talk to our consultants.