Why MMR?
| Feature | Standard Merkle Tree | MMR |
|---|---|---|
| Append | Requires rebuild | O(log n) |
| Proof size | O(log n) | O(log n) |
| Append-only | No | Yes |
| Streaming | No | Yes |
How It Works
Inclusion Proof
To prove receipt R3 is in the MMR, you need:- R3’s hash (the leaf)
- R4’s hash (sibling)
- Node 3’s hash (uncle)
- Node 14’s hash (uncle)
.png?fit=max&auto=format&n=VsjUqn6fLqEhBiuI&q=85&s=8b4c7e6431e9a6af1ef23b77bb4ff5fd)
.png?fit=max&auto=format&n=VsjUqn6fLqEhBiuI&q=85&s=d5651a45e4bfbabc33f74e146af3f94a)