barretenberg
barretenberg copied to clipboard
For unknown reasons, [this](https://github.com/AztecProtocol/aztec-packages/pull/7946) seemingly unrelated PR more than doubles the time it takes to allocate polynomials in the `aztec_ivc_bench`. Both master and branch are constructing polys of size $2^{19}$....
Came out of internal slack thread. Currently, we download for 2**24 circuits in bn254 no matter what in the native bb binary, it would be good to have a common...
Historically lookup table polynomials and other related polys have been constructed at the bottom of the execution trace. I don't know why but I assume there was some Plonk-related motivation....
This would involve modifying the verify_proof interfaces to take in an aggregation object and aggregating the pairing points from KZG. The tube circuit would then have proper aggregation. (but that's...
This will break many tests likely. The fix is adding a `builder.add_recursive_proof(default_agg_obj)` to many of the circuits. One solution is to refactor such that a call to finalize adds the...
However, this makes the acir schnorr test fail because it provided a (0,0) public key, not set to point at infinity, that should never be the case. Investigate this and...
Relevant when we convert transcript data into a biggroup or cycle_group
In the circuit builders we add dummy gates to ensure that all polynomials have at least one non-zero element in order to avoid the point-at-infinity commitment. We're getting closer to...
Undo the constant Honk proof size work. The logic of the Honk provers/verifiers was updated in [this](https://github.com/AztecProtocol/aztec-packages/pull/6954) PR to produce constant proof sizes and constant sized recursive verifiers. This was...