TL;DR
- A new preprint (arXiv:2610.33139, Oct 23, 2026) built a complete Grover search oracle for recovering Minecraft 1.13.1 world seeds — and counted what the oracle itself costs: 48,896 two-qubit gates per single run of the test, even after aggressive optimization.
- Specializing the arithmetic for known constants cut that cost roughly 42× versus the authors' original circuit (2,038,804 gates, depth 186,328) — and changed the scaling law itself, from Θ(n³) to O(n²).
- But the hardware demonstrations ran a toy version: a complete Grover loop with one marked state among eight candidates, on IBM processors and a Quantinuum H2-1. No end-to-end advantage over classical search was shown.
- The lesson travels: every quantum speedup headline quotes the square root. Nobody quotes the oracle. At Bitcoin's widths, the oracle is the bill.
What did the researchers actually build?
Grover's algorithm is usually sold as a shortcut: search a haystack of N candidates in about √N steps. What the shortcut hides is the oracle — a reversible quantum circuit that tests one candidate and marks it if it passes. The algorithm doesn't find the needle. It runs the test, over and over, at quantum speed. If the test is expensive, the search is expensive, no matter what the square root says.
Reeves, Sopkin, and Searles (arXiv:2610.33139) built that test for a concrete job: recovering the seed of a Minecraft 1.13.1 world — the number the game used to generate its terrain — from observed structure placement, by inverting the game's linear congruential generator over a 32-bit residual search space. Then they did the thing most quantum papers skip: they published the full price of the test, gate by gate.
What does the test cost?
The optimized oracle — arithmetic specialized for the constants the searcher already knows — uses 275 circuit qubits, 48,896 CX gates, and a circuit depth of 4,482. The authors' original general-purpose construction used 467 qubits, 2,038,804 CX gates, and depth 186,328. Specialization cut the gate count and depth by a factor of about 42, and improved the asymptotic scaling of the two-qubit gate count from Θ(n³) to O(n²). That is real engineering, and it is the paper's genuine result: knowing your constants before you build the test makes the test dramatically cheaper.
It does not make it cheap. 48,896 gates is the cost of asking the question once.
What is the number nobody multiplies?
Grover's algorithm for a 32-bit search space needs on the order of √2³² ≈ 50,000 iterations — and every iteration runs the full oracle. Multiply the paper's own figures (this is our arithmetic on their numbers, not a figure from the paper): 48,896 gates × ~50,000 iterations ≈ 2.4 billion two-qubit gates for one complete search, at a total circuit depth in the hundreds of millions. That is the real invoice behind the phrase "quantum search," and it is why the paper's hardware section looks the way it does.
What did they actually run on hardware?
A reduced-width version. On IBM quantum processors and Quantinuum's H2-1, the team executed complete Grover loops with one marked state among eight candidates — a three-qubit-wide search — and showed the specialized construction amplifying the marked state more strongly per iteration than the baseline. The results were sensitive to compilation, routing, and execution context, and the authors are plain about the boundary: the preprint does not demonstrate practical recovery of arbitrary Minecraft worlds or an end-to-end advantage over the best classical search. Exact enumeration also found a plateau — beyond a point, feeding the oracle more placement constraints stops shrinking the candidate set.
Why does a Minecraft paper matter for Bitcoin?
Because Grover's algorithm is the quantum tool pointed at hash functions — the math under Bitcoin mining and address derivation — and the sales pitch for that threat is always the square root: "Grover searches 2²⁵⁶ in only 2¹²⁸ steps." The Minecraft paper prices the missing half of that sentence. Each of those steps is an oracle run, and an oracle for a real cryptographic test at production width is a circuit that must be built, repeated, and executed — at a cost that can dominate the entire computation. The square root is real. So is the invoice stapled to it. Any honest accounting of a quantum threat to hash-based systems has to carry both numbers, the way this paper does.
What should you ask the next quantum headline?
Two questions, both drawn from this paper's example. First: what does the test cost? If a claim quotes query counts without an oracle construction — gate counts, depth, qubit width at production size — it has quoted the discount and hidden the price. Second: what did they actually run? A reduced-width loop over eight candidates is legitimate science and honest engineering evidence. It is not a production system, and a headline that blurs the two is selling you the audit as the achievement. The White Report's rule stands: we grade the claim that was actually demonstrated, at the width it was actually demonstrated at.
FAQ
What is a Grover oracle? The reversible circuit inside Grover's search algorithm that tests one candidate and marks it if it matches. Grover's speedup counts how many times the oracle must run; the oracle's own gate cost is separate — and, as this paper shows, often dominant.
Did a quantum computer crack Minecraft? No. The team ran reduced-width Grover loops (one marked state among eight candidates) on IBM and Quantinuum hardware and resource-estimated the full-width circuits. No arbitrary world seed was recovered, and no advantage over classical search was demonstrated.
Does this mean quantum computers are no threat to Bitcoin? No — it means the threat has to be costed honestly. Grover's algorithm applies to hash search with a quadratic speedup, but every iteration pays the oracle's full gate cost. The separate and more serious long-term threat to Bitcoin signatures is Shor's algorithm, covered in our companion piece, "The Honest Q-Day Timeline."
What is "specializing for known constants"? Rebuilding the oracle's arithmetic around values the searcher already knows, instead of a general-purpose circuit that handles any input. In this paper it cut the gate count ~42× and improved the scaling law — the single biggest cost lever the authors found.
Is this financial advice? No. This article explains a research result and the accounting method behind it. It is not financial advice, and nothing here is a recommendation to buy, sell, or hold anything.
Sources
QubitWire, "Minecraft reveals the hidden cost of quantum search" (Oct 27, 2026); Reeves, Sopkin & Searles, "The Cost of a Real Grover Oracle: Minecraft Seed Search from Software to Quantum Hardware," arXiv:2610.33139 (Oct 23, 2026).
The White Report publishes news and analysis about crypto and SI markets. Nothing on this site is financial advice, and nothing here is a recommendation to buy or sell any asset. Do your own research before making investment decisions.
Where Super Intelligence Meets Money