Key points
- Headline result: VibeThinker-3B (3B parameters) achieves 94.3 on AIME26 (97.1 with CLR) and 96.1% on LeetCode weekly contests, matching DeepSeek V3.2 (671B), Kimi K2.5 (~1T), and GPT-5.2.
- Core hypothesis — capability decoupling: Model abilities fall into two categories:
- *Parameter-dense*: world knowledge, multilingual fluency, creative writing — hard to compress.
- *Parameter-extensible*: verifiable reasoning (math, code, logic) — compressible, because each step is independently checkable.
- Four-stage training pipeline (extending the 1.5B predecessor): 1. *Two-stage curriculum SFT*: broad coverage (math, code, logic puzzles, science) → hard long-chain reasoning (>50 steps) with multi-path distillation and multi-level quality filtering. 2. *Multi-domain RL (MGPO)*: policy optimization across verifiable domains; adds Long2Short Math RL to cut redundant tokens without losing accuracy. 3. *Multi-stage consolidation*: offline self-distillation merges SFT base patterns, RL-discovered strategies, and cross-domain (math/code) logic into one model. 4. *Instruction RL*: improves controllability under complex constraints (e.g., "implement in Python with O(n) time").
- Test-time scaling — Claim-Level Reliability (CLR): the model self-assesses the reliability of each intermediate step; low-confidence steps trigger re-reasoning. Boosts AIME26 from 94.3 → 97.1 and BruMO25 to 99.2.
- Industry implications: 1. Reasoning and knowledge can be decoupled and optimized independently. 2. Small models are no longer just a deployment compromise — they are a complementary research track for verifiable tasks. 3. Democratization: contest-grade math solvers and code assistants may run locally on consumer laptops, with privacy benefits.
- Open questions / limits:
- No reported numbers on open-domain chat, creative writing, or multilingual tasks (parameter-dense abilities).
- 3B-parameter knowledge store is bounded; external retrieval will likely be required.
- CLR adds inference-time compute cost.
- Whether "verifiable reasoning is compressible" generalizes to formal proof and hardware verification is untested.
- Paper: https://arxiv.org/abs/2606.16140
One-line takeaway
> A 3B model equalling 671B-class reasoning shows that verifiable reasoning is a compressible capability subset. The win belongs to capability decoupling: small models own reasoning, large models own knowledge, and future systems will likely be small reasoners + large knowledge bases.