Build a hash tree and explore proof verification
Leaves: 0
Tree height: 0
Proof size: 0 hashes (O(log n))
vs full data: 0 items (O(n))
1. Add leaves (transaction data)
2. Click a leaf to highlight its proof path
3. Double-click a leaf to tamper with it