Sheela
Sheela
Home
Add
Questions
Thinkers
Claims
People
Concepts
Jargon
Sources
Health
Predictions
Collections
Domain Landscape
Contribute
Review
Dedup
Topic requests
Settings
Help

← Jargon

Jargontechnology· 4 claims· 1 episode

Proof of History

Solana's sequential hash chain that acts as a verifiable clock, letting nodes agree on elapsed time without constant communication.

As defined in Solana: Faster, Cheaper, More Scalable


Where it comes up · 1
  • Solana: Faster, Cheaper, More Scalable4 claims

Most important claims · 4 of 4Search all claims for “Proof of History” →
  • Because of the speed of light traveling around the planet, global consensus blocks cannot realistically be produced faster than about 150 to 200 milliseconds, which forces systems to decouple time from communication.Solana: Faster, Cheaper, More Scalable
  • In Solana, every node counts hashes locally, so after about a million hashes (roughly 400 milliseconds) leadership rotates, and a non-responding leader is skipped automatically without any shared clock being maintained.Solana: Faster, Cheaper, More Scalable
  • Solana's ability to run parallel execution comes from an execution-layer design choice rooted in its team's high-performance and distributed systems background, not from its consensus algorithm or proof of history.Solana: Faster, Cheaper, More Scalable
  • Proof of history is not a consensus algorithm but a sequential hashing process that gives each node a verifiable passage of time, allowing the network to order transactions and rotate leaders without all nodes communicating in real time.Solana: Faster, Cheaper, More Scalable