{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T13:28:31Z","timestamp":1784640511032,"version":"3.55.0"},"reference-count":35,"publisher":"MDPI AG","issue":"16","license":[{"start":{"date-parts":[[2024,8,21]],"date-time":"2024-08-21T00:00:00Z","timestamp":1724198400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Guangdong Province Key Research and Development Program, China","award":["No. 2020B0101090004"],"award-info":[{"award-number":["No. 2020B0101090004"]}]},{"name":"Guangdong Province Key Research and Development Program, China","award":["305095257053"],"award-info":[{"award-number":["305095257053"]}]},{"name":"Guangdong Province Key Research and Development Program, China","award":["403267474044"],"award-info":[{"award-number":["403267474044"]}]},{"name":"Guangdong Province Key Research and Development Program, China","award":["NS-SZJS-2022-XDNY-ZKYD-04"],"award-info":[{"award-number":["NS-SZJS-2022-XDNY-ZKYD-04"]}]},{"name":"the Guangxi Science and Technology Plan Projects, China","award":["No. 2020B0101090004"],"award-info":[{"award-number":["No. 2020B0101090004"]}]},{"name":"the Guangxi Science and Technology Plan Projects, China","award":["305095257053"],"award-info":[{"award-number":["305095257053"]}]},{"name":"the Guangxi Science and Technology Plan Projects, China","award":["403267474044"],"award-info":[{"award-number":["403267474044"]}]},{"name":"the Guangxi Science and Technology Plan Projects, China","award":["NS-SZJS-2022-XDNY-ZKYD-04"],"award-info":[{"award-number":["NS-SZJS-2022-XDNY-ZKYD-04"]}]},{"name":"Nansha District Digital Technology Application Demonstration Project","award":["No. 2020B0101090004"],"award-info":[{"award-number":["No. 2020B0101090004"]}]},{"name":"Nansha District Digital Technology Application Demonstration Project","award":["305095257053"],"award-info":[{"award-number":["305095257053"]}]},{"name":"Nansha District Digital Technology Application Demonstration Project","award":["403267474044"],"award-info":[{"award-number":["403267474044"]}]},{"name":"Nansha District Digital Technology Application Demonstration Project","award":["NS-SZJS-2022-XDNY-ZKYD-04"],"award-info":[{"award-number":["NS-SZJS-2022-XDNY-ZKYD-04"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Recent Byzantine Fault-Tolerant (BFT) State Machine Replication (SMR) protocols increasingly focus on scalability and security to meet the growing demand for Distributed Ledger Technology (DLT) applications across various domains. Current BFT consensus algorithms typically require a single leader node to receive and validate votes from the majority process and broadcast the results, a design challenging to scale in large systems. We propose a fast-response consensus algorithm based on improvements to HotStuff, aimed at enhancing transaction ordering speed and overall performance of distributed systems, even in the presence of faulty copies. The algorithm introduces an optimistic response assumption, employs a message aggregation tree to collect and validate votes, and uses a dynamically adjusted threshold mechanism to reduce communication delay and improve message delivery reliability. Additionally, a dynamic channel mechanism and an asynchronous leader multi-round mechanism are introduced to address multiple points of failure in the message aggregation tree structure, minimizing dependence on a single leader. This adaptation can be flexibly applied to real-world system conditions to improve performance and responsiveness. We conduct experimental evaluations to verify the algorithm\u2019s effectiveness and superiority. Compared to the traditional HotStuff algorithm, the improved algorithm demonstrates higher efficiency and faster response times in handling faulty copies and transaction ordering.<\/jats:p>","DOI":"10.3390\/s24165417","type":"journal-article","created":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T12:58:07Z","timestamp":1724417887000},"page":"5417","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Improved Fast-Response Consensus Algorithm Based on HotStuff"],"prefix":"10.3390","volume":"24","author":[{"given":"Rong","family":"Wang","sequence":"first","affiliation":[{"name":"Guangzhou Institute of Software, Guangzhou 510006, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minfu","family":"Yuan","sequence":"additional","affiliation":[{"name":"Guangzhou Institute of Software, Guangzhou 510006, China"},{"name":"School of Software Engineer, South China University of Technology, Guangzhou 511458, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenyu","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Software Engineer, South China University of Technology, Guangzhou 511458, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yin","family":"Li","sequence":"additional","affiliation":[{"name":"Guangzhou Institute of Software, Guangzhou 510006, China"},{"name":"Guangzhou Caseeder Technology Co., Ltd., Guangzhou 511458, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2024,8,21]]},"reference":[{"key":"ref_1","unstructured":"Lamport, L., Shostak, R., and Pease, M. (2019). The Byzantine generals problem. Concurrency: The Works of Leslie Lamport, Association for Computing Machinery."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Wang, G., and Nixon, M. (2023, January 24\u201326). SoK: Essentials of BFT Consensus for Blockchains. Proceedings of the 2023 Fifth International Conference on Blockchain Computing and Applications (BCCA), Kuwait, Kuwait.","DOI":"10.1109\/BCCA58897.2023.10338868"},{"key":"ref_3","unstructured":"Chang, Y.X., Wang, Q., Li, Q.L., and Ma, Y. (2023). Performance and Reliability Analysis for Practical Byzantine Fault Tolerance with Repairable Voting Nodes. arXiv."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Yu, J. (2023, January 27\u201330). Fault Independence in Blockchain. Proceedings of the 2023 53rd Annual IEEE\/IFIP International Conference on Dependable Systems and Networks-Supplemental Volume (DSN-S), Porto, Portugal.","DOI":"10.1109\/DSN-S58398.2023.00035"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Berger, C., Toumia, S.B., and Reiser, H.P. (2023, January 24\u201327). Scalable Performance Evaluation of Byzantine Fault-Tolerant Systems Using Network Simulation. Proceedings of the 2023 IEEE 28th Pacific Rim International Symposium on Dependable Computing (PRDC), Singapore.","DOI":"10.1109\/PRDC59308.2023.00030"},{"key":"ref_6","unstructured":"Castro, M., and Liskov, B. (1999, January 22\u201325). Practical Byzantine fault tolerance. Proceedings of the Third Symposium on Operating Systems Design and Implementation (OSDI \u201999), New Orleans, LA, USA."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., and Abraham, I. (August, January 29). Hotstuff: Bft consensus with linearity and responsiveness. Proceedings of the 2019 ACM PODC (PODC \u201919), Toronto, ON, Canada.","DOI":"10.1145\/3293611.3331591"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Sioutas, S., Sourla, E., Tsichlas, K., Vonitsanos, G., and Zaroliagis, C. (2022). A Dynamic Distributed Deterministic Load-Balancer for Decentralized Hierarchical Infrastructures. Algorithms, 15.","DOI":"10.3390\/a15030096"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Rani, R., Rashpa, S., Mahato, D.P., and Pham, V.H. (2021). Scalable Leader Election Considering Load Balancing. Advanced Information Networking and Applications, Springer.","DOI":"10.1007\/978-3-030-75078-7_27"},{"key":"ref_10","unstructured":"Neiheiser, R., Matos, M., and Rodrigues, L. (2021). The quest for scaling BFT Consensus through Tree-Based Vote Aggregation. arXiv."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Lin, T., Dong, M., and Jing, C. (2019, January 16\u201317). A tree structure-based blockchain. Proceedings of the 2019 4th International Conference on Intelligent Information Processing, Guilin, China.","DOI":"10.1145\/3378065.3378136"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Li, X., Yu, Z., and Jiang, H. (2021). Event-triggered fixed-time integral sliding mode control for nonlinear multi-agent systems with disturbances. Entropy, 23.","DOI":"10.3390\/e23111412"},{"key":"ref_13","unstructured":"Xiao, Z., and Birman, K. (2001, January 22\u201326). A randomized error recovery algorithm for reliable multicast. Proceedings of the Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), Anchorage, AK, USA."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Zhang, G., and Jacobsen, H.-A. (2022, January 10\u201313). ESCAPE to Precaution against Leader Failures. Proceedings of the 2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS), Bologna, Italy.","DOI":"10.1109\/ICDCS54860.2022.00066"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Shriya, H., Marakumbi, V.P., Soumya, N., Narayan, D.G., Altaf, H., and Pooja, S. (2023, January 6\u20138). An Efficient Voting Based Consensus Algorithm for Permissionless Blockchains. Proceedings of the 2023 14th International Conference on Computing Communication and Networking Technologies (ICCCNT), Delhi, India.","DOI":"10.1109\/ICCCNT56998.2023.10307611"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Miller, A., Xia, Y., Croman, K., Shi, E., and Song, D. (2016, January 24\u201328). The honey badger of BFT protocols. Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria.","DOI":"10.1145\/2976749.2978399"},{"key":"ref_17","unstructured":"Gueta, G.G., Abraham, I., Grossman, S., Malkhi, D., Pinkas, B., Reiter, M., Seredinschi, D.A., Tamir, O., and Tomescu, A. (2019, January 24\u201327). SBFT: A scalable and decentralized trust infrastructure. Proceedings of the 2019 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), Portland, OR, USA."},{"key":"ref_18","unstructured":"Buchman, E. (2016). Tendermint: Byzantine Fault Tolerance in the Age of Blockchains. [Ph.D. Thesis, University of Guelph]."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Gilad, Y., Hemo, R., Micali, S., Vlachos, G., and Zeldovich, N. (2017, January 28). Algorand: Scaling byzantine agreements for cryptocurrencies. Proceedings of the 26th Symposium on Operating Systems Principles, Shanghai, China.","DOI":"10.1145\/3132747.3132757"},{"key":"ref_20","first-page":"806","article-title":"A CFAR detection algorithm for generalized gamma distributed background in high-resolution SAR images","volume":"10","author":"Qin","year":"2012","journal-title":"IEEE Geosci. Remote Sens. Lett."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Berrang, P., von Styp-Rekowsky, P., Wissfeld, M., Fran\u00e7a, B., and Trinkler, R. (2019, January 24\u201326). Albatross\u2014An optimistic consensus algorithm. Proceedings of the 2019 Crypto Valley Conference on Blockchain Technology (CVCBT), Rotkreuz, Switzerland.","DOI":"10.1109\/CVCBT.2019.000-1"},{"key":"ref_22","unstructured":"Ren, Z., and Zhou, Z. (2020). SURFACE: A practical blockchain consensus algorithm for real-world networks. arXiv."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.future.2021.04.020","article-title":"DR-BFT: A consensus algorithm for blockchain-based multi-layer data integrity framework in dynamic edge computing system","volume":"124","author":"Fan","year":"2021","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Kuznetsov, P., Tonkikh, A., and Zhang, Y.X. (2021, January 26\u201330). Revisiting optimal resilience of fast byzantine consensus. Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, Virtual Event.","DOI":"10.1145\/3465084.3467924"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1049\/blc2.12030","article-title":"FP-BFT: A fast pipeline Byzantine consensus algorithm","volume":"3","author":"Liu","year":"2023","journal-title":"IET Blockchain"},{"key":"ref_26","unstructured":"Albarello, M., Sliwinski, J., Vonlanthen, Y., and Wattenhofer, R. (2023). Fast Internet Computer Consensus. arXiv."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Seo, J., Ko, D., Kim, S., and Park, S. (2020). A coordination technique for improving scalability of byzantine fault-tolerant consensus. Appl. Sci., 10.","DOI":"10.3390\/app10217609"},{"key":"ref_28","unstructured":"Moniz, H. (2020). The Istanbul BFT consensus algorithm. arXiv."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Zhang, G., and Jacobsen, H.A. (2021, January 6\u201310). Prosecutor: An efficient BFT consensus algorithm with behavior-aware penalization against Byzantine attacks. Proceedings of the 22nd International Middleware Conference, Quebec, QC, Canada.","DOI":"10.1145\/3464298.3484503"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Li, W., and He, M. (2021, January 20\u201322). EBFT: A hierarchical and group-based byzantine fault tolerant consensus algorithm. Proceedings of the 2021 IEEE 12th International Conference on Software Engineering and Service Science (ICSESS), Beijing, China.","DOI":"10.1109\/ICSESS52187.2021.9522233"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Zhou, S., and Ying, B. (2021, January 13\u201316). Vg-raft: An improved byzantine fault tolerant algorithm based on raft algorithm. Proceedings of the 2021 IEEE 21st International Conference on Communication Technology (ICCT), Tianjin, China.","DOI":"10.1109\/ICCT52962.2021.9658063"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Zhang, G., Pan, F., Tijanic, S., and Jacobsen, H.A. (2023). PrestigeBFT: Revolutionizing view changes in BFT consensus algorithms with reputation mechanisms. arXiv.","DOI":"10.1109\/ICDE60146.2024.00156"},{"key":"ref_33","unstructured":"Abraham, I., Malkhi, D., Nayak, K., and Ren, L. (2018, December 03). Dfinity consensus, Explored. Cryptology ePrint Archive. Available online: https:\/\/eprint.iacr.org\/2018\/1153."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Abraham, I., Malkhi, D., Nayak, K., Ren, L., and Yin, M. (2020, January 18\u201321). Sync hotstuff: Simple and practical synchronous state machine replication. Proceedings of the 2020 IEEE Symposium on Security and Privacy (SP), San Francisco, CA, USA.","DOI":"10.1109\/SP40000.2020.00044"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Kokoris-Kogias, E., Jovanovic, P., Gasser, L., Gailly, N., Syta, E., and Ford, B. (2018, January 20\u201324). Omniledger: A secure, scale-out, decentralized ledger via sharding. Proceedings of the 2018 IEEE Symposium on Security and Privacy (SP), San Francisco, CA, USA.","DOI":"10.1109\/SP.2018.000-5"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/24\/16\/5417\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T15:40:44Z","timestamp":1760110844000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/24\/16\/5417"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,21]]},"references-count":35,"journal-issue":{"issue":"16","published-online":{"date-parts":[[2024,8]]}},"alternative-id":["s24165417"],"URL":"https:\/\/doi.org\/10.3390\/s24165417","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,21]]}}}