Generative AI can produce the "miraculous" insights needed for formal proofs, like finding an inductive invariant, which traditionally required a PhD. It achieves this by training on vast libraries of existing mathematical proofs and generalizing their underlying patterns, effectively automating the creative leap needed for verification.

The 'Scientist AI' doesn't require a universal database of facts. It only needs a small set of unimpeachable data, like mathematical proofs, to learn the syntactic difference between a factual claim and a communication act. It can then generalize this concept of 'truthfulness' to more ambiguous domains.

P represents problems we can solve, while NP represents problems where a solution can be easily verified. If P=NP, any problem with a verifiable solution could be efficiently solved, implying we can know everything we want to know. It's a question about the ultimate limits of discovery.

The standard for mathematical proofs is shifting from peer-reviewed papers to formally verified code. This makes math more like a large open-source project, where anyone in the world can contribute. Because the contributions can be computationally certified for correctness, collaboration becomes easier and the field becomes more accessible to amateurs.

Languages like Lean allow mathematical proofs to be automatically verified. This provides a perfect, binary reward signal (correct/incorrect) for a reinforcement learning agent. It transforms the abstract art of mathematics into a well-defined environment, much like a game of Go, that an AI can be trained to master.

The "hardness versus randomness" paradigm reveals a deep connection: if a problem is computationally hard (like P≠NP is believed to be), its unpredictability can be used to construct pseudorandom generators. These generators turn a few true random bits into long sequences that can derandomize any efficient probabilistic algorithm.

Humanity's intellectual pursuits, from science to engineering, inherently focus on problems where a potential solution can be verified upon discovery. We wouldn't begin searching for something if we couldn't recognize it once found, which is the definition of an NP problem.

While any NP-complete problem can be reduced to another, SAT solvers are the practical choice because of the immense effort poured into developing heuristics that efficiently handle the structured instances arising in real-world applications. Their advantage lies in engineering, not pure theory.

For some NP-hard problems, like 3-SAT, a random guess satisfies 7/8ths of clauses. The PCP theorem proves that finding a solution satisfying just an epsilon more (7/8 + ε) is as computationally hard as finding a perfect 100% solution. This places severe limits on approximation algorithms.