Certified Target-Sufficient Readout Design and Exact Finite-Model Reduction
Orientation and abstract
Certified Target-Sufficient Readout Design and Exact Finite-Model Reduction
Jeremy Rodgers Independent Researcher www.everythingequation.com
Searchable transcription
27 October 2026
Searchable transcription
https://doi.org/10.5281/zenodo.23721133
Abstract
We give an exact computational realization of target-relative readout sufficiency for finite sources. A unique-extension circuit compiler turns failure of target descent into an explicit pair of sources, and counterexample-guided menu synthesis returns globally minimum-cost sufficient feasible selections. A rational branch-and-bound implementation supplies independently checkable lower and upper costs even when interrupted, including non-upward-closed feasibility constraints. A nonlinear autonomous register has sharp weighted predictive-completion and full-source reconstruction cost formulas, yielding unit-cost values
and 2
1. Technical appendices give exact signed rational contraction with explicit precision accounting, minimal sufficient parity summaries, and context-certified tensor-wire quotients with executable integer crossing factors. The working implementations use conventional exact backends. Separate subexponential complexity corollaries are conditional on stated external preprint theorems; neither external algorithm is advertised as implemented. The results distinguish target sufficiency, access cost, retained information and recovery of the actual source.