Byzantine Fault Tolerant Consensus

Byzantine fault tolerance (BFT) is a desirable property in a distributed computing environment. BFT means the system can survive the loss of nodes and nodes becoming unreliable. There are many different protocols for achieving BFT, though not all options can scale to large network sizes.

[Ted Yin](https://www.cs.cornell.edu/~tedyin/) joins us to explain BFT, survey the wide variety of protocols, and share details about [HotStuff](https://arxiv.org/abs/1803.05069).

Guest

Ted Yin: I finished my Ph.D. at Cornell University, co-advised by Prof. Emin Gün Sirer and Prof. Robbert van Renesse. I also worked closely with Dr. Dahlia Malkhi. I focused more on fundamental problems of fault-tolerance, consensus protocols and peer-to-peer systems. My taste of research is to build the systems which are provably correct and practically effective. Currently, I am tackling challenges in blockchains, from a system perspective. I am looking for research collaboration and a faculty position.