Difference between revisions of "Merkle proof"
Todd Price (talk | contribs) (Created page with "A Merkle proof is the act of verifying an element exists within a set summarised by the Merkle root. The data element is hashed to create its leaf(node)|leaf node valu...") |
Todd Price (talk | contribs) |
||
| Line 1: | Line 1: | ||
A Merkle proof is the act of verifying an element exists within a set summarised by the [[Merkle root]]. | A Merkle proof is the act of verifying an element exists within a set summarised by the [[Merkle root]]. | ||
| − | The data element is hashed to create its [[leaf(node)|leaf node value]], and then hashed with a provided set of the adjunct node values along the [[Merkle path]] back to the root. | + | The data element is hashed to create its [[leaf (node)|leaf node value]], and then hashed with a provided set of the adjunct node values along the [[Merkle path]] back to the root. |
If the same Merkle root is created as has been published previous. it stands that the data element is be guaranteed to come from the data set and at the same [[index]] as it was in the earlier published instance. | If the same Merkle root is created as has been published previous. it stands that the data element is be guaranteed to come from the data set and at the same [[index]] as it was in the earlier published instance. | ||
Revision as of 05:45, 25 April 2022
A Merkle proof is the act of verifying an element exists within a set summarised by the Merkle root.
The data element is hashed to create its leaf node value, and then hashed with a provided set of the adjunct node values along the Merkle path back to the root.
If the same Merkle root is created as has been published previous. it stands that the data element is be guaranteed to come from the data set and at the same index as it was in the earlier published instance.