Reproduce “The Beautiful Deception: How 256 Bits Pretend to be Infinity” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Alexander Towell
Alexander Towell introduces `LazyDigest`, a deterministic construction that effectively simulates an infinite random oracle for computationally bounded observers, bridging the gap between theoretical cryptographic ideals and practical finite systems. This work redefines cryptographic 'randomness' as computational hardness, contingent on the P\u2260NP conjecture.
Key insights
- Cryptographic 'randomness' is not true information-theoretic unpredictability but rather a manifestation of computational hardness, making pseudorandom sequences indistinguishable from true randomness to bounded observers.
- The concept of randomness is relative to an observer's computational power, leading to a 'computational relativity of randomness' where to an unbounded entity, nothing is random.
- The effectiveness of `LazyDigest` as a 'deception' relies directly on the P\u2260NP conjecture, implying that if P=NP, the system's output would be distinguishable from true randomness.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.