You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
For additively homomorphic commitment schemes (including Hyrax, Zeromorph, HyperKZG) we can use a sumcheck to reduce multiple opening proofs (multiple polynomials, not necessarily of the same size, each opened at a different point) into a single opening. This is implemented in Nova here.
Currently, the Jolt prover with Zeromorph and HyperKZG is bottlenecked by opening proofs. By reducing the number of opening proofs down to one, we can cut the prover time by about half.
The text was updated successfully, but these errors were encountered:
For additively homomorphic commitment schemes (including Hyrax, Zeromorph, HyperKZG) we can use a sumcheck to reduce multiple opening proofs (multiple polynomials, not necessarily of the same size, each opened at a different point) into a single opening. This is implemented in Nova here.
Currently, the Jolt prover with Zeromorph and HyperKZG is bottlenecked by opening proofs. By reducing the number of opening proofs down to one, we can cut the prover time by about half.
The text was updated successfully, but these errors were encountered: