Consensus in the presence of partial synchrony
By Cynthia Dwork, Nancy A. Lynch, L. Stockmeyer. 1988
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- George Danezis
- Elaine Shi
- Yang Xiao
- Dan Boneh
- Rafael Pass
- Christian Cachin
- Marko Vukolic
- Alberto Sonnino
Citations in the corpus
- Ekiden: A Platform for Confidentiality-Preserving, Trustworthy, and Performant Smart Contracts (2018, positive): “fault tolerant consensus protocol [31].”
- A Vademecum on Blockchain Technologies: When, Which, and How (2019, background): “Networks can be synchronous, asynchronous or partially synchronous [239], [240].”
- Group communication specifications: a comprehensive study (2001, background): “Partial synchrony models [Dwork et al. 1988] capture such network behavior.”
- SoK: Consensus in the Age of Blockchains (2017, background): “Networks may be synchronous or asynchronous, or offer eventual synchrony [36].”
- Efficient Byzantine Fault-Tolerance (2013, background): “It also matches the lower bound for nonsynchronous crash fault tolerance [18].”
- HotStuff: BFT Consensus with Linearity and Responsiveness (2019, background): “The usual synchronization mechanism in the literature [15, 20, 25] is for replicas to increase the count of ∆’s they spend at larger heights, until progress is being made.”
- Tendermint: Byzantine Fault Tolerance in the Age of Blockchains (2016, methodology): “We believe Tendermint achieves a superior design and implementation compared to previous approaches, including that of the classical academic literature [31, 17, 75] as well as Bitcoin [71] and its derivatives [105, 4, 55] by combining the right elements of each to achieve a practical balance of sec”
- SBFT: A Scalable and Decentralized Trust Infrastructure (2018, methodology): “SBFT follows the DLS/Paxos/viewstamp-replication paradigm [33], [49], [53] extended to Byzantine faults that guarantees liveness only when the network is synchronous.”
- The Honey Badger of BFT Protocols (2016, background): “Yet another variation is weak synchrony [26], in which the delay bound is time varying, but eventually does not grow faster than a polynomial function of time [20].”
- The Bitcoin Backbone Protocol: Analysis and Applications (2015, unknown): “…protocol in a static setting when the participants operate in a synchronous communication network (more details below and in Section 2; see also Section 7 for an extension of the analysis to a model with bounded delays [30, 66]) in the presence of an adversary that controls a subset of the players.”
- A Survey of Distributed Consensus Protocols for Blockchain Networks (2019, methodology): “1) DLS Protocol: The same paper [28] also proposes a prototype consensus protocol (called DLS for authors’ namesake) featuring a broadcast primitive for each consensus cycle.”
- Hybrid Consensus: Efficient Consensus in the Permissionless Model (2016, methodology): “Our network model is akin to the standard notion of partial synchrony [23] but not the same.”