The identity polynomials (i.e. sid(X1, ..., Xn) = sum_{i=1..n} Xi * 2^{i-1}) can be evaluated in logarithmic time by the verifier. Thus there is no need to commit to sid polynomial.
Changes
Remove PCS commitments/evals/proofs related to sid
Add an API for evaluating sid(X).
Add timers for public input checking and PCS batching.
Optimize MSMs in multilinear PCS batch verification.
The identity polynomials (i.e. sid(X1, ..., Xn) = sum_{i=1..n} Xi * 2^{i-1}) can be evaluated in logarithmic time by the verifier. Thus there is no need to commit to sid polynomial.
Changes