Quantum computing: speedup proof and ETH post-quantum framing
A claimed proof limits quantum speedups to polynomial for general problems, while an ETH-focused account frames Ethereum as a post-quantum store of value.
What we know
An account on X RTs a claim that, if the proof holds, quantum computers are only polynomially faster for general problems, with Shor's algorithm an exception. Another account on X asserts $ETH will be a post-quantum store of value.
By the Global Eye 24 desk, with AI assistance. Updated as the story develops. Spot an error? Write to corrections@globaleye24.com.