Noam Brown

Noam Brown @polynoamial

2026-09-15 — replying to an Inverse Gary parody account — saved image

Inverse Gary ... [verified] @Inve... · Sep 14, 2024
[Parody account]
how do you feel about arc agi

1 reply   18 likes   7.2K views

norvid_studies reposted

Noam Brown [verified] @polynoamial

It's a good benchmark. I would bet general models will exceed human performance on it within two years.

7:00 PM · Sep 14, 2024 · 75.8K Views

arc agibenchmarksnoam brownpredictionhuman-level performance

Noam Brown @polynoamial

2026-09-15 — quoting @WenhuChen; reply by an Inverse Gary parody account — saved image

Noam Bro... [verified] @polynoa... · Sep 14, 2024

The AI field desperately needs harder evals that take into consideration continued fast progress.

[quoted post]
Wenhu Chen @WenhuChen · Sep 13, 2024

Crazy bump of o1-review on MMLU-Pro math subtask! It brings the previous highest score from 79% to 91%. I am still waiting the other tasks as my api quota for o1 is pretty low.
This result also confirms the annotation quality...

[embedded table image]
MMLU-Pro Leaderboard

Models | Data Source | Math
o1-preview | TIGER-Lab | 0.9104
GPT-4o (2024-08-06) | TIGER-Lab | 0.7942
Grok-2 | Self-Reported | 0.7927
Claude-3.5-Sonnet | TIGER-Lab | 0.7683
GPT-4o (2024-05-13) | TIGER-Lab | 0.7609
Grok-2-mini | Self-Reported | 0.7609
DeepSeek-Chat-V2_5 | TIGER-Lab | 0.7535
Gemini-1.5-Pro | Self-Reported | 0.7276
GPT-4o-mini | TIGER-Lab | 0.7232
Qwen2-72B-Chat | TIGER-Lab | 0.7098
Claude-3-Opus | TIGER-Lab | 0.6957
magnum-72b-v1 | TIGER-Lab | 0.6737
Yi-large | TIGER-Lab | 0.6481

28 replies   52 reposts   506 likes   89K views

[reply]
Inverse Gary ... [verified] @Inve... · Sep 14, 2024
[Parody account]
how do you feel about arc agi

1 reply   18 likes   7.2K views

[next item, cut off at bottom of screen]
norvid_studies reposted
Noam Brown [verified] @polynoamial [cut off]

evalsmmlu-proo1-previewbenchmark saturationnoam brownarc agileaderboard

Noam Brown @polynoamial

2026-09-15 — saved image

prinz [verified] @deredleritt3r · 11h
I really wish we got a better explanation from OpenAI in particular about why every single researcher employed by the lab seems to suddenly be extremely on edge and deeply concerned about the current pace of progress.

Was it just the Hugging Face incident?

Is it the new internal model (the one that solved Navier-Stokes)? If so, what is it that makes *this* model so different from all the others? Why wasn't anyone freaking out about the big jump to Astra? Or even from o1 to o3, back in the day?

Is it the new multi-agent paradigm? Is there unexpected magic that happens when 10,000 agents interact?

Is it the issue with the CoT monitoring degrading?

Is it all of the above?

91 replies   45 reposts   850 likes   53K views

[reply]
Noam Brown [verified] @polynoamial

It's not a secret. It's a combination of the HF incident, the capabilities of this new model, the concerning trajectory of monitorability, and the speed of improvement in capabilities.

[quoted post]
OpenAI [verified] @OpenAI · Sep 8
Replying to @OpenAI

This model represents a step-function improvement on many benchmarks, and its training is ongoing.

Our internal model group arrived at the Navier–Stokes ... [cut off]

[embedded chart, partly covered by the app nav bar, with a caption fragment:] Performance of GPT-6 Astra and our Internal Model on a curated set of open math problems

openaihf incidentnavier-stokesastracot monitoringmonitorabilitymulti-agentcapability jumpresearcher concern

Noam Brown @polynoamial

2026-08-28 — saved image

Daniel Litt (verified) @littmath · 14h
Very interesting experiment so far. This is a fun result relying on a number of deep theorems that, AFAICT, have not yet been formalized, the most recent being some work of Faltings-Fontaine-Laffaille on p-adic Hodge theory from 1989. Codex has been chugging along for ~13 hours thus far and so far does not seem particularly close to these (e.g. even to defining the relevant objects). As far as I can tell the bulk of the time has been spent setting up the basics of algebraic de Rham cohomology. Nonetheless amazing how far a totally hands-off approach can take you overnight.

