On December 31st, ElizaOS founder Shaw commented on the "threat of quantum computing to Bitcoin," stating that its realization is far more distant than currently reported in the media. For hash functions like SHA-256, Grover's algorithm only reduces the search space from 2²⁵⁶ to 2¹²⁸, but 2¹²⁸ remains unbreakable. While Shor's algorithm can theoretically break RSA/ECDSA encryption, current quantum computers typically rely on preprocessing or optimizations based on prior knowledge, making them not universally applicable implementations of a pure Shor's algorithm.
Cracking Bitcoin's real-time network would require rapid, iterative execution; if feasible, all encrypted data would be exposed, making Bitcoin a minor issue. Modern cryptography has assumed future computational growth from the outset, with second-order acceleration anticipated and considered decades ago. Whenever you see fear or hype surrounding quantum computing, remember: these people know absolutely nothing.
