{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:39:34Z","timestamp":1787337574780,"version":"build-2736575974"},"reference-count":18,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2001,1]]},"abstract":"<jats:p>We investigate eventual Byzantine agreement (EBA) in the crash and omission failure modes. The emphasis is on characterizing optimal EBA protocols in terms of the states of knowledge required by the processors in order to attain EBA. It is well known that common knowledge among the nonfaulty processors is a necessary and sufficient condition for attaining simultaneous Byzantine agreement (SBA). We define a new variant that we call continual common knowledge and use it to provide necessary and sufficient conditions for attaining EBA. Using this characterization, we provide a technique that allows us to start with any EBA protocol and convert it to an optimal EBA protocol using a two-step process.<\/jats:p>","DOI":"10.1137\/s0097539798340217","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"838-865","source":"Crossref","is-referenced-by-count":21,"title":["A Characterization of Eventual Byzantine Agreement"],"prefix":"10.1137","volume":"31","author":[{"given":"Joseph Y.","family":"Halpern","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yoram","family":"Moses","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Orli","family":"Waarts","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2012,2,17]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511621192"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"B. Coan,\n                      A communication\u2010efficient canonical form for fault\u2010tolerant distributed protocols\n                      , in Proceedings of the 5th ACM Symposium on Principles of Distributed Computing, 1986, pp. 63\u201372.","DOI":"10.1145\/10590.10596"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1145\/96559.96565"},{"key":"R4","unstructured":"D. Dolev and H. R. Strong,\n                      Requirements for agreement in a distributed system\n                      , in Distributed Data Bases, H. J. Schneider, ed., North\u2010Holland, Amsterdam, 1982, pp. 115\u2013129."},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90014-9"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/5803.001.0001"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"Michael Fischer, The consensus problem in unreliable distributed systems (a brief survey), Lecture Notes in Comput. Sci., Vol. 158, Springer, Berlin, 1983, 127\u201314085f:68008","DOI":"10.1007\/3-540-12689-9_99"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1145\/79147.79161"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(92)90049-4"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90039-1"},{"key":"R11","unstructured":"L. Lamport and M. J. Fischer,\n                      Byzantine Generals and Transactions Commit Protocols\n                      , Tech. Report Opus 62, SRI International, Menlo Park, CA, 1982."},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(93)90107-M"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01762112"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00236-9"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1007\/BF02252679"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1986.6312888"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0097539798340217","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:18:27Z","timestamp":1787336307000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S0097539798340217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["10.1137\/S0097539798340217"],"URL":"https:\/\/doi.org\/10.1137\/s0097539798340217","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}