Source addition and zero preservation for the actual encoded condenser #
Padded coefficientwise XOR represents addition of source polynomials for
arbitrary lists. For every semantic field seed, the decoded runtime program
therefore preserves source addition and sends every all-false input to zero.
The program is the existing condenserBits implementation behind
decodedCondenser, connected to the polynomial map by the checked correctness
theorem; no alternative implementation is introduced.
Only the two runtime dimension words must match their chosen powers of three.
No source-length, capacity, positive-count, or positive-stride premise is needed.
The characteristic-two structure is derived locally from the explicit binary
field, and no global instances are introduced. Polynomial-map linearity and
its source credits are documented in Condenser.Polynomial.
Padded XOR preserves source-polynomial addition, including unequal input lengths.
Every all-false source represents the zero polynomial, at every padding length.
An empty source represents the zero polynomial.
For each field seed, the actual decoded program preserves padded source XOR.
Every padded zero source gives the zero vector of decoded output coordinates.
The empty source gives the zero decoded output for every field seed.