Bounded enumeration of the actual sumset-extractor calls #
The supplied unary counts bound both enumeration loops. Each position uses its concrete fixed-width binary code as a sampler index and in its advice. The actual sampler supplies the seed to the actual selected affine program on the same original source word. XOR within each outer coordinate and strict majority produce one final bit, including at zero counts.
The counts are runtime inputs rather than unrestricted powers generated from their bit widths. Agreement with the finite semantic construction uses separate exact-count hypotheses. Eventual bounds allowing those counts to be selected uniformly belong to the parameter-family layer.
The candidate calls at one outer coordinate, in increasing binary-index order.
Equations
- Algebraic.Cutwidth.Extractor.sourceReductionCandidatesRuntime L C source i = List.map (Algebraic.Cutwidth.Extractor.sourceReductionCallRuntime L C source i) (List.range C)
Instances For
Strict majority of the actual XOR rows, always serialized as one Boolean bit.