Open
Description
- Consider using structured polynomials in the VMs to reduce commit time for the wires who are known to be short as opposed to a more ad-hoc approach with subspans. + if the memory in ClientIVC becomes a problem
- Investigate if we could use structured polynomials in
HidingCircuit. It's a recursive verifier circuit which is fixed, so there's def something to be done here. - In any case, we need to support commitments to short polynomials, whose last rows are masked