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
When describing the constraints for the lookup table of the WindowedPedersenCommit, it is not clear how the interpolation was done to vanishing polynomials. It took us some time to figure out that the general way of creating similar polynomials for constraints derived from 3 bits outputs b0, b1, b2 and encoding outputs c1, ..., c8 is with the following constraint:
C(b0, b1, b2) = c1(b0)(1 - b1)(1 - b2) + c2(1 - b0)(b1)(1 - b2) + ... + c8(b0)(b1)(b2)
Add a note about this (but using zero-based indexing for c).
The text was updated successfully, but these errors were encountered:
From the QED-it report:
Add a note about this (but using zero-based indexing for c).
The text was updated successfully, but these errors were encountered: