{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T21:56:31Z","timestamp":1775598991515,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T00:00:00Z","timestamp":1648425600000},"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":[[2022,3,28]]},"DOI":"10.1145\/3492321.3519579","type":"proceedings-article","created":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T14:28:18Z","timestamp":1648477698000},"page":"17-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":49,"title":["State machine replication scalability made simple"],"prefix":"10.1145","author":[{"given":"Chrysoula","family":"Stathakopoulou","sequence":"first","affiliation":[{"name":"IBM Research Europe - Zurich"}]},{"given":"Matej","family":"Pavlovic","sequence":"additional","affiliation":[{"name":"IBM Research Europe - Zurich"}]},{"given":"Marko","family":"Vukoli\u0107","sequence":"additional","affiliation":[{"name":"IBM Research Europe - Zurich"}]}],"member":"320","published-online":{"date-parts":[[2022,3,28]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Cosmos: A network of distributed ledgers. https:\/\/github.com\/dedis\/kyber. Accessed: 30.05.2021.  Cosmos: A network of distributed ledgers. https:\/\/github.com\/dedis\/kyber. Accessed: 30.05.2021."},{"key":"e_1_3_2_1_2_1","volume-title":"Transaction sizes. https:\/\/bitcoinvisuals.com\/chaintx-size","author":"Bitcoin","year":"2019","unstructured":"Bitcoin visuals : Transaction sizes. https:\/\/bitcoinvisuals.com\/chaintx-size , 2019 . Bitcoin visuals: Transaction sizes. https:\/\/bitcoinvisuals.com\/chaintx-size, 2019."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190538"},{"key":"e_1_3_2_1_4_1","volume-title":"State machine replication is more expensive than consensus. Technical report","author":"Antoniadis Karolos","year":"2018","unstructured":"Karolos Antoniadis , Rachid Guerraoui , Dahlia Malkhi , and Dragos-Adrian Seredinschi . State machine replication is more expensive than consensus. Technical report , 2018 . Karolos Antoniadis, Rachid Guerraoui, Dahlia Malkhi, and Dragos-Adrian Seredinschi. State machine replication is more expensive than consensus. Technical report, 2018."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2013.53"},{"key":"e_1_3_2_1_6_1","volume-title":"Fnf-bft: Exploring performance limits of BFT protocols. CoRR, abs\/2009.02235","author":"Avarikioti Zeta","year":"2020","unstructured":"Zeta Avarikioti , Lioba Heimbach , Roland Schmid , and Roger Wattenhofer . Fnf-bft: Exploring performance limits of BFT protocols. CoRR, abs\/2009.02235 , 2020 . Zeta Avarikioti, Lioba Heimbach, Roland Schmid, and Roger Wattenhofer. Fnf-bft: Exploring performance limits of BFT protocols. CoRR, abs\/2009.02235, 2020."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/647097.717005"},{"key":"e_1_3_2_1_8_1","volume-title":"Introduction to reliable and secure distributed programming","author":"Cachin C.","year":"2010","unstructured":"C. Cachin , R. Guerraoui , and L. Rodrigues . Introduction to reliable and secure distributed programming . Springer-Verlag New York Inc , 2010 . C. Cachin, R. Guerraoui, and L. Rodrigues. Introduction to reliable and secure distributed programming. Springer-Verlag New York Inc, 2010."},{"key":"e_1_3_2_1_9_1","first-page":"173","article-title":"Practical byzantine fault tolerance","volume":"33","author":"Castro M.","year":"1998","unstructured":"M. Castro and B. Liskov . Practical byzantine fault tolerance . Operating Systems Review , 33 : 173 -- 186 , 1998 . M. Castro and B. Liskov. Practical byzantine fault tolerance. Operating Systems Review, 33:173--186, 1998.","journal-title":"Operating Systems Review"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"e_1_3_2_1_11_1","volume-title":"NSDI","author":"Clement Allen","year":"2009","unstructured":"Allen Clement , Edmund Wong , Lorenzo Alvisi , Mike Dahlin , and Mirco Marchetti . Making Byzantine fault tolerant systems tolerate Byzantine faults . In NSDI , 2009 . Allen Clement, Edmund Wong, Lorenzo Alvisi, Mike Dahlin, and Mirco Marchetti. Making Byzantine fault tolerant systems tolerate Byzantine faults. In NSDI, 2009."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2018.8548057"},{"key":"e_1_3_2_1_13_1","volume-title":"Evaluating the Red Belly blockchain. CoRR, abs\/1812.11747","author":"Crain Tyler","year":"2018","unstructured":"Tyler Crain , Christopher Natoli , and Vincent Gramoli . Evaluating the Red Belly blockchain. CoRR, abs\/1812.11747 , 2018 . Tyler Crain, Christopher Natoli, and Vincent Gramoli. Evaluating the Red Belly blockchain. CoRR, abs\/1812.11747, 2018."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-018-0652-3"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2019.00063"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1755913.1755950"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00124"},{"key":"e_1_3_2_1_21_1","volume-title":"Sonia Ben Mokthar, and Laurent R\u00e9veill\u00e8re. Dandelion: multiplexing byzantine agreements to unlock blockchain performance. arXiv preprint arXiv:2104.15063","author":"Korkmaz Kadir","year":"2021","unstructured":"Kadir Korkmaz , Joachim Bruneau-Queyreix , Sonia Ben Mokthar, and Laurent R\u00e9veill\u00e8re. Dandelion: multiplexing byzantine agreements to unlock blockchain performance. arXiv preprint arXiv:2104.15063 , 2021 . Kadir Korkmaz, Joachim Bruneau-Queyreix, Sonia Ben Mokthar, and Laurent R\u00e9veill\u00e8re. Dandelion: multiplexing byzantine agreements to unlock blockchain performance. arXiv preprint arXiv:2104.15063, 2021."},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of the Symposium on Operating Systems Principles (SOSP). ACM","author":"Kotla Ramakrishna","year":"2007","unstructured":"Ramakrishna Kotla , Lorenzo Alvisi , Mike Dahlin , Allen Clement , and Edmund Wong . Zyzzyva : speculative Byzantine fault tolerance . In Proceedings of the Symposium on Operating Systems Principles (SOSP). ACM , 2007 . Ramakrishna Kotla, Lorenzo Alvisi, Mike Dahlin, Allen Clement, and Edmund Wong. Zyzzyva: speculative Byzantine fault tolerance. In Proceedings of the Symposium on Operating Systems Principles (SOSP). ACM, 2007."},{"key":"e_1_3_2_1_23_1","volume-title":"Byzantine fault tolerance. https:\/\/www.swirlds.com\/downloads\/SWIRLDS-TR-2016-01.pdf","author":"Baird L.","year":"2016","unstructured":"L. Baird . The Swirlds Hashgraph consensus algorithm: Fair, fast , Byzantine fault tolerance. https:\/\/www.swirlds.com\/downloads\/SWIRLDS-TR-2016-01.pdf , 2016 . L. Baird. The Swirlds Hashgraph consensus algorithm: Fair, fast, Byzantine fault tolerance. https:\/\/www.swirlds.com\/downloads\/SWIRLDS-TR-2016-01.pdf, 2016."},{"issue":"4","key":"e_1_3_2_1_24_1","first-page":"18","article-title":"Paxos made simple","volume":"32","author":"Lamport Leslie","year":"2001","unstructured":"Leslie Lamport . Paxos made simple . ACM SIGACT News , 32 ( 4 ): 18 -- 25 , 2001 . Leslie Lamport. Paxos made simple. ACM SIGACT News, 32(4):18--25, 2001.","journal-title":"ACM SIGACT News"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.1997.596799"},{"key":"e_1_3_2_1_26_1","first-page":"369","volume-title":"Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation, OSDI'08","author":"Mao Yanhua","year":"2008","unstructured":"Yanhua Mao , Flavio P. Junqueira , and Keith Marzullo . Mencius : Building efficient replicated state machines for wans . In Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation, OSDI'08 , pages 369 -- 384 , Berkeley, CA, USA , 2008 . USENIX Association. Yanhua Mao, Flavio P. Junqueira, and Keith Marzullo. Mencius: Building efficient replicated state machines for wans. In Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation, OSDI'08, pages 369--384, Berkeley, CA, USA, 2008. USENIX Association."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS.2013.15"},{"key":"e_1_3_2_1_28_1","first-page":"305","volume-title":"Proc. USENIX Annual Technical Conference","author":"Ongaro Diego","year":"2014","unstructured":"Diego Ongaro and John K. Ousterhout . In search of an understandable consensus algorithm . In Proc. USENIX Annual Technical Conference , pages 305 -- 319 , 2014 . Diego Ongaro and John K. Ousterhout. In search of an understandable consensus algorithm. In Proc. USENIX Annual Technical Conference, pages 305--319, 2014."},{"key":"e_1_3_2_1_29_1","series-title":"Lecture Notes in Computer Science","first-page":"88","volume-title":"Principles of Distributed Systems, 9th International Conference, OPODIS","author":"HariGovind","year":"2005","unstructured":"HariGovind V. Ramasamy and Christian Cachin. Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast . In James H. Anderson, Giuseppe Prencipe, and Roger Wattenhofer, editors, Principles of Distributed Systems, 9th International Conference, OPODIS 2005 , Pisa, Italy, December 12--14, 2005, Revised Selected Papers, volume 3974 of Lecture Notes in Computer Science , pages 88 -- 102 . Springer , 2005. HariGovind V. Ramasamy and Christian Cachin. Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast. In James H. Anderson, Giuseppe Prencipe, and Roger Wattenhofer, editors, Principles of Distributed Systems, 9th International Conference, OPODIS 2005, Pisa, Italy, December 12--14, 2005, Revised Selected Papers, volume 3974 of Lecture Notes in Computer Science, pages 88--102. Springer, 2005."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.481515"},{"key":"e_1_3_2_1_31_1","volume-title":"Mir-bft: High-throughput bft for blockchains. arXiv preprint arXiv:1906.05552","author":"Stathakopoulou Chrysoula","year":"2019","unstructured":"Chrysoula Stathakopoulou , Tudor David , Matej Pavlovic , and Marko Vukoli\u0107 . Mir-bft: High-throughput bft for blockchains. arXiv preprint arXiv:1906.05552 , 2019 . Chrysoula Stathakopoulou, Tudor David, Matej Pavlovic, and Marko Vukoli\u0107. Mir-bft: High-throughput bft for blockchains. arXiv preprint arXiv:1906.05552, 2019."},{"key":"e_1_3_2_1_32_1","volume-title":"State-machine replication scalability made simple (extended version). https:\/\/arxiv.org\/abs\/2203.05681","author":"Stathakopoulou Chrysoula","year":"2022","unstructured":"Chrysoula Stathakopoulou , Matej Pavlovic , and Marko Vukoli\u0107 . State-machine replication scalability made simple (extended version). https:\/\/arxiv.org\/abs\/2203.05681 , 2022 . Chrysoula Stathakopoulou, Matej Pavlovic, and Marko Vukoli\u0107. State-machine replication scalability made simple (extended version). https:\/\/arxiv.org\/abs\/2203.05681, 2022."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"}],"event":{"name":"EuroSys '22: Seventeenth European Conference on Computer Systems","location":"Rennes France","acronym":"EuroSys '22","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the Seventeenth European Conference on Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3492321.3519579","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3492321.3519579","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:08Z","timestamp":1750188668000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3492321.3519579"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,28]]},"references-count":33,"alternative-id":["10.1145\/3492321.3519579","10.1145\/3492321"],"URL":"https:\/\/doi.org\/10.1145\/3492321.3519579","relation":{},"subject":[],"published":{"date-parts":[[2022,3,28]]},"assertion":[{"value":"2022-03-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}