Abstract
We present a proof that P ≠ NP, organized so that the burden is isolated rather than diffuse. The route rests on five classical pillars — Landauer's principle, Bennett's reversible completion, the argument-principle integrality of winding numbers, the monotone lower bounds of Razborov and Jerrum–Snir, and the Razborov–Rudich natural-proofs barrier — together with one new theorem (Theorem 4.5, the Bridge): the winding demand of SEARCH grows super polynomially on the general gate basis, proved by pricing the topological invariant in thermodynamic currency, where the toll is substrate-independent and no gate basis discounts it. The barrier is treated as confirmation rather than obstacle: the toll is a global topological demand, invisible by construction to any natural property, which is precisely why natural-proofs techniques cannot cross while the toll argument can. The quantum of the member is one bit's erasure cost, kT·log 2 — the analog of ε_CKN, Δν, λ₁(E), and the polarization gap of the companion manuscripts.
Keywords: P versus NP, circuit lower bounds, Landauer's principle, reversible computation, winding number, natural proofs, directional limits.
Review and status
Preprint received and posted.
Read the manuscript
Open PDF ↗Loading PDF…