{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T20:30:24Z","timestamp":1779309024426,"version":"3.51.4"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,9,2]],"date-time":"2022-09-02T00:00:00Z","timestamp":1662076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,9,2]],"date-time":"2022-09-02T00:00:00Z","timestamp":1662076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s00446-022-00432-y","type":"journal-article","created":{"date-parts":[[2022,9,2]],"date-time":"2022-09-02T13:03:57Z","timestamp":1662123837000},"page":"503-532","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Making Byzantine consensus live"],"prefix":"10.1007","volume":"35","author":[{"given":"Manuel","family":"Bravo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Chockler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexey","family":"Gotsman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,2]]},"reference":[{"key":"432_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Devadas, S., Dolev, D., Nayak, K., Ren, L.: Synchronous Byzantine agreement with expected $${O}(1)$$ rounds, expected $${O}(n^2)$$ communication, and optimal resilience. In: Conference on Financial Cryptography and Data Security (FC) (2019)","DOI":"10.1007\/978-3-030-32101-7_20"},{"key":"432_CR2","unstructured":"Abraham, I., Gueta, G., Malkhi, D., Alvisi, L., Kotla, R., Martin, J.: Revisiting fast practical Byzantine fault tolerance. arXiv:1712.01367 (2017)"},{"key":"432_CR3","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Gilbert, S., Guerraoui, R., Travers, C.: How to solve consensus in the smallest window of synchrony. In: Symposium on Distributed Computing (DISC) (2008)","DOI":"10.1007\/978-3-540-87779-0_3"},{"issue":"4","key":"432_CR4","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1109\/TDSC.2010.70","volume":"8","author":"Y Amir","year":"2011","unstructured":"Amir, Y., Coan, B.A., Kirsch, J., Lane, J.: Prime: Byzantine replication under attack. IEEE Trans. Dependable Secure Comput. 8(4), 564\u2013577 (2011)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"432_CR5","doi-asserted-by":"crossref","unstructured":"Amoussou-Guenou, Y., Pozzo, A. D., Potop-Butucaru, M., Tucci-Piergiovanni, S.: Correctness of Tendermint-core blockchains. In: Conference on Principles of Distributed Systems (OPODIS) (2018)","DOI":"10.1007\/978-3-030-31277-0_11"},{"key":"432_CR6","doi-asserted-by":"crossref","unstructured":"Amoussou-Guenou, Y., Pozzo, A. D., Potop-Butucaru, M., Tucci-Piergiovanni, S.: Dissecting tendermint. In: Conference on Networked Systems (NETYS) (2019)","DOI":"10.1007\/978-3-030-31277-0_11"},{"key":"432_CR7","doi-asserted-by":"crossref","unstructured":"Androulaki, E., Barger, A., Bortnikov, V., Cachin, C., Christidis, K., Caro, A.D., Enyeart, D., Ferris, C., Laventman, G., Manevich, Y., Muralidharan, S., Murthy, C., Nguyen, B., Sethi, M., Singh, G., Smith, K., Sorniotti, A., Stathakopoulou, C., Vukolic, M., Cocco, S. W., Yellick, J.: Hyperledger fabric: a distributed operating system for permissioned blockchains. In: European Conference on Computer Systems (EuroSys) (2018)","DOI":"10.1145\/3190508.3190538"},{"issue":"4","key":"432_CR8","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B Awerbuch","year":"1985","unstructured":"Awerbuch, B.: Complexity of network synchronization. J. ACM 32(4), 804\u2013823 (1985)","journal-title":"J. ACM"},{"key":"432_CR9","doi-asserted-by":"crossref","unstructured":"Bazzi, R. A., Ding, Y.: Non-skipping timestamps for Byzantine data storage systems. In: Symposium on Distributed Computing (DISC) (2004)","DOI":"10.1007\/978-3-540-30186-8_29"},{"key":"432_CR10","doi-asserted-by":"crossref","unstructured":"Biely, M., Widder, J., Charron-Bost, B., Gaillard, A., Hutle, M., Schiper,A.: Tolerating corrupted communication. In: Symposium on Principles of Distributed Computing (PODC) (2007)","DOI":"10.1145\/1281100.1281136"},{"issue":"2","key":"432_CR11","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0890-5401(87)90054-X","volume":"75","author":"G Bracha","year":"1987","unstructured":"Bracha, G.: Asynchronous Byzantine agreement protocols. Inf. Comput. 75(2), 130\u2013143 (1987)","journal-title":"Inf. Comput."},{"key":"432_CR12","unstructured":"Bravo, M., Chockler, G., Gotsman, A.: Making Byzantine consensus live (extended version). CoRR arXiv:2008.04167 (2020)"},{"key":"432_CR13","unstructured":"Bravo, M., Chockler, G., Gotsman, A.: Liveness and latency of Byzantine state-machine replication. In: Symposium on Distributed Computing (DISC) (2022)"},{"key":"432_CR14","unstructured":"Buchman, E., Kwon, J., Milosevic,Z.: The latest gossip on BFT consensus. arXiv:1807.04938 (2018)"},{"key":"432_CR15","unstructured":"Buterin, V., Griffith, V.: Casper the friendly finality gadget. arXiv:1710.09437 (2017)"},{"key":"432_CR16","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Petzold, F., Shoup, V.: Secure and efficient asynchronous broadcast protocols. In: International Cryptology Conference (CRYPTO) (2001)","DOI":"10.1007\/3-540-44647-8_31"},{"key":"432_CR17","unstructured":"Cachin,C., Vukolic, M.: Blockchain consensus protocols in the wild (keynote talk). In: Symposium on Distributed Computing (DISC) (2017)"},{"key":"432_CR18","unstructured":"Castro, M.: Practical Byzantine fault tolerance. PhD thesis, Massachusetts Institute of Technology (2001)"},{"key":"432_CR19","unstructured":"Castro, M., Liskov, B.: Practical Byzantine fault tolerance. In: Symposium on Operating Systems Design and Implementation (OSDI) (1999)"},{"issue":"4","key":"432_CR20","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. J. ACM 43(4), 685\u2013722 (1996)","journal-title":"J. ACM"},{"issue":"2","key":"432_CR21","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"issue":"1","key":"432_CR22","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00446-009-0084-6","volume":"22","author":"B Charron-Bost","year":"2009","unstructured":"Charron-Bost, B., Schiper, A.: The heard-of model: computing in distributed systems with benign faults. Distrib. Comput. 22(1), 49\u201371 (2009)","journal-title":"Distrib. Comput."},{"key":"432_CR23","doi-asserted-by":"crossref","unstructured":"Crain, T., Gramoli, V., Larrea, M., Raynal, M.: DBFT: efficient leaderless Byzantine consensus and its application to blockchains. In: Symposium on Network Computing and Applications (NCA) (2018)","DOI":"10.1109\/NCA.2018.8548057"},{"issue":"1","key":"432_CR24","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/200836.200870","volume":"42","author":"D Dolev","year":"1995","unstructured":"Dolev, D., Halpern, J.Y., Simons, B., Strong, R.: Dynamic fault-tolerant clock synchronization. J. ACM 42(1), 143\u2013185 (1995)","journal-title":"J. ACM"},{"issue":"OOPSLA","key":"432_CR25","doi-asserted-by":"publisher","first-page":"213:1","DOI":"10.1145\/3428281","volume":"4","author":"C Dragoi","year":"2020","unstructured":"Dragoi, C., Widder, J., Zufferey, D.: Programming at the edge of synchrony. Proc. ACM Program. Lang. 4(OOPSLA), 213:1-213:30 (2020)","journal-title":"Proc. ACM Program. Lang."},{"key":"432_CR26","unstructured":"Dutta, P., Guerraoui, R., Lamport, L.: How fast can eventual synchrony lead to consensus? In: Conference on Dependable Systems and Networks (DSN) (2005)"},{"issue":"2","key":"432_CR27","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N.A., Stockmeyer, L.J.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"issue":"2","key":"432_CR28","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"432_CR29","unstructured":"Gafni, E.: Round-by-round fault detectors: unifying synchrony and asynchrony. In: Symposium on Principles of Distributed Computing (PODC) (1998)"},{"key":"432_CR30","doi-asserted-by":"crossref","unstructured":"Gilad, Y., Hemo, R., Micali, S., Vlachos, G., Zeldovich, N.: Algorand: scaling Byzantine agreements for cryptocurrencies. In: Symposium on Operating Systems Principles (SOSP) (2017)","DOI":"10.1145\/3132747.3132757"},{"key":"432_CR31","doi-asserted-by":"crossref","unstructured":"Golan-Gueta, G., Abraham, I., Grossman, S., Malkhi, D., Pinkas, B., Reiter, M.K., Seredinschi, D., Tamir, O., Tomescu, A.: SBFT: a scalable and decentralized trust infrastructure. In: Conference on Dependable Systems and Networks (DSN) (2019)","DOI":"10.1109\/DSN.2019.00063"},{"key":"432_CR32","doi-asserted-by":"crossref","unstructured":"Haeberlen, A., Kuznetsov, P.: The fault detection problem. In: Conference on Principles of Distributed Systems (OPODIS) (2009)","DOI":"10.1007\/978-3-642-10877-8_10"},{"key":"432_CR33","doi-asserted-by":"crossref","unstructured":"Herzberg, A., Kutten, S.: Fast isolation of arbitrary forwarding faults. In: Symposium on Principles of Distributed Computing (PODC) (1989)","DOI":"10.1145\/72981.73006"},{"key":"432_CR34","doi-asserted-by":"crossref","unstructured":"Herzberg, A., Kutten, S.: Early detection of message forwarding faults. SIAM J. Comput. 30(4), 1169\u20131196 (2000)","DOI":"10.1137\/S0097539796312745"},{"key":"432_CR35","unstructured":"Incorrect by construction-CBC Casper isn\u2019t live. https:\/\/derekhsorensen.com\/docs\/CBC_Casper_Flaw.pdf"},{"key":"432_CR36","doi-asserted-by":"crossref","unstructured":"Keidar, I., Shraer, A.: Timeliness, failure-detectors, and consensus performance. In: Symposium on Principles of Distributed Computing (PODC) (2006)","DOI":"10.1145\/1146381.1146408"},{"issue":"2","key":"432_CR37","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133\u2013169 (1998)","journal-title":"ACM Trans. Comput. Syst."},{"key":"432_CR38","unstructured":"Malkhi, D., Reiter, M.: Unreliable intrusion detection in distributed computations. In: Workshop on Computer Security Foundations (CSFW) (1997)"},{"key":"432_CR39","doi-asserted-by":"crossref","unstructured":"Milosevic, Z., Biely, M., Schiper, A.: Bounded delay in Byzantine-tolerant state machine replication. In: Symposium on Reliable Distributed Systems (SRDS) (2013)","DOI":"10.1109\/SRDS.2013.15"},{"key":"432_CR40","doi-asserted-by":"crossref","unstructured":"Most\u00e9faoui, A., Raynal, M.: Solving consensus using Chandra-Toueg\u2019s unreliable failure detectors: a general quorum-based approach. In: Symposium on Distributed Computing (DISC) (1999)","DOI":"10.1007\/3-540-48169-9_4"},{"key":"432_CR41","doi-asserted-by":"crossref","unstructured":"Naor, O., Baudet, M., Malkhi, D., Spiegelman, A.: Cogsworth: Byzantine view synchronization. In: Cryptoeconomics Systems Conference (CES) (2020)","DOI":"10.21428\/58320208.08912a03"},{"key":"432_CR42","unstructured":"Naor, O., Keidar, I.: Expected linear round synchronization: the missing link for linear Byzantine SMR. In: Symposium on Distributed Computing (DISC) (2020)"},{"key":"432_CR43","unstructured":"Simons, B., Welch, J., Lynch, N.: An overview of clock synchronization. In: Fault-Tolerant Distributed Computing (1986)"},{"key":"432_CR44","unstructured":"State machine replication in the Diem blockchain. https:\/\/developers.diem.com\/papers\/diem-consensus-state-machine-replication-in-the-diem-blockchain\/2021-08-17.pdf"},{"key":"432_CR45","doi-asserted-by":"crossref","unstructured":"Yin, M., Malkhi, D., Reiter, M. K., Golan-Gueta, G., Abraham, I.: HotStuff: BFT consensus with linearity and responsiveness. In: Symposium on Principles of Distributed Computing (PODC) (2019)","DOI":"10.1145\/3293611.3331591"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-022-00432-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-022-00432-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-022-00432-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T04:15:47Z","timestamp":1727928947000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-022-00432-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,2]]},"references-count":45,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["432"],"URL":"https:\/\/doi.org\/10.1007\/s00446-022-00432-y","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,2]]},"assertion":[{"value":"2 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}