1
$\begingroup$

One of the most challenges in distributed consensus mechanisms is both time complexity and message complexity.

For example, PBFT message complexity is O(n^2) that means that it is only scalable to tens of nodes. Thus, classical BFT (Byzantine Fault Tolerant) consensus mechanisms are not scalable to the large networks.

Nevertheless, I am looking for the most scalable BFT consensus  among all. 

In other words, is there a distributed BFT consensus with less than O(n^2) message complexity?

P.S. I brought up this question before in scicomp.stackexchange.com, but they suggested me to bring up it here. (https://scicomp.stackexchange.com/q/36087/37225)

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.