Build a Merkle tree from any list of leaves, explore every intermediate hash, and generate inclusion proofs — useful for blockchain, content integrity, and file verification.
One leaf per line. Each leaf is first hashed, then paired up the tree. Odd nodes are duplicated (Bitcoin-style) if enabled.
Click any leaf to generate its inclusion proof. Green = leaves, yellow = root, blue = proof siblings.
A Merkle tree is a binary tree where every leaf is a hash of a data block and every non-leaf is the hash of the concatenation of its children. The single root hash commits to the entire set of leaves. To prove a leaf is in the tree, you only need the sibling hashes along the path to the root — a logarithmic proof instead of the full data set. Merkle trees power Git, Bitcoin, IPFS, Certificate Transparency, and many content-addressed systems.