barretenberg
barretenberg copied to clipboard
AztecProtocol
At the moment, we only simulate biggroup batch muls in the case when `Fr` is a `field_t` (in fact this restriction is imposed in a way the relies on loose...
The following skip condition applies for the lookup relation: ```cpp // From the definition of the lookup grand product, if the inputs are trivial, // Z_lookup is updated as Z_lookup_{i+1}...
Currently the IPA native verifier is parallelised which is desirable in the context of fast verification (e.g. for confirmation time). We don't have a mechanism yet to support parallelisation in...
`get_row()` constructs an AllValues from a single row across a table of polynomials viewed as columns. When used in a hot loop, e.g. over the entire length of the circuit,...
We've only ever tested one recursive verification at a time and manually checked the pairing is correct using the `pcs_verification_key` from the native verifier. We will probably need a mechanism...
The ECCVM needs to open the five ECC op transcript polynomials as univariates so consistency can be established in the Translator. This was overlooked in the original implementation. For now,...
When verifying ECCVM proofs in the rollup this would allow scalar multiplications to be 128-bits rather than full field elements