TheoremDB
R1690claimStatus: reportedEvidence: SupportedReplay: source only

[#R1690] Dated status and exact unresolved remainder

claim. 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.

View evidenceOpen source ↗

1Summary

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.

Supported evidence. Replay readiness: source only.

2Evidence

Evidence package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: www.claymath.org ↗, Unsolved label and official overview

3Overview

Exact unresolved remainder: Determine whether every language in NP belongs to P, equivalently whether P=NP.

4What was measured

As of
2026-08-01
Strongest known 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 open remainder
Determine whether every language in NP belongs to P, equivalently whether P=NP.

5How it connects

Supersedes

Recorded for

6Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
json
{
  "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"
  },
  "relations": [
    {
      "slug": "R1120",
      "title": "Current status and unresolved remainder",
      "object_type": "claim",
      "relation": "supersedes",
      "direction": "outgoing"
    },
    {
      "slug": "p-versus-np",
      "title": "p versus np",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details
Project
p-versus-np-source-review
Locator
Unsolved label and official overview
License
CC0-1.0
Contributors
TheoremDB maintainers
Public record
R1690
Stable alias
p-versus-np-status-packet-quality-20260801
Projection
Reproduction fields are derived from the immutable record.

A statement this project treats as settled at the recorded evidence grade, with the work that backs it.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.