q—gpu / simulate qubits · mine $QGPU · robinhood chain

How many qubits
does your GPU hold?

Your graphics card can simulate a quantum computer. qGPU runs one in your browser, shows you what it does to crypto, then turns the same hashing engine into a miner: your GPU earns $QGPU on Robinhood Chain.

  1. 01simulateYour GPU holds real qubits and runs Shor's and Grover's algorithms, live.
  2. 02see q-dayShor breaks wallet keys outright. Grover only takes a square root off hash puzzles.
  3. 03mineGrover's keccak oracle becomes a miner. Every hit pays $QGPU and burns a tenth.

looking for a gpu…

live · 10 qubits0 gates

01 / benchmark

Every qubit doubles the memory.
We keep adding them until your GPU says no.

idlefig. 1 — the die

?qubits

statevector
—
throughput
—
vs your cpu
—
device
—
> waiting. the bench allocates the largest statevector your gpu accepts, then runs random circuits on it.
post on x

02 / shor

Break a key.
A small one.

Every wallet on every chain has a q-day because of one algorithm. Shor turns factoring and discrete logs into finding a period, and a quantum Fourier transform finds periods. Pick a number. Your GPU runs the circuit.

counting register · probability

superposition → modular exponentiation oracle → inverse QFT → measure → continued fractions.

Same algorithm, bigger register: about 2,330 error-corrected qubits recover a 256-bit elliptic-curve private key from its public key (Roetteler et al., 2017). Your GPU just ran it on a few dozen.

03 / grover

Now try a hash.

Grover's algorithm searches N possibilities in about √N steps. Strong, but only a square root. Watch it find a keccak-256 preimage on your GPU, then do the math on the full hash.

amplitudes around the answer0 / 0
p(answer) after each oracle call0.000

oracle flips the answer's sign, diffusion reflects everything about the mean. repeat √N times.

2256

possible inputs to keccak-256

2128

oracle calls Grover would still need

1979

Lamport signs with nothing but hashes. Winternitz and NIST's SLH-DSA follow. Shor breaks curves; Grover only dents hashes.

04 / mine

Point the oracle
at the chain.

Mining here is the same search Grover's algorithm does: find an input whose keccak-256 lands under a target. Your GPU tries billions of nonces, bound to your address. The QubitMiner contract checks a hit with a single hash and pays you $QGPU out of the reactor. A tenth of every payout burns.

0MH/s

> idle. hits are verified here with keccak-256 before anything is sent.

the quantum part

Same search, two machines.

01 · one problem

In 03, your GPU ran Grover's oracle: keccak-256 evaluated on every branch of a superposition, hunting for one input. Mining is that exact problem, with a prize attached.

find nonce:
keccak256(challenge, nonce) < target

02 · the square root

03 · why it survives q-day

Shor recovers the private key behind any public key, so on q-day a wallet signature stops proving anything. Grover only speeds up hashing, and the retarget treats a quantum miner like a bigger GPU: difficulty rises and the reactor keeps paying one hit a minute.

Keys break. Hashes bend.

05 / the wall

Past fifty qubits,
only hardware counts.

Simulating n qubits takes 2n amplitudes. Your GPU hits the wall in the high twenties; the largest supercomputers hit it near fifty. A quantum chip doesn't simulate the state, it is the state. That race sets the date of q-day.

qubitslog scaleto simulate classically

    Hardware counts are noisy physical qubits. The secp256k1 figure counts error-corrected logical qubits; Gidney's RSA-2048 estimate counts noisy ones. The gap between the two is error correction, the thing Willow started to close.

    06 / board

    Leave a mark
    on Robinhood Chain.