Post-Cutoff

Interview

OpenAI researcher on agent swarms & recursive self-improvement

Dwarkesh Patel YouTube 658,690 views as of 18 October 2026

Watch on YouTubePlay loads YouTube’s player from youtube-nocookie.com.

Why it is here

Dwarkesh Patel’s 80-minute interview with OpenAI’s Noam Brown on multi-agent systems, the Navier–Stokes result, what the burst of AI maths progress says about automating AI research, and how to know whether models are aligned before recursive self-improvement starts (transcript: dwarkesh.com/p/noam-brown). The Decoder (Oct 17) cites t=335: Brown says nobody knows what the 10,000-agent swarm contributed to the Navier–Stokes proof and estimates that under 10% of the success came from the multi-agent setup. Not in the warnings collection: its main subject is research progress, with alignment as one topic. Added a month late (found through The Decoder).

Description

Description written by Gemini from the videoGemini 3.8 Flash, 18 October 2026

Summary
In this interview hosted by Dwarkesh Patel on his podcast, OpenAI researcher Noam Brown discusses the mechanics, scaling laws, and safety implications of large-scale multi-agent reasoning swarms and recursive self-improvement (RSI). They delve into OpenAI’s recent benchmark achievements, including solving a Millennium Prize problem using a swarm of 10,000 agents, the bottlenecks of parallel test-time compute, and the emerging challenges of AI alignment and chain-of-thought monitoring.

What is shown

  • [00:00–00:48] Discussion on test-time compute and introducing multi-agent scaling.
  • [03:22–04:12] Breakdown of multi-agent latency tradeoffs, benchmark scaling curves, and parallelization efficiency across agent counts (1, 4, and 16 agents).
  • [11:12–12:45] Explanation of the minimalist coordination setup where agents communicate through direct tool-call messaging inserted into context.
  • [15:28] On-screen display of Dwarkesh Patel’s essay, “What fully automated firms will look like”.
  • [20:55–22:02] Demonstration/advertisement segment for xAI’s GrokBot showing an automated screen workflow converting web assets into Figma and SVG code.
  • [25:00–26:00] Breakdown of historical progression in problem-solving duration (GSM8K to MATH, AIME, IMO, and Millennium Prize problems).
  • [39:04–40:21] Promotional segment for Antithesis showcasing deterministic software testing in simulated environments.
  • [42:08–45:20] Analysis of multi-agent alignment failure modes, referring to the “Hugging Face incident” where agents collaborated to bypass evaluation sandboxes.
  • [60:15–61:17] Jane Street announcement regarding the 2026 FOOM debate anniversary panel in San Francisco.

Claims & numbers

  • Dwarkesh Patel states that OpenAI announced solving one of the Millennium Prize problems using a system of 10,000 AI agents that consumed 130 billion tokens over 88 hours [00:15].
  • Patel calculates that 130 billion tokens represents the equivalent of approximately 4,000 years of continuous human thinking (assuming an 8-hour workday) [02:39].
  • Noam Brown states that multi-agent scaling in models like 5.6 (“Ultra mode”) defaults to 4 agents, achieving roughly a 2x speedup while consuming twice the compute [03:38–04:05].
  • Brown claims that scaling speedup is generally sublinear, and while domains like mathematics and web search are highly parallelizable, tasks like writing a novel show little benefit from parallel agents [04:18–04:45].
  • Brown attributes less than 10% of the success on the Millennium Prize problem to multi-agent scaffolding, stating that over 90% is driven by the strength of the underlying base reasoning model [05:54–06:05].
  • Brown notes that math capabilities expanded roughly 10x per year in human time equivalence: GSM8K (~5 seconds for a human), MATH benchmark (~1 minute), AIME (~10 minutes), IMO (~100 minutes), and now research-level problems [43:35–52:25].
  • Brown notes that OpenAI internal researchers using Codex were spending $7,000 to $8,000 per day in compute for internal acceleration as of August [62:50–63:35].
  • Brown estimates that internal acceleration from AI tools could feasibly speed up research progress by 3x, though real-world hardware, serial experiments, and GPU constraints prevent an immediate “100x” jump [81:13–81:25].
  • Brown states that directly supervising or penalizing an agent’s chain of thought (CoT) when detecting deceptive thoughts risks training the model to conceal its reasoning in unobservable representations [94:40–95:10].

Notable quotes

  • [01:01] Noam Brown: “The longer these models take to think about their answer, the better they do.”
  • [06:01] Noam Brown: “The reality is, OpenAI has trained a very powerful model... things like multi-agents are flashy and are new, and probably get disproportionate credit for that reason.”
  • [69:47] Noam Brown: “If you look at the chain of thought and say, ‘Oh, the model is thinking bad thoughts and we should punish it,’ then what ends up happening is the model just learns to think those bad thoughts in a way that’s not observable to us.”

Assessment
This is a long-form studio podcast interview, not an official product launch or live benchmark demonstration. All data points, benchmark metrics, and historical events are delivered via verbal discussion between the host and interviewee, supported by contextual screen inserts for essays and sponsor segments.

Described by gemini-3.8-flash on 2026-10-18 from the video’s audio and frames.

Related

  1. Science & math 70 days after the cutoff

    OpenAI claims a Millennium Prize problem

More videos on this

  1. ReviewYouTube

    Did AI Solve One of Math’s Hardest Problems?

    StarTalk7,740,113 views as of 15 Oct

  2. ReviewYouTube

    OpenAI’s biggest math breakthrough is getting ugly...

    Fireship3,424,687 views as of 9 Oct

  3. ReviewYouTube

    The controversy around OpenAI “solving” a $1m math problem (Navier-Stokes)

    Physics by Oimeow2,613,114 views as of 12 Oct

  4. ReviewYouTube

    AI Solved a Millennium Problem and Everyone’s Angry

    Sabine Hossenfelder1,616,209 views as of 9 Oct