{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T12:01:32Z","timestamp":1774612892526,"version":"3.50.1"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2026,9,30]]},"abstract":"<jats:p>\n                    The introduction of\n                    <jats:sc>Bitcoin<\/jats:sc>\n                    fueled the development of blockchain-based resilient data management systems that are resilient against failures, enable federated data management, and can support data provenance. The key factor determining the performance of such resilient data management systems is the consensus protocol used by the system to replicate client transactions among all participants. Unfortunately, existing high-throughput consensus protocols are costly and impose significant latency on transaction processing, which rules out their usage in responsive high-performance data management systems.\n                  <\/jats:p>\n                  <jats:p\/>\n                  <jats:p>\n                    In this work, we improve on this situation by introducing the\n                    <jats:italic toggle=\"yes\">Proof-of-Execution consensus protocol<\/jats:italic>\n                    (\n                    <jats:sc>PoE<\/jats:sc>\n                    ), a consensus protocol designed for high-performance low-latency resilient data management.\n                    <jats:sc>PoE<\/jats:sc>\n                    introduces\n                    <jats:italic toggle=\"yes\">speculative execution<\/jats:italic>\n                    , which minimizes latency by starting execution before consensus is reached, and\n                    <jats:sc>PoE<\/jats:sc>\n                    introduces\n                    <jats:italic toggle=\"yes\">proof-of-executions<\/jats:italic>\n                    to guarantee successful execution to clients. Furthermore,\n                    <jats:sc>PoE<\/jats:sc>\n                    introduces a single-round check-commit protocol to reduce the overall communication costs of consensus. Hence, we believe that\n                    <jats:sc>PoE<\/jats:sc>\n                    is a promising step towards flexible general-purpose low-latency resilient data management systems.\n                  <\/jats:p>\n                  <jats:p\/>","DOI":"10.1145\/3774322","type":"journal-article","created":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T11:44:27Z","timestamp":1762515867000},"page":"1-48","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Proof-of-Execution: Low-Latency Consensus via Speculative Execution"],"prefix":"10.1145","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0290-1438","authenticated-orcid":false,"given":"Jelle","family":"Hellings","sequence":"first","affiliation":[{"name":"Computing and Software, McMaster University","place":["Hamilton, Canada"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3240-1840","authenticated-orcid":false,"given":"Suyash","family":"Gupta","sequence":"additional","affiliation":[{"name":"University of Oregon","place":["Eugene, United States"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8480-0897","authenticated-orcid":false,"given":"Sajjad","family":"Rahnama","sequence":"additional","affiliation":[{"name":"Oracle Corporation","place":["San Jose, United States"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-6189-3681","authenticated-orcid":false,"given":"Junchao","family":"Chen","sequence":"additional","affiliation":[{"name":"Computer Science, University of California Davis","place":["Davis, United States"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-0592-7137","authenticated-orcid":false,"given":"Celine","family":"Sana","sequence":"additional","affiliation":[{"name":"Computing and Software, McMaster University","place":["Hamilton, Canada"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2779-6080","authenticated-orcid":false,"given":"Mohammad","family":"Sadoghi","sequence":"additional","affiliation":[{"name":"Computer Science, University of California Davis","place":["Davis, United States"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,3,27]]},"reference":[{"key":"e_1_3_3_2_2","unstructured":"2025. Apache ResilientDB. Retrieved from https:\/\/resilientdb.incubator.apache.org\/"},{"key":"e_1_3_3_3_2","unstructured":"Ittai Abraham Guy Gueta Dahlia Malkhi Lorenzo Alvisi Rama Kotla and Jean-Philippe Martin. 2017. Revisiting Fast Practical Byzantine Fault Tolerance. arXiv:1712.01367. Retrieved from https:\/\/arxiv.org\/abs\/1712.01367"},{"key":"e_1_3_3_4_2","unstructured":"Ittai Abraham Guy Gueta Dahlia Malkhi and Jean-Philippe Martin. 2018. Revisiting Fast Practical Byzantine Fault Tolerance: Thelma Velma and Zelma. arXiv:1801.10022. Retrieved from https:\/\/arxiv.org\/abs\/1801.10022"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342275"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452807"},{"key":"e_1_3_3_7_2","volume-title":"Proceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation","author":"Amiri Mohammad Javad","year":"2024","unstructured":"Mohammad Javad Amiri, Chenyuan Wu, Divyakant Agrawal, Amr El Abbadi, Boon Thau Loo, and Mohammad Sadoghi. 2024. The bedrock of byzantine fault tolerance: A unified platform for BFT protocols analysis, implementation, and experimentation. In Proceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation. USENIX, Article 22."},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/2658994"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2003.1258486"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/4221.214134"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629602"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.5555\/1558977.1558988"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/3492321.3519594"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319889"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.joule.2018.04.016"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90004-9"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342636"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_3_20_2","first-page":"568","volume-title":"Proceedings of the 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN)","author":"Gueta Guy Golan","year":"2019","unstructured":"Guy Golan Gueta, Ittai Abraham, Shelly Grossman, Dahlia Malkhi, Benny Pinkas, Michael Reiter, Dragos-Adrian Seredinschi, Orr Tamir, and Alin Tomescu. 2019. SBFT: A scalable and decentralized trust infrastructure. In Proceedings of the 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN). IEEE, 568\u2013580. DOI:10.1109\/DSN.2019.00063"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.csbj.2018.06.003"},{"key":"e_1_3_3_22_2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/3-540-08755-9_9","volume-title":"Proceedings of the Operating Systems, An Advanced Course","author":"Gray Jim","year":"1978","unstructured":"Jim Gray. 1978. Notes on data base operating systems. In Proceedings of the Operating Systems, An Advanced Course. Springer-Verlag, 393\u2013481. DOI:10.1007\/3-540-08755-9_9"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.2200\/S01068ED1V01Y202012DTM065"},{"key":"e_1_3_3_24_2","first-page":"1392","volume-title":"Proceedings of the 2021 IEEE 37th International Conference on Data Engineering (ICDE)","author":"Gupta Suyash","year":"2021","unstructured":"Suyash Gupta, Jelle Hellings, and Mohammad Sadoghi. 2021. RCC: Resilient concurrent consensus for high-throughput secure transaction processing. In Proceedings of the 2021 IEEE 37th International Conference on Data Engineering (ICDE). IEEE, 1392\u20131403. DOI:10.1109\/ICDE51399.2021.00124"},{"key":"e_1_3_3_25_2","volume-title":"Proceedings of the 39th International Symposium on Distributed Computing (DISC 2025)","author":"Gupta Suyash","year":"2025","unstructured":"Suyash Gupta, Dakai Kang, Dahlia Malkhi, and Mohammad Sadoghi. 2025. Brief announcement: Carry the tail in consensus protocols. In Proceedings of the 39th International Symposium on Distributed Computing (DISC 2025)."},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.14778\/3380750.3380757"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.5441\/002\/edbt.2021.27"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS47774.2020.00012"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476275"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1186\/s12942-018-0144-x"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tifs.2019.07.034"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3725308"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00157"},{"key":"e_1_3_3_34_2","doi-asserted-by":"crossref","DOI":"10.1201\/b17668","volume-title":"Introduction to Modern Cryptography (2nd ed.)","author":"Katz Jonathan","year":"2014","unstructured":"Jonathan Katz and Yehuda Lindell. 2014. Introduction to Modern Cryptography (2nd ed.). Chapman and Hall\/CRC."},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/1658357.1658358"},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/3372136"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2006.35"},{"key":"e_1_3_3_38_2","unstructured":"Satoshi Nakamoto. 2009. Bitcoin: A Peer-to-Peer Electronic Cash System. Retrieved from https:\/\/bitcoin.org\/en\/bitcoin-paper"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342632"},{"key":"e_1_3_3_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00020"},{"key":"e_1_3_3_41_2","volume-title":"Blockchain and Economic Development: Hype vs. Reality","author":"Pisa Michael","year":"2017","unstructured":"Michael Pisa and Matt Juden. 2017. Blockchain and Economic Development: Hype vs. Reality. Technical Report. Center for Global Development. Retrieved from https:\/\/www.cgdev.org\/publication\/blockchain-and-economic-development-hype-vs-reality"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.3390\/logistics4040027"},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452789"},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_15"},{"key":"e_1_3_3_45_2","doi-asserted-by":"publisher","DOI":"10.5555\/867558"},{"key":"e_1_3_3_46_2","doi-asserted-by":"publisher","DOI":"10.5555\/517021"},{"key":"e_1_3_3_47_2","volume-title":"An Introduction to Hyperledger","author":"Group The Hyperledger White Paper Working","year":"2018","unstructured":"The Hyperledger White Paper Working Group. 2018. An Introduction to Hyperledger. Technical Report. The Linux Foundation."},{"key":"e_1_3_3_48_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98911-2"},{"key":"e_1_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.221"},{"key":"e_1_3_3_50_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosust.2017.04.011"},{"key":"e_1_3_3_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2922538"},{"key":"e_1_3_3_52_2","unstructured":"Yin Yang. 2018. LinBFT: Linear-Communication Byzantine Fault Tolerance for Public Blockchains. arXiv:1807.01829. Retrieved from https:\/\/arxiv.org\/abs\/1807.01829"},{"key":"e_1_3_3_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3774322","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T11:05:01Z","timestamp":1774609501000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3774322"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,27]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,9,30]]}},"alternative-id":["10.1145\/3774322"],"URL":"https:\/\/doi.org\/10.1145\/3774322","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"value":"0362-5915","type":"print"},{"value":"1557-4644","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,27]]},"assertion":[{"value":"2024-12-21","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-09","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-03-27","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}