{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:42:34Z","timestamp":1760488954231,"version":"3.44.0"},"reference-count":45,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2020,8]]},"abstract":"<jats:p>Since the introduction of Bitcoin---the first widespread application driven by blockchains---the interest in the design of blockchain-based applications has increased tremendously. At the core of these applications are consensus protocols that securely replicate client requests among all replicas, even if some replicas are Byzantine faulty. Unfortunately, these consensus protocols typically have low throughput, and this lack of performance is often cited as the reason for the slow wider adoption of blockchain technology. Consequently, many works focus on designing more efficient consensus protocols to increase throughput of consensus.<\/jats:p>\n          <jats:p>\n            We believe that this focus on consensus protocols only explains part of the story. To investigate this belief, we raise a simple question:\n            <jats:italic toggle=\"yes\">Can a well-crafted system using a classical consensus protocol outperform systems using modern protocols?<\/jats:italic>\n            In this tutorial, we answer this question by diving deep into the design of blockchain systems. Further, we take an in-depth look at the theory behind consensus, which can help users select the protocol that best-fits their requirements. Finally, we share our vision of high-throughput blockchain systems that operate at large scales.\n          <\/jats:p>","DOI":"10.14778\/3415478.3415565","type":"journal-article","created":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T18:46:40Z","timestamp":1600109200000},"page":"3441-3444","source":"Crossref","is-referenced-by-count":22,"title":["Building high throughput permissioned blockchain fabrics"],"prefix":"10.14778","volume":"13","author":[{"given":"Suyash","family":"Gupta","sequence":"first","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jelle","family":"Hellings","sequence":"additional","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sajjad","family":"Rahnama","sequence":"additional","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Sadoghi","sequence":"additional","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,8]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Synchronous byzantine agreement with expected O(1) rounds, expected O(n2) communication, and optimal resilience","author":"Abraham I.","year":"2018","unstructured":"I. Abraham, S. Devadas, D. Dolev, K. Nayak, and L. Ren. Synchronous byzantine agreement with expected O(1) rounds, expected O(n2) communication, and optimal resilience, 2018."},{"issue":"11","key":"e_1_2_1_2_1","first-page":"1385","article-title":"CAPER: A cross-application permissioned blockchain","volume":"12","author":"Amiri M. J.","year":"2019","unstructured":"M. J. Amiri, D. Agrawal, and A. E. Abbadi. CAPER: A cross-application permissioned blockchain. PVLDB, 12(11):1385--1398, 2019.","journal-title":"PVLDB"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190538"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2658994"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2013.53"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2014.43"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2012.37"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319889"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802214"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064033"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1981.53"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90004-9"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_2_1_16_1","volume-title":"Data quality and the bottom line: Achieving business success through a commitment to high quality data. Technical report","author":"Eckerson W. W.","year":"2002","unstructured":"W. W. Eckerson. Data quality and the bottom line: Achieving business success through a commitment to high quality data. Technical report, The Data Warehousing Institute, 101communications LLC., 2002."},{"issue":"11","key":"e_1_2_1_17_1","first-page":"1597","article-title":"BlockchainDB: A shared database on blockchains","volume":"12","author":"El-Hindi M.","year":"2019","unstructured":"M. El-Hindi, C. Binnig, A. Arasu, D. Kossmann, and R. Ramamurthy. BlockchainDB: A shared database on blockchains. PVLDB, 12(11):1597--1609, 2019.","journal-title":"PVLDB"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90033-3"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/564585.564601"},{"key":"e_1_2_1_21_1","unstructured":"G. Greenspan. Multichain private blockchain 2015."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366625.3369437"},{"key":"e_1_2_1_23_1","volume-title":"Proof-of-execution: Reaching consensus through fault-tolerant speculation","author":"Gupta S.","year":"2019","unstructured":"S. Gupta, J. Hellings, S. Rahnama, and M. Sadoghi. Proof-of-execution: Reaching consensus through fault-tolerant speculation, 2019."},{"key":"e_1_2_1_24_1","first-page":"1","volume-title":"33rd International Symposium on Distributed Computing (DISC 2019","volume":"146","author":"Gupta S.","year":"2019","unstructured":"S. Gupta, J. Hellings, and M. Sadoghi. Brief announcement: Revisiting consensus protocols through wait-free parallelization. In 33rd International Symposium on Distributed Computing (DISC 2019), volume 146, pages 44:1--44:3. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019."},{"key":"e_1_2_1_25_1","volume-title":"Scaling blockchain databases through parallel resilient consensus paradigm","author":"Gupta S.","year":"2019","unstructured":"S. Gupta, J. Hellings, and M. Sadoghi. Scaling blockchain databases through parallel resilient consensus paradigm, 2019."},{"key":"e_1_2_1_26_1","volume-title":"Fault-Tolerant Distributed Transactions on Blockchains. Synthesis Lectures on Data Management","author":"Gupta S.","year":"2020","unstructured":"S. Gupta, J. Hellings, and M. Sadoghi. Fault-Tolerant Distributed Transactions on Blockchains. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, 2020. (to appear)."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/3380750.3380757"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS47774.2020.00012"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055540.3055548"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376713"},{"key":"e_1_2_1_31_1","first-page":"1","volume-title":"33rd International Symposium on Distributed Computing (DISC 2019","volume":"146","author":"Hellings J.","year":"2019","unstructured":"J. Hellings and M. Sadoghi. Brief announcement: The fault-tolerant cluster-sending problem. In 33rd International Symposium on Distributed Computing (DISC 2019), volume 146, pages 45:1--45:3. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019."},{"key":"e_1_2_1_32_1","first-page":"1","volume-title":"23rd International Conference on Database Theory","volume":"155","author":"Hellings J.","year":"2020","unstructured":"J. Hellings and M. Sadoghi. Coordination-free byzantine replication with minimal communication costs. In 23rd International Conference on Database Theory, volume 155, pages 17:1--17:20. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2020."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1534235"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294267"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2006.35"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90052-4"},{"key":"e_1_2_1_38_1","volume-title":"Bitcoin: A peer-to-peer electronic cash system","author":"Nakamoto S.","year":"2009","unstructured":"S. Nakamoto. Bitcoin: A peer-to-peer electronic cash system, 2009."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342632"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00020"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/269012.269025"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050034"},{"key":"e_1_2_1_44_1","volume-title":"Ethereum: a secure decentralised generalised transaction ledger","author":"Wood G.","year":"2016","unstructured":"G. Wood. Ethereum: a secure decentralised generalised transaction ledger, 2016. EIP-150 revision."},{"key":"e_1_2_1_45_1","first-page":"347","volume-title":"Proceedings of the ACM Symposium on Principles of Distributed Computing","author":"Yin M.","year":"2019","unstructured":"M. Yin, D. Malkhi, M. K. Reiter, G. G. Gueta, and I. Abraham. HotStuff: BFT consensus with linearity and responsiveness. In Proceedings of the ACM Symposium on Principles of Distributed Computing, pages 347--356. ACM, 2019."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3415478.3415565","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T02:14:13Z","timestamp":1758075253000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3415478.3415565"}},"subtitle":["challenges and opportunities"],"short-title":[],"issued":{"date-parts":[[2020,8]]},"references-count":45,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["10.14778\/3415478.3415565"],"URL":"https:\/\/doi.org\/10.14778\/3415478.3415565","relation":{},"ISSN":["2150-8097"],"issn-type":[{"type":"print","value":"2150-8097"}],"subject":[],"published":{"date-parts":[[2020,8]]}}}