DeepAI AI Chat
Log In Sign Up

Locally Solvable Tasks and the Limitations of Valency Arguments

by   Hagit Attiya, et al.

An elegant strategy for proving impossibility results in distributed computing was introduced in the celebrated FLP consensus impossibility proof. This strategy is local in nature as at each stage, one configuration of a hypothetical protocol for consensus is considered, together with future valencies of possible extensions. This proof strategy has been used in numerous situations related to consensus, leading one to wonder why it has not been used in impossibility results of two other well-known tasks: set agreement and renaming. This paper provides an explanation of why impossibility proofs of these tasks have been of a global nature. It shows that a protocol can always solve such tasks locally, in the following sense. Given a configuration and all its future valencies, if a single successor configuration is selected, then the protocol can reveal all decisions in this branch of executions, satisfying the task specification. This result is shown for both set agreement and renaming, implying that there are no local impossibility proofs for these tasks.


page 1

page 2

page 3

page 4


Why Extension-Based Proofs Fail

We prove that a class of fundamental shared memory tasks are not amenabl...

General Tasks and Extension-Based Proofs

The concept of extension-based proofs models the idea of a valency argum...

Agreement in the presence of disagreeing rational players: The Huntsman Protocol

In this paper, a novel Byzantine consensus protocol among n players is p...

Towards Formal Verification of HotStuff-based Byzantine Fault Tolerant Consensus in Agda: Extended Version

LibraBFT is a Byzantine Fault Tolerant (BFT) consensus protocol based on...

Reaching Agreement in Competitive Microbial Systems

In this work, we consider distributed agreement tasks in microbial distr...

Time-Bin CKA as a tool for blockchain technology

We explore the potential of Time-Bin Conference Key Agreement (TB CKA) p...

On the term "randomization test"

There exists no consensus on the meaning of the term "randomization test...