Difference between revisions of "Merkle proof"
Todd Price (talk | contribs) |
Todd Price (talk | contribs) |
||
| Line 3: | Line 3: | ||
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 | + | If the same Merkle root is created as has been published previous, then it stands that the data element is be guaranteed to come from the same index in the same data set as in the earlier published instance. |
Revision as of 05:46, 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, then it stands that the data element is be guaranteed to come from the same index in the same data set as in the earlier published instance.