{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T16:58:44Z","timestamp":1790701124110,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":110,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T00:00:00Z","timestamp":1635206400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2106842"],"award-info":[{"award-number":["2106842"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,10,26]]},"DOI":"10.1145\/3477132.3483552","type":"proceedings-article","created":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T15:59:18Z","timestamp":1634659158000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Basil"],"prefix":"10.1145","author":[{"given":"Florian","family":"Suri-Payer","sequence":"first","affiliation":[{"name":"Cornell University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthew","family":"Burke","sequence":"additional","affiliation":[{"name":"Cornell University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zheng","family":"Wang","sequence":"additional","affiliation":[{"name":"Cornell University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yunhao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Cornell University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lorenzo","family":"Alvisi","sequence":"additional","affiliation":[{"name":"Cornell University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Natacha","family":"Crooks","sequence":"additional","affiliation":[{"name":"UC Berkeley"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,10,26]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Byzantine fault-tolerant (bft) state machine replication (smart) v1.2. https:\/\/github.com\/bft-smart\/library.  Byzantine fault-tolerant (bft) state machine replication (smart) v1.2. https:\/\/github.com\/bft-smart\/library."},{"key":"e_1_3_2_1_2_1","unstructured":"CloudLab. https:\/\/www.cloudlab.us.  CloudLab. https:\/\/www.cloudlab.us."},{"key":"e_1_3_2_1_3_1","unstructured":"Retwis benchmark. http:\/\/retwis.redis.io\/.  Retwis benchmark. http:\/\/retwis.redis.io\/."},{"key":"e_1_3_2_1_4_1","volume-title":"https:\/\/newsroom.statefarm.com\/blockchain-solution-test-for-subrogation\/","author":"Farm State","year":"2019","unstructured":"State Farm and USAA Work Together to Test a Blockchain Solution . https:\/\/newsroom.statefarm.com\/blockchain-solution-test-for-subrogation\/ , 2019 . State Farm and USAA Work Together to Test a Blockchain Solution. https:\/\/newsroom.statefarm.com\/blockchain-solution-test-for-subrogation\/, 2019."},{"key":"e_1_3_2_1_5_1","volume-title":"A new era for the world's food supply. https:\/\/www.ibm.com\/blockchain\/solutions\/food-trust","author":"IBM","year":"2020","unstructured":"IBM food trust. A new era for the world's food supply. https:\/\/www.ibm.com\/blockchain\/solutions\/food-trust , 2020 . IBM food trust. A new era for the world's food supply. https:\/\/www.ibm.com\/blockchain\/solutions\/food-trust, 2020."},{"key":"e_1_3_2_1_6_1","volume-title":"https:\/\/www.goquorum.com\/","author":"Morgan Quorum JP","year":"2020","unstructured":"JP Morgan Quorum . https:\/\/www.goquorum.com\/ , 2020 . JP Morgan Quorum. https:\/\/www.goquorum.com\/, 2020."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095810.1095817"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294278"},{"key":"e_1_3_2_1_9_1","volume-title":"Chainspace: A sharded smart contracts platform. arXiv:1708.03778","author":"Al-Bassam M.","year":"2017","unstructured":"M. Al-Bassam , A. Sonnino , S. Bano , D. Hrycyszyn , and G. Danezis . Chainspace: A sharded smart contracts platform. arXiv:1708.03778 , 2017 . M. Al-Bassam, A. Sonnino, S. Bano, D. Hrycyszyn, and G. Danezis. Chainspace: A sharded smart contracts platform. arXiv:1708.03778, 2017."},{"key":"e_1_3_2_1_10_1","first-page":"1","volume-title":"Proceedings of the ACM European Conference on Computer Systems (EuroSys)","author":"Androulaki E.","year":"2018","unstructured":"E. Androulaki , A. Barger , V. Bortnikov , C. Cachin , K. Christidis , A. De Caro , D. Enyeart , C. Ferris , G. Laventman , Y. Manevich , Hyperledger Fabric : a distributed operating system for permissioned blockchains . In Proceedings of the ACM European Conference on Computer Systems (EuroSys) , pages 1 -- 15 , 2018 . E. Androulaki, A. Barger, V. Bortnikov, C. Cachin, K. Christidis, A. De Caro, D. Enyeart, C. Ferris, G. Laventman, Y. Manevich, et al. Hyperledger Fabric: a distributed operating system for permissioned blockchains. In Proceedings of the ACM European Conference on Computer Systems (EuroSys), pages 1--15, 2018."},{"key":"e_1_3_2_1_11_1","volume-title":"Bftree - scaling hotstuff to millions of validators. https:\/\/storage.googleapis.com\/celo_whitepapers\/BFTree%20-%20Scaling%20HotStuff%20to%20Millions%20of%20Validators.pdf","author":"Ansel J.","year":"2019","unstructured":"J. Ansel and M. Olszewski . Bftree - scaling hotstuff to millions of validators. https:\/\/storage.googleapis.com\/celo_whitepapers\/BFTree%20-%20Scaling%20HotStuff%20to%20Millions%20of%20Validators.pdf , 2019 . J. Ansel and M. Olszewski. Bftree - scaling hotstuff to millions of validators. https:\/\/storage.googleapis.com\/celo_whitepapers\/BFTree%20-%20Scaling%20HotStuff%20to%20Millions%20of%20Validators.pdf, 2019."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2019.00063"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03232-6_17"},{"key":"e_1_3_2_1_15_1","unstructured":"D. Bernstein N. Duif T. Lange P. Schwabe and B.-Y. Yang. Ed25519: high-speed high-security signatures. http:\/\/ed25519.cr.yp.to\/.  D. Bernstein N. Duif T. Lange P. Schwabe and B.-Y. Yang. Ed25519: high-speed high-security signatures. http:\/\/ed25519.cr.yp.to\/."},{"key":"e_1_3_2_1_16_1","volume-title":"Multiversion concurrency control-theory and algorithms. ACM Transactions on Database Systems (TODS), 8(4):465--483","author":"Bernstein P. A.","year":"1983","unstructured":"P. A. Bernstein and N. Goodman . Multiversion concurrency control-theory and algorithms. ACM Transactions on Database Systems (TODS), 8(4):465--483 , 1983 . P. A. Bernstein and N. Goodman. Multiversion concurrency control-theory and algorithms. ACM Transactions on Database Systems (TODS), 8(4):465--483, 1983."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/12518"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1979.234182"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2014.43"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/648120.747061"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03329-3_15"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1766171.1766207"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0318-0"},{"key":"e_1_3_2_1_25_1","first-page":"173","volume-title":"Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI)","author":"Castro M.","year":"1999","unstructured":"M. Castro , B. Liskov , Practical Byzantine fault tolerance . In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI) , pages 173 -- 186 , 1999 . M. Castro, B. Liskov, et al. Practical Byzantine fault tolerance. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI), pages 173--186, 1999."},{"key":"e_1_3_2_1_26_1","volume-title":"Pala: A simple partially synchronous blockchain. IACR Cryptol. ePrint Arch","author":"Chan T.-H. H.","year":"2018","unstructured":"T.-H. H. Chan , R. Pass , and E. Shi . Pala: A simple partially synchronous blockchain. IACR Cryptol. ePrint Arch ., 2018 :981, 2018. T.-H. H. Chan, R. Pass, and E. Shi. Pala: A simple partially synchronous blockchain. IACR Cryptol. ePrint Arch., 2018:981, 2018."},{"key":"e_1_3_2_1_27_1","first-page":"398","volume-title":"Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC)","author":"Chandra T.","year":"2007","unstructured":"T. Chandra , R. Griesmer , and J. Redstone . Paxos made live - an engineering perspective . In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC) , pages 398 -- 407 , 2007 . T. Chandra, R. Griesmer, and J. Redstone. Paxos made live - an engineering perspective. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pages 398--407, 2007."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629602"},{"key":"e_1_3_2_1_29_1","first-page":"153","volume-title":"Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI)","author":"Clement A.","year":"2009","unstructured":"A. Clement , E. Wong , L. Alvisi , M. Dahlin , and M. Marchetti . Making Byzantine fault tolerant systems tolerate Byzantine faults . In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI) , page 153 -- 168 , 2009 . A. Clement, E. Wong, L. Alvisi, M. Dahlin, and M. Marchetti. Making Byzantine fault tolerant systems tolerate Byzantine faults. In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI), page 153--168, 2009."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_3_2_1_31_1","first-page":"251","volume-title":"Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation, OSDI '12","author":"Corbett J. C.","unstructured":"J. C. Corbett , J. Dean , M. Epstein , A. Fikes , C. Frost , J. J. Furman , S. Ghemawat , A. Gubarev , C. Heiser , P. Hochschild , W. Hsieh , S. Kanthak , E. Kogan , H. Li , A. Lloyd , S. Melnik , D. Mwaura , D. Nagle , S. Quinlan , R. Rao , L. Rolig , Y. Saito , M. Szymaniak , C. Taylor , R. Wang , and D. Woodford . Spanner: Google's globally-distributed database . In Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation, OSDI '12 , pages 251 -- 264 . J. C. Corbett, J. Dean, M. Epstein, A. Fikes, C. Frost, J. J. Furman, S. Ghemawat, A. Gubarev, C. Heiser, P. Hochschild, W. Hsieh, S. Kanthak, E. Kogan, H. Li, A. Lloyd, S. Melnik, D. Mwaura, D. Nagle, S. Quinlan, R. Rao, L. Rolig, Y. Saito, M. Szymaniak, C. Taylor, R. Wang, and D. Woodford. Spanner: Google's globally-distributed database. In Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation, OSDI '12, pages 251--264."},{"key":"e_1_3_2_1_32_1","first-page":"177","volume-title":"Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI)","author":"Cowling J.","year":"2006","unstructured":"J. Cowling , D. Myers , B. Liskov , R. Rodrigues , and L. Shrira . HQ replication: A hybrid quorum protocol for Byzantine fault tolerance . In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI) , pages 177 -- 190 , 2006 . J. Cowling, D. Myers, B. Liskov, R. Rodrigues, and L. Shrira. HQ replication: A hybrid quorum protocol for Byzantine fault tolerance. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI), pages 177--190, 2006."},{"key":"e_1_3_2_1_33_1","first-page":"727","volume-title":"13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18)","author":"Crooks N.","year":"2018","unstructured":"N. Crooks , M. Burke , E. Cecchetti , S. Harel , R. Agarwal , and L. Alvisi . Obladi: Oblivious serializable transactions in the cloud . In 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18) , pages 727 -- 743 , Carlsbad, CA , Oct. 2018 . USENIX Association. N. Crooks, M. Burke, E. Cecchetti, S. Harel, R. Agarwal, and L. Alvisi. Obladi: Oblivious serializable transactions in the cloud. In 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18), pages 727--743, Carlsbad, CA, Oct. 2018. USENIX Association."},{"key":"e_1_3_2_1_34_1","unstructured":"Cypherium.io. Cypherium-whitepaper-2-0. https:\/\/www.cypherium.io\/whitepaper\/cypherium-whitepaper-2-0\/.  Cypherium.io. Cypherium-whitepaper-2-0. https:\/\/www.cypherium.io\/whitepaper\/cypherium-whitepaper-2-0\/."},{"key":"e_1_3_2_1_35_1","volume-title":"Using blockchain & internet-of-things in supply chain traceability. https:\/\/www2.deloitte.com\/content\/dam\/Deloitte\/lu\/Documents\/technology\/lu-blockchain-internet-things-supply-chain-traceability.pdf","year":"2017","unstructured":"Deloitte. Using blockchain & internet-of-things in supply chain traceability. https:\/\/www2.deloitte.com\/content\/dam\/Deloitte\/lu\/Documents\/technology\/lu-blockchain-internet-things-supply-chain-traceability.pdf , 2017 . Deloitte. Using blockchain & internet-of-things in supply chain traceability. https:\/\/www2.deloitte.com\/content\/dam\/Deloitte\/lu\/Documents\/technology\/lu-blockchain-internet-things-supply-chain-traceability.pdf, 2017."},{"key":"e_1_3_2_1_36_1","volume-title":"To build a trusted and innovative financial network that empowers people and businesses around the world. https:\/\/www.diem.com\/en-us\/","year":"2021","unstructured":"Diem. To build a trusted and innovative financial network that empowers people and businesses around the world. https:\/\/www.diem.com\/en-us\/ , 2021 . Diem. To build a trusted and innovative financial network that empowers people and businesses around the world. https:\/\/www.diem.com\/en-us\/, 2021."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732240.2732246"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2014.2312331"},{"key":"e_1_3_2_1_39_1","volume-title":"Consensus in the presence of partial synchrony. Journal of the ACM (JACM), 35(2):288--323","author":"Dwork C.","year":"1988","unstructured":"C. Dwork , N. Lynch , and L. Stockmeyer . Consensus in the presence of partial synchrony. Journal of the ACM (JACM), 35(2):288--323 , 1988 . C. Dwork, N. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM (JACM), 35(2):288--323, 1988."},{"key":"e_1_3_2_1_40_1","volume-title":"Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM), 32(2):374--382","author":"Fischer M.","year":"1985","unstructured":"M. Fischer , N. Lynch , and M. Paterson . Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM), 32(2):374--382 , 1985 . M. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM), 32(2):374--382, 1985."},{"key":"e_1_3_2_1_41_1","volume-title":"Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM), 32(2):374--382","author":"Fischer M. J.","year":"1985","unstructured":"M. J. Fischer , N. A. Lynch , and M. S. Paterson . Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM), 32(2):374--382 , 1985 . M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM), 32(2):374--382, 1985."},{"key":"e_1_3_2_1_42_1","unstructured":"floodyberry. ed25519-donna. https:\/\/github.com\/floodyberry\/ed25519-donna.  floodyberry. ed25519-donna. https:\/\/github.com\/floodyberry\/ed25519-donna."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1966445.1966456"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/11745853_17"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1755913.1755950"},{"key":"e_1_3_2_1_47_1","volume-title":"SBFT: A scalable decentralized trust infrastructure for blockchains. arXiv:1804.01626","author":"Gueta G. G.","year":"2018","unstructured":"G. G. Gueta , I. Abraham , S. Grossman , D. Malkhi , B. Pinkas , M. K. Reiter , D.-A. Seredinschi , O. Tamir , and A. Tomescu . SBFT: A scalable decentralized trust infrastructure for blockchains. arXiv:1804.01626 , 2018 . G. G. Gueta, I. Abraham, S. Grossman, D. Malkhi, B. Pinkas, M. K. Reiter, D.-A. Seredinschi, O. Tamir, and A. Tomescu. SBFT: A scalable decentralized trust infrastructure for blockchains. arXiv:1804.01626, 2018."},{"key":"e_1_3_2_1_48_1","first-page":"119","volume-title":"Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI)","author":"Haeberlen A.","year":"2010","unstructured":"A. Haeberlen , P. Aditya , R. Rodrigues , and P. Druschel . Accountable virtual machines . In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI) , page 119 -- 134 , 2010 . A. Haeberlen, P. Aditya, R. Rodrigues, and P. Druschel. Accountable virtual machines. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI), page 119--134, 2010."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2010.5544297"},{"key":"e_1_3_2_1_50_1","volume-title":"Enhancing accountability and trust in distributed ledgers. arXiv:1606.07490","author":"Herlihy M.","year":"2016","unstructured":"M. Herlihy and M. Moir . Enhancing accountability and trust in distributed ledgers. arXiv:1606.07490 , 2016 . M. Herlihy and M. Moir. Enhancing accountability and trust in distributed ledgers. arXiv:1606.07490, 2016."},{"key":"e_1_3_2_1_51_1","volume-title":"https:\/\/www.ibm.com\/blockchain\/solutions\/world-wire","author":"IBM.","year":"2020","unstructured":"IBM. Transform cross-border payments with IBM blockchain world wire. https:\/\/www.ibm.com\/blockchain\/solutions\/world-wire , 2020 . IBM. Transform cross-border payments with IBM blockchain world wire. https:\/\/www.ibm.com\/blockchain\/solutions\/world-wire, 2020."},{"key":"e_1_3_2_1_52_1","volume-title":"A public-key cryptosystem suitable for digital multisignatures. NEC Research & Development, (71):1--8","author":"Itakura K.","year":"1983","unstructured":"K. Itakura and K. Nakamura . A public-key cryptosystem suitable for digital multisignatures. NEC Research & Development, (71):1--8 , 1983 . K. Itakura and K. Nakamura. A public-key cryptosystem suitable for digital multisignatures. NEC Research & Development, (71):1--8, 1983."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2011.5958223"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_16"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.000-5"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400214.1400236"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2004.1311928"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465363"},{"key":"e_1_3_2_1_59_1","volume-title":"On optimistic methods for concurrency control. ACM Transactions on Database Systems (TODS), 6(2):213--226","author":"Kung H. T.","year":"1981","unstructured":"H. T. Kung and J. T. Robinson . On optimistic methods for concurrency control. ACM Transactions on Database Systems (TODS), 6(2):213--226 , 1981 . H. T. Kung and J. T. Robinson. On optimistic methods for concurrency control. ACM Transactions on Database Systems (TODS), 6(2):213--226, 1981."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3419614.3423263"},{"key":"e_1_3_2_1_61_1","volume-title":"ACM Transactions on Computer Systems (TOCS), 16(2):133--169","author":"Lamport L.","year":"1998","unstructured":"L. Lamport . The part-time parliament. ACM Transactions on Computer Systems (TOCS), 16(2):133--169 , 1998 . L. Lamport. The part-time parliament. ACM Transactions on Computer Systems (TOCS), 16(2):133--169, 1998."},{"key":"e_1_3_2_1_62_1","volume-title":"Paxos made simple. ACM SIGACT News (Distributed Computing Column), 32(4):51--58","author":"Lamport L.","year":"2001","unstructured":"L. Lamport . Paxos made simple. ACM SIGACT News (Distributed Computing Column), 32(4):51--58 , 2001 . L. Lamport. Paxos made simple. ACM SIGACT News (Distributed Computing Column), 32(4):51--58, 2001."},{"key":"e_1_3_2_1_63_1","volume-title":"Technical Report Microsoft Research Technical Report MSR-TR-2005-112","author":"Lamport L.","year":"2005","unstructured":"L. Lamport . Fast Paxos . Technical Report Microsoft Research Technical Report MSR-TR-2005-112 , 2005 . L. Lamport. Fast Paxos. Technical Report Microsoft Research Technical Report MSR-TR-2005-112, 2005."},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24100-0_22"},{"key":"e_1_3_2_1_66_1","first-page":"13","volume-title":"Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC)","volume":"1","author":"Lampson B.","year":"2001","unstructured":"B. Lampson . The ABCD's of paxos. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC) , volume 1 , page 13 , 2001 . B. Lampson. The ABCD's of paxos. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), volume 1, page 13, 2001."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/EDCC.2016.36"},{"key":"e_1_3_2_1_68_1","first-page":"265","volume-title":"Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI)","author":"Li C.","year":"2012","unstructured":"C. Li , D. Porto , A. Clement , J. Gehrke , N. Pregui\u00e7a , and R. Rodrigues . Making geo-replicated systems fast as possible, consistent when necessary . In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI) , pages 265 -- 278 , 2012 . C. Li, D. Porto, A. Clement, J. Gehrke, N. Pregui\u00e7a, and R. Rodrigues. Making geo-replicated systems fast as possible, consistent when necessary. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI), pages 265--278, 2012."},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS.2007.32"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11294-2_7"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2006.83"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2011.19"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354225"},{"key":"e_1_3_2_1_75_1","first-page":"203","volume-title":"Distributed computing","author":"Malkhi D.","year":"1998","unstructured":"D. Malkhi and M. Reiter . Byzantine quorum systems . In Distributed computing , volume 11 , pages 203 -- 213 . Springer , 1998 . D. Malkhi and M. Reiter. Byzantine quorum systems. In Distributed computing, volume 11, pages 203--213. Springer, 1998."},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1109\/tdsc.2006.35"},{"key":"e_1_3_2_1_77_1","first-page":"369","volume-title":"Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT)","author":"Merkle R. C.","year":"1987","unstructured":"R. C. Merkle . A digital signature based on a conventional encryption function . In Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT) , pages 369 -- 378 . Springer , 1987 . R. C. Merkle. A digital signature based on a conventional encryption function. In Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT), pages 369--378. Springer, 1987."},{"key":"e_1_3_2_1_78_1","unstructured":"meter.io. Supercharge ethereum for the financial internet. https:\/\/www.meter.io\/.  meter.io. Supercharge ethereum for the financial internet. https:\/\/www.meter.io\/."},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/501983.502017"},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978399"},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2517350"},{"key":"e_1_3_2_1_82_1","first-page":"479","volume-title":"Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI)","author":"Mu S.","year":"2014","unstructured":"S. Mu , Y. Cui , Y. Zhang , W. Lloyd , and J. Li . Extracting more concurrency from distributed transactions . In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI) , pages 479 -- 494 , 2014 . S. Mu, Y. Cui, Y. Zhang, W. Lloyd, and J. Li. Extracting more concurrency from distributed transactions. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI), pages 479--494, 2014."},{"key":"e_1_3_2_1_83_1","first-page":"517","volume-title":"Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI)","author":"Mu S.","year":"2016","unstructured":"S. Mu , L. Nelson , W. Lloyd , and J. Li . Consolidating concurrency control and consensus for commits under conflicts . In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI) , pages 517 -- 532 , 2016 . S. Mu, L. Nelson, W. Lloyd, and J. Li. Consolidating concurrency control and consensus for commits under conflicts. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI), pages 517--532, 2016."},{"key":"e_1_3_2_1_84_1","first-page":"8","volume-title":"Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC)","author":"Oki B. M.","year":"1988","unstructured":"B. M. Oki and B. H. Liskov . Viewstamped replication: A new primary copy method to support highly-available distributed systems . In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC) , pages 8 -- 17 , 1988 . B. M. Oki and B. H. Liskov. Viewstamped replication: A new primary copy method to support highly-available distributed systems. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pages 8--17, 1988."},{"key":"e_1_3_2_1_85_1","first-page":"305","volume-title":"Proceedings of the USENIX Annual Technical Conference (ATC)","author":"Ongaro D.","year":"2014","unstructured":"D. Ongaro and J. Ousterhout . In search of an understandable consensus algorithm . In Proceedings of the USENIX Annual Technical Conference (ATC) , pages 305 -- 319 , 2014 . D. Ongaro and J. Ousterhout. In search of an understandable consensus algorithm. In Proceedings of the USENIX Annual Technical Conference (ATC), pages 305--319, 2014."},{"key":"e_1_3_2_1_86_1","first-page":"223","volume-title":"Proceedings of the USENIX Annual Technical Conference (ATC)","author":"Padilha R.","year":"2016","unstructured":"R. Padilha , E. Fynn , R. Soul\u00e9 , and F. Pedone . Callinicos: Robust transactional storage for distributed data structures . In Proceedings of the USENIX Annual Technical Conference (ATC) , pages 223 -- 235 , 2016 . R. Padilha, E. Fynn, R. Soul\u00e9, and F. Pedone. Callinicos: Robust transactional storage for distributed data structures. In Proceedings of the USENIX Annual Technical Conference (ATC), pages 223--235, 2016."},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465362"},{"key":"e_1_3_2_1_88_1","volume-title":"The Serializability of Concurrent Database Updates. Journal of the ACM (JACM), 26(4):631--653","author":"Papadimitriou C. H.","year":"1979","unstructured":"C. H. Papadimitriou . The Serializability of Concurrent Database Updates. Journal of the ACM (JACM), 26(4):631--653 , 1979 . C. H. Papadimitriou. The Serializability of Concurrent Database Updates. Journal of the ACM (JACM), 26(4):631--653, 1979."},{"key":"e_1_3_2_1_89_1","first-page":"47","volume-title":"Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI)","author":"Park S. J.","year":"2019","unstructured":"S. J. Park and J. Ousterhout . Exploiting commutativity for practical fast replication . In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI) , pages 47 -- 64 , 2019 . S. J. Park and J. Ousterhout. Exploiting commutativity for practical fast replication. In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI), pages 47--64, 2019."},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13173-012-0060-z"},{"key":"e_1_3_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICOSST.2018.8632193"},{"key":"e_1_3_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.3390\/a11090141"},{"key":"e_1_3_2_1_93_1","volume-title":"IOTA: feeless and free","author":"Popov S.","year":"2019","unstructured":"S. Popov and Q. Lu . IOTA: feeless and free . IEEE Blockchain Technical Briefs , 2019 . S. Popov and Q. Lu. IOTA: feeless and free. IEEE Blockchain Technical Briefs, 2019."},{"key":"e_1_3_2_1_94_1","volume-title":"Implementing atomic actions on decentralized data. ACM Transactions on Computer Systems (TOCS), 1(1):3--23","author":"Reed D. P.","year":"1983","unstructured":"D. P. Reed . Implementing atomic actions on decentralized data. ACM Transactions on Computer Systems (TOCS), 1(1):3--23 , 1983 . D. P. Reed. Implementing atomic actions on decentralized data. ACM Transactions on Computer Systems (TOCS), 1(1):3--23, 1983."},{"key":"e_1_3_2_1_95_1","volume-title":"Scalable and probabilistic leaderless BFT consensus through metastability. arXiv:1906.08936","author":"Rocket T.","year":"2019","unstructured":"T. Rocket , M. Yin , K. Sekniqi , R. van Renesse , and E. G. Sirer . Scalable and probabilistic leaderless BFT consensus through metastability. arXiv:1906.08936 , 2019 . T. Rocket, M. Yin, K. Sekniqi, R. van Renesse, and E. G. Sirer. Scalable and probabilistic leaderless BFT consensus through metastability. arXiv:1906.08936, 2019."},{"key":"e_1_3_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"},{"key":"e_1_3_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_15"},{"key":"e_1_3_2_1_98_1","volume-title":"Mir-BFT: High-throughput BFT for blockchains. arXiv:1906.05552","author":"Stathakopoulou C.","year":"2019","unstructured":"C. Stathakopoulou , T. David , and M. Vukoli\u0107 . Mir-BFT: High-throughput BFT for blockchains. arXiv:1906.05552 , 2019 . C. Stathakopoulou, T. David, and M. Vukoli\u0107. Mir-BFT: High-throughput BFT for blockchains. arXiv:1906.05552, 2019."},{"key":"e_1_3_2_1_99_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064031"},{"key":"e_1_3_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS.2011.38"},{"key":"e_1_3_2_1_101_1","volume-title":"An introduction to Hyperledger. https:\/\/www.hyperledger.org\/wp-content\/uploads\/2018\/07\/HL_Whitepaper_IntroductiontoHyperledger.pdf","author":"Foundation The Linux","year":"2018","unstructured":"The Linux Foundation . An introduction to Hyperledger. https:\/\/www.hyperledger.org\/wp-content\/uploads\/2018\/07\/HL_Whitepaper_IntroductiontoHyperledger.pdf , 2018 . The Linux Foundation. An introduction to Hyperledger. https:\/\/www.hyperledger.org\/wp-content\/uploads\/2018\/07\/HL_Whitepaper_IntroductiontoHyperledger.pdf, 2018."},{"key":"e_1_3_2_1_102_1","volume-title":"Change healthcare using Hyperledger Fabric to improve claims lifecycle throughput and transparency","author":"Foundation The Linux","year":"2019","unstructured":"The Linux Foundation . Change healthcare using Hyperledger Fabric to improve claims lifecycle throughput and transparency , 2019 . The Linux Foundation. Change healthcare using Hyperledger Fabric to improve claims lifecycle throughput and transparency, 2019."},{"key":"e_1_3_2_1_103_1","unstructured":"Transaction Processing Performance Council. The TPC-C home page. http:\/\/www.tpc.org\/tpcc.  Transaction Processing Performance Council. The TPC-C home page. http:\/\/www.tpc.org\/tpcc."},{"key":"e_1_3_2_1_104_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2014.2355848"},{"key":"e_1_3_2_1_105_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294268"},{"key":"e_1_3_2_1_106_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815430"},{"key":"e_1_3_2_1_107_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196912"},{"key":"e_1_3_2_1_108_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945470"},{"key":"e_1_3_2_1_109_1","unstructured":"M.Yin. libhotstuff. https:\/\/github.com\/hot-stuff\/libhotstuff.  M.Yin. libhotstuff. https:\/\/github.com\/hot-stuff\/libhotstuff."},{"key":"e_1_3_2_1_110_1","first-page":"347","volume-title":"Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC)","author":"Yin M.","year":"2019","unstructured":"M. Yin , D. Malkhi , M. K. Reiter , G. G. Gueta , and I. Abraham . Hot-Stuff: BFT consensus with linearity and responsiveness . In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC) , pages 347 -- 356 , 2019 . M. Yin, D. Malkhi, M. K. Reiter, G. G. Gueta, and I. Abraham. Hot-Stuff: BFT consensus with linearity and responsiveness. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pages 347--356, 2019."},{"key":"e_1_3_2_1_111_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243853"},{"issue":"1","key":"e_1_3_2_1_112_1","first-page":"27","article-title":"When is operation ordering required in replicated transactional storage?","volume":"39","author":"Zhang I.","year":"2016","unstructured":"I. Zhang , N. K. Sharma , A. Szekeres , A. Krishnamurthy , and D. R. Ports . When is operation ordering required in replicated transactional storage? IEEE Data Engineering Bulletin , 39 ( 1 ): 27 -- 38 , 2016 . I. Zhang, N. K. Sharma, A. Szekeres, A. Krishnamurthy, and D. R. Ports. When is operation ordering required in replicated transactional storage? IEEE Data Engineering Bulletin, 39(1):27--38, 2016.","journal-title":"IEEE Data Engineering Bulletin"},{"key":"e_1_3_2_1_113_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815404"},{"key":"e_1_3_2_1_114_1","first-page":"633","volume-title":"Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI)","author":"Zhang Y.","year":"2020","unstructured":"Y. Zhang , S. Setty , Q. Chen , L. Zhou , and L. Alvisi . Byzantine ordered consensus without Byzantine oligarchy . In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI) , pages 633 -- 649 , 2020 . Y. Zhang, S. Setty, Q. Chen, L. Zhou, and L. Alvisi. Byzantine ordered consensus without Byzantine oligarchy. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI), pages 633--649, 2020."}],"event":{"name":"SOSP '21: ACM SIGOPS 28th Symposium on Operating Systems Principles","location":"Virtual Event Germany","acronym":"SOSP '21","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","USENIX Assoc USENIX Assoc"]},"container-title":["Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477132.3483552","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3477132.3483552","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3477132.3483552","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:49:15Z","timestamp":1750193355000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477132.3483552"}},"subtitle":["Breaking up BFT with ACID (transactions)"],"short-title":[],"issued":{"date-parts":[[2021,10,26]]},"references-count":110,"alternative-id":["10.1145\/3477132.3483552","10.1145\/3477132"],"URL":"https:\/\/doi.org\/10.1145\/3477132.3483552","relation":{},"subject":[],"published":{"date-parts":[[2021,10,26]]},"assertion":[{"value":"2021-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}