{"data":{"id":"p-vs-np-1971","statement_oneline":"P is not equal to NP.","statement_full_latex":"$\\mathsf{P} \\ne \\mathsf{NP}$.","source":{"title":"Cook (1971), Levin; Millennium Prize Problem","arxiv":null,"url":"https://en.wikipedia.org/wiki/P_versus_NP_problem","year":1971,"area":"cs.CC"},"renown":{"score":5,"rationale":"The central problem of computer science; $1M Millennium Prize.","scored_by":"founder"},"attackability":{"score":0,"rationale":"A refutation is a polynomial-time SAT algorithm plus a correctness proof, not a finite object; known proof barriers (relativization, natural proofs, algebrization) fence every known route.","subscores":{"finite_witness":0,"oracle_cost":0,"freshness":0,"seedability":0},"scored_by":"founder"},"status":"open","last_verified_open":"2026-01-15","added":"2026-07-25","ranking_score":0,"verification_tier":null,"ai_systems":[],"posed_by":null,"years_open":null,"notability":null,"source_trackers":[],"resolution_type":null,"resolver":null,"resolution_date":null,"evidence_url":null,"evidence_note":null,"method_note":null,"effective_status":"open","claims":[],"status_events":[{"id":"seed-p-vs-np-1971","conjecture_id":"p-vs-np-1971","status":"open","date":"2026-07-25T00:00:00.000Z","actor":"human-admin","rationale":"Loaded from unified seed data.","note":"Loaded from unified seed data."}],"public_actions":[{"name":"claim","method":"POST","href":"/c/p-vs-np-1971/claim","verification":"email magic link"},{"name":"report_resolution","method":"POST","href":"/c/p-vs-np-1971/resolve","verification":"admin review"}],"resolutions":[]},"notice":"Status is community- and machine-tracked and may lag. Verify independently before investing effort."}