A simple binary playground is not an execution-state proof implementation.
LET’S PICTURE IT
A two-way classroom family tree differs from a compressed indexed filing system.
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.
Identify the data structure
Ethereum’s familiar execution-state model uses Merkle Patricia trie structures with key paths and node encodings. A basic pairwise binary tree omits those details.
Read the proof format
Trie proofs involve encoded nodes along a key path. A list of sorted binary sibling hashes is not automatically a valid account or storage proof.
Keep roots tied to their schemas
A root commits to data under its own encoding and key construction. A thirty-two-byte length alone does not tell you which tree or verification algorithm applies.
Use the playground for intuition
The local tool demonstrates fingerprint aggregation and membership paths. For actual chain proofs, use the appropriate protocol specification and tested trie tooling.
Follow the proof model
Binary model: hash pairs of children
Execution trie model: key paths + encoded trie nodes
Both commit to data, but their proof formats differ.
Binary examples use the stated local playground convention. They are not Ethereum account or storage trie proofs.