
Written by a model from the transcript; not yet reviewed.
In this episode, the guest discusses the massive shift toward large-scale test-time compute in AI, explaining why traditional single-number benchmark grids and rigid safety frameworks are broken. Because modern models can reason across vast token budgets over weeks, performance no longer plateaus early, meaning capabilities scale directly with the money and time invested. The guest and host explore how this changes everything from model evaluation and poker solver creation to mathematical research like disproving the Erdos unit distance conjecture, while also addressing the reality of bottlenecks, research taste, and the path to advanced multi-agent systems.
Hosts Sarah and Elad introduce the episode and welcome guest Noam Brown.
Noam explains why he wrote an essay on evaluating models with large test-time compute budgets.
Proposes evaluating models by setting a token, cost, or time budget and plotting performance versus compute.
Examines how test-time compute affects safety evaluations and the need to account for budget in responsible scaling policies.
Explores the difficulty of running models for weeks or months to reach performance plateaus and its impact on release cycles.
Noam shares examples of surprising achievements, like disproving the Erdős unit distance conjecture, using existing models.
Discussion of how large-scale compute may slow or accelerate recursive self-improvement and the prospects for a fast takeoff.
Speculates on less explored areas such as large-scale multi-agent coordination and knowledge sharing among models.
Concludes with a call to move beyond the current grid equilibrium, encouraging budget-aware, X-axis evaluations.
Flaws in Traditional Benchmark Gridsinsight
Standard benchmark grids fail to capture true model improvements because they do not control for the amount of test-time compute used on benchmark questions.
Extended Reasoning Horizonsdata
Unlike older models whose performance plateaued quickly, modern models scaffolded reasonably well can think for weeks before hitting a performance plateau.
Building Poker Solvers with AIstory
The guest details using GPT models to progressively build poker river solvers, noting how the model acts like a grad student by generating code and optimizing it significantly.
Inconvenient Truth in Safety Policiesdebate
Responsible scaling policies and preparedness frameworks were built during the ChatGPT era and fail to account for how test-time compute unlocks dangerous capabilities.
Disproving the Erdos Conjecturestory
An internal OpenAI model successfully disproved the Erdos unit distance conjecture at a low budget after being guided through promising problem-solving paths.
Factual Retrieval Limitationsinsight
Factual retrieval tasks do not benefit from extended inference budgets, as giving a model a week to answer a simple historical fact yields no improvement.
Time as a Takeoff Bottleneckinsight
An overnight intelligence explosion is unlikely because models require massive test-time compute, making time itself the primary bottleneck for unlocking super intelligence.
“The problem is, we're in a world now where the capability of the model is a function of how much money you put into it, basically.”
“If you run it at max settings, 5.4 is thinking for a lot longer. It takes longer to get back a response than 5.5.”
“The only way to be fully sure is to actually run it for a month. And if you want to know after six months, the only way to know fully is to run it for six months.”
“I think fast takeoff is relative. Things are moving very fast, but I think there is this hypothesis that you could have basically an overnight intelligence explosion where the models discover some kind of breakthrough to make themselves smarter, and then that leads to more breakthroughs that make themselves even smarter immediately.”
“I think the models are definitely accelerating what researchers can do inside the labs. But I think they are accelerating some things and not other things.”
When a new AI model drops, it’s judged based on a static benchmark grid that doesn’t account for how long the model is allowed to think. How then should we measure a model’s true capability? OpenAI research scientist Noam Brown returns to talk with Sarah Guo about his latest essay on why the AI industry’s traditional benchmark grids are broken, and how large-scale test-time compute is fundamentally changing how models are evaluated. Noam explains how, if properly scaffolded, today’s models can reason for weeks or even months on complex tasks. He also discusses real-world implications of test-time compute, from building poker solver bots to disproving legendary math conjectures. Together, they also unpack the large gaps in current AI safety frameworks, explore the bottlenecks for recursive self-improvement, and look ahead at the future of multi-agent collaboration and global knowledge sharing. Read more: Implications of Large-Scale Test-Time Compute Sign up for new podcasts every week. Email feedback to [email protected] Follow us on Twitter: @NoPriorsPod | @Saranormous | @EladGil | @polynoamial | @OpenAI Chapters: 00:00 – Cold Open 00:43 – Noam Brown Introduction 01:23 – Why Benchmarks Are Broken 04:19 – Compute Budgets and Projections 05:34 – How Long Should Models Think? 06:47 – Benchmark-Maxxing 08:34 – Using Poker Bots as Evals 11:26 – Safety Evals When Model Capability Scales With Budget 14:41 – Release Cycle vs. Agent Runtime 17:06 – Latent Model Capability 20:59 – Limits on Recursive Self-Improvement 27:09 – Large-Scale Multi-Agent Coordination 29:11 – Competition at the Frontier 31:51 – Breaking the Benchmark Grid Equilibrium 33:29 – Why Benchmarks Should be Evaluated by Cost 36:18 – Conclusion
7,500 words · 2 speakers
Speaker names marked are inferred from speaking time and the show’s known hosts — they are not voice-verified.
Page updated · transcript and summary are machine-generated