2431 — DPC Survives Only as a Bounded Source-Relative Audit
Verdict
The strengthened Deutsch--Popperian Conjecture is false as a universal law. Finite countermodels show that chronological source priority is not semantic evidence, named resources may be substitutable, microscopic nonuniqueness may express universality, physical dynamics does not generate a mathematical certificate, and exact code-projector intertwining is unnecessary under recoverable code deformation.
Ordinary forgetting also need not restore an obstruction when distilled states or compiled products remain. Counterfactual restriction must remove a resource class together with its declared descendants. Reachability claims must state accuracy, time, and resource budgets.
What survives is a bounded audit framework: an independently validated physical model predicts implementation and resource-class counterfactuals, while a separate verification model certifies the recovered channel within declared bounds.
Scope
This supersedes the universal DPC formulation recorded after Ledger 2428. It does not weaken the exact D(S3) stabilizer obstruction, conditional nonlinear realization, or negative frozen-code intertwining results.
Durable verification
- Packet:
research/kitaev/dpc-bounded-audit-framework.md - Checker:
research/kitaev/checkers/check_dpc_universal_law_countermodels.py - Result:
research/kitaev/results/dpc-universal-law-countermodels.json - Countermodels passed: 8/8
- Consolidated DPC replay: 6 component checkers
- Graph admission:
ev-000000003325-bbbac2b7-61aa-4c00-b05e-cab0b1c09d60 - Ledger allocation:
seqclaim-00d66da1620ff470b02efc1b