Nonnegative native-array control count, at most 2^32-1 original IDs.
Each listed control has exactly this finite millimetre position.
Nonnegative safe cap on the relation-edge dependency depth.
Positive safe cap on intermediate provenance and final independent terms.
Dependent controls and their finite weighted original-ID expressions.
One sparse millimetre expression per original control, in input ID order.
Unowned original IDs, in ascending order; these are the free variables.
Largest declared relation-edge depth, including zero-weight dependencies.
Largest final independent term count, excluding folded fixed sources.
Largest absolute deviation of pre-folding source weight sum from one.
Least retained flattened source weight; zero for an empty expression.
Eliminate acyclic affine control relations without changing their coefficients. Original control IDs remain the independent term addresses; they are never replaced by compact solver slots. Fixed positions and returned constants are millimetres. Relations may have signed weights or sums other than one. Equal terms combine, exact zero sums disappear, and fixed terms fold into the constant. No epsilon deletion, weight normalization or convexity repair occurs.
maxTerms bounds each intermediate flattened provenance map, including fixed sources, and every final independent expression. maxDepth counts relation edges; fixed and independent controls have depth zero. Cycles are rejected even when a declared dependency has zero weight or later cancels. Weight diagnostics describe flattened fixed and independent source weights before fixed-position folding. They do not certify a dependent enclosure. Invalid identities, conflicts, budget exhaustion or nonfinite arithmetic throw without mutating input or returning a partial relation system.