In the high degree sum-check prover, and due to the succinctness of the periodic columns, when we are iterating over all of the terms in the sum (i.e., the i index) there is some work, which is not significant but not negligible either, which is redundant across terms e.g., interpolating the periodic multi-linear extensions.
We should be able reduce this by doing all of the work we do for each term at the outset i.e., before entering the loop.
In the high degree sum-check prover, and due to the succinctness of the periodic columns, when we are iterating over all of the terms in the sum (i.e., the
iindex) there is some work, which is not significant but not negligible either, which is redundant across terms e.g., interpolating the periodic multi-linear extensions. We should be able reduce this by doing all of the work we do for each term at the outset i.e., before entering the loop.