This lecture covers the FloodSet algorithm, a simple solution for synchronous agreement in the presence of crash failures. The algorithm involves processes broadcasting and aggregating values to reach a decision. The correctness of the algorithm is proven through guided proofs. Additionally, the lecture discusses the communication complexity of FloodSet and explores alternative decision rules. Bonus exercises introduce a consensus protocol in a 2D grid network and weaker specifications of NBAC and TRB.