Byzantine Agreement is Impossible for $n \leq 3 f$ if the Adversary can Simulate

The Fischer, Lynch, and Merritt, 1985 lower bound states that synchronous Byzantine agreement is impossible if the adversary controls $f>n/3$ parties. It is well known that this lower bound holds in the unauthenticated setting and does not hold in a setting with a PKI setup. Naively, one might think that the lower bound always holds if there is no PKI setup, but Nakamoto consensus shows that this is not the... [Read More]
Tags: lowerbound

What is Consensus?

Consensus broadly means different parties reaching agreement. In distributed computing, Consensus is a core functionality. In this post, we define the consensus problem and its variants. [Read More]
Tags: consensus101

The threshold adversary

In addition to limiting the adversary via a communication model synchrony, asynchrony, or partial synchrony, we need a way to limit the adversary’s power to corrupt parties. [Read More]
Tags: dist101 models

The power of the adversary

After we fix the communication model, synchrony, asynchrony, or partial synchrony, and a threshold adversary there are still five important modeling decisions regarding the adversary’s power: [Read More]
Tags: dist101 models

Where do I even start?

Post thumbnail
I have been wanting to start a blog for a long time. Here we go!