{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T10:50:11Z","timestamp":1775559011578,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819583980","type":"print"},{"value":"9789819583997","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-8399-7_18","type":"book-chapter","created":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T09:55:34Z","timestamp":1775555734000},"page":"322-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["GP-BFT: A Low-Latency BFT Protocol Under Grouped Multi-committee Parallel Consensus"],"prefix":"10.1007","author":[{"given":"Changsong","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shukang","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yujue","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglin","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,8]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","unstructured":"Abraham, I., Malkhi, D., Nayak, K., Ren, L., Yin, M.: Sync hotstuff: simple and practical synchronous state machine replication. In: 2020 IEEE Symposium on Security and Privacy (SP), pp. 106\u2013118 (2020). https:\/\/doi.org\/10.1109\/SP40000.2020.00044","DOI":"10.1109\/SP40000.2020.00044"},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Abraham, I., Nayak, K., Shrestha, N.: Optimal good-case latency for rotating leader synchronous BFT. In: Bramas, Q., Gramoli, V., Milani, A. (eds.) 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 217, pp. 27:1\u201327:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2022). https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2021.27","DOI":"10.4230\/LIPIcs.OPODIS.2021.27"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Abspoel, M., Attema, T., Rambaud, M.: Brief announcement: malicious security comes for free in consensus with leaders. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, PODC\u201921, pp. 195\u2013198. Association for Computing Machinery, New York (2021). https:\/\/doi.org\/10.1145\/3465084.3467953","DOI":"10.1145\/3465084.3467953"},{"issue":"4","key":"18_CR4","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1109\/TDSC.2010.70","volume":"8","author":"Y Amir","year":"2011","unstructured":"Amir, Y., Coan, B., Kirsch, J., Lane, J.: Prime: byzantine replication under attack. IEEE Trans. Dependable Secure Comput. 8(4), 564\u2013577 (2011). https:\/\/doi.org\/10.1109\/TDSC.2010.70","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"18_CR5","unstructured":"Buchman, E.: Tendermint: byzantine fault tolerance in the age of blockchains (2016). http:\/\/hdl.handle.net\/10214\/9769"},{"key":"18_CR6","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Proceedings of the Third Symposium on Operating Systems Design and Implementation, OSDI \u201999, pp. 173\u2013186. USENIX Association (1999). https:\/\/dl.acm.org\/doi\/10.5555\/296806.296824"},{"key":"18_CR7","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Proceedings of the Third Symposium on Operating Systems Design and Implementation, OSDI \u201999, pp. 173\u2013186. USENIX Association (1999). https:\/\/dl.acm.org\/doi\/proceedings\/10.5555\/296806"},{"key":"18_CR8","doi-asserted-by":"publisher","unstructured":"Chan, B.Y., Shi, E.: Streamlet: textbook streamlined blockchains. In: Proceedings of the 2nd ACM Conference on Advances in Financial Technologies, AFT \u201920, pp. 1\u201311. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3419614.3423256","DOI":"10.1145\/3419614.3423256"},{"key":"18_CR9","unstructured":"Chan, T.H.H., Pass, R., Shi, E.: PiLi: an extremely simple synchronous blockchain. Cryptology ePrint Archive, Paper 2018\/980 (2018). https:\/\/eprint.iacr.org\/2018\/980"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"2664","DOI":"10.1109\/TIFS.2025.3544034","volume":"20","author":"X Fu","year":"2025","unstructured":"Fu, X., Li, M., Zeng, Q., Li, T., Yang, S., Guan, Y., Liu, C.: Hamster: a fast synchronous byzantine fault tolerant protocol. IEEE Trans. Inf. Forensics Secur. 20, 2664\u20132676 (2025). https:\/\/doi.org\/10.1109\/TIFS.2025.3544034","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"18_CR11","doi-asserted-by":"publisher","unstructured":"Gao, M., Lu, G., Wang, Z., Gao, Y.: Wpbft: an improved consensus algorithm based on the hotstuff algorithm. In: 2023 2nd International Conference on Artificial Intelligence and Blockchain Technology (AIBT), pp. 56\u201359 (2023). https:\/\/doi.org\/10.1109\/AIBT57480.2023.00018","DOI":"10.1109\/AIBT57480.2023.00018"},{"key":"18_CR12","doi-asserted-by":"publisher","unstructured":"Gelashvili, R., Kokoris-Kogias, L., Sonnino, A., Spiegelman, A., Xiang, Z.: Jolteon and ditto: network-adaptive efficient consensus with asynchronous fallback. In: Eyal, I., Garay, J. (eds.) Financial Cryptography and Data Security, pp. 296\u2013315. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_14","DOI":"10.1007\/978-3-031-18283-9_14"},{"key":"18_CR13","unstructured":"Giridharan, N., Howard, H., Abraham, I., Crooks, N., Tomescu, A.: No-commit proofs: defeating livelock in BFT. Cryptology ePrint Archive, Paper 2021\/1308 (2021). https:\/\/eprint.iacr.org\/2021\/1308"},{"key":"18_CR14","doi-asserted-by":"publisher","unstructured":"Guo, Y., Pass, R., Shi, E.: Synchronous, with a chance of partition tolerance. In: Boldyreva, A., Micciancio, D. (eds.) Advances in Cryptology - CRYPTO 2019, pp. 499\u2013529. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_18","DOI":"10.1007\/978-3-030-26948-7_18"},{"key":"18_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2022.109419","volume":"219","author":"K Huang","year":"2022","unstructured":"Huang, K., Hou, R., Zeng, Y.: Lwsbft: leaderless weakly synchronous bft protocol. Comput. Netw. 219, 109419 (2022). https:\/\/doi.org\/10.1016\/j.comnet.2022.109419","journal-title":"Comput. Netw."},{"key":"18_CR16","doi-asserted-by":"publisher","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem, pp. 203\u2013226. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3335772.3335936","DOI":"10.1145\/3335772.3335936"},{"key":"18_CR17","doi-asserted-by":"publisher","unstructured":"Malkhi, D., Nayak, K., Ren, L.: Flexible byzantine fault tolerance. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201919, pp. 1041\u20131053. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3319535.3354225","DOI":"10.1145\/3319535.3354225"},{"key":"18_CR18","unstructured":"Momose, A., Cruz, J.P., Kaji, Y.: Hybrid-BFT: Optimistically responsive synchronous consensus with optimal latency or resilience. Cryptology ePrint Archive, Paper 2020\/406 (2020). https:\/\/eprint.iacr.org\/2020\/406"},{"key":"18_CR19","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008). https:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"18_CR20","doi-asserted-by":"publisher","unstructured":"Sui, X., Duan, S., Zhang, H.: Marlin: two-phase bft with linearity. In: 2022 52nd Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 54\u201366 (2022). https:\/\/doi.org\/10.1109\/DSN53405.2022.00018","DOI":"10.1109\/DSN53405.2022.00018"},{"issue":"10s","key":"18_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3503042","volume":"54","author":"X Wang","year":"2022","unstructured":"Wang, X., Duan, S., Clavin, J., Zhang, H.: Bft in blockchains: from protocols to use cases. ACM Comput. Surv. 54(10s), 1\u201337 (2022). https:\/\/doi.org\/10.1145\/3503042","journal-title":"ACM Comput. Surv."},{"key":"18_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119322","volume":"645","author":"B Wen","year":"2023","unstructured":"Wen, B., Wang, Y., Ding, Y., Zheng, H., Qin, B., Yang, C.: Security and privacy protection technologies in securing blockchain applications. Inf. Sci. 645, 119322 (2023). https:\/\/doi.org\/10.1016\/j.ins.2023.119322","journal-title":"Inf. Sci."},{"key":"18_CR23","doi-asserted-by":"publisher","unstructured":"Yao, D., et al.: Dybft: leaderless bft protocol based on locally adjustable valid committee set mechanism. World Wide Web 28(1), 17 (2025). https:\/\/doi.org\/10.1007\/s11280-024-01324-w","DOI":"10.1007\/s11280-024-01324-w"},{"key":"18_CR24","doi-asserted-by":"publisher","unstructured":"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, PODC \u201919, pp. 347\u2013356. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3293611.3331591","DOI":"10.1145\/3293611.3331591"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-8399-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T09:55:39Z","timestamp":1775555739000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-8399-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819583980","9789819583997"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-8399-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"8 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zhengzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ieee-cybermatics.org\/2025\/ica3pp\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}