In this series of three posts, we discuss two of the most important consensus lower bounds: Lamport, Fischer [1982]: any protocol solving consensus in the synchronous model that is resilient to $t$ crash failures must have an execution with at least $t+1$ rounds. Fischer, Lynch, and Patterson [1983, 1985]: any...| decentralizedthoughts.github.io
We all broadly understand “consensus” as the notion of different parties agreeing with each other. In distributed computing, Consensus is one of the core functionalities. In this post, we define the consensus problem and discuss some variants and their differences. In modern parliaments, the passing of decrees is hindered by...| decentralizedthoughts.github.io
In this second post, we show the fundamental lower bound on the number of rounds for consensus protocols in the synchronous model. Theorem: Any protocol solving consensus in the synchronous model for $n$ parties that is resilient to $n-2 \geq t \geq 1$ crash failures must have an execution with...| decentralizedthoughts.github.io