LibraryConsensus2017Design paperCorpus record
Thunderella: Blockchains with Optimistic Instant Confirmation
Thunderella. Rafael Pass and Elaine Shi.
A fast path and a slow path. If a large supermajority is honest and an accelerator proposes quickly, transactions confirm at network speed. If not, the protocol falls back to an underlying chain.
Thunderella confirms quickly only while a large supermajority and an accelerator behave. When that fails, it falls back to a slower underlying chain. The fast path is not the security bound.
- Evidence
- Primary paper
- Re-measured
- No
- Assumptions
- 4
- Records linked
- 5
Code
Source, repository, and what is actually hosted
- ePrint 2017/454https://eprint.iacr.org/2017/454
- 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
Two modes
The optimistic path needs more than three quarters honest and a live accelerator. The fallback is a conventional chain that keeps moving when the fast path cannot.
Claim 02 · Paper model
Instant means one round trip
Under those assumptions, a transaction can be acknowledged as fast as the committee can sign. That is a network-speed claim, not a claim about a user's wallet, a bridge, or a court.
Claim 03 · Paper model
The timeout is the design
Something has to notice that the fast path has stalled and switch. A product diagram that omits the switch has omitted the protocol.
Claim 04 · Paper model
Not Avalanche, not Tendermint
Avalanche samples. Tendermint commits with a two-thirds quorum in one mode. Thunderella's contribution is the pairing of an optimistic committee with a pessimistic chain.
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 Two modes
Observation
What the study says
The optimistic path needs more than three quarters honest and a live accelerator. The fallback is a conventional chain that keeps moving when the fast path cannot.
Model
What has to hold
The accelerator is live during optimistic periods. A censored accelerator is a fallback event, not a fatal bug, if the fallback exists.
Falsifier
What would retire it
What fraction must be honest on the fast path?
02 Instant means one round trip
Observation
What the study says
Under those assumptions, a transaction can be acknowledged as fast as the committee can sign. That is a network-speed claim, not a claim about a user's wallet, a bridge, or a court.
Model
What has to hold
Timeouts match real delay. A short timeout falls back forever. A long one stalls the optimistic claim.
Falsifier
What would retire it
What is the underlying chain, and when is it used?
03 The timeout is the design
Observation
What the study says
Something has to notice that the fast path has stalled and switch. A product diagram that omits the switch has omitted the protocol.
Model
What has to hold
Timeouts match real delay. A short timeout falls back forever. A long one stalls the optimistic claim.
Falsifier
What would retire it
How long is the timeout that triggers fallback?
04 Not Avalanche, not Tendermint
Observation
What the study says
Avalanche samples. Tendermint commits with a two-thirds quorum in one mode. Thunderella's contribution is the pairing of an optimistic committee with a pessimistic chain.
Model
What has to hold
The accelerator is live during optimistic periods. A censored accelerator is a fallback event, not a fatal bug, if the fallback exists.
Falsifier
What would retire it
What is the underlying chain, and when is it used?
03 Sequence
One action, as an operating tape
- 01A user sends a transaction to the accelerator.
- 02The accelerator proposes it to the committee.
- 03If more than three quarters acknowledge, the transaction is confirmed on the fast path.
- 04If acknowledgements do not arrive before the timeout, nodes stop treating the fast path as live.
- 05The underlying chain orders transactions and the protocol uses it to resume or to punish, on the paper's rules.
04 Load-bearing
The argument, and where a pitch drops it
Optimism is an assumption you can leave
The cut
The interesting failure is not a slow network. It is a committee that is only two-thirds honest, which would be enough for ordinary BFT and is not enough for this fast path. The fallback exists for that case.
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 optimistic committee is not a marketing 'instant finality' badge.
Instant confirmation is easy to fake in a demo
The cut
A leader and a few servers can always acknowledge quickly. Thunderella's content is the condition under which that acknowledgement is safe, and the path that remains when the condition is false.
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.
05 Register
What has to be true
Stake and threshold · Not re-measured
The fast path's honesty threshold is met. Below it, only the fallback is supposed to be safe.
Model · Not re-measured
The accelerator is live during optimistic periods. A censored accelerator is a fallback event, not a fatal bug, if the fallback exists.
Model · Not re-measured
The underlying chain has its own security assumption, which still has to be true.
Network · Not re-measured
Timeouts match real delay. A short timeout falls back forever. A long one stalls the optimistic claim.
06 Divergence
What happened after the paper
Thunderella influenced how researchers talk about optimistic fast paths. It did not become a household network. Production chains that say instant finality usually mean a single BFT mode, which is a different bet: no fallback, because the quorum assumption is supposed to hold all the time.
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 4 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
Standard Nakamoto confirmation is slow because it has to tolerate a worst-case adversary all the time. Thunderella asks for instant confirmation only in the optimistic case, with a conservative chain underneath.
What the design proposes
- An accelerator proposes.
- A committee of more than three quarters acknowledges.
- A fallback chain records enough to punish or to resume when the fast path fails.
How the mechanism is specified
- The fast path is safe only under the larger honesty assumption. It is not the same bound as ordinary BFT.
- A timeout moves the system onto the slow path. That timeout is the product decision hiding inside the paper.
- Instant means one round trip under those assumptions, not a guarantee about a live deployment.
What this page does not treat as proven
- The optimistic committee is not a marketing 'instant finality' badge.
- Fallback has to be specified. A diagram with only the fast path is incomplete.
- The paper is not Avalanche and not Tendermint.
Why the desk still reads it
Make the team point at the fallback. If they cannot say what confirms when the accelerator is censored, they have a demo.
09 Lexicon
Terms, opened into the record
- Accelerator
- The proposer the fast path relies on. If it is silent or corrupt, the protocol is supposed to leave the fast path.
- Fallback
- The slower chain that remains live when the optimistic committee does not.
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.
Protocols
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.
