Skip to main content

Highway: A Super Pipelined Parallel BFT Consensus Algorithm for Permissioned Blockchain

  • Conference paper
  • First Online:
Machine Learning for Cyber Security (ML4CS 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13656))

Included in the following conference series:

  • 935 Accesses

Abstract

Blockchain technology has recently received widespread attention from academia and industry, and its application scenarios have expanded from digital currency to all walks of life. However, as a crucial component of the blockchain, the poor performance and scalability of the current Byzantine Fault Tolerance (BFT) consensus algorithms severely limit the development of the blockchain. To cope with this dilemma, we propose Highway, a parallel optimized high-performance BFT consensus algorithm that supports decentralized management. Our algorithm is a state machine replication protocol based on a partial synchrony model. Our approach has an 18\(\times \)–50\(\times \) throughput improvement over HotStuff and can reach millions of throughput at 1000 Mbps networks.

This work was funded by grants from the National Key Research and Development Program of China (Grant No. 2021YFB2700300).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Buterin, V., et al.: A next-generation smart contract and decentralized application platform. White Paper 3(37) (2014)

    Google Scholar 

  2. Castro, M., Liskov, B., et al.: Practical byzantine fault tolerance. In: OSDI. vol. 99, pp. 173–186 (1999)

    Google Scholar 

  3. Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM (JACM) 35(2), 288–323 (1988)

    Article  MathSciNet  Google Scholar 

  4. Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139–147. Springer, Heidelberg (1993). https://doi.org/10.1007/3-540-48071-4_10

    Chapter  Google Scholar 

  5. Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM (JACM) 32(2), 374–382 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gueta, G.G., et al.: SBFT: a scalable and decentralized trust infrastructure. In: 2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 568–580. IEEE (2019)

    Google Scholar 

  7. Jalalzai, M.M., Niu, J., Feng, C., Gai, F.: Fast-hotstuff: a fast and resilient hotstuff protocol. arXiv preprint arXiv:2010.11454 (2020)

  8. Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.: Zyzzyva: speculative byzantine fault tolerance. In: Proceedings of Twenty-first ACM SIGOPS Symposium on Operating Systems Principles.,pp. 45–58 (2007)

    Google Scholar 

  9. LAMPORT, L.: The part-time parliament. ACM Trans. Comput. Systt. 16(2), 133–169 (1998)

    Google Scholar 

  10. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. In: Concurrency: the Works of Leslie Lamport, pp. 179–196 (2019)

    Google Scholar 

  11. LAMPORT, L., SHOSTAK, R., PEASE, M.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4, 382–401(1982)

    Google Scholar 

  12. Li, C., et al.: A decentralized blockchain with high throughput and fast confirmation. In: 2020 USENIX Annual Technical Conference (USENIX ATC 2020), pp. 515–528 (2020)

    Google Scholar 

  13. Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system. Decentral. Bus. Rev. 21260 (2008)

    Google Scholar 

  14. Neiheiser, R., Matos, M., Rodrigues, L.: Kauri: Scalable BFT consensus with pipelined tree-based dissemination and aggregation. In: Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles, pp. 35–48 (2021)

    Google Scholar 

  15. Ongaro, D., Ousterhout, J.: In search of an understandable consensus algorithm. In: 2014 USENIX Annual Technical Conference (Usenix ATC 2014), pp. 305–319 (2014)

    Google Scholar 

  16. Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the preDsence of faults. J. ACM (JACM) 27(2), 228–234 (1980)

    Article  MATH  Google Scholar 

  17. Schneider, F.B.: Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput. Surv. (CSUR) 22, pp. 299–319 (1990)

    Google Scholar 

  18. Stathakopoulou, C., David, T., Vukolic, M.: MIR-BFT: High-throughput BFT for blockchains. arXiv preprint arXiv:1906.05552 (2019)

  19. Stathakopoulou, C., Pavlovic, M., Vukolić, M.: State machine replication scalability made simple. In: Proceedings of the Seventeenth European Conference on Computer Systems, pp. 17–33 (2022)

    Google Scholar 

  20. Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., Abraham, I.: Hotstuff: BFT consensus with linearity and responsiveness. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pp. 347–356 (2019)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wangjie Qiu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Luo, Z., Chen, C., Qiu, W. (2023). Highway: A Super Pipelined Parallel BFT Consensus Algorithm for Permissioned Blockchain. In: Xu, Y., Yan, H., Teng, H., Cai, J., Li, J. (eds) Machine Learning for Cyber Security. ML4CS 2022. Lecture Notes in Computer Science, vol 13656. Springer, Cham. https://doi.org/10.1007/978-3-031-20099-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-20099-1_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-20098-4

  • Online ISBN: 978-3-031-20099-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics