{"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":1774942932712,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"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":[[2024,6,17]]},"DOI":"10.1145\/3662158.3662787","type":"proceedings-article","created":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T14:38:06Z","timestamp":1717598286000},"page":"135-144","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Lumiere: Making Optimal BFT for Partial Synchrony Practical"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0228-2243","authenticated-orcid":false,"given":"Andrew","family":"Lewis-Pye","sequence":"first","affiliation":[{"name":"London School of Economics, London, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7038-7250","authenticated-orcid":false,"given":"Dahlia","family":"Malkhi","sequence":"additional","affiliation":[{"name":"UC Santa Barbara, Santa Barbara, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9092-4327","authenticated-orcid":false,"given":"Oded","family":"Naor","sequence":"additional","affiliation":[{"name":"Starkware, Netanya, Israel"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5675-263X","authenticated-orcid":false,"given":"Kartik","family":"Nayak","sequence":"additional","affiliation":[{"name":"Duke University, Durham, United States of America"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/647097.717005"},{"key":"e_1_3_2_1_2_1","volume-title":"Making Byzantine Consensus Live. In 34th International Symposium on Distributed Computing.","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."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2022.12"},{"key":"e_1_3_2_1_4_1","volume-title":"36th International Symposium on Distributed Computing (DISC","author":"Bravo Manuel","year":"2022","unstructured":"Manuel Bravo, Gregory Chockler, and Alexey Gotsman. 2022. Liveness and latency of Byzantine state-machine replication. In 36th International Symposium on Distributed Computing (DISC 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-022-00432-y"},{"key":"e_1_3_2_1_6_1","first-page":"173","article-title":"Practical byzantine fault tolerance","volume":"99","author":"Castro Miguel","year":"1999","unstructured":"Miguel Castro, Barbara Liskov, et al. 1999. Practical byzantine fault tolerance. In OsDI, Vol. 99. 173--186.","journal-title":"OsDI"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2022.14"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3457588.3457600"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294267"},{"key":"e_1_3_2_1_12_1","volume-title":"Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model. CoRR abs\/2201.01107","author":"Lewis-Pye Andrew","year":"2022","unstructured":"Andrew Lewis-Pye. 2022. Quadratic worst-case message complexity for State Machine Replication in the partial synchrony model. CoRR abs\/2201.01107 (2022). arXiv:2201.01107 https:\/\/arxiv.org\/abs\/2201.01107"},{"key":"e_1_3_2_1_13_1","volume-title":"Fever: Optimal Responsive View Synchronisation. arXiv preprint arXiv:2301.09881","author":"Lewis-Pye Andrew","year":"2023","unstructured":"Andrew Lewis-Pye and Ittai Abraham. 2023. Fever: Optimal Responsive View Synchronisation. arXiv preprint arXiv:2301.09881 (2023)."},{"key":"e_1_3_2_1_14_1","volume-title":"Lumiere: Making Optimal BFT for Partial Synchrony Practical. arXiv:2311.08091 [cs.DC] Full version of this paper.","author":"Lewis-Pye Andrew","year":"2024","unstructured":"Andrew Lewis-Pye, Dahlia Malkhi, Oded Naor, and Kartik Nayak. 2024. Lumiere: Making Optimal BFT for Partial Synchrony Practical. arXiv:2311.08091 [cs.DC] Full version of this paper."},{"key":"e_1_3_2_1_15_1","volume-title":"HotStuff-2: Optimal Two-Phase Responsive BFT. Cryptology ePrint Archive","author":"Malkhi Dahlia","year":"2023","unstructured":"Dahlia Malkhi and Kartik Nayak. 2023. HotStuff-2: Optimal Two-Phase Responsive BFT. Cryptology ePrint Archive (2023)."},{"key":"e_1_3_2_1_16_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 22 2021). https:\/\/cryptoeconomicsystems.pubpub.org\/pub\/naor-cogsworth-synchronization.","journal-title":"Cryptoeconomic Systems"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2020.26"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756169.1756190"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"}],"event":{"name":"PODC '24: 43rd ACM Symposium on Principles of Distributed Computing","location":"Nantes France","acronym":"PODC '24","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662787","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:43:41Z","timestamp":1750290221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662787"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":20,"alternative-id":["10.1145\/3662158.3662787","10.1145\/3662158"],"URL":"https:\/\/doi.org\/10.1145\/3662158.3662787","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}