REVIEW 1 cited by
Nakamoto Consensus with Verifiable Delay Puzzle
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
This paper presents 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 the continuous verifiable delay function. Further, we show that VDP can be combined with the Nakamoto consensus in a proof-of-stake/proof-of-delay hybrid protocol. We analyze the persistence and liveness of the protocol, and show that compared to PoW, our proposal consumes much less energy; compared to BFT leader-election based consensus algorithms, our proposal achieves better resistance to long-range attacks and DoS attacks targeting the block proposers.
Forward citations
Cited by 1 Pith paper
-
Fast Deterministically Safe Proof-of-Work Consensus
Sieve-MMR is a proof-of-work consensus protocol that achieves deterministic safety and constant expected latency in a fully permissionless model by layering MMR on a new time-travel-resilient broadcast primitive called Sieve.
Discussion (0). Sign in to comment.