LibraryScaling2018Design paperCorpus record
Verkle Trees
Verkle trees. John Kuszmaul.
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.
A reading of the public document. Not a copy of it, and not a claim about a later network that reused the name.
A stateless-client pitch should say whether the proof is a Merkle sibling list or a Verkle opening, and what setup that requires.
- Evidence
- Primary paper
- Re-measured
- No
- Assumptions
- 3
- Records linked
- 2
Code
Source, repository, and what is actually hosted
- Kuszmaulhttps://math.mit.edu/research/highschool/primes/materials/2018/Kuszmaul.pdf
- The source URL is not a GitHub repository. No code remote is invented.
- Full text is not mirrored. Public availability is not a licence to copy the file onto this site.
- Add to a reading list
01 Claim ledger
What the paper is allowed to say
Each row is a sentence already in the study. The status is the same on every row: a model claim, not a live measurement.
Claim 01 · Paper model
The defect
A Merkle proof of a piece of state grows with the width of the tree. A stateless client that needs many proofs spends its bandwidth on sibling hashes.
Claim 02 · Paper model
The rule
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.
Claim 03 · Paper model
How it is put together
Width can be large because the proof does not carry every sibling. The commitment is not a simple hash. Stateless validation is the reason to care.
Claim 04 · Paper model
Where the claim stops
The thesis is not an Ethereum specification.
02 Three cuts
Observation, model, falsifier
A desk does not stop at the summary. Each claim is cut three ways, using only this study's own assumptions and checks. Nothing here is a new figure.
01 The defect
Observation
What the study says
A Merkle proof of a piece of state grows with the width of the tree. A stateless client that needs many proofs spends its bandwidth on sibling hashes.
Model
What has to hold
Shorter proofs do not remove the need for the data to exist.
Falsifier
What would retire it
How wide is a node?
02 The rule
Observation
What the study says
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.
Model
What has to hold
Shorter proofs do not remove the need for the data to exist.
Falsifier
What would retire it
What commitment opens a child?
03 How it is put together
Observation
What the study says
Width can be large because the proof does not carry every sibling. The commitment is not a simple hash. Stateless validation is the reason to care.
Falsifier
What would retire it
What commitment opens a child?
04 Where the claim stops
03 Sequence
One action, as an operating tape
- 01Commit to a wide node with a vector commitment.
- 02A proof shows the path of commitments down to the leaf.
- 03The verifier checks openings rather than hashing siblings.
- 04How wide is a node?
04 Load-bearing
The argument, and where a pitch drops it
Why it is still on the desk
The cut
A stateless-client pitch should say whether the proof is a Merkle sibling list or a Verkle opening, and what setup that requires.
Why it carries weight
If this cut is skipped, the paper's name is being used without the mechanism that makes the name mean anything.
Where it is dropped
A later client, parameter or reward formula is a different object from this paragraph.
After the text
The cut
Ethereum research adopted Verkle trees as a proposed state structure. Shipping is a later decision.
Why it carries weight
If this cut is skipped, the paper's name is being used without the mechanism that makes the name mean anything.
Where it is dropped
The thesis is not an Ethereum specification.
05 Register
What has to be true
06 Divergence
What happened after the paper
Ethereum research adopted Verkle trees as a proposed state structure. Shipping is a later decision.
A later client, parameter set, or reward formula is a different object. Cite this paper for the mechanism. Cite a primary release for the network. This desk has not re-run the proof.
07 Pre-mortem
What to check before you use the idea
- 0 of 3 marked on this browser. A mark is a reading note, not a pass, a rating, or a recommendation.
08 Anatomy
The paper, in the order a builder needs
The problem it names
A Merkle proof of a piece of state grows with the width of the tree. A stateless client that needs many proofs spends its bandwidth on sibling hashes.
What the design proposes
- Width can be large because the proof does not carry every sibling.
- The commitment is not a simple hash.
- Stateless validation is the reason to care.
How the mechanism is specified
- Commit to a wide node with a vector commitment.
- A proof shows the path of commitments down to the leaf.
- The verifier checks openings rather than hashing siblings.
What this page does not treat as proven
Why the desk still reads it
A stateless-client pitch should say whether the proof is a Merkle sibling list or a Verkle opening, and what setup that requires.
09 Lexicon
Terms, opened into the record
- Vector commitment
- A commitment to a list that can open one index.
- Stateless client
- A verifier that checks a block from a proof, without storing all state.
10 Repository
Every linked record on this page
Underlined words open a page that already exists: a concept, a protocol profile, a failure record, or another paper. If a word is not underlined, this desk does not have a record for it.
This is Blockchain Lab's reading of a public design paper. It is not the paper, not a copy of it, and not an offer of tokens, equity, custody or a partnership. Later network behaviour can diverge from the text. Nothing here is investment, legal or technical advice.
Research status: Design paper. Last reviewed: 1 October 2026. This is a reading of a public paper, not investment, legal or security advice.