ACM Workshop Series | Achieving Consensus in Asynchronous Distributed Systems

Abstract
In this talk, we navigate the consensus problem in distributed systems, a critical challenge where multiple computing entities must agree on algorithm steps. We explore the CAP theorem's trade-offs and the FLP impossibility result, highlighting the impossibility of consensus in asynchronous networks with failures. Through innovative algorithms, we seek solutions beyond these limitations, aiming to inspire undergraduate students with a foundational understanding of distributed computing's role in achieving reliable, scalable, and efficient network collaboration.