-
# 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…
-
`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
…
-
You can reproduce this issue by running cmd in the branch of #368.
```
RAYON_NUM_THREADS=64 RUST_LOG=debug cargo run --release --example fibonacci_elf -- --nocapture
```
The prover hangs when it…
-
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…
-
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 includes:
- [ ] Compute `gamma` and `beta` from the transcript
- [ ] Compute step 3 (Sumcheck Proof) inside of the folding fn in `NIMFS`.
- [ ] Put the steps of folding in the right order
-
## Background
**Definition**
- **Verifiable outsourced computation**: designing protocols where it is impossible for a provider to cheat.
- **Incentive-based verifiable computation**: cheating is…
-
I substituted the 673 line in `hyperplonk/src/snark.rs` with
```rust
let permutation = vec![
E::ScalarField::from(1u128),
E::ScalarField::from(2u128),
E::ScalarField::from(3u128),
…
-
Maybe I don't understand it correctly, does the part of the code that uses the Virgo poly-commitment just commit to the input of the circuit? I don't see anything about the "zk-sumcheck" with mask-pol…