Can small models match frontier reasoning without massive scale?

The reigning assumption is that frontier reasoning lives in tens-to-hundreds of billions of parameters: cross the scaling threshold or stay locked out of hard math and code. VibeThinker-3B is a direct counterexample. A dense 3B model, trained with the Spectrum-to-Signal post-training paradigm — curriculum-based SFT, multi-domain RL, then offline self-distillation — reaches 94.3 on AIME26 (97.1 with claim-level test-time scaling), 80.2 Pass@1 on LiveCodeBench v6, and 96.1% acceptance on unseen LeetCode contests, claiming parity with systems orders of magnitude larger. On verifiable tasks, the capability appears to be elicited by the pipeline rather than minted by raw scale.

What makes this credible rather than a benchmark stunt is the shape of the pipeline, which echoes results the vault already holds. Since Does sequencing imitation then exploration training improve reasoning?, the sequencing — imitation to lay a reasoning foundation, then RL to push against verifiers — is exactly VibeThinker's curriculum-SFT-then-multi-domain-RL structure, now shown to hold at 3B. And since When does RL actually extend reasoning beyond pretraining?, the curriculum is plausibly what keeps a small model perpetually at its edge of competence, where RL actually pays.

The load-bearing qualifier is verifiable. Every headline benchmark here has a checkable ground truth (a numeric answer, a passing test suite), which is precisely the regime where RLVR has a clean reward and small models can be driven hard. This is the boundary worth writing about: the result does not claim a 3B model matches flagships on open-ended judgment, long-context synthesis, or tasks without a verifier. The honest reading is that the cost of verifiable reasoning is collapsing toward the cost of a good pipeline — while the unverifiable frontier may still want scale.

The strongest counterargument is contamination and selection: heavy distillation and curriculum tuning on benchmark-adjacent data can inflate scores without transfer. The unseen-LeetCode generalization number is the rebuttal, but it is one signal, not proof of robustness off-distribution.