{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T17:43:46Z","timestamp":1782927826527,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,6]]},"DOI":"10.1145\/3796701.3815965","type":"proceedings-article","created":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:40:43Z","timestamp":1782924043000},"page":"478-488","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Forget-IT: Optimal Good-Case Latency For Information-Theoretic BFT"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9568-7674","authenticated-orcid":false,"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[{"name":"A16Z, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5298-621X","authenticated-orcid":false,"given":"Sourav","family":"Das","sequence":"additional","affiliation":[{"name":"Category Labs, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0882-9342","authenticated-orcid":false,"given":"Yuval","family":"Efron","sequence":"additional","affiliation":[{"name":"Ritual, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-9714-4079","authenticated-orcid":false,"given":"Jovan","family":"Komatovic","sequence":"additional","affiliation":[{"name":"Category Labs, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11516798_17"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538426"},{"key":"e_1_3_2_1_3_1","volume-title":"Forget-IT: Optimal Good-Case Latency For Information-Theoretic BFT. Cryptology ePrint Archive","author":"Abraham Ittai","year":"2026","unstructured":"Ittai Abraham, Sourav Das, Yuval Efron, and Jovan Komatovic. 2026. Forget-IT: Optimal Good-Case Latency For Information-Theoretic BFT. Cryptology ePrint Archive (2026)."},{"key":"e_1_3_2_1_4_1","volume-title":"Brief Announcement: Practical Synchronous Byzantine Consensus. In 31st International Symposium on Distributed Computing (DISC","author":"Abraham Ittai","year":"2017","unstructured":"Ittai Abraham, Srinivas Devadas, Kartik Nayak, and Ling Ren. 2017. Brief Announcement: Practical Synchronous Byzantine Consensus. In 31st International Symposium on Distributed Computing (DISC 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_5_1","unstructured":"Ittai Abraham Yuval Efron and Ling Ren. 2025. The Latency Cost Of Censorship Resistance. IACR Cryptol. ePrint Arch. (2025) 2136."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467899"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.OPODIS.2021.27"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.OPODIS.2021.5"},{"key":"e_1_3_2_1_9_1","volume-title":"Information Theoretic HotStuff. In 24th International Conference on Principles of Distributed Systems (OPODIS","author":"Abraham Ittai","year":"2021","unstructured":"Ittai Abraham and Gilad Stern. 2021. Information Theoretic HotStuff. In 24th International Conference on Principles of Distributed Systems (OPODIS 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 11\u20131."},{"key":"e_1_3_2_1_10_1","unstructured":"Ittai Abraham and Gilad Stern. 2021. Information Theoretic HotStuff (IT-HS) Part One. https:\/\/decentralizedthoughts.github.io\/2021-09-20-information-theoretic-hotstuff-it-hs-part-one\/."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-024-00464-6"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.DISC.2023.36"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or. 1983. Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols (Extended Abstract). In PODC. ACM 27\u201330.","DOI":"10.1145\/800221.806707"},{"key":"e_1_3_2_1_14_1","volume-title":"Asynchronous Byzantine agreement protocols. Information and computation 75, 2","author":"Bracha Gabriel","year":"1987","unstructured":"Gabriel Bracha. 1987. Asynchronous Byzantine agreement protocols. Information and computation 75, 2 (1987), 130\u2013143."},{"key":"e_1_3_2_1_15_1","unstructured":"Ethan Buchman. 2016. Tendermint: Byzantine Fault Tolerance in the Age of Blockchains. Ph.D. Dissertation. University of Guelph."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_31"},{"key":"e_1_3_2_1_17_1","volume-title":"Chan and Rafael Pass","author":"Benjamin","year":"2023","unstructured":"Benjamin Y. Chan and Rafael Pass. 2023. Simplex Consensus: A Simple and Fast Consensus Protocol. In TCC (4) (Lecture Notes in Computer Science, Vol. 14372). Springer, 452\u2013479."},{"key":"e_1_3_2_1_18_1","unstructured":"Jinyuan Chen. 2024. OciorMVBA: Near-Optimal Error-Free Asynchronous MVBA. arXiv:2501.00214v1 [cs.CR]. arXiv:2501.00214v1 [cs.CR] http:\/\/arxiv.org\/abs\/2501.00214v1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2022.14"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the 41st IEEE International Conference on Distributed Computing Systems (ICDCS '21)","author":"Civit Pierre","year":"2021","unstructured":"Pierre Civit, Seth Gilbert, and Vincent Gramoli. 2021. Polygraph: Accountable Byzantine Agreement. In Proceedings of the 41st IEEE International Conference on Distributed Computing Systems (ICDCS '21)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594567"},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of the 17th IEEE International Symposium on Network Computing and Applications (NCA '18)","author":"Crain Tyler","year":"2018","unstructured":"Tyler Crain, Vincent Gramoli, Mikel Larrea, and Michel Raynal. 2018. DBFT: Efficient Leaderless Byzantine Consensus and its Applications to Blockchains. In Proceedings of the 17th IEEE International Symposium on Network Computing and Applications (NCA '18). IEEE."},{"key":"e_1_3_2_1_23_1","unstructured":"Miguel Oom Temudo de Castro. 2000. Practical Byzantine fault tolerance. Ph.D. Dissertation. Massachusetts Institute of Technology Cambridge MA USA. https:\/\/hdl.handle.net\/1721.1\/86581"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/96559.96565"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2410.22080"},{"key":"e_1_3_2_1_27_1","volume-title":"FIN: Practical Signature-Free Asynchronous Common Subset in Constant Time. In CCS. ACM, 815\u2013829.","author":"Duan Sisi","year":"2023","unstructured":"Sisi Duan, Xin Wang, and Haibin Zhang. 2023. FIN: Practical Signature-Free Asynchronous Common Subset in Constant Time. In CCS. ACM, 815\u2013829."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2510.06023"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539790187084"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872066"},{"key":"e_1_3_2_1_32_1","volume-title":"Melliar-Smith","author":"Kihlstrom Kim P.","year":"2003","unstructured":"Kim P. Kihlstrom, Louise E. Moser, and Peter M. Melliar-Smith. 2003. Byzantine Fault Detectors for Solving Consensus. British Computer Society (2003)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2410.12755"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322398"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Yuan Lu Zhenliang Lu Qiang Tang and Guiling Wang. 2020. Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement Revisited. In PODC. ACM 129\u2013138.","DOI":"10.1145\/3382734.3405707"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2006.35"},{"key":"e_1_3_2_1_38_1","volume-title":"Byzantine Agreement with Interval Validity. In 2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS). IEEE, 251\u2013260","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, 251\u2013260."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00236-016-0269-Y"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_1_41_1","volume-title":"Randomized Byzantine Generals","author":"Rabin Michael O.","unstructured":"Michael O. Rabin. 1983. Randomized Byzantine Generals. In FOCS. IEEE Computer Society, 403\u2013409."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(97)10054-8"},{"key":"e_1_3_2_1_43_1","volume-title":"Byzantine Agreement with Median Validity. In 19th International Conference on Principles of Distributed Systems (OPODIS","volume":"46","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), Vol. 46. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik GmbH, 22."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3662158.3662783"}],"event":{"name":"PODC '26: ACM Symposium on Principles of Distributed Computing","location":"Egham United Kingdom","acronym":"PODC '26","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3796701.3815965","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:45:44Z","timestamp":1782924344000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3796701.3815965"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":45,"alternative-id":["10.1145\/3796701.3815965","10.1145\/3796701"],"URL":"https:\/\/doi.org\/10.1145\/3796701.3815965","relation":{},"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"2026-07-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}