The Same Weights Scored 291, Then 468 — What Changed Was the Loop

The Same Weights Scored 291, Then 468 — What Changed Was the Loop Source: Post-Training Language Models for Gold-Medal Performance in Coding Competitions Paper was published on September 02, 2026 This episode was AI-generated on September 3, 2026. The script was written by an AI language model and the host voices were synthesized by Eleven Labs. The producer is not affiliated with Anthropic or Eleven Labs. NVIDIA ran the experiment nobody publishes: they built the training data, the distillation, the reinforcement learning, and the test-time scaffolding — then measured each one separately on the same olympiad exam. Reinforcement learning with verifiable rewards, the stage the whole field is excited about, bought eleven points out of six hundred. The loop wrapped around the model bought a hundred and seventy-seven, and the move that paid for most of it is deliberately throwing away your ten best answers. Key Takeaways The full ablation ladder on one fixed exam: base model 130, distillation to 280, reinforcement learning to 291, test-time loop to 468 — distillation bought 150 points, RL bought 11, the loop bought 177 Why GRPO stalls on hard problems: when all sixteen sampled attempts fail, every attempt equals the batch average and the gradient is zero — RL sharpens the frontier but doesn't move it Why the selector submits the ten *least similar* candidates instead of the top ten, and why round one is reconnaissance rather than an attempt to win The Mastermind-versus-padlock result: with subtask scorecards the loop improves through all five rounds; on ICPC's single pass/fail bit, both models plateau after two or three The live IOI run scored 535.4 against a top human's 498.27 — but reruns ranged 495 to 546, so the bottom of the distribution loses to the human Why the bigger 550B model finishes round one *behind* the small one (343.9 vs 360.6) and ends 34 points ahead — and what that means for single-sample benchmarks 00:00 — Eleven points from the exciting part Setting up the central surprise: reinforcement learning with verifiable rewards, the technique everyone bets on for competitive programming, moved the score eleven points out of six hundred. 02:15 — The four-rung ladder, measured one at a time Walking the ablation from a 130-point base model through 1.2 million distilled chains of thought to 280, then RL to 291, then the test-time loop to 468. 04:30 — Why does reinforcement learning stall here? The two diagnosed failure modes: a batch of sixteen uniformly-failing attempts produces zero gradient, and a quarter-million-token trace graded with one number gives nowhere to assign credit. 06:46 — Two hundred candidates, ten slots, one rule Inside GenCorrect: the candidate pool, the selector, the official grader returning subtask scorecards, and the notebook that banks per-subtask maximums across five rounds of ten submissions. 09:01 — Why throw away your ten best answers? The counterintuitive selection rule — submit the ten most dissimilar candidates, not the ten best — explained through the oil-drilling analogy and why round one is reconnaissance. 11:17 — Contest strategy, pasted into a prompt What round two actually receives: the accumulated scorecard, three complementary reference solutions, and a near-verbatim instruction to pick the single subtask with the largest remaining gap. 13:32 — The bigger model starts behind and finishes ahead The 550B model trails the small one at round one (343.9 vs 360.6) but ends 34 points ahead at 502 vs 468 — and why single-sample benchmarks rank models on the wrong axis. 14:52 — Mastermind versus a padlock On IOI's tiered scorecards the loop improves for five rounds; on ICPC's binary pass/fail it plateaus after two or three — the transferable lesson for anyone building agent environments. 18:03 — Sitting the exam before the problems exist The live IOI run — shorter-trace teacher, a thousand candidates, four-bit quantization for 3.7x throughput, a self-built grader — producing 535.4 against a gold threshold of 361 and a top human of 498.27. 20:18 — One draw from a distribution that crosses the line The steelman critique: reruns averaged 522 with a range of 495 to 546, the student never beats the teacher, and every competition-specific decision was tuned on a six-problem development set. 22:34 — Where would you spend the quarter? The closing allocation question — 150 points from fine-tuning, 11 from RL, 177 from the loop — and what that implies for anyone budgeting a coding agent. Recommended Reading Competition-Level Code Generation with AlphaCode — The direct ancestor of the episode's GenCorrect loop — DeepMind generated millions of candidate programs and then used filtering and clustering to choose just ten submissions, the same 'diversity over top-ranked quality' bet the episode spends its middle act unpacking. Competitive Programming with Large Reasoning Models — OpenAI's IOI write-up argues the opposite of this episode's thesis — that scaled general RL eventually beats hand-built inference scaffolding — making it the best available counterpoint to the '11 points from RL, 177 from the loop' ladder. DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models — The paper that introduced GRPO, so you can see exactly why a batch where all sixteen samples fail yields a zero advantage and no gradient — the failure mode Eric diagnoses as the reason RL stalls at +11 points. Large Language Monkeys: Scaling Inference Compute with Repeated Sampling — Quantifies the gap between one-shot accuracy and best-of-200 coverage that explains why the 550B model loses at single-shot but pulls 34 points ahead once the loop runs — and why verifier quality, not model quality, becomes the bottleneck.