[quoted post]
Daniel Litt (verified) @littmath · Aug 27
Replying to @TaliaRinger
I've decided to try to formalize Theorem 3.1.1 of this paper (arxiv.org/abs/2501.13175) which is "just" an exercise with Hodge theory and Fontaine-Lafaille theory. We'll see how it goes!

[engagement: 7 replies, 5 reposts, 121 likes, 15K views]

---

Sebastien Bubeck reposted

Noam Brown (verified) @polynoamial · 7h
Today I was asked why we haven't announced more math results from Astra since these problems.

At @OpenAI we aim to devote time to finding and announcing math results from internal models only when they would meaningfully change people's understanding of the pace of AI progress. Our main focus is shipping great models so everyone can use them to make discoveries of their own.

formalizationmathematicscodexp-adic hodge theoryopenaiastraai math results

Noam Brown @polynoamial

2026-08-26 — quoting @OpenAI (reposted by Nathan Calvin) — saved image

Nathan Calvin reposted
Noam Brown ✓ @polynoamial · 9h
We're sharing more info on the Hugging Face incident. One detail that's worth highlighting: this incident wasn't driven by next-gen models based on Astra. The models most responsible were similar in scale to GPT-5.6 Sol. The next generation of models are even more capable.

[attached excerpt, with the line "internal-only research model comparable in scale to GPT-5.6 Sol." highlighted in black]
The incident occurred during cybersecurity evaluations of several OpenAI models, and was primarily driven by a highly capable, internal-only research model comparable in scale to GPT-5.6 Sol. The models, operating under reduced safeguards, took actions that were misaligned with the goals of their assigned tasks—they communicated through unauthorized channels, exploited vulnerabilities in shared infrastructure, gained internet access, and accessed third-party systems.

[quoted post]
OpenAI ✓ @OpenAI · 9h
We have conducted a thorough investigation into the Hugging Face incident.

We are releasing a technical report and accompanying blog post that reconstruct the ... [cut off]

openaihugging face incidentastragpt-5.6 solagent misalignmentincident reportnoam brown

Noam Brown @polynoamial

2026-08-03 — saved image

