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 | Verkle Trees |
|---|---|
| What the text proposes | Verkle trees use vector commitments so a proof of many leaves shares one commitment path. The proof is shorter, at the cost of a polynomial-commitment assumption. |
| Who may write | John Kuszmaul |
| What is settled | Width can be large because the proof does not carry every sibling. |
| Load-bearing assumption | The thesis is not an Ethereum specification. |
| What this library says afterwards | A reading of the public document. Not a copy of it, and not a claim about a later network that reused the name. |
| Rights | Official external source only |