Uniform polynomial-time evaluation of coefficient blocks #
A single evaluator reads a flat coefficient string, block-width word, seed, modulus, and count word through nested pairing. Horner's rule processes the requested blocks from high degree to low degree using bounded remainder states. Missing coefficients are zero; malformed encodings follow the total projections and zero moduli produce empty output.
Horner evaluation of runtime coefficient blocks is uniformly polynomial-time.