OpenAI proof dump shows first superlinear circuit lower bound, but progress stays slow

thomasahle · x · 2026-11-22

Thomasahle notes that OpenAI's proof dump achieved the first superlinear circuit lower bound, improving from 3.1n to n√(log n). He self-corrects that the bound applies to a problem in E^NP (not known open in P), and remarks that progress on circuit lower bounds remains slow—reaching n² and 2^n bounds is still far off.

Related event: OpenAI Proof Documents Show First Superlinear Circuit Lower Bound(2 posts)→

Original post →

More from Research

Research channel →