The authors resolve the contradiction between deterministic crash-tolerant consensus in a fully asynchronous environment and the FLP impossibility result by demonstrating that one protocol phase separates their findings.
The authors present a new perspective on the FLP impossibility result and provide a novel algorithm for multiple crash faults.
Keywords
Before reading this…
Applications
- →Distributed systems
- →Blockchain
To understand this paper, make sure you know these concepts first:
- Distributed consensus algorithmsfind papers →
- Formal reasoningfind papers →
Abstract
More Like ThisIn this paper, we resolve the apparent contradiction between the proven possibility of deterministic crash-tolerant consensus in a fully asynchronous environment and the reconfirmation of the FLP impossibility result by Attiya, Castañeda, and Rajsbaum. With the use of a strictly formal framework that extends their reasoning, we close this fundamental gap in theory. Specifically, we demonstrate that a single protocol phase separates their findings from reaching the exact opposite conclusion. Another important outcome is a novel algorithm with ability to tolerate multiple crash faults. We provide a rigorous, strictly formal proof of correctness to validate our results.