{"schema_version":"source-reader-v1","record":{"source_id":"pnp-book","versions":[{"work":{"authors":["Avi Wigderson"],"kind":"research_paper","publication":"published","publication_note":"Published author exposition or original paper.","ai_role":"not_reported","ai_note":"AI involvement is not reported by this cited source; this is not a claim of its absence.","artifacts":[{"kind":"pdf","title":"Avi Wigderson · Mathematics and Computation — proof text","url":"https://www.math.ias.edu/files/Book-online-Aug0619.pdf","version":"author-draft-2019-08-06","assessment":"paper_proof","note":"External source text. Its mathematical claims and independent OpenMath review are assessed separately.","sha256":"c6b72d0487d31b7d7173266c8d6706649607c6615defb7e2b6c2395782ab1829"}],"published":{"value":"2019"}},"id":"pnp-book@author-draft-2019-08-06","source_id":"pnp-book","title":"Avi Wigderson · Mathematics and Computation","owner":"Avi Wigderson","url":"https://www.math.ias.edu/files/Book-online-Aug0619.pdf","subject_scope":"The precise statements and locators cited in this P versus NP research record.","revision":"author-draft-2019-08-06","content_sha256":"c6b72d0487d31b7d7173266c8d6706649607c6615defb7e2b6c2395782ab1829","update_method":"Manual primary-source check; changes require a new source version and staff publication.","identifier_policy":"Source URL and exact theorem/section locator; no inferred identity merge.","observed_on":"2026-10-10","source_updated_on":null,"rights":"metadata-link","license":"Full-text redistribution rights not asserted","terms_url":"https://www.math.ias.edu/files/Book-online-Aug0619.pdf","attribution":"Avi Wigderson","rights_note":"Only metadata and original OpenMath paraphrases are published; proof PDFs remain at their source.","check_interval_days":30}],"entries":[{"id":"pnp-entry-circuits-imply-separation:v1","source_version_id":"pnp-book@author-draft-2019-08-06","item_id":"circuits-imply-separation","url":"https://www.math.ias.edu/files/Book-online-Aug0619.pdf","wording":"If NP is not contained in P/poly, then P ≠ NP.","wording_kind":"paraphrase","locator":"§5.2.1, Theorem 5.3","supersedes":null},{"id":"pnp-entry-conp-implies-separation:v1","source_version_id":"pnp-book@author-draft-2019-08-06","item_id":"conp-implies-separation","url":"https://www.math.ias.edu/files/Book-online-Aug0619.pdf","wording":"If NP ≠ coNP, then P ≠ NP.","wording_kind":"paraphrase","locator":"§3.5, NP versus coNP","supersedes":null},{"id":"pnp-entry-hierarchy-collapse:v1","source_version_id":"pnp-book@author-draft-2019-08-06","item_id":"hierarchy-collapse","url":"https://www.math.ias.edu/files/Book-online-Aug0619.pdf","wording":"If P = NP, then PH = P.","wording_kind":"paraphrase","locator":"§4.1, polynomial hierarchy; P = NP collapse discussion","supersedes":null},{"id":"pnp-entry-karp-lipton:v1","source_version_id":"pnp-book@author-draft-2019-08-06","item_id":"karp-lipton","url":"https://www.math.ias.edu/files/Book-online-Aug0619.pdf","wording":"If NP is contained in P/poly, then PH = Σ₂^P.","wording_kind":"paraphrase","locator":"Theorem 5.5 [KL82], §5.2.1","supersedes":null},{"id":"pnp-entry-ladner:v1","source_version_id":"pnp-book@author-draft-2019-08-06","item_id":"ladner","url":"https://www.math.ias.edu/files/Book-online-Aug0619.pdf","wording":"If P ≠ NP, then some languages in NP are neither in P nor NP-complete under polynomial-time many-one reductions.","wording_kind":"paraphrase","locator":"Theorem 4.1 [Lad75], §4.2","supersedes":null},{"id":"pnp-entry-np-circuits:v1","source_version_id":"pnp-book@author-draft-2019-08-06","item_id":"np-circuits","url":"https://www.math.ias.edu/files/Book-online-Aug0619.pdf","wording":"NP is not contained in P/poly.","wording_kind":"paraphrase","locator":"§5.2.1, Theorem 5.3 and Conjecture 5.4","supersedes":null},{"id":"pnp-entry-one-way:v1","source_version_id":"pnp-book@author-draft-2019-08-06","item_id":"one-way","url":"https://www.math.ias.edu/files/Book-online-Aug0619.pdf","wording":"There exists a polynomial-time-computable function that is hard to invert on average for probabilistic polynomial-time algorithms.","wording_kind":"paraphrase","locator":"Definition 4.7 and §4.5","supersedes":null},{"id":"pnp-entry-owf-implies-separation:v1","source_version_id":"pnp-book@author-draft-2019-08-06","item_id":"owf-implies-separation","url":"https://www.math.ias.edu/files/Book-online-Aug0619.pdf","wording":"If standard one-way functions exist, then P ≠ NP.","wording_kind":"paraphrase","locator":"§4.4–4.5, Definition 4.7 and discussion","supersedes":null},{"id":"pnp-entry-vp-vnp:v1","source_version_id":"pnp-book@author-draft-2019-08-06","item_id":"vp-vnp","url":"https://www.math.ias.edu/files/Book-online-Aug0619.pdf","wording":"Over a field of characteristic zero, VP and VNP are distinct.","wording_kind":"paraphrase","locator":"§12.4, algebraic reductions and completeness","supersedes":null}],"problems":[{"slug":"p-vs-np","title":"P versus NP","publication_version":14}],"selected_version_id":"pnp-book@author-draft-2019-08-06","available_versions":[{"id":"pnp-book@author-draft-2019-08-06","revision":"author-draft-2019-08-06","observed_on":"2026-10-10","title":"Avi Wigderson · Mathematics and Computation","publication":"published","content_sha256":"c6b72d0487d31b7d7173266c8d6706649607c6615defb7e2b6c2395782ab1829","used_in_current_publications":true}],"usages":[{"id":"source-use-b68549915438126f53b9","entry_id":"pnp-entry-circuits-imply-separation:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Established implication or scoped theorem in cited mathematics","claim":{"id":"claim-pnp-circuits-imply-separation","version":2,"slug":"pnp-circuits-imply-separation","title":"General NP circuit lower bounds would separate P and NP"},"fragment":"claim-pnp-circuits-imply-separation","assessment":{"id":"pnp-report-circuits-imply-separation:v1","entry_id":"pnp-entry-circuits-imply-separation:v1","state":"resolved","source_label":"Established implication or scoped theorem in cited mathematics","scope":"A one-direction sufficient condition; the converse is not established.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://www.math.ias.edu/files/Book-online-Aug0619.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-e15480b5c21d7ef01b85","entry_id":"pnp-entry-circuits-imply-separation:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"connection","title":"Nonuniform general NP circuit lower bounds would suffice for P ≠ NP.","claim":{"id":"claim-pnp-circuits-imply-separation","version":2,"slug":"pnp-circuits-imply-separation","title":"General NP circuit lower bounds would separate P and NP"},"fragment":"claim-pnp-circuits-imply-separation","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-2f532376674d92cc3fc6","entry_id":"pnp-entry-circuits-imply-separation:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"question","title":"P versus NP","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-32f67246d9341bc1b854","entry_id":"pnp-entry-circuits-imply-separation:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"General NP circuit lower bounds would separate P and NP","claim":{"id":"claim-pnp-circuits-imply-separation","version":2,"slug":"pnp-circuits-imply-separation","title":"General NP circuit lower bounds would separate P and NP"},"fragment":"claim-pnp-circuits-imply-separation","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-f807b9aa1bde259a5f0b","entry_id":"pnp-entry-conp-implies-separation:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Established implication or scoped theorem in cited mathematics","claim":{"id":"claim-pnp-conp-implies-separation","version":2,"slug":"pnp-conp-implies-separation","title":"NP versus coNP would separate P and NP"},"fragment":"claim-pnp-conp-implies-separation","assessment":{"id":"pnp-report-conp-implies-separation:v1","entry_id":"pnp-entry-conp-implies-separation:v1","state":"resolved","source_label":"Established implication or scoped theorem in cited mathematics","scope":"The implication does not establish its premise.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://www.math.ias.edu/files/Book-online-Aug0619.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-4a6e6f89620fa9d8a509","entry_id":"pnp-entry-conp-implies-separation:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"connection","title":"Separating NP from coNP would also separate P from NP.","claim":{"id":"claim-pnp-conp-implies-separation","version":2,"slug":"pnp-conp-implies-separation","title":"NP versus coNP would separate P and NP"},"fragment":"claim-pnp-conp-implies-separation","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-4708bd71d3c57d9c4413","entry_id":"pnp-entry-conp-implies-separation:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"question","title":"P versus NP","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-f241ec6a5b318c59ad69","entry_id":"pnp-entry-conp-implies-separation:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"NP versus coNP would separate P and NP","claim":{"id":"claim-pnp-conp-implies-separation","version":2,"slug":"pnp-conp-implies-separation","title":"NP versus coNP would separate P and NP"},"fragment":"claim-pnp-conp-implies-separation","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-6e23c4d3d4e551aff08e","entry_id":"pnp-entry-hierarchy-collapse:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Established implication or scoped theorem in cited mathematics","claim":{"id":"claim-pnp-hierarchy-collapse","version":2,"slug":"pnp-hierarchy-collapse","title":"If P = NP, the polynomial hierarchy collapses to P"},"fragment":"claim-pnp-hierarchy-collapse","assessment":{"id":"pnp-report-hierarchy-collapse:v1","entry_id":"pnp-entry-hierarchy-collapse:v1","state":"resolved","source_label":"Established implication or scoped theorem in cited mathematics","scope":"An asymptotic complexity-class consequence, not a practical algorithm implementation.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://www.math.ias.edu/files/Book-online-Aug0619.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-1612e5810cc67925ea42","entry_id":"pnp-entry-hierarchy-collapse:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"question","title":"P versus NP","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-afd6403314ff74b1f809","entry_id":"pnp-entry-hierarchy-collapse:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"If P = NP, the polynomial hierarchy collapses to P","claim":{"id":"claim-pnp-hierarchy-collapse","version":2,"slug":"pnp-hierarchy-collapse","title":"If P = NP, the polynomial hierarchy collapses to P"},"fragment":"claim-pnp-hierarchy-collapse","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-98ded813960dba623490","entry_id":"pnp-entry-karp-lipton:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Established implication or scoped theorem in cited mathematics","claim":{"id":"claim-pnp-karp-lipton","version":2,"slug":"pnp-karp-lipton","title":"Polynomial NP circuits would collapse the hierarchy"},"fragment":"claim-pnp-karp-lipton","assessment":{"id":"pnp-report-karp-lipton:v1","entry_id":"pnp-entry-karp-lipton:v1","state":"resolved","source_label":"Established implication or scoped theorem in cited mathematics","scope":"The Karp–Lipton implication; the circuit containment premise remains unresolved.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://www.math.ias.edu/files/Book-online-Aug0619.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-308e7fcdff8250a32b54","entry_id":"pnp-entry-karp-lipton:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"question","title":"P versus NP","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-c911676a8ad70a2af875","entry_id":"pnp-entry-karp-lipton:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"Polynomial NP circuits would collapse the hierarchy","claim":{"id":"claim-pnp-karp-lipton","version":2,"slug":"pnp-karp-lipton","title":"Polynomial NP circuits would collapse the hierarchy"},"fragment":"claim-pnp-karp-lipton","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-bcf175caef98800ea772","entry_id":"pnp-entry-ladner:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Established implication or scoped theorem in cited mathematics","claim":{"id":"claim-pnp-ladner","version":2,"slug":"pnp-ladner","title":"If P ≠ NP, intermediate problems exist"},"fragment":"claim-pnp-ladner","assessment":{"id":"pnp-report-ladner:v1","entry_id":"pnp-entry-ladner:v1","state":"resolved","source_label":"Established implication or scoped theorem in cited mathematics","scope":"Existence of NP-intermediate languages; not a classification of specific natural candidates.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://www.math.ias.edu/files/Book-online-Aug0619.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-d5ae5f9d68079c89c8e1","entry_id":"pnp-entry-ladner:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"milestone","title":"Conditional existence of intermediate problems","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-ecc721dbb333584d4d35","entry_id":"pnp-entry-ladner:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"question","title":"P versus NP","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-7891461e6925dfca2b61","entry_id":"pnp-entry-ladner:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"If P ≠ NP, intermediate problems exist","claim":{"id":"claim-pnp-ladner","version":2,"slug":"pnp-ladner","title":"If P ≠ NP, intermediate problems exist"},"fragment":"claim-pnp-ladner","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-6295b7b0be4ef3976cc5","entry_id":"pnp-entry-np-circuits:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Unresolved assertion in the cited scope","claim":{"id":"claim-pnp-np-circuits","version":2,"slug":"pnp-np-circuits","title":"NP lacks polynomial-size general circuits"},"fragment":"claim-pnp-np-circuits","assessment":{"id":"pnp-report-np-circuits:v1","entry_id":"pnp-entry-np-circuits:v1","state":"reported_open","source_label":"Unresolved assertion in the cited scope","scope":"A stronger circuit-complexity target than P ≠ NP.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://www.math.ias.edu/files/Book-online-Aug0619.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-e3933baaabd99aba4ea1","entry_id":"pnp-entry-np-circuits:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"question","title":"P versus NP","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-3bb919bad28b4b2556e6","entry_id":"pnp-entry-np-circuits:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"NP lacks polynomial-size general circuits","claim":{"id":"claim-pnp-np-circuits","version":2,"slug":"pnp-np-circuits","title":"NP lacks polynomial-size general circuits"},"fragment":"claim-pnp-np-circuits","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-f426e665d77a47a6322f","entry_id":"pnp-entry-one-way:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Unresolved assertion in the cited scope","claim":{"id":"claim-pnp-one-way","version":2,"slug":"pnp-one-way","title":"Standard one-way functions exist"},"fragment":"claim-pnp-one-way","assessment":{"id":"pnp-report-one-way:v1","entry_id":"pnp-entry-one-way:v1","state":"reported_open","source_label":"Unresolved assertion in the cited scope","scope":"Average-case cryptographic hardness; stronger than merely worst-case NP hardness.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://www.math.ias.edu/files/Book-online-Aug0619.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-dd0b29e642eff4454421","entry_id":"pnp-entry-one-way:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"question","title":"P versus NP","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-ac0c41fc1782645ea5e2","entry_id":"pnp-entry-one-way:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"Standard one-way functions exist","claim":{"id":"claim-pnp-one-way","version":2,"slug":"pnp-one-way","title":"Standard one-way functions exist"},"fragment":"claim-pnp-one-way","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-7fcfe0bb74f1c66280a7","entry_id":"pnp-entry-owf-implies-separation:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Established implication or scoped theorem in cited mathematics","claim":{"id":"claim-pnp-owf-implies-separation","version":2,"slug":"pnp-owf-implies-separation","title":"One-way functions would separate P and NP"},"fragment":"claim-pnp-owf-implies-separation","assessment":{"id":"pnp-report-owf-implies-separation:v1","entry_id":"pnp-entry-owf-implies-separation:v1","state":"resolved","source_label":"Established implication or scoped theorem in cited mathematics","scope":"The reverse implication is not established; P ≠ NP alone is not a security guarantee.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://www.math.ias.edu/files/Book-online-Aug0619.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-ca2e33f9ccf4fbff4e3e","entry_id":"pnp-entry-owf-implies-separation:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"connection","title":"Average-case one-wayness is a stronger sufficient hardness premise.","claim":{"id":"claim-pnp-owf-implies-separation","version":2,"slug":"pnp-owf-implies-separation","title":"One-way functions would separate P and NP"},"fragment":"claim-pnp-owf-implies-separation","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-61bf0c3ad1c01bdbb350","entry_id":"pnp-entry-owf-implies-separation:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"question","title":"P versus NP","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-93550db7681e00f0c2a1","entry_id":"pnp-entry-owf-implies-separation:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"One-way functions would separate P and NP","claim":{"id":"claim-pnp-owf-implies-separation","version":2,"slug":"pnp-owf-implies-separation","title":"One-way functions would separate P and NP"},"fragment":"claim-pnp-owf-implies-separation","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-46b4935eb9cd6fc104eb","entry_id":"pnp-entry-vp-vnp:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Unresolved assertion in the cited scope","claim":{"id":"claim-pnp-vp-vnp","version":2,"slug":"pnp-vp-vnp","title":"VP versus VNP"},"fragment":"claim-pnp-vp-vnp","assessment":{"id":"pnp-report-vp-vnp:v1","entry_id":"pnp-entry-vp-vnp:v1","state":"reported_open","source_label":"Unresolved assertion in the cited scope","scope":"An algebraic analogue; no equivalence to Boolean P versus NP is asserted.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://www.math.ias.edu/files/Book-online-Aug0619.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-365448124a90ad334b88","entry_id":"pnp-entry-vp-vnp:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"connection","title":"VP versus VNP is an algebraic complexity analogue, with field operations and polynomial families.","claim":null,"fragment":"connections","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-4cd12fd43d3455aa9341","entry_id":"pnp-entry-vp-vnp:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"question","title":"P versus NP","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-8cf2bd374ad8f39d06ec","entry_id":"pnp-entry-vp-vnp:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"VP versus VNP","claim":{"id":"claim-pnp-vp-vnp","version":2,"slug":"pnp-vp-vnp","title":"VP versus VNP"},"fragment":"claim-pnp-vp-vnp","assessment":null,"superseded":false,"formalization":null,"update":null}],"linked_entries":[],"linked_sources":[]}}