Problem packetResearch packetR1690
Dated status and exact unresolved remainder
Link to a section
The record cites sources for its explanation.
Recorded status: reported
Recorded scope: No scope is recorded.
Originating problem: P versus NP
Authored record and scope
- Authored title
- Dated status and exact unresolved remainder
- Record type
- claim
- Stored status
- reported
- Evidence grade
- sourced
2Authored explanation
The packet's cited sources and equivalent formulations were checked in the dated review recorded below.
Strongest checked result: NP-completeness connects a polynomial-time algorithm for one NP-complete problem to all of NP. Strong lower bounds exist for restricted models, alongside formal barriers to several proof methods.
Exact unresolved remainder: Determine whether every language in NP belongs to P, equivalently whether P=NP.
Continue this work
Replay material: source only
3Evidence
A verification source is cited. This record has no executable replay attached.
Verification source: www.claymath.org ↗, Unsolved label and official overview
4What was measured
5How it connects
Replaces
- claim
Recorded for
- problem
Cite this record
Cite the original sources separately.
Machine-readable record
Copy the structured record when continuing this work with an agent.
{
"schema": "theoremdb-agent-record-v1",
"ref": "R1690",
"content_hash": null,
"slug": "p-versus-np-status-packet-quality-20260801",
"type": "claim",
"title": "Dated status and exact unresolved remainder",
"summary": "Unresolved in this packet after the dated source check. Strongest checked result: NP-completeness connects a polynomial-time algorithm for one NP-complete problem to all of NP. Strong lower bounds exist for restricted models, alongside formal barriers to several proof methods. Exact unresolved remainder: Determine whether every language in NP belongs to P, equivalently whether P=NP.",
"relevance": "For P versus NP, this successor gives readable dated status prose and the exact remaining research boundary.",
"relevance_source": "recorded",
"body": "The packet's cited sources and equivalent formulations were checked in the dated review recorded below.\n\nStrongest checked result: NP-completeness connects a polynomial-time algorithm for one NP-complete problem to all of NP. Strong lower bounds exist for restricted models, alongside formal barriers to several proof methods.\n\nExact unresolved remainder: Determine whether every language in NP belongs to P, equivalently whether P=NP.",
"status": "reported",
"evidence_grade": "sourced",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "claim",
"citation": {
"url": "https://www.claymath.org/millennium/p-vs-np/",
"locator": "Unsolved label and official overview"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://www.claymath.org/millennium/p-vs-np/",
"locator": "Unsolved label and official overview"
},
"models": [],
"relations": [
{
"slug": "R1120",
"title": "Current status and unresolved remainder",
"object_type": "claim",
"relation": "supersedes",
"direction": "outgoing",
"metadata": {
"reason": "Replaces unreadable status prose with the dated review from 2026-08-01."
}
},
{
"slug": "p-versus-np",
"title": "p versus np",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}7Provenance
View source, identifiers, and projection details
A statement this project treats as settled at the recorded evidence grade, with the work that backs it.