P versus NP

Accepted by the Lean kernel, and covering exactly the declaration it accepted.

Nothing recorded.

Open, and still standing after review. Promising is not verified.

Nothing recorded.

Closed, with the record that closed it. Kept so it is not proposed again.

• D-0.1D-0.1 · Counting argument over random Boolean functionsIt. 1 · EXHAUSTED · 2026-09-15
• D-0.2D-0.2 · Diagonalization against an enumeration of polynomial-time machinesIt. 1 · EXHAUSTED · 2026-09-15
• H-001The counting bound transfers to an explicit familyIt. 1 · REJECTED · 2026-09-15
• H-002The diagonal language stays inside NPIt. 1 · REJECTED · 2026-09-15
• H-003The construction survives every oracleIt. 1 · REJECTED · 2026-09-15

Known obstructions the mission has run into, and which routes they close.

• D-0.1Recorded in mission memory: counting is non-constructiveIt. 1 · RECORDED · 2026-09-15
• D-0.2Recorded in mission memory: the relativization barrierIt. 1 · RECORDED · 2026-09-15

What the corpus has been read for, direction by direction.

• Shannon 1949C. E. Shannon · The synthesis of two-terminal switching circuitsIt. 1 · INDEXED · 2026-09-15
• Baker 1975T. Baker, J. Gill, R. Solovay · Relativizations of the P =? NP questionIt. 1 · INDEXED · 2026-09-15

Sandboxed runs. Agent-written code never runs on the laboratory’s own machines.

Nothing recorded.

Questions the mission owes an answer to. They outlive the iteration that found them.

Nothing recorded.