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.
See how Lean source becomes a public status report.
The source is compiled, declarations and axiom closures are inventoried, reviewed milestone pins are checked, and the public report is generated. Missing or inconsistent evidence fails closed.
Each layer must match the exact reviewed coordinate. Missing, stale, malformed, digest-mismatched, or internally inconsistent data fails closed.
Compiled declaration inventory
The canonical inventory records the actual public declarations, modules, theorem kinds and axiom closures, with private compiler auxiliaries excluded. Reviewed theorem kinds, exact fingerprints, permitted axiom closures and source identity establish the publication boundary. Declaration totals are not proof completion.
Reviewed evidence pins
Milestone candidates carry reviewed kernel-type fingerprints; the publication map itself is digest-pinned.
Whole-source closure
Every Lean source plus toolchain, Lake configuration, manifest, and inventory probe is bound to one reviewed source-closure digest.
Scoped milestone classifier
Formal artefact coverage is 260 of 262 scoped rows, earned only when theorem presence, theorem kind, approved axiom closure with no project axiom, exact type pins and source-closure identity all agree. This evidence-ledger ratio is not proof completion. The separate fixed-weight tracker is 40% and comes from the canonical progress ledger.
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.
Concrete publication gate
Concrete standard semantics, target/root fingerprints, axiom closure, and source closure form a strict conjunction. Null is never a match.
Generated public surfaces
Status, theorem-emission fields, TeX, PDF, and site copy derive from the gate and inventory; historical checker records cannot override them.
Historical package ledger
Unformalized vocabulary from the 57-page manuscript.
These names are review leads, not inventory-derived theorem evidence and not current publication inputs.
Package family
Audit question
Expected evidence
E / N / FT / X
Do local transformations compile to full-mode verified direct-wire gains?
Frontier exactness, obligation lifecycle, finite coverage, route priority, and gain compilation.
BC / UN / HN / BUD
Are governed structures routed, solved, or sidecar-blocked without circular justification?
Transition audits, BWL exactness, budget dynamic programs, and blocker-indexed sidecars.
RW / BN2–BN6 / PkgC
Does positive residual slack force a concrete packet prototype?
The JavaScript checker validates fields and relations in assertion-bearing records under implemented predicates. It does not prove the mathematical assertions carried by those fields.
Constructive firewall
The new Lean interface makes the terminal case explicit: selected-coordinate equality is not a full-mode replacement until every omitted profile coordinate is checked. Route tokens, sidecar records, and bounds-only evidence likewise cannot stand in for complete replacement records.
Release custody
Source/checker origin is separated from the durable artefact-bearing release, with manifest and checksum records available for review.
Formal invariant
Every mathematical step must become a checked Lean theorem.
Legacy verifier records can identify proposed obligations, but the reconstruction must prove them from concrete definitions and expose every remaining axiom at the root theorem.