From eb27a2d2b2937c550a33bd89da13e95c0c734dce Mon Sep 17 00:00:00 2001 From: Daniel Lubarov Date: Tue, 16 Nov 2021 22:51:38 -0800 Subject: [PATCH] warnings --- src/fri/mod.rs | 4 ---- src/gadgets/split_base.rs | 5 +---- src/plonk/recursive_verifier.rs | 4 ++-- 3 files changed, 3 insertions(+), 10 deletions(-) diff --git a/src/fri/mod.rs b/src/fri/mod.rs index 2419b06b..bfb2ebfd 100644 --- a/src/fri/mod.rs +++ b/src/fri/mod.rs @@ -36,8 +36,4 @@ impl FriParams { pub(crate) fn max_arity_bits(&self) -> Option { self.reduction_arity_bits.iter().copied().max() } - - pub(crate) fn max_arity(&self) -> Option { - self.max_arity_bits().map(|bits| 1 << bits) - } } diff --git a/src/gadgets/split_base.rs b/src/gadgets/split_base.rs index d60324ce..ade2ab0c 100644 --- a/src/gadgets/split_base.rs +++ b/src/gadgets/split_base.rs @@ -29,10 +29,7 @@ impl, const D: usize> CircuitBuilder { /// 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( - &mut self, - mut bits: impl Iterator>, - ) -> Target { + pub(crate) fn le_sum(&mut self, bits: impl Iterator>) -> Target { let bits = bits.map(|b| *b.borrow()).collect_vec(); let num_bits = bits.len(); if num_bits == 0 { diff --git a/src/plonk/recursive_verifier.rs b/src/plonk/recursive_verifier.rs index 147b585e..7e5a91a3 100644 --- a/src/plonk/recursive_verifier.rs +++ b/src/plonk/recursive_verifier.rs @@ -511,12 +511,12 @@ mod tests { CommonCircuitData, )> { let mut builder = CircuitBuilder::::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())?;