"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.
AI is usually framed as "how smart is the model / how many GPUs did you buy." The real bottleneck is elsewhere โ how efficiently you use the GPUs you already have.
Training happens once; inference runs the entire time users use your product. So a service's economics come down to cost per token. Inference acceleration uses software to pull several times more out of the same GPU โ the effect of plugging in one more "virtual GPU."
VIDRAFT's VKAE, measured (B200, same-harness, no quality loss):
Qwen3.5-35B-A3B (MoE): 25.7 โ 601 tok/s (23.4ร) Darwin-36B-Opus (in-house MoE): 25.0 โ 280.8 (11.2ร) 10,000+ tok/s peak aggregate under concurrency The key: it's reproducible โ model + serving shipped as one container.
docker pull vidraft/qwen35-vkae:601 Don't take our word for it โ run it yourself. The mechanism will be released as a paper.
๐ง Does your LLM know when it's about to be wrong?
Most leaderboards measure accuracy. We measure metacognition โ whether a model catches its own errors. Benchmark + leaderboard + adapters, all open. ๐
The surprise: even a K-AI #1 model (JGOS-31B-Citizen) is the strongest on multiple-choice traps (trap_rate 0.005 โ ~2 misses in 400) yet blind to its own free-form mistakes (self-confidence AUROC = 0.5, pure random). A tiny base-frozen adapter recovers that signal.
Two independent axes (never compared across a row): โ trap_rate โ does it fall for tempting trap options? (lower = stronger) โก adapter gain ฮ โ how much a lightweight adapter catches errors the model itself misses. (higher = more adapter value)
What's open: ๐ 300+100 trap problems (each with a hidden trap + TICOS type) ๐ 24-model leaderboard ๐งฉ 11 per-model adapters โ adapters, NOT fine-tunes (base stays frozen; the adapter just reads the hidden state โ P(wrong))
Submit any HF model โ auto-scored daily at 09:00 KST and added to the board.