-
Angus Gruen mentions some tricks [here](https://eprint.iacr.org/2024/108.pdf) – notably in section 3.2
-
When trying to build BB:
```sh
cd ./aztec-packages/barretenberg/cpp/
cmake --preset default -DCMAKE_BUILD_TYPE=RelWithAssert
cmake --build --preset default --target bb
```
There is one **ASS…
-
The ongoing work implementing batched Spartan introduces a lot of code duplication, and made some existing duplication more apparent.
## Generalize use of `SumcheckEngine`
The `SumcheckEngine`…
-
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 `batched_poly_u…
-
The final batching sumcheck of `Snark::prove` is unneeded for us as we only need to support R1CS rather than Relaxed R1CS. This final sumcheck accounts for **~25% of Spartan e2e** prover time.
We c…
-
`Sumcheck::prove_cubic_with_additive_term` seems suboptimal. Currently it takes **~6% of Spartan e2e** time.
https://github.com/a16z/Spartan2/blob/uniform_r1cs_shape/src/spartan/sumcheck.rs#L251
…
-
# Motivation
We currently store too many preprocessed polynomials in the proving key, like `ID_1, ID_2, ID_3`, and `L_FIRST` and `L_LAST`.
All of these can be efficiently evaluatable by the verif…
-
Hello,
First of all thank you for this great crate, it's really helping me a lot.
I had a remark concerning the latest version of the crate available on github. When I try to use it and build my…
-
`ark-bcs` is almost done. While univariate sumcheck is IP, we can still use the transcript by implementing `ark-bcs::iop::IOPProver`.
Also, write constraints for sumcheck (should not be too much w…
-
This issue is just to remark a useful variant of Marlin with the property of commit-and-prove. Basically, the verifier does not know the input but instead obtains a commitment of the input. Later, sep…