What Shor changes

Shor described quantum algorithms for integer factorization and discrete logarithms with running time polynomial in the problem size. Those are mathematical problems underlying important public-key systems. The discrete-logarithm problem also appears in elliptic-curve systems used for many cryptocurrency signatures. A suitable attack could derive a signing secret from a public key rather than guess a password.

That result concerns an algorithm on an adequate quantum computer. Breaking a deployed cryptographic key requires enough reliable computation to finish the full attack. A demonstration on tiny numbers or a vendor announcement about raw qubits does not establish that capability for a blockchain key.

Sources:Peter Shor: factoring and discrete logarithmsNIST: What is post-quantum cryptography?

Why reliable computation matters

A scalable, fault-tolerant quantum computer must preserve useful logical computation despite physical errors. Resource estimates therefore distinguish logical operations from the physical hardware and error correction used to realize them. An estimate also depends on the chosen attack circuit, gate assumptions and allowed completion time.

When reading a resource claim, retain these assumptions instead of extracting a single qubit number. A statement that one circuit is cheaper than an earlier circuit is not an observation that an adversary has built the machine. CoinTalk does not turn such estimates into a date when a particular network will be attacked.

Sources:NIST: What is post-quantum cryptography?

What Grover speeds up

Grover provides a quadratic query speedup for a suitable unstructured search: an ideal search space of N possibilities can be searched using roughly the square root of N oracle calls. The oracle must still be implemented, and the complete computation has costs beyond the query count.

For idealized exhaustive key search, this motivates comparing a classical search of roughly 2^n trials with roughly 2^(n/2) quantum queries. It does not mean a real device simply cuts every security level in half at no cost. Circuit depth, parallelism, hardware cost and error correction materially affect an attack.

Sources:Lov Grover: A fast quantum mechanical algorithm for database searchNIST PQC frequently asked questions

Do not merge every hash problem

Finding an input for a specified digest is a preimage problem. Finding any two inputs with the same digest is a collision problem. Mining seeks an input whose digest satisfies a target condition. These tasks have different success conditions and can involve different attack models.

A generic quantum search advantage therefore does not, by itself, demonstrate practical hash-function failure, profitable quantum mining or the ability to rewrite a chain. A credible claim must describe the exact task and compare complete costs and timing with the relevant classical alternative. Network rules and competing participants remain part of a mining analysis.

Sources:Lov Grover: A fast quantum mechanical algorithm for database searchNIST PQC frequently asked questions

Map the result to a protocol

For a signature system based on discrete logarithms, the central quantum concern is the underlying public-key problem. For a hash-based signature, examine the hash assumptions, parameters and state management instead. Calling both systems cryptography does not make their attack paths interchangeable.

This distinction is useful when reviewing migration proposals. Ask what is being replaced, which attack the replacement addresses and what remains unchanged elsewhere in the protocol. Security planning can proceed through inventories, implementation work and testing without pretending to know when cryptographically relevant quantum hardware will arrive.

Sources:NIST SP 800-208: Stateful hash-based signaturesNIST IR 8547: Transition to PQC standards