Merkle proof: Difference between revisions
Mr. MacKenty (talk | contribs) No edit summary |
Mr. MacKenty (talk | contribs) No edit summary |
||
| Line 1: | Line 1: | ||
[[file:computation.png|right|frame|Programming<ref>http://www.flaticon.com/</ref>]] | [[file:computation.png|right|frame|Programming<ref>http://www.flaticon.com/</ref>]] | ||
Merkle proofs are used to decide upon the following factors: | |||
# If the data belongs in the merkle tree | |||
# To concisely prove the validity of data being part of a dataset without storing the whole data set | |||
# To ensure the validity of a certain data set being inclusive in a larger data set without revealing either the complete data set or its subset. | |||
Merkle trees make extensive use of one way hashing. | |||
Merkle proofs are established by hashing a hash’s corresponding hash together and climbing up the tree until you obtain the root hash which is or can be publicly known. | |||
Given that one way hashes are intended to be collision free and deterministic algorithms, no two plaintext hashes can/should be the same.<ref>https://medium.com/crypto-0-nite/merkle-proofs-explained-6dd429623dc5</ref> | |||
== Video == | == Video == | ||
<html> | <html> | ||
<iframe width="560" height="315" src="https://www.youtube.com/embed/ | <iframe width="560" height="315" src="https://www.youtube.com/embed/2kPFSoknlUU" frameborder="0" allow="accelerometer; autoplay; encrypted-media; gyroscope; picture-in-picture" allowfullscreen></iframe> | ||
</html> | </html> | ||
== References == | == References == | ||
<references /> | <references /> | ||
[[Category:programming]] | [[Category:programming]] | ||
Revision as of 19:41, 8 March 2020
Programming[1]
Merkle proofs are used to decide upon the following factors:
- If the data belongs in the merkle tree
- To concisely prove the validity of data being part of a dataset without storing the whole data set
- To ensure the validity of a certain data set being inclusive in a larger data set without revealing either the complete data set or its subset.
Merkle trees make extensive use of one way hashing. Merkle proofs are established by hashing a hash’s corresponding hash together and climbing up the tree until you obtain the root hash which is or can be publicly known. Given that one way hashes are intended to be collision free and deterministic algorithms, no two plaintext hashes can/should be the same.[2]
Video