Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Banyan: Fast Rotating Leader BFT (2312.05869v3)

Published 10 Dec 2023 in cs.DC and cs.CR

Abstract: This paper presents Banyan, the first rotating leader state machine replication (SMR) protocol that allows transactions to be confirmed in just a single round-trip time in the Byzantine fault tolerance (BFT) setting. Based on minimal alterations to the Internet Computer Consensus (ICC) protocol and with negligible communication overhead, we introduce a novel dual mode mechanism that enables optimal block finalization latency in the fast path. Crucially, the modes of operation are integrated, such that even if the fast path is not effective, no penalties are incurred. Moreover, our algorithm maintains the core attributes of the ICC protocol it is based on, including optimistic responsiveness and rotating leaders without the necessity for a view-change protocol. We prove the correctness of our protocol and provide an open-source implementation of it. Banyan is compared to its predecessor ICC, as well as other well known BFT protocols, in a globally distributed wide-area network. Our evaluation reveals that Banyan reduces latency by up to 30% compared to state-of-the-art protocols, without requiring additional security assumptions.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (60)
  1. Revisiting fast practical byzantine fault tolerance. arXiv preprint arXiv:1712.01367 (2017).
  2. Revisiting fast practical byzantine fault tolerance: Thelma, velma, and zelma. arXiv preprint arXiv:1801.10022 (2018).
  3. Good-case latency of byzantine broadcast: A complete categorization. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. 331–341.
  4. Optimal good-case latency for rotating leader synchronous bft. Cryptology ePrint Archive (2021).
  5. Amazon. Accessed 2023. Manage Amazon EC2 instance clock accuracy. https://aws.amazon.com/blogs/mt/manage-amazon-ec2-instance-clock-accuracy-using-amazon-time-sync-service-and-amazon-cloudwatch-part-1/.
  6. The next 700 BFT protocols. ACM Transactions on Computer Systems (TOCS) 32, 4 (2015), 1–45.
  7. FnF-BFT: A BFT protocol with provable performance under attack. In Structural Information and Communication Complexity: 30th International Colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6–9, 2023, Proceedings. Springer, 165–198.
  8. Mysticeti: Low-Latency DAG Consensus with Fast Commit Path. arXiv preprint arXiv:2310.14821 (2023).
  9. Michael Ben-Or. 1983. Another advantage of free choice (extended abstract) completely asynchronous agreement protocols. In Proceedings of the second annual ACM symposium on Principles of distributed computing. 27–30.
  10. Sui Lutris: A Blockchain Combining Broadcast and Consensus. Technical Report. Technical Report. Mysten Labs. https://sonnino. com/papers/sui-lutris. pdf.
  11. Compact multi-signatures for smaller blockchains. In Advances in Cryptology–ASIACRYPT 2018: 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2–6, 2018, Proceedings, Part II. Springer, 435–464.
  12. Gabriel Bracha. 1987. Asynchronous Byzantine agreement protocols. Information and Computation 75, 2 (1987), 130–143.
  13. Consensus in one communication step. In Parallel Computing Technologies: 6th International Conference, PaCT 2001 Novosibirsk, Russia, September 3–7, 2001 Proceedings 6. Springer, 42–50.
  14. Ethan Buchman. 2016. Tendermint: Byzantine fault tolerance in the age of blockchains. Ph. D. Dissertation. University of Guelph.
  15. Vitalik Buterin. 2013. Ethereum: A Next-Generation Smart Contract and Decentralized Application Platform. https://github.com/ethereum/wiki/wiki/White-Paper.
  16. Vitalik Buterin and Virgil Griffith. 2017. Casper the friendly finality gadget. arXiv preprint arXiv:1710.09437 (2017).
  17. Internet computer consensus. In Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing. 81–91.
  18. Practical byzantine fault tolerance. In OsDI. 173–186.
  19. Benjamin Y Chan and Rafael Pass. 2023. Simplex Consensus: A Simple and Fast Consensus Protocol. Cryptology ePrint Archive, Paper 2023/463. https://eprint.iacr.org/2023/463 https://eprint.iacr.org/2023/463.
  20. Pala: A simple partially synchronous blockchain. Cryptology ePrint Archive (2018).
  21. Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults. In Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation (Boston, Massachusetts) (NSDI’09). USENIX Association, USA, 153–168.
  22. Compound. Accessed 2023. Compound - An algorithmic, autonomous interest rate protocol. https://compound.finance/.
  23. DBFT: Efficient Leaderless Byzantine Consensus and its Application to Blockchains. In 2018 IEEE 17th International Symposium on Network Computing and Applications (NCA). 1–8. https://doi.org/10.1109/NCA.2018.8548057
  24. Flash boys 2.0: Frontrunning in decentralized exchanges, miner extractable value, and consensus instability. In 2020 IEEE Symposium on Security and Privacy (SP). IEEE, 910–927.
  25. Narwhal and tusk: a dag-based mempool and efficient bft consensus. In Proceedings of the Seventeenth European Conference on Computer Systems. 34–50.
  26. Dfinity. Accessed 2023a. SUbnets - ICP Dashboard. https://dashboard.internetcomputer.org/subnets.
  27. Dfinity. Accessed 2023b. The Internet Computer Protocol (ICP). https://github.com/dfinity/ic.
  28. Dfinity. Accessed 2023c. World Computer build on the network. https://internetcomputer.org/.
  29. dscvr. Accessed 2023. dscvr - An end-to-end decentralized Web3 social media platform. https://dscvr.one/.
  30. Consensus in the presence of partial synchrony. Journal of the ACM (JACM) 35, 2 (1988), 288–323.
  31. Filecoin. Accessed 2023. Filecoin - A decentralized storage network. https://filecoin.io/.
  32. Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback. In Financial Cryptography and Data Security: 26th International Conference, FC 2022, Grenada, May 2–6, 2022, Revised Selected Papers. Springer, 296–315.
  33. Algorand: Scaling byzantine agreements for cryptocurrencies. In Proceedings of the 26th symposium on operating systems principles. 51–68.
  34. Rachid Guerraoui and Marko Vukolić. 2007. Refined quorum systems. In Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing. 119–128.
  35. Sbft: a scalable and decentralized trust infrastructure. In 2019 49th Annual IEEE/IFIP international conference on dependable systems and networks (DSN). IEEE, 568–580.
  36. Fast-hotstuff: A fast and resilient hotstuff protocol. arXiv preprint arXiv:2010.11454 (2020).
  37. All you need is dag. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. 165–175.
  38. Zyzzyva: speculative byzantine fault tolerance. In Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles. 45–58.
  39. Klaus Kursawe. 2002. Optimistic byzantine agreement. In 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings. IEEE, 262–267.
  40. Revisiting Optimal Resilience of Fast Byzantine Consensus. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (Virtual Event, Italy) (PODC’21). Association for Computing Machinery, New York, NY, USA, 343–353. https://doi.org/10.1145/3465084.3467924
  41. Leslie Lamport. 2003. Lower bounds for asynchronous consensus. Future Directions in Distributed Computing: Research and Position Papers (2003), 22–23.
  42. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems 4, 3 (1982), 382–401.
  43. Inclusive block chain protocols. In Financial Cryptography and Data Security: 19th International Conference, FC 2015, San Juan, Puerto Rico, January 26-30, 2015, Revised Selected Papers 19. Springer, 528–547.
  44. MakerDAO. Accessed 2023. MakerDAO - A better, smarter currency. https://makerdao.com/.
  45. Dahlia Malkhi and Kartik Nayak. 2023. HotStuff-2: Optimal Two-Phase Responsive BFT. Cryptology ePrint Archive (2023).
  46. BBCA-CHAIN: One-Message, Low Latency BFT Consensus on a DAG. arXiv preprint arXiv:2310.06335 (2023).
  47. J.-P. Martin and L. Alvisi. 2006. Fast Byzantine Consensus. IEEE Transactions on Dependable and Secure Computing 3, 3 (2006), 202–215. https://doi.org/10.1109/TDSC.2006.35
  48. Massimo Albarello. 2023. Git repository - Fast Internet Computer Consensus. https://anonymous.4open.science/r/fast_internet_computer_consensus-235F/README.md.
  49. Satoshi Nakamoto. 2009. Bitcoin: A peer-to-peer electronic cash system. http://www.bitcoin.org/bitcoin.pdf.
  50. OpenSea. Accessed 2023. OpenSea, the largest NFT marketplace. https://opensea.io/.
  51. Protocol Labs. Accessed 2023. libp2p - A modular network stack for peer-to-peer applications. https://libp2p.io/.
  52. Consensus on demand. In Stabilization, Safety, and Security of Distributed Systems: 24th International Symposium, SSS 2022, Clermont-Ferrand, France, November 15–17, 2022, Proceedings. Springer, 299–313.
  53. Yee Jiun Song and Robbert van Renesse. 2008. Bosco: One-step byzantine asynchronous consensus. In Distributed Computing: 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008. Proceedings 22. Springer, 438–450.
  54. Bullshark: The Partially Synchronous Version. arXiv preprint arXiv:2209.05633 (2022).
  55. Mir-bft: High-throughput bft for blockchains. arXiv preprint arXiv:1906.05552 (2019), 92.
  56. State machine replication scalability made simple. In Proceedings of the Seventeenth European Conference on Computer Systems. 17–33.
  57. Tally. Accessed 2023. Run DAOs on-chain. https://www.tally.xyz/.
  58. Uniswap. Accessed 2023. Uniswap - Swap, earn, and build on the leading decentralized crypto trading protocol. https://uniswap.org/.
  59. Worldcoin. Accessed 2023. Worldcoin - The global economy belongs to everyone. https://worldcoin.org/.
  60. HotStuff: BFT consensus with linearity and responsiveness. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. 347–356.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets