#web3 #computer-science #analogy Created at 2023-01-25 # [Anonymous feedback](https://www.admonymous.co/louis030195) # [[Epistemic status]] #shower-thought Last modified date: 2023-01-25 Commit: 0 # Related - [[Computing/Proof of stake]] - [[Computing/Proof of work]] - [[Computing/Web3/Blockchain]] - [[Computing/Intelligence/AI on the blockchain]] - [[Computing/Architecture]] # TODO > [!TODO] TODO # Proof of history >This paper proposes a new blockchain architecture based on Proof of History (PoH) - a proof for verifying order and passage of time between events. PoH is used to encode trustless passage of time into a ledger - an append only data structure. When used alongside a consensus algorithm such as Proof of Work (PoW) or Proof of Stake (PoS), PoH can reduce messaging overhead in a Byzantine Fault Tolerant replicated state machine, resulting inn sub-second finality times. This paper also proposes two algorithms that leverage the time keeping properties of the PoH ledger - a PoS algorithm that can recover from partitions of any size and an efficient streaming Proof of Replication (PoRep). The combination of PoRep and PoH provides a defense against forgery of the ledger with respect to time (ordering) and storage. The protocol is analyzed on a 1 gbps network, and this paper shows that throughput up to 710k transactions per second is possible with todays hardware. Akin to a clock that encodes trustless passage of time into a ledger. Just as a clock is used to keep track of the time of day, PoH is used to keep track of the order and passage of time between events in a ledger.