Fall 2019

Building Probabilistic BFT Protocols Through Subsampled Voting

Thursday, October 24th, 2019 2:30 pm3:00 pm

Add to Calendar


Kevin Sekniqi (Cornell University)

We are familiar with classical BFT protocols and longest-chain BFT protocols. In this talk, we introduce a new set of BFT protocols, called the `Snow' family, which inherit some of the best properties of both classical and longest-chain protocols. In particular, these protocols scale nearly independently of the number of nodes in the system, and yet have latency and throughput at the levels of classical deployments.