In this episode, we discuss The Complexity of Agreement (https://arxiv.org/abs/cs/0406061), published by Scott Aaronson in the Symposium on the Theory of Computing, we also go beyond the paper to discuss the various forms several communities from game theory (social choice) and distributed computing (the study of Consens) tried to mathematically formalise the intractable question of agreement and communication.