Solana: A new architecture for a high performance blockchain

The problem the paper 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

• Proof of History is a sequential hash. Checking it can be parallel; producing it cannot.
• The clock is an input to consensus, not a replacement for voting. The paper pairs it with a consensus algorithm.
• The text is explicit that it is a design for comment, not an offer of tokens.

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 a venture studio 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.