{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T21:34:57Z","timestamp":1778362497952,"version":"3.51.4"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Distrib. Ledger Technol."],"published-print":{"date-parts":[[2026,9,30]]},"abstract":"<jats:p>\n                    We propose\n                    <jats:italic toggle=\"yes\">N-choice game<\/jats:italic>\n                    (NCG), a decentralized method for generating pseudo-random numbers for smart contracts. NCG involves multiple participants, each of whom chooses a value between 0 and\n                    <jats:inline-formula content-type=\"math\/tex\">\n                      <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(N-1\\)<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    and whose collective choices determine the generation of a pseudo-random number. The design of NCG has three key objectives: incentivizing participants to make random choices, assessing randomness in a decentralized environment, and achieving high operational performance. Implemented in Solidity and rigorously tested, NCG has shown remarkable effectiveness. Our results show that the randomness of the numbers generated by NCG is high and consistent, even under a strict NIST randomness test, provided that there is no collusion between the majority of participants. Not only is it impossible to customize the outputs generated by NCG, but it is also impractical to make them non-random. Therefore, it is rational to engage NCG for the purpose of rewards rather than the output values it produces. Selecting values in a way that is not predicted by other nodes yields the highest expected value, and NCG incentivizes random selection. Furthermore, NCG demonstrates a significant performance advantage, being up to 158 times faster at generating random numbers than the existing Random Bit Generator framework [\n                    <jats:xref ref-type=\"bibr\">3<\/jats:xref>\n                    ]. This efficiency underscores NCG\u2019s potential to enhance blockchain applications.\n                  <\/jats:p>","DOI":"10.1145\/3756327","type":"journal-article","created":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T19:38:51Z","timestamp":1755027531000},"page":"1-26","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["N-Choice Game: Building a Smart Contract for Accurate Pseudo-Random Number Generation"],"prefix":"10.1145","volume":"5","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0009-0009-9405-9102","authenticated-orcid":false,"given":"Kentaro","family":"Sako","sequence":"first","affiliation":[{"name":"Deloitte Tohmatsu Cyber LCC, Kawasaki, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-3208-4531","authenticated-orcid":false,"given":"Shin\u00edchiro","family":"Matsuo","sequence":"additional","affiliation":[{"name":"Georgetown University, Washington, District of Columbia, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0003-1583-4174","authenticated-orcid":false,"given":"Tatsuya","family":"Mori","sequence":"additional","affiliation":[{"name":"Waseda University, Shinjuku-ku, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,5,6]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484574"},{"key":"e_1_3_1_3_2","unstructured":"Zhuo Cai. 2023. A game-theoretic approach for provably-uniform random number generation in decentralized networks. arXiv:2309.11250. Retrieved from https:\/\/2.zoppoz.workers.dev:443\/http\/arxiv.org\/abs\/2309.11250"},{"key":"e_1_3_1_4_2","doi-asserted-by":"crossref","unstructured":"Krishnendu Chatterjee Amir Kafshdar Goharshady and Arash Pourdamghani. 2019. Probabilistic smart contracts: Secure randomness on the blockchain. arXiv:1902.07986. Retrieved from https:\/\/2.zoppoz.workers.dev:443\/http\/arxiv.org\/abs\/1902.07986","DOI":"10.1109\/BLOC.2019.8751326"},{"key":"e_1_3_1_5_2","unstructured":"CryptoKitties. 2017. CryptoKitties. Retrieved April 23 from https:\/\/2.zoppoz.workers.dev:443\/https\/www.cryptokitties.co\/"},{"key":"e_1_3_1_6_2","unstructured":"Sourav Das Vinith Krishnan Irene Miriam Isaac and Ling Ren. 2021. SPURT: Scalable distributed randomness beacon with transparent setup. IACR Cryptology ePrint Archieve. Retrieved from https:\/\/2.zoppoz.workers.dev:443\/https\/eprint.iacr.org\/2021\/100"},{"key":"e_1_3_1_7_2","unstructured":"Chainlink Developers. 2022. Introduction to Chainlink VRF. Retrieved April 23 from https:\/\/2.zoppoz.workers.dev:443\/https\/docs.chain.link\/docs\/chainlink-vrf\/"},{"key":"e_1_3_1_8_2","unstructured":"Solidity developers. 2016. Solidity. Retrieved April 30 from https:\/\/2.zoppoz.workers.dev:443\/https\/docs.soliditylang.org\/en\/v0.8.13\/"},{"key":"e_1_3_1_9_2","unstructured":"Ethereum. 2022. The Merge. Retrieved March 11 from https:\/\/2.zoppoz.workers.dev:443\/https\/ethereum.org\/ja\/roadmap\/merge\/"},{"key":"e_1_3_1_10_2","unstructured":"Etherscan. 2023. Active Ethereum addresses. Retrieved November 30 https:\/\/2.zoppoz.workers.dev:443\/https\/etherscan.io\/chart\/active-address"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISQED51717.2021.9424346"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36400-5_30"},{"key":"e_1_3_1_13_2","unstructured":"The go-ethereum Authors. 2013. go-ethereum. Retrieved April 30 from https:\/\/2.zoppoz.workers.dev:443\/https\/geth.ethereum.org\/"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/272991.272995"},{"key":"e_1_3_1_15_2","unstructured":"Satoshi Nakamoto. 2008. Bitcoin: A Peer-to-Peer Electronic Cash System. Retrieved from https:\/\/2.zoppoz.workers.dev:443\/https\/bitcoin.org\/bitcoin.pdf"},{"key":"e_1_3_1_16_2","unstructured":"NIST. 2019. Interoperable Randomness Beacons. Retrieved April 23 from https:\/\/2.zoppoz.workers.dev:443\/https\/csrc.nist.gov\/projects\/interoperable-randomness-beacons"},{"key":"e_1_3_1_17_2","unstructured":"NIST. 2019. NIST Randomness Beacon (Version 2.0 Beta). Retrieved April 23 2022 from https:\/\/2.zoppoz.workers.dev:443\/https\/beacon.nist.gov\/home"},{"key":"e_1_3_1_18_2","unstructured":"Charles W. O\u2019Donnell G. Edward Suh and Srinivas Devadas. 2004. PUF-based random number generation. Retrieved April 23 from https:\/\/2.zoppoz.workers.dev:443\/http\/people.csail.mit.edu\/cwo\/publications\/mit-csail-csg-481.pdf"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.3389\/FBLOC.2022.814977"},{"key":"e_1_3_1_20_2","unstructured":"S. W. C. Registry. 2023. SWC-116: Block Values as a Proxy for Time. Retrieved November 24 from https:\/\/2.zoppoz.workers.dev:443\/https\/swcregistry.io\/docs\/SWC-116\/"},{"key":"e_1_3_1_21_2","unstructured":"Andrew Rukhin Juan Soto James Nechvatal Miles Smid Elaine Barker Stefan Leigh Mark Levenson Mark Vangel David Banks Alan Heckert et al. 2010. A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications. Retrieved April 23 2022 from https:\/\/2.zoppoz.workers.dev:443\/https\/nvlpubs.nist.gov\/nistpubs\/legacy\/sp\/nistspecialpublication800-22r1a.pdf"},{"key":"e_1_3_1_22_2","unstructured":"Kentaro Sako. 2022. N-Choice Game Source Code. Retrieved April 26 from https:\/\/2.zoppoz.workers.dev:443\/https\/github.com\/ksbowler\/N-choice_game"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-63958-0_42"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3559795.3559796"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00003"},{"key":"e_1_3_1_26_2","unstructured":"Nick Szabo. 1996. Smart Contracts. Retrieved June 23 2022 from https:\/\/2.zoppoz.workers.dev:443\/http\/www.fon.hum.uva.nl\/rob\/Courses\/InformationInSpeech\/CDROM\/Literature\/LOTwinterschool2006\/szabo.best.vwh.net\/smart_contracts_2.html"},{"key":"e_1_3_1_27_2","first-page":"1427","volume-title":"26th USENIX Security Symposium (USENIX Security \u201917)","author":"Zhang Fan","year":"2017","unstructured":"Fan Zhang, Ittay Eyal, Robert Escriva, Ari Juels, and Robbert van Renesse. 2017. REM: Resource-efficient mining for blockchains. In 26th USENIX Security Symposium (USENIX Security \u201917). Engin Kirda and Thomas Ristenpart (Eds.), USENIX Association, 1427\u20131444. Retrieved from https:\/\/2.zoppoz.workers.dev:443\/https\/www.usenix.org\/conference\/usenixsecurity17\/technical-sessions\/presentation\/zhang"}],"container-title":["Distributed Ledger Technologies: Research and Practice"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/pdf\/10.1145\/3756327","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T14:28:47Z","timestamp":1778077727000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/3756327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,6]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,9,30]]}},"alternative-id":["10.1145\/3756327"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/3756327","relation":{},"ISSN":["2769-6480","2769-6480"],"issn-type":[{"value":"2769-6480","type":"print"},{"value":"2769-6480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,6]]},"assertion":[{"value":"2023-12-31","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-06-27","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-05-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}