proofwatchBETASuggest a problem
Back to the watchlist
Computer science / Millennium problem

P vs NP

Can every efficiently checkable problem also be solved efficiently?

The source trail 8

Findings, with context
DiscussionSep 10, 2026

A source discussing P vs NP

ActorNightly writes the excerpt below in a discussion related to P vs NP. Read the source for the surrounding context.

“P vs NP is a more fundamental problem that if proven, will have insane consequences, perhaps more than anything else out there.”
This excerpt is evidence of what the linked page says, not verification of its claims.
ActorNightlyOriginal source · Found Sep 20
Hacker News
DiscussionAug 4, 2026

A source discussing P vs NP

MichaelMoser123 writes the excerpt below in a discussion related to P vs NP. Read the source for the surrounding context.

“It didn't come up with a counterexample for the P versus NP problem, I wonder if they just didn't ask about it...”
This excerpt is evidence of what the linked page says, not verification of its claims.
MichaelMoser123Original source · Found Sep 20
Hacker News
DiscussionSep 18, 2026

A source discussing P vs NP

kurtis_reed writes the excerpt below in a discussion related to P vs NP. Read the source for the surrounding context.

“P vs NP has a lot to do with real problems.”
This excerpt is evidence of what the linked page says, not verification of its claims.
kurtis_reedOriginal source · Found Sep 20
Hacker News
DiscussionFound Sep 20, 2026

A source discussing P vs NP

securemachinery.com contains the excerpt below in a discussion related to P vs NP. Read the source for the surrounding context.

“No major AI-driven breakthrough has been reported here as of September 2026.”
This excerpt is evidence of what the linked page says, not verification of its claims. Publication date has not been established.
Source pageIndirect account · Found Sep 20
securemachinery.com
DiscussionFound Sep 20, 2026

A source discussing P vs NP

proofatlas.ai contains the excerpt below in a discussion related to P vs NP. Read the source for the surrounding context.

“Neither artifact was independently audited, published in a qualifying outlet, or shown to have general mathematical acceptance, so neither changes the open status.”
This excerpt is evidence of what the linked page says, not verification of its claims. Publication date has not been established.
Source pageIndirect account · Found Sep 20
proofatlas.ai
DiscussionSep 10, 2026

A commenter revisits a 2009 prediction attributed to Tao

num42 writes the excerpt below in a discussion related to P vs NP. Read the source for the surrounding context.

“Probably, P vs NP would be the last one to be solved, said by Terrence Tao in 2009.”
The September 2026 commenter is recalling a prediction attributed to Terence Tao in 2009. This is discussion of an older forecast, not a new Tao announcement or a report of lab progress.
num42Original source · Found Sep 19
Hacker News
DiscussionSep 10, 2026

A discussion of P vs NP and cryptography

eru writes the excerpt below in a discussion related to P vs NP. Read the source for the surrounding context.

“Most people expect P < NP, and then crypto wouldn't be broken.”
This is an informal comment about possible implications, not evidence of a P vs NP result or a security guarantee for any cryptosystem.
eruOriginal source · Found Sep 19
Hacker News
DiscussionAug 4, 2026

A commenter explains the scope of new arithmetic-circuit bounds

isaacfrond writes the excerpt below in a discussion related to P vs NP. Read the source for the surrounding context.

“The paper does not resolve P versus NP, but it does make an important advance in a closely related area.”
The comment describes progress on related arithmetic-circuit lower bounds and explicitly says it does not resolve P vs NP or separate VP from VNP.
isaacfrondOriginal source · Found Sep 19
Hacker News