{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T16:38:48Z","timestamp":1782751128896,"version":"3.54.5"},"reference-count":51,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2022,2,24]],"date-time":"2022-02-24T00:00:00Z","timestamp":1645660800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NeTS 1718270"],"award-info":[{"award-number":["NeTS 1718270"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"US Army Research Office Grant","award":["W911NF-18-1-0332"],"award-info":[{"award-number":["W911NF-18-1-0332"]}]},{"name":"National Science Foundation","award":["CCF- 1705007"],"award-info":[{"award-number":["CCF- 1705007"]}]},{"name":"XDC network"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Meas. Anal. Comput. Syst."],"published-print":{"date-parts":[[2022,2,24]]},"abstract":"<jats:p>In this paper, we study a canonical distributed resource allocation problem arising in blockchains. While distributed resource allocation is a well-studied problem in networking, the blockchain setting additionally requires the solution to be resilient to adversarial behavior from a fraction of nodes. Scaling blockchain performance is a basic research topic; a plethora of solutions (under the umbrella of sharding ) have been proposed in recent years. Although the various sharding solutions share a common thread (they cryptographically stitch together multiple parallel chains), architectural differences lead to differing resource allocation problems. In this paper we make three main contributions: (a) we categorize the different sharding proposals under a common architectural framework, allowing for the emergence of a new, uniformly improved, uni-consensus sharding architecture. (b) We formulate and exactly solve a core resource allocation problem in the uni-consensus sharding architecture -- our solution, Free2shard, is adversary-resistant and achieves optimal throughput. The key technical contribution is a mathematical connection to the classical work of Blackwell approachability in dynamic game theory. (c) We implement the sharding architecture atop a full-stack blockchain in 3000 lines of code in Rust -- we achieve a throughput of more than 250,000 transactions per second with 6 shards, a vast improvement over state-of-the-art.<\/jats:p>","DOI":"10.1145\/3508031","type":"journal-article","created":{"date-parts":[[2022,2,28]],"date-time":"2022-02-28T23:44:29Z","timestamp":1646091869000},"page":"1-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Free2Shard"],"prefix":"10.1145","volume":"6","author":[{"given":"Ranvir","family":"Rana","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sreeram","family":"Kannan","sequence":"additional","affiliation":[{"name":"University of Washington at Seattle, Seattle, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Tse","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pramod","family":"Viswanath","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,2,28]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 24th Annual Conference on Learning Theory. JMLR Workshop and Conference Proceedings, 27--46","author":"Abernethy Jacob","year":"2011","unstructured":"Jacob Abernethy , Peter L Bartlett , and Elad Hazan . 2011 . Blackwell approachability and no-regret learning are equivalent . In Proceedings of the 24th Annual Conference on Learning Theory. JMLR Workshop and Conference Proceedings, 27--46 . Jacob Abernethy, Peter L Bartlett, and Elad Hazan. 2011. Blackwell approachability and no-regret learning are equivalent. In Proceedings of the 24th Annual Conference on Learning Theory. JMLR Workshop and Conference Proceedings, 27--46."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331629"},{"key":"e_1_2_1_3_1","volume-title":"LazyLedger: A Distributed Data Availability Ledger With Client-Side Smart Contracts. arxiv","author":"Al-Bassam Mustafa","year":"1905","unstructured":"Mustafa Al-Bassam . 2019. LazyLedger: A Distributed Data Availability Ledger With Client-Side Smart Contracts. arxiv : 1905 .09274 [cs.CR] Mustafa Al-Bassam. 2019. LazyLedger: A Distributed Data Availability Ledger With Client-Side Smart Contracts. arxiv: 1905.09274 [cs.CR]"},{"key":"e_1_2_1_4_1","volume-title":"Recognizing safety and liveness. Distributed computing","author":"Alpern Bowen","year":"1987","unstructured":"Bowen Alpern and Fred B Schneider . 1987. Recognizing safety and liveness. Distributed computing , Vol. 2 , 3 ( 1987 ), 117--126. Bowen Alpern and Fred B Schneider. 1987. Recognizing safety and liveness. Distributed computing , Vol. 2, 3 (1987), 117--126."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308897.3308950"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a006"},{"key":"e_1_2_1_7_1","volume-title":"Divide and scale: Formalization of distributed ledger sharding protocols. arXiv preprint arXiv:1910.10434","author":"Avarikioti Georgia","year":"2019","unstructured":"Georgia Avarikioti , Eleftherios Kokoris-Kogias , and Roger Wattenhofer . 2019. Divide and scale: Formalization of distributed ledger sharding protocols. arXiv preprint arXiv:1910.10434 ( 2019 ). Georgia Avarikioti, Eleftherios Kokoris-Kogias, and Roger Wattenhofer. 2019. Divide and scale: Formalization of distributed ledger sharding protocols. arXiv preprint arXiv:1910.10434 (2019)."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78375-8_2"},{"key":"e_1_2_1_9_1","volume-title":"Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability. Cryptology ePrint Archive, Report 2018\/378. https:\/\/eprint.iacr.org\/2018\/378.","author":"Badertscher Christian","year":"2018","unstructured":"Christian Badertscher , Peter Gazi , Aggelos Kiayias , Alexander Russell , and Vassilis Zikas . 2018 b. Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability. Cryptology ePrint Archive, Report 2018\/378. https:\/\/eprint.iacr.org\/2018\/378. Christian Badertscher, Peter Gazi, Aggelos Kiayias, Alexander Russell, and Vassilis Zikas. 2018b. Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability. Cryptology ePrint Archive, Report 2018\/378. https:\/\/eprint.iacr.org\/2018\/378."},{"key":"e_1_2_1_10_1","volume-title":"ACM Computer and Communications Security Conference","author":"Bagaria Vivek","year":"2019","unstructured":"Vivek Bagaria , Sreeram Kannan , David Tse , Giulia Fanti , and Pramod Viswanath . 2019 . sf Prism: Deconstructing the blockchain to approach physical limits . ACM Computer and Communications Security Conference (2019). Vivek Bagaria, Sreeram Kannan, David Tse, Giulia Fanti, and Pramod Viswanath. 2019. sf Prism: Deconstructing the blockchain to approach physical limits. ACM Computer and Communications Security Conference (2019)."},{"key":"e_1_2_1_11_1","volume-title":"CORFU: A Shared Log Design for Flash Clusters. In Presented as part of the 9th USENIX Symposium on Networked Systems Design and Implementation (NSDI 12) . 1--14.","author":"Balakrishnan Mahesh","year":"2012","unstructured":"Mahesh Balakrishnan , Dahlia Malkhi , Vijayan Prabhakaran , Ted Wobbler , Michael Wei , and John D Davis . 2012 . CORFU: A Shared Log Design for Flash Clusters. In Presented as part of the 9th USENIX Symposium on Networked Systems Design and Implementation (NSDI 12) . 1--14. Mahesh Balakrishnan, Dahlia Malkhi, Vijayan Prabhakaran, Ted Wobbler, Michael Wei, and John D Davis. 2012. CORFU: A Shared Log Design for Flash Clusters. In Presented as part of the 9th USENIX Symposium on Networked Systems Design and Implementation (NSDI 12) . 1--14."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522732"},{"key":"e_1_2_1_13_1","first-page":"46","article-title":"Scalable, transparent, and post-quantum secure computational integrity","volume":"2018","author":"Ben-Sasson Eli","year":"2018","unstructured":"Eli Ben-Sasson , Iddo Bentov , Yinon Horesh , and Michael Riabzev . 2018 . Scalable, transparent, and post-quantum secure computational integrity . IACR Cryptology ePrint Archive , Vol. 2018 (2018), 46 . Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev. 2018. Scalable, transparent, and post-quantum secure computational integrity. IACR Cryptology ePrint Archive , Vol. 2018 (2018), 46.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_2_1_14_1","volume-title":"23rd USENIX Security Symposium (USENIX Security 14)","author":"Ben-Sasson Eli","year":"2014","unstructured":"Eli Ben-Sasson , Alessandro Chiesa , Eran Tromer , and Madars Virza . 2014 . Succinct non-interactive zero knowledge for a von Neumann architecture . In 23rd USENIX Security Symposium (USENIX Security 14) . 781--796. Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, and Madars Virza. 2014. Succinct non-interactive zero knowledge for a von Neumann architecture. In 23rd USENIX Security Symposium (USENIX Security 14). 781--796."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1956.6.1"},{"key":"e_1_2_1_16_1","first-page":"173","article-title":"Practical Byzantine fault tolerance","volume":"99","author":"Castro Miguel","year":"1999","unstructured":"Miguel Castro , Barbara Liskov , 1999 . Practical Byzantine fault tolerance . In OSDI , Vol. 99. 173 -- 186 . Miguel Castro, Barbara Liskov, et almbox. 1999. Practical Byzantine fault tolerance. In OSDI, Vol. 99. 173--186.","journal-title":"OSDI"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/42282.42283"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_10"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70972-7_22"},{"key":"e_1_2_1_23_1","volume-title":"Approachability in Stackelberg stochastic games with vector costs. Dynamic games and applications","author":"Kalathil Dileep","year":"2017","unstructured":"Dileep Kalathil , Vivek S Borkar , and Rahul Jain . 2017. Approachability in Stackelberg stochastic games with vector costs. Dynamic games and applications , Vol. 7 , 3 ( 2017 ), 422--442. Dileep Kalathil, Vivek S Borkar, and Rahul Jain. 2017. Approachability in Stackelberg stochastic games with vector costs. Dynamic games and applications , Vol. 7, 3 (2017), 422--442."},{"key":"e_1_2_1_24_1","volume-title":"Arbitrum: Scalable, private smart contracts. In 27th $$USENIX$$ Security Symposium ($$USENIX$$ Security 18). 1353--1370.","author":"Kalodner Harry","year":"2018","unstructured":"Harry Kalodner , Steven Goldfeder , Xiaoqi Chen , S Matthew Weinberg , and Edward W Felten . 2018 . Arbitrum: Scalable, private smart contracts. In 27th $$USENIX$$ Security Symposium ($$USENIX$$ Security 18). 1353--1370. Harry Kalodner, Steven Goldfeder, Xiaoqi Chen, S Matthew Weinberg, and Edward W Felten. 2018. Arbitrum: Scalable, private smart contracts. In 27th $$USENIX$$ Security Symposium ($$USENIX$$ Security 18). 1353--1370."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63688-7_12"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.000-5"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1977.229904"},{"key":"e_1_2_1_28_1","volume-title":"Resource Pools and the CAP Theorem. arxiv","author":"Lewis-Pye Andrew","year":"2006","unstructured":"Andrew Lewis-Pye and Tim Roughgarden . 2020. Resource Pools and the CAP Theorem. arxiv : 2006 .10698 [cs.DC] Andrew Lewis-Pye and Tim Roughgarden. 2020. Resource Pools and the CAP Theorem. arxiv: 2006.10698 [cs.DC]"},{"key":"e_1_2_1_29_1","volume-title":"International Conference on Machine Learning . PMLR, 3944--3952","author":"Liakopoulos Nikolaos","year":"2019","unstructured":"Nikolaos Liakopoulos , Apostolos Destounis , Georgios Paschos , Thrasyvoulos Spyropoulos , and Panayotis Mertikopoulos . 2019 . Cautious regret minimization: Online optimization with long-term budget constraints . In International Conference on Machine Learning . PMLR, 3944--3952 . Nikolaos Liakopoulos, Apostolos Destounis, Georgios Paschos, Thrasyvoulos Spyropoulos, and Panayotis Mertikopoulos. 2019. Cautious regret minimization: Online optimization with long-term budget constraints. In International Conference on Machine Learning . PMLR, 3944--3952."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978389"},{"key":"e_1_2_1_31_1","unstructured":"Loi Luu and Nate Rush. 2017. PeaceRelay Merkle-Patricia Trie Proof Verification.  Loi Luu and Nate Rush. 2017. PeaceRelay Merkle-Patricia Trie Proof Verification."},{"key":"e_1_2_1_32_1","article-title":"Online Learning with Sample Path Constraints","volume":"10","author":"Mannor Shie","year":"2009","unstructured":"Shie Mannor , John N Tsitsiklis , and Jia Yuan Yu . 2009 . Online Learning with Sample Path Constraints . Journal of Machine Learning Research , Vol. 10 , 3 (2009). Shie Mannor, John N Tsitsiklis, and Jia Yuan Yu. 2009. Online Learning with Sample Path Constraints. Journal of Machine Learning Research , Vol. 10, 3 (2009).","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_1_33_1","volume-title":"Bitcoin: A peer-to-peer electronic cash system.","author":"Nakamoto Satoshi","year":"2008","unstructured":"Satoshi Nakamoto . 2008 . Bitcoin: A peer-to-peer electronic cash system. (2008). Satoshi Nakamoto. 2008. Bitcoin: A peer-to-peer electronic cash system. (2008)."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.47"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the ACM Symposium on Principles of Distributed Computing. ACM.","author":"Pass R.","unstructured":"R. Pass and E. Shi . 2017. Fruitchains: A fair blockchain . In Proceedings of the ACM Symposium on Principles of Distributed Computing. ACM. R. Pass and E. Shi. 2017. Fruitchains: A fair blockchain. In Proceedings of the ACM Symposium on Principles of Distributed Computing. ACM."},{"key":"e_1_2_1_36_1","unstructured":"Ethereum Research. 2020. Ethereum 2.0. https:\/\/github.com\/ethereum\/eth2.0-specs .  Ethereum Research. 2020. Ethereum 2.0. https:\/\/github.com\/ethereum\/eth2.0-specs ."},{"key":"e_1_2_1_37_1","unstructured":"Fred B Schneider. 1993. Replication management using the state-machine approach distributed systems. (1993).  Fred B Schneider. 1993. Replication management using the state-machine approach distributed systems. (1993)."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/2946645.3007082"},{"key":"e_1_2_1_39_1","volume-title":"Nightshade: Near protocol sharding design.","author":"Skidanov Alex","year":"2019","unstructured":"Alex Skidanov and Illia Polosukhin . 2019 . Nightshade: Near protocol sharding design. (2019). Alex Skidanov and Illia Polosukhin. 2019. Nightshade: Near protocol sharding design. (2019)."},{"key":"e_1_2_1_40_1","volume-title":"Replay Attacks and Defenses Against Cross-shard Consensus in Sharded Distributed Ledgers. arXiv preprint arXiv:1901.11218","author":"Sonnino Alberto","year":"2019","unstructured":"Alberto Sonnino , Shehar Bano , Mustafa Al-Bassam , and George Danezis . 2019. Replay Attacks and Defenses Against Cross-shard Consensus in Sharded Distributed Ledgers. arXiv preprint arXiv:1901.11218 ( 2019 ). Alberto Sonnino, Shehar Bano, Mustafa Al-Bassam, and George Danezis. 2019. Replay Attacks and Defenses Against Cross-shard Consensus in Sharded Distributed Ledgers. arXiv preprint arXiv:1901.11218 (2019)."},{"key":"e_1_2_1_41_1","volume-title":"Communication networks: an optimization, control, and stochastic networks perspective","author":"Srikant Rayadurgam","unstructured":"Rayadurgam Srikant and Lei Ying . 2013. Communication networks: an optimization, control, and stochastic networks perspective . Cambridge University Press . Rayadurgam Srikant and Lei Ying. 2013. Communication networks: an optimization, control, and stochastic networks perspective .Cambridge University Press."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.1990.204000"},{"key":"e_1_2_1_43_1","unstructured":"Coin Telegraph. 2019. 10 000 Nodes Are Running BTC Lightning Network in New All-Time High. https:\/\/cointelegraph.com\/news\/10-000-nodes-are-running-btc-lightning-network-in-new-all-time-high .  Coin Telegraph. 2019. 10 000 Nodes Are Running BTC Lightning Network in New All-Time High. https:\/\/cointelegraph.com\/news\/10-000-nodes-are-running-btc-lightning-network-in-new-all-time-high ."},{"key":"e_1_2_1_44_1","volume-title":"A scalable verification solution for blockchains. arXiv preprint arXiv:1908.04756","author":"Teutsch Jason","year":"2019","unstructured":"Jason Teutsch and Christian Reitwie\u00dfner . 2019. A scalable verification solution for blockchains. arXiv preprint arXiv:1908.04756 ( 2019 ). Jason Teutsch and Christian Reitwie\u00dfner. 2019. A scalable verification solution for blockchains. arXiv preprint arXiv:1908.04756 (2019)."},{"key":"e_1_2_1_45_1","volume-title":"A certain zero-sum two-person game equivalent to the optimal assignment problem. Contributions to the Theory of Games","author":"Neumann John Von","year":"1953","unstructured":"John Von Neumann . 1953. A certain zero-sum two-person game equivalent to the optimal assignment problem. Contributions to the Theory of Games , Vol. 2 , 0 ( 1953 ), 5--12. John Von Neumann. 1953. A certain zero-sum two-person game equivalent to the optimal assignment problem. Contributions to the Theory of Games , Vol. 2, 0 (1953), 5--12."},{"key":"e_1_2_1_46_1","volume-title":"Market Structure and Equilibrium","author":"von Stackelberg Heinrich","unstructured":"Heinrich von Stackelberg . 2011. Market Structure and Equilibrium . Springer . Heinrich von Stackelberg. 2011. Market Structure and Equilibrium .Springer."},{"key":"e_1_2_1_47_1","volume-title":"Monoxide: Scale out blockchains with asynchronous consensus zones. In 16th $$USENIX$$ Symposium on Networked Systems Design and Implementation ($$NSDI$$ 19) . 95--112.","author":"Wang Jiaping","year":"2019","unstructured":"Jiaping Wang and Hao Wang . 2019 . Monoxide: Scale out blockchains with asynchronous consensus zones. In 16th $$USENIX$$ Symposium on Networked Systems Design and Implementation ($$NSDI$$ 19) . 95--112. Jiaping Wang and Hao Wang. 2019. Monoxide: Scale out blockchains with asynchronous consensus zones. In 16th $$USENIX$$ Symposium on Networked Systems Design and Implementation ($$NSDI$$ 19) . 95--112."},{"key":"e_1_2_1_48_1","volume-title":"Polkadot: Vision for a heterogeneous multi-chain framework.","author":"Wood Gavin","year":"2016","unstructured":"Gavin Wood . 2016 . Polkadot: Vision for a heterogeneous multi-chain framework. (2016). Gavin Wood. 2016. Polkadot: Vision for a heterogeneous multi-chain framework. (2016)."},{"key":"e_1_2_1_49_1","volume-title":"Prism: Scaling Bitcoin by 10,000 x. arXiv preprint arXiv:1909.11261","author":"Yang Lei","year":"2019","unstructured":"Lei Yang , Vivek Bagaria , Gerui Wang , Mohammad Alizadeh , David Tse , Giulia Fanti , and Pramod Viswanath . 2019 . Prism: Scaling Bitcoin by 10,000 x. arXiv preprint arXiv:1909.11261 (2019). Lei Yang, Vivek Bagaria, Gerui Wang, Mohammad Alizadeh, David Tse, Giulia Fanti, and Pramod Viswanath. 2019. Prism: Scaling Bitcoin by 10,000 x. arXiv preprint arXiv:1909.11261 (2019)."},{"key":"e_1_2_1_50_1","volume-title":"A Low Complexity Algorithm with $O(backslashsqrt T)$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints. arXiv preprint arXiv:1604.02218","author":"Yu Hao","year":"2016","unstructured":"Hao Yu and Michael J Neely . 2016. A Low Complexity Algorithm with $O(backslashsqrt T)$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints. arXiv preprint arXiv:1604.02218 ( 2016 ). Hao Yu and Michael J Neely. 2016. A Low Complexity Algorithm with $O(backslashsqrt T)$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints. arXiv preprint arXiv:1604.02218 (2016)."},{"key":"e_1_2_1_51_1","volume-title":"Online Convex Optimization with Stochastic Constraints. In 31st Conference on Neural Information Processing Systems (NIPS","author":"Yu Hao","year":"2017","unstructured":"Hao Yu , Michael J Neely , and Xiaohan Wei . 2017 . Online Convex Optimization with Stochastic Constraints. In 31st Conference on Neural Information Processing Systems (NIPS 2017), Long Beach, CA, USA. Hao Yu, Michael J Neely, and Xiaohan Wei. 2017. Online Convex Optimization with Stochastic Constraints. In 31st Conference on Neural Information Processing Systems (NIPS 2017), Long Beach, CA, USA."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243853"},{"key":"e_1_2_1_54_1","unstructured":"Zilliqa. 2017. The ZILLIQA Technical Whitepaper. https:\/\/docs.zilliqa.com\/whitepaper.pdf .  Zilliqa. 2017. The ZILLIQA Technical Whitepaper. https:\/\/docs.zilliqa.com\/whitepaper.pdf ."}],"container-title":["Proceedings of the ACM on Measurement and Analysis of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3508031","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3508031","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3508031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:29Z","timestamp":1750191149000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3508031"}},"subtitle":["Adversary-resistant Distributed Resource Allocation for Blockchains"],"short-title":[],"issued":{"date-parts":[[2022,2,24]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2,24]]}},"alternative-id":["10.1145\/3508031"],"URL":"https:\/\/doi.org\/10.1145\/3508031","relation":{},"ISSN":["2476-1249"],"issn-type":[{"value":"2476-1249","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,24]]},"assertion":[{"value":"2022-02-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}