Minor

src/fri/commitment.rs

@@ -288,7 +288,6 @@ mod tests {
             config: CircuitConfig {
                 fri_config,
                 num_routed_wires: 6,
-                zero_knowledge: true,
                 ..CircuitConfig::large_config()
             },
             degree_bits,

src/gadgets/arithmetic_extension.rs

@@ -13,6 +13,9 @@ use crate::plonk::circuit_builder::CircuitBuilder;
 use crate::util::bits_u64;
 
 impl<F: Extendable<D>, const D: usize> CircuitBuilder<F, D> {
+    /// Finds the last available arithmetic gate with the given constants or add one if there aren't any.
+    /// Returns `(g,i)` such that there is an arithmetic gate with the given constants at index
+    /// `g` and the gate's `i`-th operation is available.
     fn find_arithmetic_gate(&mut self, const_0: F, const_1: F) -> (usize, usize) {
         let (gate, i) = self
             .free_arithmetic

src/gates/arithmetic.rs

@@ -108,7 +108,7 @@ impl<F: Extendable<D>, const D: usize> Gate<F, D> for ArithmeticExtensionGate<D>
         gate_index: usize,
         local_constants: &[F],
     ) -> Vec<Box<dyn WitnessGenerator<F>>> {
-        (0..4)
+        (0..NUM_ARITHMETIC_OPS)
             .map(|i| {
                 let g: Box<dyn WitnessGenerator<F>> = Box::new(ArithmeticExtensionGenerator {
                     gate_index,

src/plonk/copy_constraint.rs

@@ -1,7 +1,6 @@
 use crate::iop::target::Target;
 
 /// A named copy constraint.
-#[derive(Debug)]
 pub struct CopyConstraint {
     pub pair: (Target, Target),
     pub name: String,