Making Byzantine consensus live
From MaRDI portal
Publication:2104036
DOI10.1007/s00446-022-00432-yOpenAlexW4294281180WikidataQ128784492 ScholiaQ128784492MaRDI QIDQ2104036
Alexey Gotsman, Gregory Chockler, Manuel Bravo
Publication date: 9 December 2022
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.04167
Related Items (4)
A case study on parametric verification of failure detectors ⋮ Consensus in Data Management: From Distributed Commit to Blockchain ⋮ Be aware of your leaders ⋮ Making Byzantine consensus live
Cites Work
- Unnamed Item
- Asynchronous byzantine agreement protocols
- Making Byzantine consensus live
- The Heard-Of model: computing in distributed systems with benign faults
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
- Round-by-round fault detectors (extended abstract)
- How to Solve Consensus in the Smallest Window of Synchrony
- Complexity of network synchronization
- Impossibility of distributed consensus with one faulty process
- Dynamic fault-tolerant clock synchronization
- Unreliable failure detectors for reliable distributed systems
- The weakest failure detector for solving consensus
- Early Detection of Message Forwarding Faults
- Correctness of Tendermint-Core Blockchains
- The part-time parliament
- HotStuff
- Timeliness, failure-detectors, and consensus performance
- Tolerating corrupted communication
This page was built for publication: Making Byzantine consensus live