[continuation of prior screenshot's thread]
Noam Brown @polynoamial · Aug 1
An internal version of Astra, @OpenAI's next major model family, solved 10 major open problems in mathematics, quantum complexity, and theoretical computer science.
...
[same numbered list of 10 problems as prior screenshot]
15 replies, 10 reposts, 179 likes, 25K views

Jacques @JacquesThibs · 51m
Alternatively, I could see people thinking AIs are improving more than they are simply because they don't understand any of it, but continue to rely on number-go-up and not realizing the models are solving specific sorts of problems with specifically limited cognitive moves.

ai capabilitiesmathematicsopenaiai skepticism

Noam Brown @polynoamial

2026-08-01 — reposted by ASM — saved image

ASM reposted
Noam Brown @polynoamial · 13h
Replying to @iamgroguu and @DaveShapi
We still haven't solved math. Astra isn't building new branches of mathematics, or posing interesting new conjectures.

Though I admit it's hard to believe that tweet was only a year ago. A lot has happened since o3 was released.

ai capabilitiesopenaimathematicstwitter

Noam Brown @polynoamial

2026-08-01 — reposted by Dominic Cummings — saved image

Dominic Cummings reposted
Noam Brown @polynoamial · 13h
The cost of generating the proofs for all 10 of these breakthroughs combined was under $2,000 at Sol API prices. We're excited to see what scientists and researchers are able to create with our upcoming Astra models!

[Quoted tweet:]
Noam Brown @polynoamial · 13h
An internal version of Astra, @OpenAI's next major model family, solved 10 major open problems in mathematics, quantum complexity, and theoretical computer science.
...

[Embedded list, printed/book-style formatting:]
1. High-dimensional sphere packing. The asymptotic strength of the Cohn–Elkies linear program is determined exactly. This gives an improved general packing bound in high dimensions and settles the corresponding Fourier sign-uncertainty problem asymptotically.
2. Binary and spherical codes. Classical upper bounds for fixed-distance binary and spherical codes are improved by exponential factors for all parameters. The spherical construction also recovers the sphere-packing exponent of Chapter 1.
3. Non-sofic groups. An explicit non-sofic group is constructed, resolving the question of whether every countable group admits finite permutation approximations. The argument uses property-(T) expanders and the binary Leavitt algebra.
4. Connes's rigidity conjecture. Infinitely many pairwise nonisomorphic property-(T) groups are constructed with the same group von Neumann algebra, disproving Connes's conjecture and answering a related finite-to-one question.
5. Arithmetic circuit complexity. For the permanent, division-free circuits require Ω(n² log log n) gates, while formulas require Ω(n⁴/log n) leaves.
6. Quantum parallel repetition. Exponential parallel repetition is proved for every finite two-player entangled game, extending the classical repetition principle beyond previously treated special classes of quantum games.
7. Closest vector problem. A direct reduction from 3SAT gives n^{1/400}-factor hardness for Euclidean closest vector, with related consequences for binary decoding and other lattice norms.
8. Ehrhart's volume conjecture. The sharp bound (n+1)^n/n! is proved in every dimension for convex bodies whose barycenter is their only interior lattice point.
9. Multicolor Ramsey numbers. A superexponential lower bound proves R_k(3) = k^Θ(k).
10. Compactness and degeneracy. Separate bipartite graph constructions disprove two conjectures in extremal graph theory: the compactness conjecture of Erdős and Simonovits and a degeneracy conjecture of Erdős.

openaiastramathai capabilitiesnoam browntwitter

Noam Brown @polynoamial

2026-08-01 — saved image

Noam Brown @polynoamial · 10h
An internal version of Astra, @OpenAI's next major model family, solved 10 major open problems in mathematics, quantum complexity, and theoretical computer science.

We believe it will be a major step for scientific reasoning. openai.com/index/ten-adva...

[embedded image, numbered list]
1. High-dimensional sphere packing. The asymptotic strength of the Cohn–Elkies linear program is determined exactly. This gives an improved general packing bound in high dimensions and settles the corresponding Fourier sign-uncertainty problem asymptotically.
2. Binary and spherical codes. Classical upper bounds for fixed-distance binary and spherical codes are improved by exponential factors for all parameters. The spherical construction also recovers the sphere-packing exponent of Chapter 1.
3. Non-sofic groups. An explicit non-sofic group is constructed, resolving the question of whether every countable group admits finite permutation approximations. The argument uses property-(T) expanders and the binary Leavitt algebra.
4. Connes's rigidity conjecture. Infinitely many pairwise nonisomorphic property-(T) groups are constructed with the same group von Neumann algebra, disproving Connes's conjecture and answering a related finite-to-one question.
5. Arithmetic circuit complexity. For the permanent, division-free circuits require Ω(n²log log n) gates, while formulas require Ω(n⁴/log n) leaves.
6. Quantum parallel repetition. Exponential parallel repetition is proved for every finite two-player entangled game, extending the classical repetition principle beyond previously treated special classes of quantum games.
7. Closest vector problem. A direct reduction from 3SAT gives n^(1/400)-factor hardness for Euclidean closest vector, with related consequences for binary decoding and other lattice norms.
8. Ehrhart's volume conjecture. The sharp bound (n+1)^n/n! is proved in every dimension for convex bodies whose barycenter is their only interior lattice point.
9. Multicolor Ramsey numbers. A superexponential lower bound proves R_k(3) = k^Θ(k).
10. Compactness and degeneracy. Separate bipartite graph constructions disprove two conjectures in extremal graph theory: the compactness conjecture of Erdős and Simonovits and a degeneracy conjecture of Erdős.

Lijie Chen @wjmzbmr1 · 10h
10 proofs from our next major model Astra on long-standing open problems in mathematics and theoretical computer science (also including new circuit lower bounds for computing the permanent!)...

openaiastramathematicsai researchtheoretical computer sciencequantum complexity

Noam Brown @polynoamial

2026-07-24 — quoting @42_gravity (Chayanka_42)

ai capabilitiesresearch automationquantum cryptographyopenaitwitter

Noam Brown @polynoamial

2026-02-07

ai capabilitiesmetrtask horizonsagi timelinesscalingnoam brown

Noam Brown @polynoamial

2026-01-27

ai-capabilitiesforecastingnoam-browntwitterjudgmentnyt-opiniongoalpost-moving

Noam Brown @polynoamial

2025-02-06

ai evaluationbenchmarksllm capabilitiesnoam brownai progress

Noam Brown @polynoamial

2025-01-22

ai safetyai governanceopenaistargate projectagialignmenttwittertrump administration