Fast Deterministically Safe Proof-of-Work Consensus
Ali Farahbakhsh, Giuliano Losa, Youer Pu, Lorenzo Alvisi, Ittay Eyal

TL;DR
This paper introduces Sieve-MMR, a permissionless blockchain protocol that combines proof-of-work with deterministic security and constant latency, effectively preventing long-range and time-travel attacks without external mechanisms.
Contribution
It adapts a proof-of-stake protocol (MMR) to proof-of-work, creating a fully-permissionless, deterministic, and low-latency consensus protocol resistant to advanced attacks.
Findings
Achieves deterministic security with constant expected latency.
Introduces time-travel-resilient broadcast (TTRB) primitive.
Resists long-range and time-travel attacks effectively.
Abstract
Permissionless blockchains achieve consensus while allowing unknown nodes to join and leave the system at any time. They typically come in two flavors: proof of work (PoW) and proof of stake (PoS), and both are vulnerable to attacks. PoS protocols suffer from long-range attacks, wherein attackers alter execution history at little cost, and PoW protocols are vulnerable to attackers with enough computational power to subvert execution history. PoS protocols respond by relying on external mechanisms like social consensus; PoW protocols either fall back to probabilistic guarantees, or are slow. We present Sieve-MMR, the first fully-permissionless protocol with deterministic security and constant expected latency that does not rely on external mechanisms. We obtain Sieve-MMR by porting a PoS protocol (MMR) to the PoW setting. From MMR we inherit constant expected latency and deterministic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Blockchain Technology Applications and Security · Opportunistic and Delay-Tolerant Networks
