What is Merkle Tree?
A Merkle tree pairs and hashes data items recursively until a single root hash remains. Changing any leaf changes the root, so it is a compact, tamper-evident summary used in Bitcoin block headers, Ethereum state roots and many other systems.
Why Merkle Tree matters
Understanding Merkle Tree is part of building a solid mental model of how Bitcoin, blockchain and Web3 systems actually work. Concepts in the Cryptography category sit at the foundation of the broader stack — get them right and the rest is far easier.
Learn this interactively
Reading the definition is a start. ZeroToBlock teaches concepts like Merkle Tree through hands-on, browser-based simulations. Build the mental model by actually using it:
- Bitcoin 101 — interactive fundamentals course
- Bitcoin Proof of Work — mining, hashing and consensus
- Browse all interactive blockchain courses
Related terms
- Merkle Root — The single hash summarising all transactions in a block.
- Hash Function — A deterministic function mapping arbitrary input to fixed-size output.
More cryptography terms
- Digital Signature — A cryptographic proof that the holder of a private key authorised a message.
- ECDSA — Elliptic Curve Digital Signature Algorithm.
- Private Key — The secret number that authorises spending from an address.
- Public Key — The shareable counterpart to a private key.
- SHA-256 — The hash function Bitcoin uses everywhere.
- Zero-Knowledge Proof — Proving you know something without revealing what it is.
- Schnorr Signature — A signature scheme enabling key aggregation.
- Merkle Proof — Compact proof that a transaction is in a block.
Keep exploring
Continue with the full blockchain glossary — 136 terms in total — or read the developer blog and FAQ for deeper context.