Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Fast Byzantine Consensus

J-P. Martin and L. Alvisi


We present the first consensus protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case. We prove that our protocol is optimal in terms of both number of communication step, and number of processes for 2-step consensus. The protocol can be used to build a replicated state machine that requires only three communication steps per request in the common case.


Publication typeInproceedings
Published inProceedings of the International Conference on Dependable Systems and Networks
PublisherIEEE Computer Society
> Publications > Fast Byzantine Consensus