{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T18:01:12Z","timestamp":1774893672209,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819584109","type":"print"},{"value":"9789819584116","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-8411-6_8","type":"book-chapter","created":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T17:09:14Z","timestamp":1774890554000},"page":"100-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["pBeeGees: A Prudent Approach to\u00a0Certificate-Decoupled BFT Consensus"],"prefix":"10.1007","author":[{"given":"Kaiji","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingjing","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junyao","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiwen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weigang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jieying","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,31]]},"reference":[{"key":"8_CR1","unstructured":"Castro, M., Liskov, B., et al.: Practical byzantine fault tolerance. In: OsDI. 99, 173\u2013186 (1999)"},{"key":"8_CR2","unstructured":"Chan, T.H.H., Pass, R., Shi, E.: PaLa: A Simple Partially Synchronous Blockchain (2018)"},{"issue":"2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s00446-023-00458-w","volume":"37","author":"P Civit","year":"2024","unstructured":"Civit, P., et al.: Byzantine consensus is $$\\theta $$ (n 2): the Dolev-reischuk bound is tight even in partial synchrony! Distrib. Comput. 37(2), 89\u2013119 (2024)","journal-title":"Distrib. Comput."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Duan, S., Reiter, M.K., Zhang, H.: BEAT: Asynchronous BFT Made Practical. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 2028\u20132041. ACM, Toronto Canada (Oct 2018)","DOI":"10.1145\/3243734.3243812"},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM (JACM) 35(2), 288\u2013323 (1988)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM (JACM) 32(2), 374\u2013382 (1985)","journal-title":"J. ACM (JACM)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Gao, Y., Lu, Y., Lu, Z., Tang, Q., Xu, J., Zhang, Z.: Dumbo-ng: fast asynchronous BFT consensus with throughput-oblivious latency. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pp. 1187\u20131201 (2022)","DOI":"10.1145\/3548606.3559379"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Giridharan, N., Suri-Payer, F., Ding, M., Howard, H., Abraham, I., Crooks, N.: Beegees: stayin\u2019alive in chained BFT. In: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, pp. 233\u2013243 (2023)","DOI":"10.1145\/3583668.3594572"},{"key":"8_CR9","unstructured":"Jalalzai, M.M., Niu, J., Feng, C., Gai, F.: Fast-hotstuff: a fast and resilient hotstuff protocol. arXiv preprint arXiv:2010.11454 (2020)"},{"key":"8_CR10","unstructured":"Lewis-Pye, A.: Quadratic worst-case message complexity for state machine replication in the partial synchrony model. arXiv preprint arXiv:2201.01107 (2022)"},{"key":"8_CR11","unstructured":"Lewis-Pye, A., Abraham, I.: Fever: optimal responsive view synchronisation. arXiv preprint arXiv:2301.09881 (2023)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Lewis-Pye, A., Malkhi, D., Naor, O., Nayak, K.: Lumiere: Making optimal BFT for partial synchrony practical. In: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, pp. 135\u2013144 (2024)","DOI":"10.1145\/3662158.3662787"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Miller, A., Xia, Y., Croman, K., Shi, E., Song, D.: The honey badger of BFT protocols. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 31\u201342 (2016)","DOI":"10.1145\/2976749.2978399"},{"key":"8_CR14","unstructured":"Resilient Systems Lab.: relab\/hotstuff. https:\/\/github.com\/relab\/hotstuff"},{"key":"8_CR15","unstructured":"Team, T.D.: Diembft v4: State machine replication in the diem blockchain (2021). https:\/\/api.semanticscholar.org\/CorpusID:246607407"},{"key":"8_CR16","unstructured":"Yang, K., Zhang, J., Zheng, J., Liu, Q., Wu, W., Zhou, J.: pBeeGees: A Prudent Approach to Certificate-Decoupled BFT Consensus. arXiv preprint arXiv2509.17496 (Sep 2025)"},{"key":"8_CR17","doi-asserted-by":"crossref","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, pp. 347\u2013356 (2019)","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-8411-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T17:09:16Z","timestamp":1774890556000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-8411-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819584109","9789819584116"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-8411-6_8","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":"31 March 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"}}]}}