LibraryConsensus2018Design paperCorpus record
Solana: A new architecture for a high performance blockchain
Solana. Anatoly Yakovenko.
Yakovenko's design note for a ledger that encodes the passage of time as a verifiable hash chain, called Proof of History, so that validators spend less effort agreeing on order.
Solana's paper bets that a chain can order a firehose of transactions if every node shares a clock, built by hashing the passage of time, and if signature checks are done before the block is agreed.
- Evidence
- Primary paper
- Re-measured
- No
- Assumptions
- 4
- Records linked
- 4
Code
Source, repository, and what is actually hosted
- solana.com white paperhttps://solana.com/solana-whitepaper.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 clock is the product
Proof of History is a verifiable delay function used as a timestamp. A hash chain proves that a duration passed between two events, because the only way to produce it was to compute it in sequence.
Claim 02 · Paper model
Leaders still exist
The clock does not remove block production. A leader, scheduled in rotation, orders transactions and stamps them into the hash sequence. Other nodes verify the sequence instead of trusting the leader's word for time.
Claim 03 · Paper model
Gulf Stream and pipeline are about not waiting
The paper describes forwarding transactions to the expected next leader, and pipelining validation across hardware stages. Throughput in the paper is a pipeline claim, not a consensus theorem standing alone.
Claim 04 · Paper model
Tower BFT sits on the clock
Votes are lockouts that get longer as a node commits. The paper's bet is that a shared notion of time makes those timeouts meaningful. Without the clock, the voting story is an ordinary Byzantine protocol.
Claim 05 · Paper model
Hardware is not a footnote
The architecture assumes fast cores, many threads, and GPUs or equivalent for signature verification. A node that cannot keep the pipeline is not a slower honest node. It is outside the design.
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 clock is the product
Observation
What the study says
Proof of History is a verifiable delay function used as a timestamp. A hash chain proves that a duration passed between two events, because the only way to produce it was to compute it in sequence.
Model
What has to hold
Verifiers can recompute the hash sequence fast enough to keep up. The delay function is only a clock if the verifier's hardware matches the assumption.
Falsifier
What would retire it
Which component orders transactions, and which component only timestamps them?
02 Leaders still exist
Observation
What the study says
The clock does not remove block production. A leader, scheduled in rotation, orders transactions and stamps them into the hash sequence. Other nodes verify the sequence instead of trusting the leader's word for time.
Model
What has to hold
Stake-weighted leader rotation and Tower lockouts are both implemented. One without the other is a partial reading.
Falsifier
What would retire it
Which component orders transactions, and which component only timestamps them?
03 Gulf Stream and pipeline are about not waiting
Observation
What the study says
The paper describes forwarding transactions to the expected next leader, and pipelining validation across hardware stages. Throughput in the paper is a pipeline claim, not a consensus theorem standing alone.
Model
What has to hold
Verifiers can recompute the hash sequence fast enough to keep up. The delay function is only a clock if the verifier's hardware matches the assumption.
Falsifier
What would retire it
How long is a leader's slot, and what happens when the leader is silent?
04 Tower BFT sits on the clock
Observation
What the study says
Votes are lockouts that get longer as a node commits. The paper's bet is that a shared notion of time makes those timeouts meaningful. Without the clock, the voting story is an ordinary Byzantine protocol.
Model
What has to hold
Stake-weighted leader rotation and Tower lockouts are both implemented. One without the other is a partial reading.
Falsifier
What would retire it
Are the paper's throughput numbers labelled as targets or as a current measurement?
05 Hardware is not a footnote
Observation
What the study says
The architecture assumes fast cores, many threads, and GPUs or equivalent for signature verification. A node that cannot keep the pipeline is not a slower honest node. It is outside the design.
Model
What has to hold
Verifiers can recompute the hash sequence fast enough to keep up. The delay function is only a clock if the verifier's hardware matches the assumption.
Falsifier
What would retire it
What hardware class is a verifying node assumed to have?
03 Sequence
One action, as an operating tape
- 01A leader is scheduled for a slot from the stake-weighted rotation.
- 02Transactions arrive, often forwarded ahead of the slot, and are checked for signatures in a parallel stage.
- 03The leader sequences them and mixes their hashes into the ongoing Proof of History chain, so order and time are the same object.
- 04Verifiers recompute enough of the sequence to confirm the leader did not invent the timestamps, and they execute the transactions.
- 05Votes extend lockouts. A block becomes economically hard to reverse as the lockouts stack, under the paper's Tower rules.
04 Load-bearing
The argument, and where a pitch drops it
A clock is not consensus
The cut
Proof of History proves that time passed and that events were ordered inside one leader's sequence. It does not, by itself, decide which leader you should believe if two leaders speak. That decision is the voting protocol. Slides that call the hash chain 'the consensus algorithm' have collapsed two layers.
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 verifiable clock still has a leader who produces it. Censorship and leader rotation are outside the clock.
Throughput figures are scenario figures
The cut
The paper's large transactions-per-second numbers assume a data centre network, batched signatures, and a pipeline that stays full. They are not a measurement of the worst slot on a public network years later. Quote them as design targets of the text, or do not quote them.
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 paper's theoretical discussion of throughput is not a measurement of the live network, and this page will not repeat it as one.
The leader schedule is a centralisation surface
The cut
Rotation spreads the right to order, but the leader of a slot can still censor inside the slot, and a cluster of stake can take many slots. The paper's performance depends on leaders being online and well connected. Liveness and neutrality are operational facts on top of the architecture.
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 verifiable clock still has a leader who produces it. Censorship and leader rotation are outside the clock.
05 Register
What has to be true
Network · Not re-measured
Verifiers can recompute the hash sequence fast enough to keep up. The delay function is only a clock if the verifier's hardware matches the assumption.
Network · Not re-measured
Network delay is small relative to slot time, in the data-centre sense the paper uses.
Stake and threshold · Not re-measured
Stake-weighted leader rotation and Tower lockouts are both implemented. One without the other is a partial reading.
Model · Not re-measured
Users tolerate a node set that looks more like a cluster than a laptop swarm.
06 Divergence
What happened after the paper
The live Solana network added, changed and tuned runtime details — Gulf Stream, QUIC delivery, local fee markets, and several scheduler revisions — after this architecture paper. Outages and fixes belong to that history. They are not pages of the 2018 text, and they also mean the paper is not a status report.
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
In a usual BFT network, nodes spend messages establishing what happened before what. The paper's claim is that a hash chain, produced by a sequencer and checked by everyone else, can carry a lower bound on time between events before consensus starts.
What the design proposes
How the mechanism is specified
- A verifier recomputes hashes from the claimed starting point. Gaps in the chain imply time passed.
- Leaders, voting and data propagation are separate moving parts. PoH does not make them honest.
- Later production choices — Turbine, Gulf Stream, local fee markets — are not this PDF.
What this page does not treat as proven
- The paper's theoretical discussion of throughput is not a measurement of the live network, and this page will not repeat it as one.
- A verifiable clock still has a leader who produces it. Censorship and leader rotation are outside the clock.
- Hardware assumptions in the note are assumptions. They are not a requirement we are imposing on any reader.
Why the desk still reads it
The useful separation is clock versus consensus. A venture that needs ordered events from machines should say which component is a proof of elapsed time and which component is an agreement that the events were valid.
09 Lexicon
Terms, opened into the record
- Proof of History
- A sequential hash chain that acts as a clock. Checking it shows that a stretch of time and an order of events occurred.
- Leader schedule
- The stake-weighted roster of who may produce the sequence in each slot.
- Tower BFT
- The voting rule that stacks increasing lockouts so a node cannot cheaply change an old vote.
- Pipeline
- Overlapping signature checks, execution and broadcast so a core is not idle while the network waits.
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.