"Frontier models need a datacenter GPU" rests on a hidden assumption: that the model reads ALL its parameters every token. Decode is memory-bandwidth bound ā sweep 34B params/token and an 8 GB card dies at 1ā2 tok/s.
So we ran ONE 34.7B reasoning model ā Ourbox-35B-JGOS, a sparse Mixture-of-Experts ā as the identical weights across the whole hardware spectrum. All measured:
Why it works: Ourbox holds 34.7B params but only ~3B are active per token (256 experts, top-8). Since decode is bandwidth-bound, a dense 34B moves ~16.7 GB/token while Ourbox moves ~1.45 GB ā ~11Ć less traffic. Put the experts in system RAM, keep attention/router/shared on the GPU, and a 34.7B reasoner runs on an 8 GB laptop ā or no GPU at all.
Sparsity alone, proven (same laptop, same quant, ~same footprint): Ourbox-35B (A3B) 20.01 tok/s vs Qwen2.5-32B (dense) 5.36 ā 3.7Ć from sparsity alone, ~2Ć the best dense-32B on any 8 GB machine. Not a toy: GPQA Diamond 86.4% (maj@8).
Try it live (same prompt, GPU vs GPU-less CPU, live tok/s). Honest scope: one machine's measurements; the CPU path proves it RUNS without a GPU, not that it beats one.
š We ran genuine quantum key-recovery on 'real IBM quantum hardware' ā and pushed the frontier well past the largest hardware demos we're aware of (which sat at N=4).
Using Simon's algorithm on ibm_kingston, we recovered the secret key of two symmetric-cipher structures: ⢠EvenāMansour ā N=5 ā N=10 ⢠3-round Feistel (DES-family) ā block 6 ā 8
Each verified against an 'independent control key', using error mitigation only (no QEC).
š§ Honest scope: this is not a quantum speedup (the effective difficulty tracks the classical birthday bound ~2^{n/2}), not a break of real AES/RSA, and not 16-round DES (ours is 3-round). The recovery method is reserved for a forthcoming paper; formal record status is pending peer review.