P vs NP as Verification-Construction Separation in the Primitive Coupling Grammar — *Capability Exists; Deployment Restrained by Choice*

P vs NP, one of the seven Clay Mathematics Institute Millennium Prize Problems, asks whether every problem whose solution can be verified in polynomial time can also be solved in polynomial time. This companion deposit proposes that P vs NP is the formalism-substrate-resolution-class readout of an underlying substrate-coupling-architecture in which local evaluability v (x) and recoverable constructive traversal v (x) \, z are distinct architectural regimes unless z is recoverable from v (x) by a polynomially bounded constructive map. Under the primitive coupling grammar (Apex Deposit Definition 1): ₀ (x, z) = v (x) \, z - NP verification v (x) (local evaluability) - P construction v (x) \, z (constructive traversal with axial coupling) The decisive question: can z be recovered from v (x) by a polynomially-bounded constructive map?