barretenberg
barretenberg copied to clipboard
To complete the ZM degree check, we need to commit to $(q_{\zeta} + z\cdot q_Z)X^{N_{max} - N - 1}$. Verification then requires a pairing check similar to the standard KZG...
Following the Noir work under this issue https://github.com/noir-lang/noir/issues/4428, Noir will build a list of ACIR circuits as well as a witness stack to be executed rather than a single circuit....
A lot of them are not const, but they should be.
Some of our provers call `transcript->export_proof()` in their `export_proof` while others return `transcript->proof_data` we should make this uniform, probably have all provers call `transcript->export_proof()` and then the `StructureTest` should operate...
The second opening is only temporary until IPA is fixed ( see #768 ) but for now the domain separation is not done properly
compute_logderivative_inverse seemingly creates the lookup_inverses polynomial and doesn't rely on shifts so it could be possible to use a provingkey instead.
we use `from_witness` to create variables whose value don't change and they should be constants.
Randomness in barretenberg is taken from random_device which is extremely slow (syscall per 4 bytes). It needs to be replaced at some point at least for the server usecase. The...