DeepAI AI Chat
Log In Sign Up

Different Perspectives on FLP Impossibility

by   Ivan Klianev, et al.

We demonstrate possibility for vector consensus under the model and conditions used by Fischer, Lynch, and Patterson (FLP) to prove impossibility of binary consensus - full asynchrony and one faulty process. Under that model, we also demonstrate that with any binary consensus protocol: i) binary outcome is produced from a vector value; ii) elaboration on a vector value is an unavoidable necessity; and iii) binary agreement can be reached with voting on a vector value. Key finding: the FLP impossibility result is about impossibility to produce a binary value from any allowed vector value, i.e., from any data set assembled from an allowed initial state.


page 1

page 2

page 3

page 4


Multidimensional Byzantine Agreement in a Synchronous Setting

In this paper we will present the Multidimensional Byzantine Agreement (...

Byzantine Fault Tolerant Vector Consensus with Anonymous Proposals

In this paper, we introduce the anonymous proposer vector consensus prob...

MOPaC: The Multiple Offers Protocol for Multilateral Negotiations with Partial Consensus

Existing protocols for multilateral negotiation require a full consensus...

Consensus in Equilibrium: Can One Against All Decide Fairly?

Is there an equilibrium for distributed consensus when all agents except...

On Fairness in Voting Consensus Protocols

Voting algorithms have been widely used as consensus protocols in the re...

Diagonalization Games

We study several variants of a combinatorial game which is based on Cant...

Cohesive Networks using Delayed Self Reinforcement

How a network gets to the goal (a consensus value) can be as important a...