Optimistic Byzantine Agreement Achieves Linear Communication Complexity for Scalability
This optimistic consensus design fundamentally challenges the quadratic communication lower bound, enabling optimal scalability for distributed state machine replication.
