{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:24:14Z","timestamp":1767338654573,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:00:00Z","timestamp":1626825600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"TrustShare Innovation Chair"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,21]]},"DOI":"10.1145\/3465084.3467924","type":"proceedings-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T21:09:28Z","timestamp":1627074568000},"page":"343-353","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Revisiting Optimal Resilience of Fast Byzantine Consensus"],"prefix":"10.1145","author":[{"given":"Petr","family":"Kuznetsov","sequence":"first","affiliation":[{"name":"LTCI, T\u00e9l\u00e9com Paris, Institut Polytechnique de Paris, Paris, France"}]},{"given":"Andrei","family":"Tonkikh","sequence":"additional","affiliation":[{"name":"National Research University Higher School of Economics, Saint-Petersburg, Russian Fed."}]},{"given":"Yan X","family":"Zhang","sequence":"additional","affiliation":[{"name":"San Jos\u00e9 State University, San Jos\u00e9, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Revisiting fast practical byzantine fault tolerance. arXiv preprint arXiv:1712.01367","author":"Abraham Ittai","year":"2017","unstructured":"Ittai Abraham , Guy Gueta , Dahlia Malkhi , Lorenzo Alvisi , Rama Kotla , and Jean-Philippe Martin . 2017. Revisiting fast practical byzantine fault tolerance. arXiv preprint arXiv:1712.01367 ( 2017 ). Ittai Abraham, Guy Gueta, Dahlia Malkhi, Lorenzo Alvisi, Rama Kotla, and Jean-Philippe Martin. 2017. Revisiting fast practical byzantine fault tolerance. arXiv preprint arXiv:1712.01367 (2017)."},{"key":"e_1_3_2_2_2_1","volume-title":"Revisiting fast practical byzantine fault tolerance: Thelma, velma, and zelma. arXiv preprint arXiv:1801.10022","author":"Abraham Ittai","year":"2018","unstructured":"Ittai Abraham , Guy Gueta , Dahlia Malkhi , and Jean-Philippe Martin . 2018. Revisiting fast practical byzantine fault tolerance: Thelma, velma, and zelma. arXiv preprint arXiv:1801.10022 ( 2018 ). Ittai Abraham, Guy Gueta, Dahlia Malkhi, and Jean-Philippe Martin. 2018. Revisiting fast practical byzantine fault tolerance: Thelma, velma, and zelma. arXiv preprint arXiv:1801.10022 (2018)."},{"key":"e_1_3_2_2_3_1","volume-title":"2021 a. Fast Validated Byzantine Broadcast. arXiv preprint arXiv:2102.07932","author":"Abraham Ittai","year":"2021","unstructured":"Ittai Abraham , Kartik Nayak , Ling Ren , and Zhuolun Xiang . 2021 a. Fast Validated Byzantine Broadcast. arXiv preprint arXiv:2102.07932 ( 2021 ). Ittai Abraham, Kartik Nayak, Ling Ren, and Zhuolun Xiang. 2021 a. Fast Validated Byzantine Broadcast. arXiv preprint arXiv:2102.07932 (2021)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467899"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190538"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2014.43"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.214134"},{"key":"e_1_3_2_2_8_1","volume-title":"34th International Symposium on Distributed Computing (DISC","author":"Bravo Manuel","year":"2020","unstructured":"Manuel Bravo , Gregory Chockler , and Alexey Gotsman . 2020 . Making Byzantine consensus live . In 34th International Symposium on Distributed Computing (DISC 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik. Manuel Bravo, Gregory Chockler, and Alexey Gotsman. 2020. Making Byzantine consensus live. In 34th International Symposium on Distributed Computing (DISC 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_2_9_1","unstructured":"Ethan Buchman. 2016. Tendermint: Byzantine fault tolerance in the age of blockchains . Ph.D. Dissertation.  Ethan Buchman. 2016. Tendermint: Byzantine fault tolerance in the age of blockchains . Ph.D. Dissertation."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1298455.1298487"},{"key":"e_1_3_2_2_11_1","first-page":"173","article-title":"Practical byzantine fault tolerance","volume":"99","author":"Castro Miguel","year":"1999","unstructured":"Miguel Castro , Barbara Liskov , 1999 . Practical byzantine fault tolerance . In OSDI , Vol. 99. 173 -- 186 . Miguel Castro, Barbara Liskov, et almbox. 1999. Practical byzantine fault tolerance. In OSDI, Vol. 99. 173--186.","journal-title":"OSDI"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629602"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2014.2312331"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2019.00063"},{"key":"e_1_3_2_2_16_1","volume-title":"Flavio Paiva Junqueira, and Benjamin Reed","author":"Hunt Patrick","year":"2010","unstructured":"Patrick Hunt , Mahadev Konar , Flavio Paiva Junqueira, and Benjamin Reed . 2010 . ZooKeeper: Wait-free Coordination for Internet-scale Systems.. In USENIX annual technical conference, Vol. 8 . Patrick Hunt, Mahadev Konar, Flavio Paiva Junqueira, and Benjamin Reed. 2010. ZooKeeper: Wait-free Coordination for Internet-scale Systems.. In USENIX annual technical conference, Vol. 8."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294267"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.2002.1180196"},{"key":"e_1_3_2_2_19_1","volume-title":"Time, Clocks, and the Ordering of Events in a Distributed System. Communications","author":"Lamport Leslie","year":"1978","unstructured":"Leslie Lamport . 1978. Time, Clocks, and the Ordering of Events in a Distributed System. Communications ( 1978 ). Leslie Lamport. 1978. Time, Clocks, and the Ordering of Events in a Distributed System. Communications (1978)."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24100-0_22"},{"key":"e_1_3_2_2_21_1","first-page":"18","article-title":"Paxos made simple","volume":"32","author":"Leslie Lamport","year":"2001","unstructured":"Leslie Lamport et almbox. 2001 . Paxos made simple . ACM Sigact News , Vol. 32 , 4 (2001), 18 -- 25 . Leslie Lamport et almbox. 2001. Paxos made simple. ACM Sigact News , Vol. 32, 4 (2001), 18--25.","journal-title":"ACM Sigact News"},{"key":"e_1_3_2_2_22_1","unstructured":"Barbara Liskov and James Cowling. 2012. Viewstamped replication revisited. (2012).  Barbara Liskov and James Cowling. 2012. Viewstamped replication revisited. (2012)."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2006.35"},{"key":"e_1_3_2_2_24_1","volume-title":"Expected linear round synchronization: The missing link for linear Byzantine SMR. arXiv preprint arXiv:2002.07539","author":"Naor Oded","year":"2020","unstructured":"Oded Naor and Idit Keidar . 2020. Expected linear round synchronization: The missing link for linear Byzantine SMR. arXiv preprint arXiv:2002.07539 ( 2020 ). Oded Naor and Idit Keidar. 2020. Expected linear round synchronization: The missing link for linear Byzantine SMR. arXiv preprint arXiv:2002.07539 (2020)."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/62546.62549"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"},{"key":"e_1_3_2_2_28_1","volume-title":"Revisiting hbft: Speculative byzantine fault tolerance with minimum cost. arXiv preprint arXiv:1902.08505","author":"Shrestha Nibesh","year":"2019","unstructured":"Nibesh Shrestha , Mohan Kumar , and SiSi Duan . 2019. Revisiting hbft: Speculative byzantine fault tolerance with minimum cost. arXiv preprint arXiv:1902.08505 ( 2019 ). Nibesh Shrestha, Mohan Kumar, and SiSi Duan. 2019. Revisiting hbft: Speculative byzantine fault tolerance with minimum cost. arXiv preprint arXiv:1902.08505 (2019)."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87779-0_30"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"}],"event":{"name":"PODC '21: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Virtual Event Italy","acronym":"PODC '21"},"container-title":["Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467924","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465084.3467924","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:25Z","timestamp":1750191505000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467924"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":30,"alternative-id":["10.1145\/3465084.3467924","10.1145\/3465084"],"URL":"https:\/\/doi.org\/10.1145\/3465084.3467924","relation":{},"subject":[],"published":{"date-parts":[[2021,7,21]]},"assertion":[{"value":"2021-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}