Compile the complete valid-input pipeline: the registered exact LP solver, rational directed distances, deterministic metric rounding, and certificate output. A bounded interpreter computes the source word width and clock from the actual binary input size. Its execution and polynomial resource proofs apply to every input word. On valid networks its clock contains the complete source execution, so it emits exactly the certified output. Compiler transfer establishes the existing uniform word-RAM predicate at every sufficient host word width.