LibraryConsensus2017Design paperCorpus record
Snow White: Robustly Reconfigurable Consensus
Snow White. Phil Daian, Rafael Pass and Elaine Shi.
A proof-of-stake design in the sleepy model: honest nodes may be offline, and the set of stakeholders can change. It is an academic predecessor, not Cardano and not Ethereum.
Snow White is a proof-of-stake protocol in the sleepy model: honest stakeholders may be offline, and the eligible set changes, without treating every sleeping honest node as an attacker.
- Evidence
- Primary paper
- Re-measured
- No
- Assumptions
- 4
- Records linked
- 12
Code
Source, repository, and what is actually hosted
- ePrint 2016/919https://eprint.iacr.org/2016/919
- 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
Sleep is not corruption
Nakamoto-style arguments often need honest participants to be awake and mining. Snow White's model allows honest keys to be offline and still counts the adversary only among the corrupt, not among the asleep.
Claim 02 · Paper model
The committee changes
Stake moves. The protocol has to decide which old keys can still speak, and for how long, so a sold key cannot rule the present.
Claim 03 · Paper model
It is still a chain
The fork choice is in the longest-chain family over eligible blocks. This is not a BFT quorum and not Ouroboros's slot lottery, though it is part of the same conversation.
Claim 04 · Paper model
No product is attached
There is no delegation market, no liquid staking receipt, and no wallet in the paper. Those are later economic objects with their own failures.
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 Sleep is not corruption
Observation
What the study says
Nakamoto-style arguments often need honest participants to be awake and mining. Snow White's model allows honest keys to be offline and still counts the adversary only among the corrupt, not among the asleep.
Model
What has to hold
Corrupt stake is below the paper's threshold relative to awake honest stake, not relative to all coins ever issued.
Falsifier
What would retire it
Are offline honest holders treated as absent or as faulty?
02 The committee changes
Observation
What the study says
Stake moves. The protocol has to decide which old keys can still speak, and for how long, so a sold key cannot rule the present.
Model
What has to hold
Corrupt stake is below the paper's threshold relative to awake honest stake, not relative to all coins ever issued.
Falsifier
What would retire it
When does an old key lose eligibility?
03 It is still a chain
Observation
What the study says
The fork choice is in the longest-chain family over eligible blocks. This is not a BFT quorum and not Ouroboros's slot lottery, though it is part of the same conversation.
Model
What has to hold
Honest nodes that are awake follow the fork choice. Strategic silence is outside the basic claim.
Falsifier
What would retire it
Is the fork choice longest-chain or a quorum?
04 No product is attached
Observation
What the study says
There is no delegation market, no liquid staking receipt, and no wallet in the paper. Those are later economic objects with their own failures.
Model
What has to hold
Corrupt stake is below the paper's threshold relative to awake honest stake, not relative to all coins ever issued.
Falsifier
What would retire it
Is the fork choice longest-chain or a quorum?
03 Sequence
One action, as an operating tape
- 01Stakeholders register stake under the reconfiguration rule.
- 02Eligible leaders for an epoch are determined from that stake and from randomness the adversary should not freely grind.
- 03An eligible leader who is awake publishes a block extending the chain they adopt.
- 04Nodes apply the fork choice to eligible blocks they have seen.
- 05A later epoch refreshes eligibility so old stake loses its voice on the schedule the paper defines.
04 Load-bearing
The argument, and where a pitch drops it
The model is the result
The cut
The contribution is a security statement that does not pretend every honest holder is online. A chain that copies a staking sentence and then assumes full participation has not used the theorem.
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
Do not cite Snow White as the consensus of any chain that merely uses the words proof of stake.
Reconfiguration is where stake protocols lie
The cut
If yesterday's keys can still sign today's blocks without bound, the present stake does not govern. Snow White is one attempt to cut that off. The cutoff has to be real in the client, not only in the paper.
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
Do not cite Snow White as the consensus of any chain that merely uses the words proof of stake.
05 Register
What has to be true
Stake and threshold · Not re-measured
Corrupt stake is below the paper's threshold relative to awake honest stake, not relative to all coins ever issued.
Cryptography · Not re-measured
Randomness used for eligibility is not cheaply grindable by the adversary.
Adversary · Not re-measured
Honest nodes that are awake follow the fork choice. Strategic silence is outside the basic claim.
Network · Not re-measured
Network delay sits inside the model's bound during the periods the proof uses.
06 Divergence
What happened after the paper
Snow White sits in the 2016–2017 cluster of proof-of-stake papers with Ouroboros, Algorand, and Thunderella. None of them is the specification of Ethereum, Cardano, or Solana. It remains the citation for the sleepy assumption, which most investor decks skip.
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
Nakamoto's protocol assumes honest hash power is awake and racing. Proof of stake needs a committee drawn from a changing set of keys, some of which are asleep, without letting an old committee rewrite the present.
What the design proposes
- A sleepy execution model. Offline honest nodes are not counted as corrupt.
- Periodic reconfiguration of who may produce blocks.
- A longest-chain style rule over blocks from the eligible set.
How the mechanism is specified
- Eligibility is determined from stake and randomness that an adversary should not grind freely.
- The security statement is about corrupt stake versus awake honest stake, inside the model's delay bound.
- Nothing in the paper is a wallet, a delegation market, or a fee rule.
What this page does not treat as proven
- Do not cite Snow White as the consensus of any chain that merely uses the words proof of stake.
- Sleepiness is an assumption about honest users, not a feature you can bolt on after measuring uptime.
- The paper does not analyse liquid staking or exchange custody of keys.
Why the desk still reads it
Ask which honest participants are allowed to be offline before the theorem stops applying. Most production decks never answer.
09 Lexicon
Terms, opened into the record
- Sleepy model
- Honest participants may be offline without being counted as attackers.
- Reconfiguration
- The scheduled change in which stake is allowed to produce blocks.
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.