Toward Candidate P = NP Routes via Multitime Transport Compilation: Receipt-Gated Canonicalization and Conditional Deciders

This paper continues the Multitime Barriers program by reframing progress on P vs NP as an operational transport question across reductions: do “reasons” for satisfiable or unsatisfiable outcomes remain stable, checkable, and auditable when transformed under declared regimes? We introduce Multitime Transport Compilation, a receipt-gated protocol that converts admissible transformations into comparable, replayable artifacts under a Temporal State Machine kernel. The kernel treats clocks as transition families and enforces enriched state constraints: admissibility corridors, no-reopen discipline, abstain gating, and recovery-to-okay feasibility. Within this framework, we define a conditional candidate decider as a pipeline — canonicalize → key → library lookup → bounded verification — whose claims are restricted to what can be closed within the current receipts. Empirically, we report transport tests and closure behavior under multiple stages and regimes, highlighting (i) stable measured overlap coexisting with closure deficits (key_hit below gate and abstain above gate) and persistent unresolved ties, and (ii) a counterexample where increased Weisfeiler–Lehman depth correlates with measured overlap loss and a scale-guard violation, motivating rollback discipline. The contribution is not a proof of P = NP, but a constructive, auditable research program: make comparability mechanical, classify failure modes by receipts, and publish a protocol that other groups can scale and verify.