{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T07:42:12Z","timestamp":1774942932735,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T00:00:00Z","timestamp":1686873600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,19]]},"DOI":"10.1145\/3583668.3594572","type":"proceedings-article","created":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T22:28:38Z","timestamp":1686954518000},"page":"233-243","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["BeeGees: Stayin' Alive in Chained BFT"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-2175-2611","authenticated-orcid":false,"given":"Neil","family":"Giridharan","sequence":"first","affiliation":[{"name":"UC Berkeley, Berkeley, California, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3948-6725","authenticated-orcid":false,"given":"Florian","family":"Suri-Payer","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, New York, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7674-0548","authenticated-orcid":false,"given":"Matthew","family":"Ding","sequence":"additional","affiliation":[{"name":"UC Berkeley, Berkeley, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5256-7664","authenticated-orcid":false,"given":"Heidi","family":"Howard","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9568-7674","authenticated-orcid":false,"given":"Ittai","family":"Abraham","sequence":"additional","affiliation":[{"name":"VMware Research, Herzliya, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3567-801X","authenticated-orcid":false,"given":"Natacha","family":"Crooks","sequence":"additional","affiliation":[{"name":"UC Berkeley, Berkeley, United States of America"}]}],"member":"320","published-online":{"date-parts":[[2023,6,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2102.07932"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467899"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.OPODIS.2021.27"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.OPODIS.2021.7"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2020.23"},{"key":"e_1_3_2_1_7_1","unstructured":"Ethan Buchman. 2016. Tendermint: Byzantine fault tolerance in the age of blockchains. Ph.D. Dissertation. University of Guelph. http:\/\/hdl.handle.net\/10214\/9769"},{"key":"e_1_3_2_1_8_1","volume-title":"Casper the friendly finality gadget. arXiv preprint arXiv:1710.09437 abs\/1710.09437","author":"Buterin Vitalik","year":"2017","unstructured":"Vitalik Buterin and Virgil Griffith. 2017. Casper the friendly finality gadget. arXiv preprint arXiv:1710.09437 abs\/1710.09437 (2017)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/296806.296824"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1558977.1558988"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-18283-9_13"},{"key":"e_1_3_2_1_12_1","volume-title":"Flash boys 2.0: Frontrunning, transaction reordering, and consensus instability in decentralized exchanges. arXiv preprint arXiv:1904.05234","author":"Daian Philip","year":"2019","unstructured":"Philip Daian, Steven Goldfeder, Tyler Kell, Yunqi Li, Xueyuan Zhao, Iddo Bentov, Lorenz Breidenbach, and Ari Juels. 2019. Flash boys 2.0: Frontrunning, transaction reordering, and consensus instability in decentralized exchanges. arXiv preprint arXiv:1904.05234 (2019)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3492321.3519594"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.spl.2021.109132"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-18283-9_14"},{"key":"e_1_3_2_1_17_1","volume-title":"No-commit proofs: Defeating livelock in bft. Cryptology ePrint Archive","author":"Giridharan Neil","year":"2021","unstructured":"Neil Giridharan, Heidi Howard, Ittai Abraham, Natacha Crooks, and Alin Tomescu. 2021. No-commit proofs: Defeating livelock in bft. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Neil Giridharan Florian Suri-Payer Matthew Ding Heidi Howard Ittai Abraham and Natacha Crooks. 2023. BeeGees: stayin' alive in chained BFT. arXiv:2205.11652 [cs.DC]","DOI":"10.1145\/3583668.3594572"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2019.00063"},{"key":"e_1_3_2_1_20_1","volume-title":"SoK: Preventing Transaction Reordering Manipulations in Decentralized Finance. arXiv preprint arXiv:2203.11520","author":"Heimbach Lioba","year":"2022","unstructured":"Lioba Heimbach and Roger Wattenhofer. 2022. SoK: Preventing Transaction Reordering Manipulations in Decentralized Finance. arXiv preprint arXiv:2203.11520 (2022)."},{"key":"e_1_3_2_1_21_1","volume-title":"Fast-HotStuff: A Fast and Resilient HotStuff Protocol. CoRR abs\/2010.11454","author":"Jalalzai Mohammad M.","year":"2020","unstructured":"Mohammad M. Jalalzai, Jianyu Niu, and Chen Feng. 2020. Fast-HotStuff: A Fast and Resilient HotStuff Protocol. CoRR abs\/2010.11454 (2020). arXiv:2010.11454 https:\/\/arxiv.org\/abs\/2010.11454"},{"key":"e_1_3_2_1_22_1","volume-title":"Themis: Fast, strong order-fairness in byzantine consensus. Cryptology ePrint Archive","author":"Kelkar Mahimna","year":"2021","unstructured":"Mahimna Kelkar, Soubhik Deb, Sishan Long, Ari Juels, and Sreeram Kannan. 2021. Themis: Fast, strong order-fairness in byzantine consensus. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_1_23_1","volume-title":"Annual International Cryptology Conference. Springer, 451--480","author":"Kelkar Mahimna","year":"2020","unstructured":"Mahimna Kelkar, Fan Zhang, Steven Goldfeder, and Ari Juels. 2020. Orderfairness for byzantine consensus. In Annual International Cryptology Conference. Springer, 451--480."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1658357.1658358"},{"key":"e_1_3_2_1_25_1","volume-title":"Maximal Extractable Value (MEV) Protection on a DAG. arXiv preprint arXiv:2208.00940","author":"Malkhi Dahlia","year":"2022","unstructured":"Dahlia Malkhi and Pawel Szalachowski. 2022. Maximal Extractable Value (MEV) Protection on a DAG. arXiv preprint arXiv:2208.00940 (2022)."},{"key":"e_1_3_2_1_26_1","first-page":"2","article-title":"Cogsworth: Byzantine View Synchronization","volume":"1","author":"Naor Oded","year":"2021","unstructured":"Oded Naor, Mathieu Baudet, Dahlia Malkhi, and Alexander Spiegelman. 2021. Cogsworth: Byzantine View Synchronization. Cryptoeconomic Systems 1, 2 (Oct 2021). https:\/\/cryptoeconomicsystems.pubpub.org\/pub\/naor-cogsworth-synchronization.","journal-title":"Cryptoeconomic Systems"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488706"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559361"},{"key":"e_1_3_2_1_29_1","volume-title":"Marlin: Two-Phase BFT with Linearity. Cryptology ePrint Archive","author":"Sui Xiao","year":"2022","unstructured":"Xiao Sui, Sisi Duan, and Haibin Zhang. 2022. Marlin: Two-Phase BFT with Linearity. Cryptology ePrint Archive (2022)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477132.3483552"},{"key":"e_1_3_2_1_31_1","unstructured":"Aptos Team. [n.d.]. Aptos homepage. https:\/\/aptoslabs.com."},{"key":"e_1_3_2_1_33_1","unstructured":"Diem Team. [n.d.]. Diem homepage. https:\/\/www.diem.com."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3464298.3484503"},{"key":"e_1_3_2_1_36_1","volume-title":"Byzantine Ordered Consensus without Byzantine Oligarchy. (Nov","author":"Zhang Yunhao","year":"2020","unstructured":"Yunhao Zhang, Srinath Setty, Qi Chen, Lidong Zhou, and Lorenzo Alvisi. 2020. Byzantine Ordered Consensus without Byzantine Oligarchy. (Nov. 2020), 633--649. https:\/\/www.usenix.org\/conference\/osdi20\/presentation\/zhang-yunhao"}],"event":{"name":"PODC '23: 2023 ACM Symposium on Principles of Distributed Computing","location":"Orlando FL USA","acronym":"PODC '23","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583668.3594572","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583668.3594572","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:55Z","timestamp":1750178275000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583668.3594572"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,16]]},"references-count":34,"alternative-id":["10.1145\/3583668.3594572","10.1145\/3583668"],"URL":"https:\/\/doi.org\/10.1145\/3583668.3594572","relation":{},"subject":[],"published":{"date-parts":[[2023,6,16]]},"assertion":[{"value":"2023-06-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}