{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T16:40:20Z","timestamp":1756485620059,"version":"3.44.0"},"reference-count":46,"publisher":"Association for Computing Machinery (ACM)","issue":"7","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:p>\n            Asynchronous\n            <jats:italic toggle=\"yes\">Byzantine Fault Tolerant<\/jats:italic>\n            (BFT) consensus protocols have garnered significant attention with the rise of blockchain technology. A typical asynchronous protocol is designed by executing sequential instances of the\n            <jats:italic toggle=\"yes\">Asynchronous Common Sub-seQuence<\/jats:italic>\n            (ACSQ). The ACSQ protocol consists of two primary components: the\n            <jats:italic toggle=\"yes\">Asynchronous Common Subset<\/jats:italic>\n            (ACS) protocol and a block sorting mechanism, with the ACS protocol comprising two stages: broadcast and agreement. However, current protocols encounter three critical issues: high latency arising from the execution of the agreement stage, latency instability due to the integral-sorting mechanism, and reduced throughput caused by block discarding.\n          <\/jats:p>\n          <jats:p>\n            To address these issues, we propose Falcon, an asynchronous BFT protocol that achieves low latency and enhanced throughput. Falcon introduces a novel broadcast protocol,\n            <jats:italic toggle=\"yes\">Graded Broadcast<\/jats:italic>\n            (GBC), which enables a block to be included in the ACS set directly, bypassing the agreement stage and thereby reducing latency. To ensure safety, Falcon incorporates a new binary agreement protocol called\n            <jats:italic toggle=\"yes\">Asymmetrical Asynchronous Binary Agreement<\/jats:italic>\n            (AABA), designed to complement GBC. Additionally, Falcon employs a partial-sorting mechanism, allowing continuous rather than simultaneous block committing, enhancing latency stability. Finally, we incorporate an agreement trigger that, before its activation, enables nodes to wait for more blocks to be delivered and committed, thereby boosting throughput. We conduct a series of experiments to evaluate Falcon, demonstrating its superior performance.\n          <\/jats:p>","DOI":"10.14778\/3734839.3734850","type":"journal-article","created":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T16:01:06Z","timestamp":1756483266000},"page":"2136-2148","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Falcon: Advancing Asynchronous BFT Consensus for Lower Latency and Enhanced Throughput"],"prefix":"10.14778","volume":"18","author":[{"given":"Xiaohai","family":"Dai","sequence":"first","affiliation":[{"name":"HUST"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaozheng","family":"Ding","sequence":"additional","affiliation":[{"name":"HUST"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Li","sequence":"additional","affiliation":[{"name":"USYD"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiang","family":"Xiao","sequence":"additional","affiliation":[{"name":"HUST"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bolin","family":"Zhang","sequence":"additional","affiliation":[{"name":"CMU"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Yu","sequence":"additional","affiliation":[{"name":"HUST"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert Y.","family":"Zomaya","sequence":"additional","affiliation":[{"name":"USYD"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Jin","sequence":"additional","affiliation":[{"name":"HUST"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,8,29]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538451"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538426"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00044"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331612"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551835"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 2nd Annual ACM Symposium on Principles of Distributed Computing. ACM, 27\u201330","author":"Ben-Or Michael","year":"1983","unstructured":"Michael Ben-Or. 1983. Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols. In Proceedings of the 2nd Annual ACM Symposium on Principles of Distributed Computing. ACM, 27\u201330."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167109"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing. ACM, 183\u2013192","author":"Ben-Or Michael","year":"1994","unstructured":"Michael Ben-Or, Boaz Kelmer, and Tal Rabin. 1994. Asynchronous Secure Computations with Optimal Resilience. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing. ACM, 183\u2013192."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623191"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_31"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_42"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the 3rd USENIX Symposium on Operating Systems Design and Implementation. USENIX, 173\u2013186","author":"Castro Miguel","year":"1999","unstructured":"Miguel Castro and Barbara Liskov. 1999. Practical Byzantine Fault Tolerance. In Proceedings of the 3rd USENIX Symposium on Operating Systems Design and Implementation. USENIX, 173\u2013186."},{"key":"e_1_2_1_14_1","volume-title":"Pili: An Extremely Simple Synchronous Blockchain. Cryptology ePrint Archive","author":"Hubert Chan TH","year":"2018","unstructured":"TH Hubert Chan, Rafael Pass, and Elaine Shi. 2018. Pili: An Extremely Simple Synchronous Blockchain. Cryptology ePrint Archive (2018)."},{"key":"e_1_2_1_15_1","volume-title":"Falcon: Advancing Asynchronous BFT Consensus for Lower Latency and Enhanced Throughput (full version). arXiv:2504.12766 https:\/\/arxiv.org\/abs\/2504.12766","author":"Dai Xiaohai","year":"2025","unstructured":"Xiaohai Dai, Chaozheng Ding, Wei Li, Jiang Xiao, Bolin Zhang, Chen Yu, Albert Y. Zomaya, and Hai Jin. 2025. Falcon: Advancing Asynchronous BFT Consensus for Lower Latency and Enhanced Throughput (full version). arXiv:2504.12766 https:\/\/arxiv.org\/abs\/2504.12766"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623101"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3409082"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS60354.2023.00020"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3492321.3519594"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484808"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243812"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3616633"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2005.13"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-18283-9_14"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3572848.3577524"},{"key":"e_1_2_1_26_1","volume-title":"Speeding Dumbo: Pushing Asynchronous BFT Closer to Practice. Cryptology ePrint Archive","author":"Guo Bingyong","year":"2022","unstructured":"Bingyong Guo, Yuan Lu, Zhenliang Lu, Qiang Tang, Jing Xu, and Zhenfeng Zhang. 2022. Speeding Dumbo: Pushing Asynchronous BFT Closer to Practice. Cryptology ePrint Archive (2022)."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417262"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366625.3369437"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467905"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_17"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3600006.3613164"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559346"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405707"},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the 28th International Conference on Financial Cryptography and Data Security. Springer, 51\u201373","author":"Malkhi Dahlia","year":"2024","unstructured":"Dahlia Malkhi, Chrysoula Stathakopoulou, and Maofan Yin. 2024. BBCA-CHAIN: Low latency, High Throughput BFT Consensus on a DAG. In Proceedings of the 28th International Conference on Financial Cryptography and Data Security. Springer, 51\u201373."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978399"},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of the 33rd ACM Symposium on Principles of Distributed Computing. ACM, 2\u20139.","author":"Most\u00e9faoui Achour","year":"2014","unstructured":"Achour Most\u00e9faoui, Hamouma Moumen, and Michel Raynal. 2014. Signature-free Asynchronous Byzantine Consensus with t < n\/3 and O(n2) Messages. In Proceedings of the 33rd ACM Symposium on Principles of Distributed Computing. ACM, 2\u20139."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551816"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/11795490_9"},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of the 46th IEEE Symposium on Security and Privacy. IEEE.","author":"Shrestha Nibesh","year":"2025","unstructured":"Nibesh Shrestha, Rohan Shrothrium, Aniket Kate, and Kartik Nayak. 2025. Sail-fish: Towards Improving Latency of DAG-based BFT. In Proceedings of the 46th IEEE Symposium on Security and Privacy. IEEE."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559361"},{"key":"e_1_2_1_41_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3503042","article-title":"BFT in Blockchains: From Protocols to Use","volume":"54","author":"Wang Xin","year":"2022","unstructured":"Xin Wang, Sisi Duan, James Clavin, and Haibin Zhang. 2022. BFT in Blockchains: From Protocols to Use Cases. Comput. Surveys 54, 10 (2022), 1\u201337.","journal-title":"Cases. Comput. Surveys"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/3561261.3561264"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2020.2969706"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559348"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJWGS.2018.095647"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3734839.3734850","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T16:01:28Z","timestamp":1756483288000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3734839.3734850"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":46,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["10.14778\/3734839.3734850"],"URL":"https:\/\/doi.org\/10.14778\/3734839.3734850","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2025,3]]},"assertion":[{"value":"2025-08-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}