barretenberg
barretenberg copied to clipboard
AztecProtocol
ClientIVC sends four proofs: last fold proof, UGH decider, eccvm, translator that we recursively verify with a 2-by-1 approach.
We currently just don't strip LLVM, this brings bb.js to 7mb but enables stack traces. Reevaluated this plan.
Why were all tests passing before https://github.com/AztecProtocol/aztec-packages/pull/5529?
Brought up in a discussion with Zac over potential slowdowns in Sumcheck. Currently we iterate over each polynomial and for each one, we call `add_scaled`, which loops over the same...
In the ECCVM, the ProverPolynomials constructor (from a builder) creates all polynomials directly, with the exception of z_perm and z_lookup_inverses. The ProvingKey constructor (also from a builder) creates all polynomials...
Circuit generation is not parallelized in protogalaxy tests or benchmarks. They're not necessary for the actual benchmarks, but would be nice to have for faster iteration.
Currently the databus does not allow multiple reads from the same index. (This is plausibly OK for the long term, see note at bottom). This is to ensure that `read_counts`...