Revisiting Fast Practical Byzantine Fault Tolerance
arXiv:1712.01367
Abstract
In this note, we observe a safety violation in Zyzzyva and a liveness violation in FaB. To demonstrate these issues, we require relatively simple scenarios, involving only four replicas, and one or two view changes. In all of them, the problem is manifested already in the first log slot.
Cited by in corpus (5)
- The Consensus Number of a Cryptocurrency (Extended Version)
- Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics
- No Need for Recovery: A Simple Two-Step Byzantine Consensus
- Can 100 Machines Agree?
- Que Sera Consensus: Simple Asynchronous Agreement with Private Coins and Threshold Logical Clocks