BlockBeats News, December 31 — ElizaOS founder Shaw shared his views on “Quantum Computing Threat to Bitcoin.” Its realization is much farther off than current media reports suggest. For hash functions like SHA-256, Grover’s algorithm only reduces the search space from 2²⁵⁶ to 2¹²⁸, but 2¹²⁸ remains unbreakable. Shor’s algorithm can theoretically crack RSA/ECDSA encryption, but current quantum computers typically rely on preprocessing or known factors for optimization, and are not pure Shor algorithm implementations. To crack Bitcoin, a real-time network, it would require rapid repeated execution. If feasible, all encrypted data would be exposed, and Bitcoin would then be a minor issue. Modern cryptography has always assumed future computational growth; quadratic acceleration was anticipated and considered decades ago. Whenever you see fear or hype around quantum computing, remember: these people know nothing at all.
Disclaimer: The information on this page may come from third parties and does not represent the views or opinions of Gate. The content displayed on this page is for reference only and does not constitute any financial, investment, or legal advice. Gate does not guarantee the accuracy or completeness of the information and shall not be liable for any losses arising from the use of this information. Virtual asset investments carry high risks and are subject to significant price volatility. You may lose all of your invested principal. Please fully understand the relevant risks and make prudent decisions based on your own financial situation and risk tolerance. For details, please refer to
Disclaimer.
