Consensus on demand

DOI10.1007/978-3-031-21017-4_20MaRDI QIDQ6155257zbMATH OpenFDO

Authors Jakub Sliwinski, Yann Vonlanthen, Roger Wattenhofer

Publication date 12 June 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2202.03756

zbMATH Keywords

blockchainconsensuscryptocurrencyfault tolerancereliable broadcast

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Cryptography (94A60)

Abstract: Digital money can be implemented efficiently by avoiding consensus. However, no-consensus implementations have drawbacks, as they cannot support smart contracts, and (even more fundamentally) they cannot deal with conflicting transactions. We present a novel protocol that combines the benefits of an asynchronous, broadcast-based digital currency, with the capacity to perform consensus. This is achieved by selectively performing consensus a posteriori, i.e., only when absolutely necessary. Our on-demand consensus comes at the price of restricting the Byzantine participants to be less than a one-fifth minority in the system, which is the optimal threshold. We formally prove the correctness of our system and present an open-source implementation, which inherits many features from the Ethereum ecosystem.

Recommendations

• The consensus number of a cryptocurrency
• Consensus from signatures of work
• Hybrid consensus: efficient consensus in the permissionless model
• SoK: a consensus taxonomy in the blockchain era
• Permissionless consensus in the resource model

Cites work

• Asynchronous byzantine agreement protocols
• Asynchronous consensus and broadcast protocols
• Bosco: One-Step Byzantine Asynchronous Consensus
• Clairvoyant state machine replication
• Generalized Paxos made Byzantine (and less complex)
• HotStuff
• Lower bounds for asynchronous consensus
• Money transfer made simple: a specification, a generic algorithm, and its proof
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• Replicated data types, specification, verification, optimality
• The Consensus Number of a Cryptocurrency

Cited in

(3)

• De Finettian consensus
• scientific article; zbMATH DE number 2079342 (Why is no real title available?)
• The Consensus Number of a Cryptocurrency

This page was built for publication: Consensus on demand

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155257)