Course
Week 1: models and definitions
- The network model, the threshold adversary model, and the power of the adversary.
- Definition of Consensus and Agreement.
- State machine replication and consensus.
- State Machine Replication for crash failures.
- From single agreement to state machine replication.
- The ideal state machine model and Linearizability.
Week 2: synchrony with omission failures
- Upper bound: Consensus with Omission failures.
- Lower bound: Consensus with Omission failures requires $f<n/2$.
Week 3: lower bounds for partial synchrony
- Lower bound: the CAP theorem.
- Lower bound: Consensus with Byzantine failures in Partial Synchrony requires f<n/3
Week 4: Byzantine adversaries
- Upper bound: partial synchrony, single shot PBFT using locked broadcast.
Week 5: asynchrony
- Upper bound: Reliable broadcast.
- Lower bound: FLP and single mobile failure.