Merkle tree: Difference between revisions

From Computer Science Wiki
No edit summary
No edit summary
Line 3: Line 3:
In cryptography and computer science, a hash tree or Merkle tree is a tree in which every leaf node is labelled with the cryptographic hash of a data block, and every non-leaf node is labelled with the hash of the labels of its child nodes. Hash trees allow efficient and secure verification of the contents of large data structures. Hash trees are a generalization of hash lists and hash chains.<ref>https://en.wikipedia.org/wiki/Merkle_tree</ref>
In cryptography and computer science, a hash tree or Merkle tree is a tree in which every leaf node is labelled with the cryptographic hash of a data block, and every non-leaf node is labelled with the hash of the labels of its child nodes. Hash trees allow efficient and secure verification of the contents of large data structures. Hash trees are a generalization of hash lists and hash chains.<ref>https://en.wikipedia.org/wiki/Merkle_tree</ref>


 
[[File:Merkle tree.jpg|600px]]


== References ==
== References ==

Revision as of 18:13, 8 March 2020

Programming[1]

In cryptography and computer science, a hash tree or Merkle tree is a tree in which every leaf node is labelled with the cryptographic hash of a data block, and every non-leaf node is labelled with the hash of the labels of its child nodes. Hash trees allow efficient and secure verification of the contents of large data structures. Hash trees are a generalization of hash lists and hash chains.[2]

Merkle tree.jpg

References