This website uses cookies
We use cookies to personalise content and ads, to provide social media features and to analyse our traffic. We also share information about your use of our site with our social media, advertising and analytics partners who may combine it with other information that you’ve provided to them or that they’ve collected from your use of their services.
Consent Selection
Details
  • Necessary cookies help make a website usable by enabling basic functions like page navigation and access to secure areas of the website. The website cannot function properly without these cookies.
  • Preference cookies enable a website to remember information that changes the way the website behaves or looks, like your preferred language or the region that you are in.
    • We do not use cookies of this type.

  • Statistic cookies help website owners to understand how visitors interact with websites by collecting and reporting information anonymously.
    • We do not use cookies of this type.

  • Marketing cookies are used to track visitors across websites. The intention is to display ads that are relevant and engaging for the individual user and thereby more valuable for publishers and third party advertisers.
    • We do not use cookies of this type.

  • Unclassified cookies are cookies that we are in the process of classifying, together with the providers of individual cookies.
    • __emg_sidPending
      Maximum Storage Duration: 1 dayType: HTTP Cookie
      __emg_vidPending
      Maximum Storage Duration: 1 yearType: HTTP Cookie
      nl-read-countPending
      Maximum Storage Duration: PersistentType: HTML Local Storage
Cookie declaration last updated on 8/12/26 by Cookiebot
[#IABV2_TITLE#]
[#IABV2_BODY_INTRO#]
[#IABV2_BODY_LEGITIMATE_INTEREST_INTRO#]
[#IABV2_BODY_PREFERENCE_INTRO#]
[#IABV2_BODY_PURPOSES_INTRO#]
[#IABV2_BODY_PURPOSES#]
[#IABV2_BODY_FEATURES_INTRO#]
[#IABV2_BODY_FEATURES#]
[#IABV2_BODY_PARTNERS_INTRO#]
[#IABV2_BODY_PARTNERS#]
About
Cookies are small text files that can be used by websites to make a user's experience more efficient.

The law states that we can store cookies on your device if they are strictly necessary for the operation of this site. For all other types of cookies we need your permission.

This site uses different types of cookies. Some cookies are placed by third party services that appear on our pages.

You can at any time change or withdraw your consent from the Cookie Declaration on our website.

Learn more about who we are, how you can contact us and how we process personal data in our Privacy Policy.

Please state your consent ID and date when you contact us regarding your consent.
NewsLayer

Install NewsLayer

Get the app experience — one tap from your home screen, instant loads and breaking-news alerts.

NewsLayer.com
NewsLayer PulseLIVEBTC$62,915-0.28%ETH$1,875-0.46%SOL$74.4-1.51%XRP$0.9948-0.84%DOGE$0.0694-0.77%ADA$0.176-0.87%Total Cap$2.26T-0.45%Layer Index41 Neutral
External Reporting公開 18時間前

Google study shows Bitcoin’s cryptography could fall in minutes, not decades

Google’s quantum researchers have significantly narrowed the resource gap between today’s quantum computers and the kind capable of breaking the cryptography that secures Bitcoin, Ethereum and most other blockchains — a finding that has…

Google study shows Bitcoin’s cryptography could fall in minutes, not decades
Publisher MM News 3 分で読める
Image via MM News

Market Context

Bitcoin

BTC

$62,915

-0.28% 24h

ETH$1,875-0.46%

Layer Index

41

↓ 8 pts in 24h

Google’s quantum researchers have significantly narrowed the resource gap between today’s quantum computers and the kind capable of breaking the cryptography that secures Bitcoin, Ethereum and most other blockchains — a finding that has reopened debate over how much time the digital-asset industry actually has to prepare.

In a whitepaper published by Google Quantum AI, in collaboration with researchers from the Ethereum Foundation and Stanford University, the team presented new resource estimates for breaking the 256-bit Elliptic Curve Discrete Logarithm Problem (ECDLP-256) — the mathematical problem underlying the secp256k1 curve that protects nearly every major cryptocurrency’s private keys.

The paper’s authors, led by Ryan Babbush and Hartmut Neven of Google Quantum AI, said an optimised version of Shor’s algorithm could solve the problem using either fewer than 1,200 logical qubits and 90 million Toffoli gates, or fewer than 1,450 logical qubits and 70 million Toffoli gates — whichever pairing reflects a trade-off between qubit count and gate operations.

On error-corrected superconducting hardware, the researchers estimated this could translate into an attack completed in minutes using fewer than half a million physical qubits.

That figure represents roughly a 20-fold reduction from earlier estimates, which had placed the resource requirement in the millions of qubits, according to the paper and multiple outlets that reviewed it, including Forbes and SecurityWeek.

Google said it verified the results through a zero-knowledge proof — a cryptographic technique that allows third parties to confirm the findings without disclosing the underlying attack methodology, a step the company described as part of a “responsible disclosure” approach.

The Attack Vectors

The paper outlines what it calls an “on-spend” attack: because a wallet’s public key becomes visible on the network the moment a transaction is broadcast — but before it is confirmed on-chain — a sufficiently fast quantum computer could theoretically derive the corresponding private key and reroute funds within that narrow window.

The researchers distinguish between “fast-clock” architectures, such as superconducting or photonic systems, and “slow-clock” architectures, such as neutral-atom or ion-trap systems, noting that only the former would plausibly be fast enough to exploit this window before a transaction settles.

Separately, the paper flags a longer-term risk to dormant or lost wallets whose public keys are already exposed on public ledgers — funds that, researchers say, would become vulnerable to extraction once capable quantum hardware exists, without requiring any action from the wallet owner.

The authors also survey quantum-era risks to smart contracts, proof-of-stake consensus mechanisms and data-availability sampling systems, though the paper stops short of assigning a firm timeline to when any of these vulnerabilities might be practically exploited.

Context and Caveats

Interestingly, industry observers have cautioned against reading the findings as an imminent threat.

The hardware needed to execute such an attack does not yet exist, and independent analysts who reviewed the paper — including commentary from post-quantum security researchers — noted that the estimates describe a theoretical resource floor rather than a demonstrated capability.

Quantum Computing Report and other trade publications framed the study as a recalibration of assumptions rather than evidence of an imminent break.

Even so, the timing has drawn scrutiny. Google has separately set a 2029 internal deadline to migrate its own systems to post-quantum cryptography, a target the company had announced prior to this paper’s release.

The Ethereum Foundation has likewise been developing post-quantum migration plans through a dedicated initiative, mapping out hard forks intended to move the network toward quantum-resistant signatures.

The paper’s authors have urged blockchain communities broadly to accelerate the transition to post-quantum cryptographic standards, while also calling for policy frameworks to address the fate of dormant, quantum-vulnerable holdings — an issue the paper terms “digital salvage” — without creating new avenues for adversarial seizure.

速報

速報を見逃さない

Advertisement

House — Advertise on NewsLayer
NewsLayerAd

Sourced by

Originally reported by MM News

NewsLayer coverage based on externally reported material.

The Daily Brief

The onchain economy, before your day starts.

Curated markets, onchain insights, and key headlines — delivered every weekday morning.

Weekdays · Free · ~5 minute read

関連記事