the round1 in proof generation of plonk in snarkjs

[VegeBun-csj]

May I ask if there are any considerations for adding 4 commitments here? I have seen many plonk implementations of rust with 4 commitments

[VegeBun-csj]

@naps62 @jacobrosenthal @phated @uaoleg @phated @jbaylina hi guys, can we discuss it ? Maybe 4 commitments will be better and do we have any plan to implement it?

[xavi-pinsach]

This code is useful to extend to 4*N evaluations because in the following rounds you more evaluations than N because of the degree of the polynomials you have to compute

[VegeBun-csj]

This code is useful to extend to 4*N evaluations because in the following rounds you more evaluations than N because of the degree of the polynomials you have to compute

So, the community of snarkjs will have plan to apply the 4 commitments?

[xavi-pinsach]

For the computation of the polynomial t(X) of the plonk protocol we interpolate it from its evaluations. Due to the degree of the polynomial t(X) we need 4N evaluations of it. To compute these evaluations we need evaluations of a(X), b(X) and c(X) and therefore we need 4N evaluations of these polynomials