ethertools.
Tools/Merkle trees
CRYPTOGRAPHY · RUNS IN YOUR BROWSER

Merkle tree playground

Build a tree. Select a leaf. Verify its proof.

Convention: Keccak-256 leaves, sorted raw-byte pairs, unpaired nodes promoted. Educational format, not an Ethereum state trie.

HOW THE CONCEPT WORKS · SEPARATE TEACHING EXAMPLE
Build a root and follow one membership proofStep 1 / 4
Build a root and follow one membership proofA0x03783f…b760B0x1f675b…9111C0x017e66…8f72D0x6c3fd3…79f2A0x03783f…b760B0x1f675b…9111C0x017e66…8f72D0x6c3fd3…79f2hash(A,B)0x69de75…24a0hash(C,D)0xe62e1d…b5a4A0x03783f…b760B0x1f675b…9111C0x017e66…8f72D0x6c3fd3…79f2hash(A,B)0x69de75…24a0hash(C,D)0xe62e1d…b5a4ROOT0x4e2b32…5956A0x03783f…b760B0x1f675b…9111C0x017e66…8f72D0x6c3fd3…79f2hash(A,B)0x69de75…24a0hash(C,D)0xe62e1d…b5a4ROOT0x4e2b32…5956

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.

Animated local teaching model. No wallet, RPC or live blockchain data. Some labels and hashes are abbreviated for readability.

How to use this merkle trees

Build a local binary Merkle tree from UTF-8 items with Keccak-256 sorted pairs, promoted odd nodes, and interactive proof verification. Educational tree format, not an Ethereum state trie. Start with the prefilled example, change an input, and run the calculation. Invalid values produce an explanation rather than a misleading result.

What the result means

These results describe your supplied inputs. They do not query a blockchain, check balances, estimate current network conditions, or submit transactions. Read merkle trees and proofs for the meaning and limits of the calculation.