Researcher: frontier LLMs convincingly refuted his 30 years of P=NP attempts

csuwildcat · x · 2026-10-28

A researcher who spent years building SHA-256 as a Boolean circuit and decades attacking P=NP says he fed all his accumulated proof attempts to frontier LLMs — which "thoroughly and convincingly refuted every single line of reasoning" he had come up with over 30 years, leaving him believing for the first time that P≠NP. A rare first-hand account of LLMs as mathematical argument checkers.

Original post →

More from Fun

Fun channel →