(also hash tree)
A Merkle tree is a data structure in computer science and cryptography where each node contains a cryptographic hash of its children’s nodes, forming a binary tree. It allows for efficient and secure verification of the content of large data structures because it reduces the amount of data required for verification. Merkle trees are used in various applications, including distributed systems, peer-to-peer networks, and blockchain technology.
Merkle trees are more efficient than traditional hash lists or hash chains when the content of large data structures needs to be verified. By using a tree structure, Merkle trees require fewer hash comparisons and can verify data in logarithmic time.
We value your privacy