Traceable random numbers from a non-local quantum advantage
- PMID: 40500436
- DOI: 10.1038/s41586-025-09054-3
Traceable random numbers from a non-local quantum advantage
Abstract
The unpredictability of random numbers is fundamental to both digital security1,2 and applications that fairly distribute resources3,4. However, existing random number generators have limitations-the generation processes cannot be fully traced, audited and certified to be unpredictable. The algorithmic steps used in pseudorandom number generators5 are auditable, but they cannot guarantee that their outputs were a priori unpredictable given knowledge of the initial seed. Device-independent quantum random number generators6-9 can ensure that the source of randomness was unknown beforehand, but the steps used to extract the randomness are vulnerable to tampering. Here we demonstrate a fully traceable random number generation protocol based on device-independent techniques. Our protocol extracts randomness from unpredictable non-local quantum correlations, and uses distributed intertwined hash chains to cryptographically trace and verify the extraction process. This protocol forms the basis for a public traceable and certifiable quantum randomness beacon that we have launched10. Over the first 40 days of operation, we completed the protocol 7,434 out of 7,454 attempts-a success rate of 99.7%. Each time the protocol succeeded, the beacon emitted a pulse of 512 bits of traceable randomness. The bits are certified to be uniform with error multiplied by actual success probability bounded by 2-64. The generation of certifiable and traceable randomness represents a public service that operates with an entanglement-derived advantage over comparable classical approaches.
© 2025. This is a U.S. Government work and not under copyright protection in the US; foreign copyright protection may apply.
Conflict of interest statement
Competing interests: The authors declare no competing interests.
References
-
- Buchmann, J. A. Introduction to Cryptography (Springer, 2004).
-
- Eastlake, D. E. 3rd, Crocker, S. & Schiller, J. I. Randomness Requirements for Security. Request for Comments 4086 (Internet Engineering Task Force, 2005).
-
- Stone, P. Why lotteries are just. J. Polit. Philos. 15, 276–295 (2007). - DOI
-
- Duxbury, N. Random Justice: On Lotteries and Legal Decision-Making (Oxford Univ. Press, 1999).
-
- Menezes, A. J., Van Oorschot, P. C. & Vanstone, S. A. Handbook of Applied Cryptography 1st edn (CRC, 2018).
LinkOut - more resources
Full Text Sources