warnings

src/fri/mod.rs

@@ -36,8 +36,4 @@ impl FriParams {
     pub(crate) fn max_arity_bits(&self) -> Option<usize> {
         self.reduction_arity_bits.iter().copied().max()
     }
-
-    pub(crate) fn max_arity(&self) -> Option<usize> {
-        self.max_arity_bits().map(|bits| 1 << bits)
-    }
 }

src/gadgets/split_base.rs

@@ -29,10 +29,7 @@ impl<F: RichField + Extendable<D>, const D: usize> CircuitBuilder<F, D> {
 
     /// Takes an iterator of bits `(b_i)` and returns `sum b_i * 2^i`, i.e.,
     /// the number with little-endian bit representation given by `bits`.
-    pub(crate) fn le_sum(
+    pub(crate) fn le_sum(&mut self, bits: impl Iterator<Item = impl Borrow<BoolTarget>>) -> Target {
-        &mut self,
-        mut bits: impl Iterator<Item = impl Borrow<BoolTarget>>,
-    ) -> Target {
         let bits = bits.map(|b| *b.borrow()).collect_vec();
         let num_bits = bits.len();
         if num_bits == 0 {

src/plonk/recursive_verifier.rs

@@ -511,12 +511,12 @@ mod tests {
         CommonCircuitData<F, D>,
     )> {
         let mut builder = CircuitBuilder::<F, D>::new(config.clone());
-        for i in 0..num_dummy_gates {
+        for _ in 0..num_dummy_gates {
             builder.add_gate(NoopGate, vec![]);
         }
 
         let data = builder.build();
-        let mut inputs = PartialWitness::new();
+        let inputs = PartialWitness::new();
         let proof = data.prove(inputs)?;
         data.verify(proof.clone())?;