An empirical study of a scalable Byzantine agreement algorithm


A recent theoretical result by King and Saia shows that it is possible to solve the Byzantine agreement, leader election and universe reduction problems in the full information model with &#x00D5;(n<sup>3/2</sup>) total bits sent. However, this result, while theoretically interesting, is not practical due to large hidden constants. In this paper, we design… (More)
DOI: 10.1109/IPDPSW.2010.5470874


7 Figures and Tables

Slides referencing similar topics