Feat/batched grand products

[moodlezoup]

This PR changes the way we batch grand products to reduce proof size and verifier cost.

Previously, a batch of k grand products, each of size n, would be batched via random linear combination into a single grand product of size n. With this batching approach, the grand product proof contains 2*k claimed polynomial evaluations per layer.

With this PR, a batch of k grand products, each of size n, would be proven as a single circuit: this can be viewed as simply laying out the individual grand product circuits side-by-side, so that the output layer is of size k. With this new approach, the grand product proof contains only 2 claims per layer.

In addition, this PR implements the Dao-Thaler optimization for EQ polynomials: https://eprint.iacr.org/2024/1210.pdf

[wiz-a16z]

Wiz Scan Summary

Scan Module						Total
IaC Misconfigurations	0	0	0	0	0	0
Vulnerabilities	0	0	0	0	3	3
Sensitive Data	0	0	0	0	0	0
Secrets	0	0	0	0	0	0
Total	0	0	0	0	3	3

View scan details in Wiz

To detect these findings earlier in the dev lifecycle, try using Wiz Code VS Code Extension.