Merkle Tree

Definition ∞ A Merkle tree is a data structure that uses cryptographic hashes to verify data integrity efficiently. It organizes data into a tree-like structure where each non-leaf node contains the hash of its child nodes, ultimately leading to a single Merkle root hash. This root hash provides a concise and tamper-proof summary of all underlying data. Merkle trees enable efficient verification of large datasets without requiring access to all individual data segments.
Context ∞ Merkle trees are fundamental to the efficiency and security of blockchain protocols, frequently mentioned in technical crypto news regarding transaction verification or light client synchronization. Their use allows for compact proofs of transaction inclusion within a block, reducing bandwidth requirements. The integrity provided by Merkle trees is a key element supporting the verifiable nature of distributed ledgers.