- Merkle Tree
Definition of "Merkle Tree"
- A tree in which every non-leaf node is labelled with the hash of the labels or values (in case of leaves) of its child nodes. Hash trees are useful because they allow efficient and secure verification of the contents of large data structures. Hash trees are a generalization of hash lists and hash chains.
Demonstrating that a leaf node is a part of the given hash tree requires processing an amount of data proportional to the logarithm of the number of nodes of the tree; this contrasts with hash lists, where the amount is proportional to the number of nodes.
Articles Related to "Merkle Tree"
A Survey Of Second Layer Solutions for Blockchain Scaling, Part 2
Overview Of Ethereum's Developments In Closing 2017
Charity Event Raises $70K In Ether For Toronto’s At-Risk Youth