A speculative but structured argument that the quantum threat to RSA and Bitcoin may be fundamentally overstated. The author invokes the Bekenstein bound — the universe's physical information limit (~10^66 bits) — to argue that running Shor's algorithm on cryptographically random keys would require representing 2^4096 bits of
•9m read time• From coinsbench.com
Table of contents
Why RSA and Bitcoin May Be Safer Than We ThinkThe Standard StoryThe Bekenstein Bound: The Universe’s Information BudgetThe Quantum Computing AssumptionThe Cryptographic ProblemThe “Small Islands” EscapeThe Wall at 200–400 Logical QubitsGet Gustav Stieger ’s stories in your inboxWhy This Matters for BitcoinThe ObjectionsThe TestConclusionReferencesSort: