Follow two neighboring branches from one record to an accepted top fingerprint.
SEE IT FOR YOURSELF
Build a root and follow one membership proofStep 1 / 4
This example hashes UTF-8 A, B, C and D. The displayed hashes are abbreviated, and the tree uses the playground’s sorted-pair convention.
This example hashes UTF-8 A, B, C and D. The displayed hashes are abbreviated, and the tree uses the playground’s sorted-pair convention.Each pair of raw child hashes is sorted, concatenated and hashed. The resulting parent fingerprints commit to their children.Hash the two parents under the same rule to obtain one root commitment. Changing a leaf changes the hashes on its path.The highlighted siblings are B and hash(C,D). Starting with A, the verifier recomputes its path and compares the final result with a trusted root.
Animated local teaching model. No wallet, RPC or live blockchain data. Some labels and hashes are abbreviated for readability.
Use the specified convention
Enter A, B, C and D as distinct UTF-8 items. The playground uses single-hashed leaves, sorted pairs and promoted odd nodes.
Select A’s proof
The needed siblings are B’s leaf hash and parent CD. Combine from the leaf upward using complete hash bytes.
Compare the expected root
The acceptance target below supplies the root for this exact convention. Another tree format can produce a different root from the same text list.
Test a negative case
Change A’s text while retaining its proof. Verification should fail against the original root. Explain where the trusted-root assumption enters.
Your acceptance target
items: A, B, C, D
root: 0x4e2b32e9c7b10ee15f38192ed65b95656a84e32531157b9384ef0d3cabe95956
proof A:
0x1f675bff07515f5df96737194ea945c36c41e7b4fcef307b7cd4d0e602a69111
0xe62e1dfc08d58fd144947903447473a090c958fe34e2425d578237fcdf1ab5a4
Use only local examples and public sample addresses. State the assumptions and limits alongside the result.