P versus NP

Whether efficiently checkable solutions are also efficiently discoverable. MindForge treats the official problem statement and accepted definitions as authoritative.

Complexity classes, reductions, circuit lower bounds, proof complexity, and known relativization or natural-proof barriers.

• Canonical definitions and prerequisites
• Major partial results and equivalent formulations
• Known barriers and failed approach classes

The current phase is research curation: map dependencies, formalize candidate subproblems, test toy cases, and document counterarguments. No solution or proof is claimed.

Computation may find patterns or counterexamples in bounded domains. It does not prove an infinite mathematical statement. Any future proof draft must survive line-by-line specialist review.