4 ms·
IMO, more interesting property than the messaging complexity is, bitcoin (in theory) allows <50% malicious actors in the consensus group. Lamport BFT only allow
by iambvk 10y ago
IMO, more interesting property than the messaging complexity is, bitcoin (in theory) allows <50% malicious actors in the consensus group. Lamport BFT only allows <33% malicious actors.
Of course, this comparison is not really fair because Lamport BFT achieves deterministic consensus, where as, bitcoin only gives probabilistic consensus.
I hope there is room for Deterministic BFT with <50% malicious actors.
> or in some new highly-academic algorithms O(N polylog(N))
Could you point me to this algorithm? I am not aware of any BFT solution other Lamport BFT.
- troymc 10y agoThere are many deterministic BFT protocols. PBFT is probably the most well-known. [1] The SCP paper points to several BFT protocols with message complexity of O(N polylog(N)), e.g. [2] [1] Miguel Castro and Barbara Liskov. Practical byzantine fault tolerance. In Proceedings of the Third Symposium on Operating Systems Design and Implementation, pages 173–186. USENIX Association, 1999. [2] Valerie King, Steven Lonargan, Jared Saia, and Amitabh Trehan. Load balanced scalable byzantine agreement through quorum building, with full information. In MarcosK. Aguilera, Haifeng Yu, Nitin H. Vaidya, Vikram Srinivasan, and RomitRoy Choudhury, editors, Distributed Computing and Networking, volume 6522 of Lecture Notes in Computer Science, pages 203–214. Springer Berlin Heidelberg, 2011.