From a04bed282d2b71df3042c64c185c9dfa6b36c229 Mon Sep 17 00:00:00 2001
From: Daniel Lubarov <daniel@lubarov.com>
Date: Thu, 13 May 2021 21:32:08 -0700
Subject: [PATCH] Use num_checks zetas

The soundness error is (degree of combined constraints)/|F|, so three zetas should be appropriate for all practical circuit sizes.
---
 src/prover.rs | 4 +---
 1 file changed, 1 insertion(+), 3 deletions(-)

diff --git a/src/prover.rs b/src/prover.rs
index 434d0084..cb2e963e 100644
--- a/src/prover.rs
+++ b/src/prover.rs
@@ -118,9 +118,7 @@ pub(crate) fn prove<F: Field>(
 
     challenger.observe_hash(&quotient_polys_commitment.merkle_tree.root);
 
-    // TODO: How many do we need?
-    let num_zetas = 2;
-    let zetas = challenger.get_n_challenges(num_zetas);
+    let zetas = challenger.get_n_challenges(config.num_checks);
 
     let (opening_proof, openings) = timed!(
         ListPolynomialCommitment::batch_open_plonk(