Proof-of-History (PoH)

Proof-of-History (PoH) is a method for recording the order and timing of events on a blockchain by running a long chain of hash calculations, each one taking the previous result as its input. Because the calculations must be done one after another and cannot be done in parallel, the length of the chain acts as a cryptographic clock: anyone can check that a certain amount of computation, and therefore time, separated two events. PoH is best known as a core component of Solana.

PoH was described in Solana's 2017 whitepaper by its founder, Anatoly Yakovenko. Despite its name, it is not a consensus mechanism on its own. Solana reaches agreement through a proof-of-stake system, called Tower BFT, in which validators vote on blocks. PoH supplies a shared ordering of transactions that makes this voting faster and helps the network achieve high throughput.

Imagine a person who counts aloud, one number per second, without stopping, and writes down the current number each time something happens: "letter arrived at 1,204", "phone rang at 1,377". Later, anyone reading the notes knows the order of events and roughly how far apart they were, without needing a wall clock that everyone agrees on.

Proof-of-History does the counting with a computer, using a hash function so that each "number" can only be produced after the previous one. Other computers can then check the count far more quickly than it took to produce, because checking can be split among many processors while producing cannot.

A designated leader runs a sequential hash chain using the SHA256 function, in which each new value is the hash of the one before:

• $h_{n}$ is the hash at step $n$ of the sequence.
• $h_{n-1}$ is the hash produced at the previous step.
• When a transaction arrives, its data is mixed into the next step, so the transaction is fixed at that position in the sequence.

For example, if a transaction is mixed in at step 1,000,000 and another at step 1,400,000, the 400,000 sequential hashes between them prove that the first came before the second and that a measurable amount of time passed. Validators can verify the 400,000 steps in parallel by splitting them into chunks, since each chunk's start and end values are already recorded.

• Leader schedule. Validators take turns as leader according to a schedule based on stake. The leader orders incoming transactions within the PoH sequence and streams blocks to the network.
• Faster voting. Because validators share a trusted sense of time, they can vote and apply time-outs without waiting for many rounds of messages, which reduces communication overhead.
• Throughput. Combined with parallel transaction processing, the design supports high transactions per second and short block intervals, measured in hundreds of milliseconds.

PoH has been part of Solana since its main network went live in beta in March 2020. Each leader keeps its PoH generator running continuously, even when there are no transactions, so the clock never stops; empty stretches simply show up as runs of hashes with nothing mixed in. When leadership passes to the next validator in the schedule, the new leader continues from the last recorded value, so the sequence is unbroken across the whole chain. If a leader goes offline, the gap in its expected output is visible to everyone, and the network moves on to the next scheduled leader. This design helps Solana operate as a single, fast layer-1 blockchain rather than relying on separate scaling layers.

In Bitcoin, timing comes loosely from block timestamps and the steady rate of proof of work, and nodes rely on the longest chain to settle order. Many proof-of-stake networks rely on synchronised clocks and multiple message rounds. PoH replaces some of that coordination with a verifiable sequence. It is related to research on verifiable delay functions and to the broader idea of proof of time, although PoH's verification relies on parallel re-computation rather than a short mathematical proof.

Critics note that PoH's speed depends on powerful validator hardware and high bandwidth, which raises the cost of running a node and may concentrate validation among well-resourced operators. Solana suffered several network outages and slowdowns in 2021 and 2022, though these were mostly attributed to software bugs and transaction spam rather than to PoH itself. Some researchers argue that PoH adds complexity without being essential to fast consensus. In 2025, Solana developers proposed a new consensus design, Alpenglow, intended to replace Tower BFT and reduce the network's reliance on PoH for consensus, showing that the role of PoH in the protocol continues to evolve. Related scaling ideas are covered under Byzantine fault tolerance.