Struct AffineQuery 

pub struct AffineQuery {
    pub qrot: Vec<f32>,
    pub a: f32,
    pub b: f32,
}

The affine estimate (2g.2): because the quantizer ladder is UNIFORM, level value v(l) = l * step - SPAN (in coordinate units), so dot(x, q) ~ norm * ( step * SUM(l_j * q_j) - SPAN * SUM(q_j) ) / sd The second sum is one constant per query; the first needs no table at all – unpack each nibble to an integer, convert, multiply-add. Every step of that loop is straight-line arithmetic the compiler can vectorize, unlike a table lookup which never vectorizes. Four accumulators break the dependency chain as before.

Fields

qrot: Vec<f32>

a: f32

step / sqrt(padded), premultiplied.

b: f32

-SPAN/sqrt(padded) * SUM(qrot), premultiplied.