barretenberg
barretenberg copied to clipboard
AztecProtocol
Currently we just add constraints and return new elements when we normalize field elements and reduce bigfield elements. This means that a call to the same field element twice to...
Rectify typographical inaccuracies This PR addresses several typographical errors across various files in the project. The changes improve readability and maintain the professional standard of the documentation and code comments....
According the description of the algorithm, this shouldn't happen. Investigate
All of the the tests that run ClientIvc on noir "fold" programs have been preemptively disabled due to expected intermittent failure issues related to those seen elsewhere. (I never actually...
We need a mechanism to quickly check if transactions are bunk
Its inconvenient both for development and in practice to have a single set of fixed block sizes for the structuring. It would be nice for the structuring to be more...
The circuit size (required as a witness FF in the ZM recursive verifier) cannot be extracted from the transcript as an FF (bigfield) in the ECCVM recursive verifier. It is...
`batch_mul` may fail with only one input and this case can get hit unintentionally due to handling of points at infinity.
Constraints are currently not added when hashing in an Ultra arithmetized circuit (i.e. a recursive verifier). This was done for convenience since Ultra does not have poseidon.
Currently we generate log_n many gate challenges (the challenges used to construct the pow polynomial for sumcheck). For consistency with the constant honk proof size work, this would need to...