Source · Project

OpenAI · Mathematics release: complexity proposals

Project documentationPublication date Oct 6, 2026
View project ↗

Overview

The precise statements and locators cited in this P versus NP research record.

Source-reported preprint/project; independent mathematical assessment pending.

Passages

The exact passages cited in OpenMath. Each passage identifies how its wording was recorded.

Passage index · 3
  1. Family 112; lean/docs/112.md and DepthThree comparator
  2. Family 108; lean/docs/108.md, PermanentCubic comparator; supporting theorem scope excludes ABP consequences
  3. Family 102; lean/docs/102.md and linked paper/comparator
Passage 1 · OpenMath paraphrasePermalink

Family 112; lean/docs/112.md and DepthThree comparator

A fixed language in P requires more than 2^{A√n} depth-three OR–AND–OR gates for every fixed A > 0, at every sufficiently large input length.

Passage details

Passage ID: pnp-entry-depth-three-proposal:v1

Source item: depth-three-proposal

Source record: pnp-openai@fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb

Passage 2 · OpenMath paraphrasePermalink

Family 108; lean/docs/108.md, PermanentCubic comparator; supporting theorem scope excludes ABP consequences

For m ≥ 1408, every affine-linear determinant representation, including coefficientwise limits, of the complex m×m permanent has size at least m^3/(5529600e).

Passage details

Passage ID: pnp-entry-permanent-proposal:v1

Source item: permanent-proposal

Source record: pnp-openai@fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb

Passage 3 · OpenMath paraphrasePermalink

Family 102; lean/docs/102.md and linked paper/comparator

For every fixed ε, δ in (0,1/2), there is a deterministic polynomial-time reduction from binary 3SAT to unique games over a fixed alphabet, with completeness at least 1−ε and soundness at most δ.

Passage details

Passage ID: pnp-entry-ugc-proposal:v1

Source item: ugc-proposal

Source record: pnp-openai@fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb

Used in

Explicit citations in versioned problem publications. A citation records a use; it does not confer proof or independent verification.

P versus NP →

Problem publication v14

Proposed depth-three bound beyond the square-root exponent →

Source assessment

Proposed

Provider proposes this result; assessment pending

Restricted depth only; not a fixed n^{1/2+ε} exponent and not unrestricted circuits.

Observed Oct 10, 2026

Proposed Unique Games gap reductions →

Source assessment

Proposed

Provider proposes this result; assessment pending

Provider proposal for Unique Games hardness; a hardness reduction does not prove P ≠ NP.

Observed Oct 10, 2026

Problem context · 6 citations

Files

Linked manuscripts, code and data. External proof reports, statement correspondence and OpenMath execution are separate checks.

Project notes

Unique Games gap reductions — formalization scope ↗

Source-reported evidence

Pinned provider scope document and comparator links. OpenMath has not executed the code or independently reviewed the mathematical correspondence.

Resource revision: fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb

Project notes

Depth-three circuit lower bound — formalization scope ↗

Source-reported evidence

Pinned provider scope document and comparator links. OpenMath has not executed the code or independently reviewed the mathematical correspondence.

Resource revision: fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb

PDF

Unique Games proposal — manuscript ↗

Source-reported evidence

Pinned provider manuscript; the proposed result has not received independent OpenMath mathematical review. See the matching formalization scope document separately.

Resource revision: fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb

PDF

Depth-three proposal — manuscript ↗

Source-reported evidence

Pinned provider manuscript; the proposed result has not received independent OpenMath mathematical review. See the matching formalization scope document separately.

Resource revision: fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb

PDF

Permanent proposal — manuscript ↗

Source-reported evidence

Pinned provider manuscript; the proposed result has not received independent OpenMath mathematical review. See the matching formalization scope document separately.

Resource revision: fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb

Credits

Recorded authorship

OpenAI internal model; author attribution per manuscript

AI involvement reported by the source

OpenAI reports internal-model production and accompanying formalizations at mixed stages of assessment. These Claims remain proposed in this curation; external formal evidence does not become an OpenMath check.

Versions

OpenMath source records preserve exact citations. Observation dates order these records; they do not establish the latest upstream paper or proof.

  1. fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb · selectedObserved Oct 10, 2026 · used in current publications

    OpenAI · Mathematics release: complexity proposals

Record details
Source ID
pnp-openai
Record ID
pnp-openai@fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb
Recorded title
OpenAI · Mathematics release: complexity proposals
Revision
fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb
Observed
Oct 10, 2026
Source updated
Not recorded
Content SHA-256
Not recorded
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.
Check interval
30 days
Rights
metadata-link
License
Full-text redistribution rights not asserted

Only metadata and original OpenMath paraphrases are published; proof PDFs remain at their source.

Source terms ↗