James Bull
CO-FOUNDER & CEO
ENERGY INFRASTRUCTURE. A DECADE BUILDING AND SCALING ENERGY BUSINESSES
Dots = Quantum × Bitcoin Mining
Mining is a search problem. We search differently. Dots builds Mining-Capable Quantum Circuits, purpose-built quantum hardware that mines Bitcoin with Grover's algorithm on today's devices. No error correction required.
Bitcoin mining burns more electricity than Norway.
Mining is a ~$17 billion-per-year industry consuming over 150 TWh of electricity annually, more than the entire annual consumption of Norway. The network runs on brute force: around a billion trillion SHA-256 guesses every second, almost all of them wasted.
A decade of optimisation has taken classical hardware close to its physical limits. ASIC gains are flattening, energy costs keep rising, and difficulty keeps climbing. The classical answer is finished improving.
Source: CBECI, University of Cambridge. National figures indicative.
A classical miner checks hashes one at a time. Grover's algorithm, proven optimal for unstructured search, finds a needle among N possibilities in roughly √N quantum steps, by amplifying the amplitude of the right answer until it dominates.
N of ten to the twenty-three implies square root of N of about three times ten to the eleven
Eleven orders of magnitude fewer steps per block
A quadratic speedup, mathematically guaranteed, and mining is the textbook case: a vast search space with trivially checkable answers. How Grover's algorithm works →
Mining-Capable Quantum Circuits (MCQCs)
The standard objection: Grover's algorithm needs a fault-tolerant quantum computer, and those are years away. Our founders' peer-reviewed research found the loophole: mining already tolerates failure. The protocol is built around overwhelmingly probable misses, so noisy NISQ-era hardware clears the bar.
An MCQC isn't a general-purpose computer. It's a quantum circuit engineered for exactly one job: winning more blocks per joule than the machine next to it.
Peer-reviewed. University of Kent. 100+ citations →Mining's low success probability means errors cost a miss, not a meltdown. Failure is already priced in.
NISQ devices are sufficient. No wait for fault tolerance, no dependence on a research breakthrough.
The thesis is peer-reviewed and citable, not a pitch-deck extrapolation. Read the papers →
Classical mining cost scales linearly with difficulty. Quantum cost scales with the square root. Every difficulty epoch widens the gap. The advantage is structural, and it compounds.
The team that wrote the papers, now building the machines.
CO-FOUNDER & CEO
ENERGY INFRASTRUCTURE. A DECADE BUILDING AND SCALING ENERGY BUSINESSES
CO-FOUNDER & CTO
PHD, UNIVERSITY OF KENT. AUTHOR OF THE FOUNDATIONAL QUANTUM-MINING PAPERS. 100+ CITATIONS
ADVISOR
ACADEMIC CO-AUTHOR. QUANTUM COMPUTING THEORY
ADVISOR
CTO, PROJECT ELEVEN
The founding research: Grover-based mining, amplitude amplification on proof-of-work, and NISQ-regime mining economics. View the papers →
Meet the teamQuantum Bitcoin mining uses a quantum computer instead of classical ASICs to search for valid block hashes. Because mining is an unstructured search problem, Grover's algorithm lets a quantum miner find solutions in roughly the square root of the steps a classical machine needs. The result is the same valid block, found with far less computation and energy.
Yes, and crucially, it doesn't need to be a fault-tolerant quantum computer. Our peer-reviewed research shows that because mining already tolerates very low success probabilities, today's noisy (NISQ) quantum hardware can mine without error correction. That removes the single biggest barrier between current quantum devices and useful work.
For most applications, yes. Errors destroy long computations. Mining is the exception: a failed attempt costs almost nothing, because classical miners already fail trillions of times per second by design. A noisy quantum miner that succeeds only occasionally still wins, which is why mining is arguably the first commercial workload suited to NISQ hardware.
Grover's algorithm gives a quadratic speedup: a search that takes a classical machine N steps takes a quantum miner about √N. As Bitcoin's difficulty rises, classical mining costs grow linearly while quantum costs grow as the square root, so the advantage compounds over time rather than eroding.
Quantum mining and "breaking Bitcoin" are different things. Mining attacks nothing. It performs the same proof-of-work as every other miner, just more efficiently. The often-discussed threat to Bitcoin's signature scheme (ECDSA) would require large, error-corrected machines that don't exist yet; quantum mining works on hardware available today.
Proof-of-work is brute force by design: the network performs on the order of a billion trillion hash attempts per second, consuming over 150 TWh a year, more electricity than Norway. Quantum search reduces the number of attempts needed at a given difficulty, which is why mining is one of the most valuable energy problems quantum computing can address.
Investors, partners, and collaborators: the search starts here.