Capability Without Self-Authorisation: A Constraint Physical Computing Research Programme for External Authority over Artificial Superintelligence (ASI)

Constraint Physical Computing (CPC) investigates two separately testable objectives: native computation through answer-independent compilation of declarative constraints into engineered physical dynamics, without requiring a prescribed quantum-gate sequence; and independently governed admission of specified consequential effects proposed by increasingly capable artificial intelligence. CPC does not prescribe human values or claim that unrestricted Artificial Superintelligence (ASI) has been contained. Uncontrolled decoherence and loss obstruct quantum scaling, alongside control, connectivity, readout and fault-tolerance costs. CPC investigates whether selected engineered dissipative processes can stabilize physical representations and implement problem-dependent constraint dynamics. Terminal-sector correctness, physical convergence, calibrated readout and complete resource scaling remain separate qualification obligations. Gate-free quantum computing has prior art; neither a CPC-specific quantum advantage nor native scalable quantum execution has been demonstrated. CPC Validation v0.7.0 integrates answer-independent compilation and open-system execution contracts, finite CPC–Shor models, pre-physical bosonic N0 tooling, and a bounded classical probability service on an iCE40UP5K FPGA with RP2040 transport. Three seeded SEED–PROB pairs produced six oracle-exact physical response frames comprising 132 16-bit words. Separately, an N = 15 order/factor witness was obtained from 256 simulated measurements. These results establish reusable semantic and implementation evidence, not physical quantum order finding, full physical oracle conformance, quantum scalability or an ASI authority gate. Bosonic WP–B1 conformance and physical N0 acquisition remain open. For external authority, CPC proposes a separately protected physical admission boundary for declared effect interfaces. Its concrete-harm exclusion theorem is conditional on complete mediation, sound refinement, independently qualified semantic adequacy and protected policy governance. The proposed tests are falsifiable; neither universal ASI containment nor a demonstrated CPC-specific security advantage over conventional reference monitors is claimed.