Expand description
Polynomial evaluation via Horner’s method — mirrors
p3_uni_stark::verify’s AIR constraint polynomial evaluation at
FRI challenge points.
For each of NUM_POINTS challenge points x, evaluate a degree-
(DEGREE - 1) polynomial
p(x) = c_0 + c_1·x + c_2·x² + … + c_{DEGREE-1}·x^(DEGREE-1) via
Horner’s method. Memory access is a sequential streaming read of
coeffs[] (4096 × u64 = 32 KiB, fits in L1). Compute: DEGREE-1
chained mul + add per point — totally dependent (each step
needs the previous result).
Complements:
goldilocks-mul: chained mul, no add, no memorymini-verifier: closed-form constraint eval (no memory access)fri-fold-tree: scattered memory access