Different Perspectives on FLP Impossibility
Distributed, Parallel, and Cluster Computing
2025-01-29 v9
Abstract
We demonstrate termination of binary consensus under the model and conditions used by Fischer, Lynch, and Patterson (FLP) to prove impossibility of binary agreement - in complete asynchrony and a possible process crash - in two steps. First, we introduce a new paradigm for consensus termination and show that impossibility of agreement is not evidence for impossibility to terminate. Next, we present a consensus algorithm that ensures termination with agreement about the initial input from the processes.
Keywords
Cite
@article{arxiv.2210.02695,
title = {Different Perspectives on FLP Impossibility},
author = {Ivan Klianev},
journal= {arXiv preprint arXiv:2210.02695},
year = {2025}
}