Why expanding an exhaustive search does not fix its size problem
A checked family of circuit examples shows a limit of expanding the existing exhaustive search. For these inputs, any accepted improvement needs a complete candidate list that eventually exceeds every polynomial bound in the encoded input length.
This rules out a polynomial-size guarantee for that fully materialized enumeration strategy, not every possible solver. It does not bound how many candidates a selective search must visit, rule out compressed or lazy methods, or claim that these examples arise from the SAT reduction. It does not settle P versus NP or earn additional proof-completion credit.
Why a complete local search can still miss a global improvement
The project has verified a limit of the implemented circuit search: no fixed cap on the number of gates checked together makes it a complete test for global minimality. For every such cap, a circuit can be made smaller even though the complete bounded search finds no accepted improvement. Every proper selected part, including disconnected selections, is already minimal when its boundary inputs are treated as independent.
The result rules out using this fixed-size local search alone to certify that an entire circuit is minimal. It does not settle P versus NP or rule out growing windows or transformations that use the surrounding circuit. A corrected route must still prove global coverage and polynomial runtime for the complete construction. This correction does not earn a positive milestone or increase the proof-completion estimate.
The project has verified a counterexample to an unrestricted reading of the original report's replacement claim. The checked example has a smaller replacement for one part, but inserting it would create a circular dependency; the whole circuit was already minimal.
This does not invalidate the checked replacement results that enforce the necessary restrictions, and it does not settle P versus NP. It identifies a central obligation for the next research: derive the admissible replacements and show that the general method can use them without losing the required saving.
The project now proves a polynomial bound for the complete machine that reads an input and produces its reduced problem. It also proves that the machine for replaying the recorded simplifications can recover a valid original answer from a genuine solution of that reduced problem, within a polynomial bound.
This closes the running-time gap for these two defined phases, not for a complete solver. The remaining problem can still be unresolved, and this work does not find its solution. The replay bound starts with its encoded request; an additional machine to assemble that request is not claimed. The overall proof estimate is unchanged.
Risk-weighted proof completion estimate: 40%, with uncertainty 20% to 40%. Formal artefact coverage: 260 of 262 current scoped publication rows earned. Global gates closed: 0 of 5. Project-specific axioms remaining: 0. The eligible root theorem PNP.Main.p_eq_np remains absent and the publication gate is false.
Read what has been machine-checked, and what has not.
The current report is generated from the compiled Lean inventory. It records scoped results, assumptions, and missing work. It does not report an established proof of P = NP.
The report is deterministically rendered from the status and publication map that are themselves derived from the compiled Lean environment.
Compiled environment
The canonical compiled inventory records the checked declarations, modules, theorem kinds and their axiom closures. Private compiler auxiliaries are excluded. Project-specific axioms remaining: 0. Inventory size is not proof completion.
Reviewed milestone pins
Theorem candidates have reviewed kernel-type SHA-256 pins. Earned milestones require every named theorem to be present, theorem-kind, type-matched, bound to the reviewed source closure, and free of project or unapproved axioms.
Concrete gate
Publication requires the strict conjunction of concrete target, root, type/value, axiom-closure, and source-closure checks. Unconfigured null fingerprints never match.
Current formal artefact coverage
260 earned scoped milestones; 2 missing global milestones
Risk-weighted proof completion estimate: 40%, with uncertainty 20% to 40%. Formal artefact coverage: 260 of 262 current scoped publication rows earned. Global gates closed: 0 of 5. Project-specific axioms remaining: 0. The eligible root theorem PNP.Main.p_eq_np remains absent and the publication gate is false. This row count measures the evidence ledger, not proof completion.
Earned scoped results
The report retains the complete canonical evidence ledger, including earlier constructions and their original limitations.
The project now proves a polynomial bound for the complete machine that reads an input and produces its reduced problem. It also proves that the machine for replaying the recorded simplifications can recover a valid original answer from a genuine solution of that reduced problem, within a polynomial bound.
This closes the running-time gap for these two defined phases, not for a complete solver. The remaining problem can still be unresolved, and this work does not find its solution. The replay bound starts with its encoded request; an additional machine to assemble that request is not claimed. The overall proof estimate is unchanged.
Not earned
A deterministic polynomial-time SAT algorithm, unconditional residual minimization and global ZeroSlack, complete exact PCCMin with polynomial construction, runtime, output-size and certificate-size bounds, and the eligible concrete P-versus-NP root theorem. The full manuscript carrier, general obligation calculus and complete global routes remain open. The report-facing compatibility alias and conditional bridge cannot substitute for that missing root. P = NP is not established.
Claim boundary
A concrete compatibility name is not a publication theorem
PNP.PEqualsNP now aliases the concrete finite charged-pipeline mutual-inclusion proposition, and PNP.Main.ConcretePEqualsNP names the same inactive target. Neither definition proves the proposition. The reviewed activation fingerprints and exact compatibility root PNP.Main.p_eq_np remain absent, so the gate fails and all public theorem-emission fields remain false or null.
Verify the report
Check the bytes and their source boundary.
Use the published digest ledger for file identity, then reproduce the compiled inventory and publication generation in the Lean repository. A hash match is not proof of a theorem.
The old 57-page claim manuscript remains historical only
The historical manuscript is preserved at source tag final-pnp-proof-report-hardened-7072f8d, commit 7072f8d0bda6d44d240f9bb3fad624fd357e1278, with provenance in archive/legacy-v0/ARCHIVE.json. Its checker-mediated claim language is superseded and never controls current theorem status or the canonical download aliases.