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
In a consensus protocol parties have an input (at least two possible values, say 0 or 1) and may output a decision value such that: Uniform Agreement: all decision values are the same. Validity: if all inputs are the same, then this is the output value. The third property is...| decentralizedthoughts.github.io
In the standard distributed computing model, the communication uncertainty is captured by an adversary that can control the message delays. The communication model defines the limits to the power of the adversary to delay messages. There are three basic communication models: the Synchronous model, the Asynchronous model, and the Partial...| decentralizedthoughts.github.io