What is Proof of History?

Proof of History is not a consensus mechanism, which is how most people misunderstand it. It is a clock built into the blockchain itself, a way of proving that time has passed between events without anyone needing to communicate to confirm it.

Every major blockchain has a timing problem. Validators spread across the world need to agree not just on which transactions happened, but on the exact order they happened in, and reaching that agreement requires communication. That communication takes time, and that time is what limits throughput. Proof of History removes that bottleneck by making the order provable before consensus even begins.

How a verifiable delay function creates a cryptographic clock

Proof of History is implemented as a Verifiable Delay Function, or VDF, using SHA-256. A SHA-256 hash function runs continuously, taking its own output as the next input, which creates a long chain of hashes where each one depends on the one before it. This sequence can only be produced by running the computation sequentially. You cannot skip ahead or fake it.

Each transaction gets stamped into this chain at a specific point, and the position of that stamp proves when the transaction was submitted relative to every other transaction. Any validator can verify this quickly, but generating the chain itself takes real sequential time, which is what makes it trustworthy.

Why PoH lets validators skip the consensus round trip

On most blockchains, validators need to talk to each other to establish ordering, and that back and forth is slow across a global network where machines sit on different continents. With Proof of History, the ordering is already proven by the hash chain, so validators do not need to discuss it. They receive a block, check its position in the PoH sequence, and immediately know where it sits in time relative to everything else.

This is what allows Solana to produce a new block every 0.4 seconds and process thousands of transactions per second on the base layer. The communication bottleneck simply does not exist in the same way.

PoH plus Proof of Stake: how Solana combines them

Proof of History handles ordering while Proof of Stake handles consensus and security. Solana uses Tower BFT, its own version of Practical Byzantine Fault Tolerance adapted to work with PoH timestamps, where validators vote on blocks using their staked SOL and the PoH clock timestamps those votes, allowing the network to reach finality quickly without extended communication rounds.

Staked SOL acts as the economic security layer. Validators who behave dishonestly can be penalised through slashing, and the more SOL staked across the network, the more expensive it becomes to attack.

Trade-offs: hardware requirements and the centralisation debate

Solana validators need serious hardware, typically multi-core CPUs, NVMe storage, and network connections of around 10 Gbps. This is significantly more demanding than running an Ethereum node, and the reason is throughput. Processing thousands of transactions per second requires real computing power, and Solana's design choice is to push that requirement onto validators rather than limit the network's speed.

The criticism is legitimate. Higher hardware costs mean fewer people can afford to run validators, which concentrates validation among well-funded operators. Ethereum's validator count runs into the hundreds of thousands, while Solana's sits in the low hundreds. Whether that tradeoff is acceptable depends on what you think a blockchain should optimise for, and Solana's answer has always been performance first.

Proof of History and How Solana Achieves High Throughput