Merkle Tree
Also known as: Hash Tree, Binary Hash Tree, Blockchain Merkle Structure
A hierarchical data structure that enables efficient and secure verification of large datasets using cryptographic hashes.
A Merkle tree is a binary tree data structure where each leaf node contains a hash of data, and each parent node contains the hash of its children. The root of the tree, called the Merkle root, summarizes the entire dataset. Merkle trees allow for efficient and secure data verification without storing or revealing the entire dataset. They are essential in blockchain for validating blocks, verifying transactions, and enabling light clients. Merkle trees are also foundational to scaling technologies like rollups and proof systems like zk-SNARKs and STARKs.