wip

0xPolygonZero · Nov 9, 2024 · 104ed57 · 104ed57
1 parent d94800f
commit 104ed57
Show file tree

Hide file tree

Showing 2 changed files with 4 additions and 5 deletions.
diff --git a/plonky2/src/fri/recursive_verifier.rs b/plonky2/src/fri/recursive_verifier.rs
@@ -215,6 +215,8 @@ impl<F: RichField + Extendable<D>, const D: usize> CircuitBuilder<F, D> {
             self.fri_verify_proof_of_work(challenges.fri_pow_response, &params.config)
         );
 
+        return;
+
         // Check that parameters are coherent.
         debug_assert_eq!(
             params.config.num_query_rounds,

diff --git a/starky/src/fibonacci_stark.rs b/starky/src/fibonacci_stark.rs
@@ -277,7 +277,7 @@ mod tests {
         let min_degree_bits_to_support = 7;
         let verifier_degree_bits = 14;
         let degree_bits = min_degree_bits_to_support..=verifier_degree_bits;
-        let fri_params = stark_config.fri_params(verifier_degree_bits);
+        let verifier_fri_params = stark_config.fri_params(verifier_degree_bits);
 
         // Generate STARK proofs for each degree in `degree_bits`
         let proofs: Vec<_> = degree_bits
@@ -294,16 +294,13 @@ mod tests {
                     &stark_config,
                     trace,
                     &public_inputs,
-                    Some(fri_params.clone()),
+                    Some(verifier_fri_params.clone()),
                     &mut TimingTree::default(),
                 )
                 .unwrap()
             })
             .collect();
 
-        // dbg!(proofs[0].clone());
-        // dbg!(proofs[7].clone());
-
         // Configure the circuit for recursive verification
         let num_rows = 1 << verifier_degree_bits;
         let stark = S::new(num_rows);