Compare
Four documents, the same five questions.
No throughput league table and no yield. The cells are what this library is willing to say about the text.
| Question | Fast Merkle Trees |
|---|---|
| What the text proposes | BIP 98, Fast Merkle Trees. In many applications it is useful to prove membership of a data element in a set without having to reveal the entire contents of that set. |
| Who may write | Mark Friedenbach |
| What is settled | In many applications it is useful to prove membership of a data element in a set without having to reveal the entire contents of that set. |
| Load-bearing assumption | A soft fork does not bind a node that never upgrades. It binds the nodes that enforce the new rejection. |
| What this library says afterwards | Status in the source: Draft. A reading of the public specification, not a copy of it and not a certification. |
| Rights | Official external source only |