Merkle proof: Difference between revisions
Mr. MacKenty (talk | contribs) (Created page with "<center> <blockquote style="padding: 5px; background-color: #FFF8DC; border: solid thin gray;"> File:Exclamation.png This is student work which has not yet been approve...") |
Mr. MacKenty (talk | contribs) No edit summary |
||
Line 1: | Line 1: | ||
[[file:computation.png|right|frame|Programming<ref>http://www.flaticon.com/</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|400px]] | |||
== Video == | |||
<html> | |||
<iframe width="560" height="315" src="https://www.youtube.com/embed/s0fruNfgW30" frameborder="0" allow="accelerometer; autoplay; encrypted-media; gyroscope; picture-in-picture" allowfullscreen></iframe> | |||
</html> | |||
== References == | == References == | ||
<references /> | <references /> | ||
[[Category: | [[Category:programming]] | ||
Revision as of 18:32, 8 March 2020
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]
Video