Added springproofs

Author: Maltesius

benches/perf.rs

@@ -26,7 +26,7 @@ fn apply_permutation_group(vec_a: Vec<G1Affine>, permutation: &Vec<u32>) -> Vec<
 fn benchmark_shuffle(c: &mut Criterion) {
     let mut rng = StdRng::seed_from_u64(0u64);
 
-    let N = 512;
+    let N = 84;
     let N_BLINDERS = 4;
     let ell = N - N_BLINDERS;
 

src/curdleproofs.rs

@@ -241,6 +241,8 @@ impl CurdleproofsProof {
             rng,
         )?;
 
+        println!("done1");
+
         // Step 3
         self.same_scalar_proof.verify(
             &crs.G_t,
@@ -253,6 +255,8 @@ impl CurdleproofsProof {
             &mut transcript,
         )?;
 
+        println!("done2");
+
         // Step 4
         let A_prime = self.A + self.cm_T.T_1 + self.cm_U.T_1;
 
@@ -288,6 +292,7 @@ impl CurdleproofsProof {
             &mut msm_accumulator,
             rng,
         )?;
+        println!("done3");
 
         // Finally check the correctness of R and S
         msm_accumulator.accumulate_check(&self.R, &vec_a, vec_R, rng);

src/grand_product_argument.rs

@@ -74,7 +74,8 @@ impl GrandProductProof {
 
         let vec_c_blinders = generate_blinders(rng, n_blinders); // vec_r_c in the paper
         let C = msm(crs_G_vec, &vec_c) + msm(crs_H_vec, &vec_c_blinders);
-
+        
+        
         // Compute r_p
         let vec_r_b_plus_alpha: Vec<Fr> =
             vec_b_blinders.iter().map(|r_b_i| *r_b_i + alpha).collect();
@@ -141,7 +142,7 @@ impl GrandProductProof {
         let inner_prod =
             r_p * beta.pow([(ell + 1) as u64]) + gprod_result * beta.pow([ell as u64]) - Fr::one();
 
-        vec_c.extend(vec_c_blinders);
+        vec_c.extend(&vec_c_blinders);
         vec_d.extend(vec_d_blinders);
 
         // Sanity checks