{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T16:45:02Z","timestamp":1761324302537,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,6]]},"DOI":"10.1145\/3350755.3400272","type":"proceedings-article","created":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T15:56:12Z","timestamp":1594310172000},"page":"383-393","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["The Append Memory Model: Why BlockDAGs Excel Blockchains"],"prefix":"10.1145","author":[{"given":"Darya","family":"Melnyk","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00100-3"},{"key":"e_1_3_2_1_2_1","volume-title":"Distributed Computing","volume":"18","author":"Alon Noga","year":"2005","unstructured":"Noga Alon , Michael Merritt , Omer Reingold , Gadi Taubenfeld , and Rebecca Wright . 2005 . Tight bounds for shared memory systems accessed by Byzantine processes . Distributed Computing , Vol. 18 (11 2005), 99--109. Noga Alon, Michael Merritt, Omer Reingold, Gadi Taubenfeld, and Rebecca Wright. 2005. Tight bounds for shared memory systems accessed by Byzantine processes. Distributed Computing, Vol. 18 (11 2005), 99--109."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200869"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/362759.362813"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/365559.365617"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/7531.7533"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90033-3"},{"key":"e_1_3_2_1_9_1","first-page":"281","article-title":"The Bitcoin Backbone Protocol","volume":"2015","author":"Garay Juan","year":"2015","unstructured":"Juan Garay , Aggelos Kiayias , and Nikos Leonardos . 2015 . The Bitcoin Backbone Protocol : Analysis and Applications. In Advances in Cryptology - EUROCRYPT 2015. 281 -- 310 . Juan Garay, Aggelos Kiayias, and Nikos Leonardos. 2015. The Bitcoin Backbone Protocol: Analysis and Applications. In Advances in Cryptology - EUROCRYPT 2015. 281--310.","journal-title":"Analysis and Applications. In Advances in Cryptology - EUROCRYPT"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331589"},{"key":"e_1_3_2_1_11_1","unstructured":"Saurabh Gupta. 2016. A Non-Consensus Based Decentralized Financial Transaction Processing Model with Support for Efficient Auditing.  Saurabh Gupta. 2016. A Non-Consensus Based Decentralized Financial Transaction Processing Model with Support for Efficient Auditing."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"volume-title":"Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (CCS). 729--744","author":"Kiffer Lucianna","key":"e_1_3_2_1_13_1","unstructured":"Lucianna Kiffer , Rajmohan Rajaraman , and abhi shelat. 2018. A Better Method to Analyze Blockchain Consistency . In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (CCS). 729--744 . Lucianna Kiffer, Rajmohan Rajaraman, and abhi shelat. 2018. A Better Method to Analyze Blockchain Consistency. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (CCS). 729--744."},{"key":"e_1_3_2_1_14_1","unstructured":"Chenxing Li Peilun Li Dong Zhou Wei Xu Fan Long and Andrew Yao. 2018. Scaling Nakamoto Consensus to Thousands of Transactions per Second. arxiv: cs.DC\/1805.03870  Chenxing Li Peilun Li Dong Zhou Wei Xu Fan Long and Andrew Yao. 2018. Scaling Nakamoto Consensus to Thousands of Transactions per Second. arxiv: cs.DC\/1805.03870"},{"key":"e_1_3_2_1_15_1","volume-title":"Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing research","author":"Loui Michael C","year":"1987","unstructured":"Michael C Loui and Hosame H Abu-Amara . 1987. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing research , Vol. 4 , 163--183 ( 1987 ), 31. Michael C Loui and Hosame H Abu-Amara. 1987. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing research, Vol. 4, 163--183 (1987), 31."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Dahlia Malkhi Michael Merritt Michael Reiter and Gadi Taubenfeld. 2000. Objects Shared by Byzantine Processes. In Distributed Computing. 345--359.  Dahlia Malkhi Michael Merritt Michael Reiter and Gadi Taubenfeld. 2000. Objects Shared by Byzantine Processes. In Distributed Computing. 345--359.","DOI":"10.1007\/3-540-40026-5_23"},{"key":"e_1_3_2_1_17_1","unstructured":"Satoshi Nakamoto and A Bitcoin. 2008. A peer-to-peer electronic cash system. (2008).  Satoshi Nakamoto and A Bitcoin. 2008. A peer-to-peer electronic cash system. (2008)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Rafael Pass Lior Seeman and Abhi Shelat. 2017. Analysis of the Blockchain Protocol in Asynchronous Networks. In Advances in Cryptology -- EUROCRYPT. 643--673.  Rafael Pass Lior Seeman and Abhi Shelat. 2017. Analysis of the Blockchain Protocol in Asynchronous Networks. In Advances in Cryptology -- EUROCRYPT. 643--673.","DOI":"10.1007\/978-3-319-56614-6_22"},{"volume-title":"Rethinking Large-Scale Consensus. In 2017 IEEE 30th Computer Security Foundations Symposium (CSF). 115--129","author":"Pass R.","key":"e_1_3_2_1_19_1","unstructured":"R. Pass and E. Shi . 2017 . Rethinking Large-Scale Consensus. In 2017 IEEE 30th Computer Security Foundations Symposium (CSF). 115--129 . R. Pass and E. Shi. 2017. Rethinking Large-Scale Consensus. In 2017 IEEE 30th Computer Security Foundations Symposium (CSF). 115--129."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/72981.72992"},{"key":"e_1_3_2_1_21_1","volume-title":"Analysis of Nakamoto Consensus. IACR Cryptology ePrint Archive","author":"Ren Ling","year":"2019","unstructured":"Ling Ren . 2019. Analysis of Nakamoto Consensus. IACR Cryptology ePrint Archive ( 2019 ), 943. Ling Ren. 2019. Analysis of Nakamoto Consensus. IACR Cryptology ePrint Archive (2019), 943."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Yonatan Sompolinsky and Aviv Zohar. 2015. Secure High-Rate Transaction Processing in Bitcoin. In Financial Cryptography and Data Security. 507--527.  Yonatan Sompolinsky and Aviv Zohar. 2015. Secure High-Rate Transaction Processing in Bitcoin. In Financial Cryptography and Data Security. 507--527.","DOI":"10.1007\/978-3-662-47854-7_32"}],"event":{"name":"SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Virtual Event USA","acronym":"SPAA '20"},"container-title":["Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400272","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3350755.3400272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:21Z","timestamp":1750200081000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":22,"alternative-id":["10.1145\/3350755.3400272","10.1145\/3350755"],"URL":"https:\/\/doi.org\/10.1145\/3350755.3400272","relation":{},"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"2020-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}