Our newest sum-check optimizations are out!
We propose a *better* domain for sum-check: the infinity hypercube.
Evaluations over this domain give *precisely* the monomial coefficients, and lead to a ~10% prover speedup over 128+ bits prime fields
🧵/ n