{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:44:40Z","timestamp":1782971080559,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100013165","name":"National Energy Technology Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100013165","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["SIEVE"],"award-info":[{"award-number":["SIEVE"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1916939"],"award-info":[{"award-number":["1916939"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ripple"},{"name":"Cylab","award":["Seed Funding"],"award-info":[{"award-number":["Seed Funding"]}]},{"name":"PNC center for financial services innovation"},{"name":"JP Morgan","award":["Faculty Fellowship"],"award-info":[{"award-number":["Faculty Fellowship"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538442","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"70-80","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Optimal Synchronous Approximate Agreement with Asynchronous Fallback"],"prefix":"10.1145","author":[{"given":"Diana","family":"Ghinea","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen-Da","family":"Liu-Zhang","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Principles of Distributed Systems","author":"Abraham Ittai","unstructured":"Ittai Abraham , Yonatan Amit , and Danny Dolev . 2005. Optimal Resilience Asynchronous Approximate Agreement . In Principles of Distributed Systems , Teruo Higashino (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg , 229--239. Ittai Abraham, Yonatan Amit, and Danny Dolev. 2005. Optimal Resilience Asynchronous Approximate Agreement. In Principles of Distributed Systems, Teruo Higashino (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 229--239."},{"key":"e_1_3_2_2_2_1","volume-title":"Structural Information and Communication Complexity, Tomasz Jurdzi'ski and Stefan Schmid (Eds.)","author":"Alistarh Dan","unstructured":"Dan Alistarh , Faith Ellen , and Joel Rybicki . 2021. Wait-Free Approximate Agreement on Graphs . In Structural Information and Communication Complexity, Tomasz Jurdzi'ski and Stefan Schmid (Eds.) . Springer International Publishing , Cham , 87--105. https:\/\/doi.org\/10.1007\/978--3-030--79527--6_6 10.1007\/978--3-030--79527--6_6 Dan Alistarh, Faith Ellen, and Joel Rybicki. 2021. Wait-Free Approximate Agreement on Graphs. In Structural Information and Communication Complexity, Tomasz Jurdzi'ski and Stefan Schmid (Eds.). Springer International Publishing, Cham, 87--105. https:\/\/doi.org\/10.1007\/978--3-030--79527--6_6"},{"key":"e_1_3_2_2_3_1","volume-title":"Hoch","author":"Ben-Or Michael","year":"2010","unstructured":"Michael Ben-Or , Danny Dolev , and Ezra N . Hoch . 2010 . Brief Announcement : Simple Gradecast Based Algorithms. In Distributed Computing, Nancy A. Lynch and Alexander A. Shvartsman (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg, 194--197. Michael Ben-Or, Danny Dolev, and Ezra N. Hoch. 2010. Brief Announcement: Simple Gradecast Based Algorithms. In Distributed Computing, Nancy A. Lynch and Alexander A. Shvartsman (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 194--197."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-36030-6_6"},{"key":"e_1_3_2_2_5_1","volume-title":"Tardigrade: An Atomic Broadcast Protocol for Arbitrary Network Conditions. In Advances in Cryptology -- ASIACRYPT","author":"Blum Erica","year":"2021","unstructured":"Erica Blum , Jonathan Katz , and Julian Loss . 2021 . Tardigrade: An Atomic Broadcast Protocol for Arbitrary Network Conditions. In Advances in Cryptology -- ASIACRYPT 2021, Mehdi Tibouchi and Huaxiong Wang (Eds.). Springer International Publishing , Cham, 547--572. https:\/\/doi.org\/10.1007\/978--3-030--92075--3_19 10.1007\/978--3-030--92075--3_19 Erica Blum, Jonathan Katz, and Julian Loss. 2021. Tardigrade: An Atomic Broadcast Protocol for Arbitrary Network Conditions. In Advances in Cryptology -- ASIACRYPT 2021, Mehdi Tibouchi and Huaxiong Wang (Eds.). Springer International Publishing, Cham, 547--572. https:\/\/doi.org\/10.1007\/978--3-030--92075--3_19"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_25"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467897"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/646766.704283"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53015-3_9"},{"key":"e_1_3_2_2_10_1","volume-title":"Round- Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols. In ICALP 2017 (LIPIcs","volume":"15","author":"Cohen Ran","year":"2017","unstructured":"Ran Cohen , Sandro Coretti , Juan A. Garay , and Vassilis Zikas . 2017 . Round- Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols. In ICALP 2017 (LIPIcs , Vol. 80), Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, and Anca Muscholl (Eds.). Schloss Dagstuhl,Warsaw, Poland, 37:1-- 37: 15 . https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2017.37 10.4230\/LIPIcs.ICALP.2017.37 Ran Cohen, Sandro Coretti, Juan A. Garay, and Vassilis Zikas. 2017. Round- Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols. In ICALP 2017 (LIPIcs, Vol. 80), Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, and Anca Muscholl (Eds.). Schloss Dagstuhl,Warsaw, Poland, 37:1-- 37:15. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2017.37"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-90459-3_21"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/5925.5931"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_2_14_1","volume-title":"6th ACM PODC, Fred B","author":"Fekete Alan David","year":"1840","unstructured":"Alan David Fekete . 1987. Asynchronous Approximate Agreement . In 6th ACM PODC, Fred B . Schneider (Ed.). ACM, Vancouver, BC , Canada , 64--76. https: \/\/doi.org\/10.1145\/4 1840 .41846 10.1145\/41840.41846 Alan David Fekete. 1987. Asynchronous Approximate Agreement. In 6th ACM PODC, Fred B. Schneider (Ed.). ACM, Vancouver, BC, Canada, 64--76. https: \/\/doi.org\/10.1145\/41840.41846"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01783662"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485242"},{"key":"e_1_3_2_2_18_1","volume-title":"SBFT: A Scalable and Decentralized Trust Infrastructure. In 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks, DSN 2019","author":"Golan-Gueta Guy","year":"2019","unstructured":"Guy Golan-Gueta , Ittai Abraham , Shelly Grossman , Dahlia Malkhi , Benny Pinkas , Michael K. Reiter , Dragos-Adrian Seredinschi , Orr Tamir , and Alin Tomescu . 2019 . SBFT: A Scalable and Decentralized Trust Infrastructure. In 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks, DSN 2019 , Portland, OR, USA, June 24--27 , 2019. IEEE Computer Society, Los Alamitos, CA, USA, 568--580. https:\/\/doi.org\/10.1109\/DSN.2019.00063 10.1109\/DSN.2019.00063 Guy Golan-Gueta, Ittai Abraham, Shelly Grossman, Dahlia Malkhi, Benny Pinkas, Michael K. Reiter, Dragos-Adrian Seredinschi, Orr Tamir, and Alin Tomescu. 2019. SBFT: A Scalable and Decentralized Trust Infrastructure. In 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks, DSN 2019, Portland, OR, USA, June 24--27, 2019. IEEE Computer Society, Los Alamitos, CA, USA, 568--580. https:\/\/doi.org\/10.1109\/DSN.2019.00063"},{"key":"e_1_3_2_2_19_1","volume-title":"3rd ACM PODC, Robert L","author":"Halpern Joseph Y.","unstructured":"Joseph Y. Halpern , Barbara Simons , H. Raymond Strong , and Danny Dolev . 1984. Fault-Tolerant Clock Synchronization . In 3rd ACM PODC, Robert L . Probert, Nancy A. Lynch, and Nicola Santoro (Eds.). ACM, Vancouver, BC , Canada , 89-- 102. https:\/\/doi.org\/10.1145\/800222.806739 10.1145\/800222.806739 Joseph Y. Halpern, Barbara Simons, H. Raymond Strong, and Danny Dolev. 1984. Fault-Tolerant Clock Synchronization. In 3rd ACM PODC, Robert L. Probert, Nancy A. Lynch, and Nicola Santoro (Eds.). ACM, Vancouver, BC, Canada, 89-- 102. https:\/\/doi.org\/10.1145\/800222.806739"},{"key":"e_1_3_2_2_20_1","volume-title":"24th International Conference on Principles of Distributed Systems (OPODIS 2020) (Leibniz International Proceedings in Informatics (LIPIcs)","author":"Hirt Martin","year":"2020","unstructured":"Martin Hirt , Ard Kastrati , and Chen-Da Liu-Zhang . 2021. Multi-Threshold Asynchronous Reliable Broadcast and Consensus . In 24th International Conference on Principles of Distributed Systems (OPODIS 2020) (Leibniz International Proceedings in Informatics (LIPIcs) , Vol. 184), Quentin Bramas, Rotem Oshman, and Paolo Romano (Eds.). Schloss Dagstuhl--Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 6:1--6: 16 . https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS. 2020 .6 10.4230\/LIPIcs.OPODIS.2020.6 Martin Hirt, Ard Kastrati, and Chen-Da Liu-Zhang. 2021. Multi-Threshold Asynchronous Reliable Broadcast and Consensus. In 24th International Conference on Principles of Distributed Systems (OPODIS 2020) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 184), Quentin Bramas, Rotem Oshman, and Paolo Romano (Eds.). Schloss Dagstuhl--Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 6:1--6:16. https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2020.6"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467946"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217857"},{"key":"e_1_3_2_2_24_1","volume-title":"Byzantine Agreement with Interval Validity. In 2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS). IEEE Computer Society","author":"Melnyk Darya","year":"2018","unstructured":"Darya Melnyk and Roger Wattenhofer . 2018 . Byzantine Agreement with Interval Validity. In 2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS). IEEE Computer Society , Los Alamitos, CA, USA, 251--260. https:\/\/doi.org\/10. 1109\/SRDS. 2018.00036 Darya Melnyk and Roger Wattenhofer. 2018. Byzantine Agreement with Interval Validity. In 2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS). IEEE Computer Society, Los Alamitos, CA, USA, 251--260. https:\/\/doi.org\/10. 1109\/SRDS.2018.00036"},{"key":"e_1_3_2_2_25_1","volume-title":"45th ACM STOC","author":"Mendes Hammurabi","unstructured":"Hammurabi Mendes and Maurice Herlihy . 2013. Multidimensional approximate agreement in Byzantine asynchronous systems . In 45th ACM STOC , Dan Boneh, Tim Roughgarden, and Joan Feigenbaum (Eds.). ACM Press , Palo Alto, CA, USA , 391--400. https:\/\/doi.org\/10.1145\/2488608.2488657 10.1145\/2488608.2488657 Hammurabi Mendes and Maurice Herlihy. 2013. Multidimensional approximate agreement in Byzantine asynchronous systems. In 45th ACM STOC, Dan Boneh, Tim Roughgarden, and Joan Feigenbaum (Eds.). ACM Press, Palo Alto, CA, USA, 391--400. https:\/\/doi.org\/10.1145\/2488608.2488657"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484554"},{"key":"e_1_3_2_2_27_1","volume-title":"Byzantine Approximate Agreement on Graphs. In 33rd International Symposium on Distributed Computing (DISC 2019) (Leibniz International Proceedings in Informatics (LIPIcs)","volume":"17","author":"Nowak Thomas","year":"2019","unstructured":"Thomas Nowak and Joel Rybicki . 2019 . Byzantine Approximate Agreement on Graphs. In 33rd International Symposium on Distributed Computing (DISC 2019) (Leibniz International Proceedings in Informatics (LIPIcs) , Vol. 146), Jukka Suomela (Ed.). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 29:1--29: 17 . https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2019.29 10.4230\/LIPIcs.DISC.2019.29 Thomas Nowak and Joel Rybicki. 2019. Byzantine Approximate Agreement on Graphs. In 33rd International Symposium on Distributed Computing (DISC 2019) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 146), Jukka Suomela (Ed.). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 29:1--29:17. https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2019.29"},{"key":"e_1_3_2_2_28_1","volume-title":"Byzantine Agreement with Median Validity. In 19th International Conference on Principles of Distributed Systems (OPODIS 2015) (Leibniz International Proceedings in Informatics (LIPIcs)","volume":"14","author":"Stolz David","year":"2016","unstructured":"David Stolz and Roger Wattenhofer . 2016 . Byzantine Agreement with Median Validity. In 19th International Conference on Principles of Distributed Systems (OPODIS 2015) (Leibniz International Proceedings in Informatics (LIPIcs) , Vol. 46), Emmanuelle Anceaume, Christian Cachin, and Maria Potop-Butucaru (Eds.). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 1-- 14 . https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2015.22 10.4230\/LIPIcs.OPODIS.2015.22 David Stolz and Roger Wattenhofer. 2016. Byzantine Agreement with Median Validity. In 19th International Conference on Principles of Distributed Systems (OPODIS 2015) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 46), Emmanuelle Anceaume, Christian Cachin, and Maria Potop-Butucaru (Eds.). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 1--14. https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2015.22"},{"key":"e_1_3_2_2_29_1","volume-title":"Garg","author":"Vaidya Nitin H.","year":"2013","unstructured":"Nitin H. Vaidya and Vijay K . Garg . 2013 . Byzantine vector consensus in complete graphs. In 32nd ACM PODC, Panagiota Fatourou and Gadi Taubenfeld (Eds.). ACM, Montreal, QC , 65--73. https:\/\/doi.org\/10.1145\/2484239.2484256 10.1145\/2484239.2484256 Nitin H. Vaidya and Vijay K. Garg. 2013. Byzantine vector consensus in complete graphs. In 32nd ACM PODC, Panagiota Fatourou and Gadi Taubenfeld (Eds.). ACM, Montreal, QC, 65--73. https:\/\/doi.org\/10.1145\/2484239.2484256"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90043-0"}],"event":{"name":"PODC '22: ACM Symposium on Principles of Distributed Computing","location":"Salerno Italy","acronym":"PODC '22","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538442","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538442","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538442","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:21Z","timestamp":1750191141000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538442"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":30,"alternative-id":["10.1145\/3519270.3538442","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538442","relation":{},"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"2022-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}