Fast rise of decentralized systems and cloud computing introduces a new challenge, designing highly scalable algorithms; algorithms that have asymptotically-small communication, computation, and latency costs with respect to the network size. Moreover, systems with thousands or even millions of parties distributed throughout the world which are not controlled by a single trusted authority are likely in danger of faults from untrusted parties. In this talk, we study Dfinity consensus protocol as a scalable method to reach agreement in large decentralized systems.
Throughout this talk, we first look into the Byzantine agreement (BA) problem and study the early protocols for solving this problem and achieving consensus. We then look into lower bounds on BA protocols in a different network and adversarial models to build background knowledge of what is possible and what is not possible to achieve. Then, we study the importance of randomness in designing a BA protocol. We learn how to create global randomness from proof of work and solve the consensus problem in the synchronous model using blockchain. Next, we explore the new technique that combines classical BA protocols with blockchain to address one of the most challenging problems in the consensus domain: scalability. We learn what is a Verifiable Random Function (VRF) and how we can use VRF to create a faster consensus protocol.
Speaker: Mahnush Movahedi, Dfinity
Contact:Website: Click to Visit
Save this Event:iCalendar
Windows Live Calendar