Potentially simplify linear combination for low degree proof #7
To reduce the size of FRI proofs, polynomials P(x), B(x) and D(x) are combined into a single polynomial using random linear combination. In Vitalik Buterin's STARKs, Part 3: Into the Weeds this done by combining P, Psteps, B, Bsteps, and D as follows:
E = k1 * P + k2 * P * xsteps+ k3 * B + k4 * B * xsteps + D
This library implements a generalized version of this approach, but it is not clear to me why the linear combination can't be done with just Psteps, Bsteps, and D as:
E = k1 * P * xsteps+ k2 * B * xsteps + D
If the above does not sacrifice security, it would simplify the code a little and also make #5 straightforward to implement.
This simplification doesn't seem to be possible per Vitalik Buterin's comment from here: