causal

Verification easier than generation per P vs NP

Ranking or verification should be much easier than generation, analogous to the P versus NP distinction: if P does not equal NP, there is a massive class of problems that are far easier to verify given a proof than to actually solve.

causalpending

Speaker

Aman Sanger

Evidence Quote

“if you believe P does not equal NP, then there’s this massive class of problems that are much, much easier to verify given proof, than actually proving it”

Source

Cursor Team— Lex Fridman Podcast
Created: 6/13/2026, 3:31:02 AM

Your notes

Loading notes...