2018 essay 'I Believe P=NP' resurfaces, draws Greg Brockman's skepticism
Theoretical computer scientist Emanuele Viola's old blog post on P vs NP recirculates on Hacker News and X, prompting a terse rebuttal from OpenAI's Greg Brockman.
What to know
- A 2018 essay by theorist Emanuele Viola, stating his personal belief that P=NP despite no formal proof, resurfaced on Hacker News and X in October 2026.
- Viola's argument rests on the historical pattern that efficient algorithms (upper bounds) keep surprising researchers, while few lower bounds can be proven at all.
- OpenAI president Greg Brockman publicly voiced skepticism, underscoring that the P vs NP question remains unresolved and contested among researchers and technologists.
Emanuele Viola Theoretical computer scientist, essay author
Greg Brockman OpenAI president, @gdb on X
How it unfolded 2 developments, newest first · click a bar or a number to jump articlesposts
-
2
Essay resurfaces on Hacker News
The 2018 post is resubmitted to Hacker News under the title "I Believe P=NP," prompting renewed circulation though drawing minimal comment activity.
“After worrying about P vs. NP for half my life, and having carefully reviewed the available "evidence" I have decided I believe that P = NP.”
— Emanuele Viola, Theoretical computer scientist · source -
1 outlet I believe P=NP
first by Thoughts, 12d ago
-
-
1
Brockman pushes back on X
OpenAI president Greg Brockman posts a short skeptical reply on X in apparent response to the essay's circulation, reasserting the conventional view that P likely does not equal NP.
“p still probably doesn't equal np…”
— @gdb -
Uhhh. So...there's a real chance P=NP Which would be awesome for computation, and also potentially break cryptography.
-
-
background
Viola publishes essay arguing he believes P=NP — Theoretical computer scientist Emanuele Viola writes that despite lacking proof, he personally believes P=NP, citing a history of surprising efficient algorithms (upper bounds) against few proven lower bounds.