Fast byzantine agreement
Nicolas Braud-Santoni, Rachid Guerraoui, Florian Huc · 2013
This paper presents the first probabilistic Byzantine Agreement algorithm whose communication and time complexities are poly-logarithmic. So far, the most effective probabilistic Byzantine Agreement algorithm had communication complexity Õ(√n) and time complexity Õ(1).