Merkle Tree Explorer
Understand how Bitcoin efficiently verifies transactions using Merkle trees. Build trees, generate proofs, and verify transactions with SPV (Simplified Payment Verification).
Transactions
Alice sends 10 BTC to Bob
Bob sends 5 BTC to Charlie
Charlie sends 3 BTC to Dave
Dave sends 2 BTC to Eve
SPV Verification
Merkle Tree Visualization
Add transactions and click "Build Merkle Tree" to visualize
How Merkle Trees Work
Tree Construction
- • Hash each transaction (leaf nodes)
- • Pair and hash nodes to create parent
- • Repeat until single root remains
- • Root represents entire transaction set
SPV Benefits
- • Verify transactions without full blockchain
- • Proof size: O(log n) instead of O(n)
- • Enables lightweight Bitcoin clients
- • Secure verification with minimal data
Key Insight: Merkle trees allow Bitcoin nodes to prove a transaction is included in a block by providing only a small proof path, not the entire block.