DeepAI AI Chat
Log In Sign Up

Nakamoto Consensus with Verifiable Delay Puzzle

by   Jieyi Long, et al.
Theta Labs

This technical report summarizes our work-in-progress on a new consensus protocol based on verifiable delay function. First, we introduce the concept of verifiable delay puzzle (VDP), which resembles the hashing puzzle used in the PoW mechanism but can only be solved sequentially. We then present a VDP implementation based on Pietrzak's verifiable delay function. Further, we show that VDP can be combined with the Nakamoto consensus in a proof-of-stake protocol. We analyze the safety and liveness of the protocol, and show that compared to PoW, our proposal consumes much less energy; compared to BFT based consensus algorithms which usually place an upper limit on the number of consensus nodes, our proposal is much more scalable and can thus achieve a higher level of decentralization.


page 1

page 2

page 3

page 4


Analysis of the XRP Ledger Consensus Protocol

The XRP Ledger Consensus Protocol is a previously developed consensus pr...

Verification of Eventual Consensus in Synod Using a Failure-Aware Actor Model

Successfully attaining consensus in the absence of a centralized coordin...

A Blockchain Consensus Protocol Based on Dedicated Time-Memory-Data Trade-Off

A problem of developing the consensus protocols in public blockchain sys...

ProPoS: A Probabilistic Proof-of-Stake Protocol

We present ProPoS, a Proof-of-Stake protocol dedicated, but not limited,...

Selfish Behavior in the Tezos Proof-of-Stake Protocol

Proof-of-Stake consensus protocols give rise to complex modeling challen...

HotPoW: Finality from Proof-of-Work Quorums

We build a bridge between the notions of Byzantine and Nakamoto consensu...