From fbeedd47d36258a99448aaa2012d338c0130dd7a Mon Sep 17 00:00:00 2001
From: wborgeaud <williamborgeaud@gmail.com>
Date: Tue, 20 Jul 2021 11:02:22 +0200
Subject: [PATCH] Minor

---
 src/fri/recursive_verifier.rs | 2 +-
 src/fri/verifier.rs           | 4 ++--
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/src/fri/recursive_verifier.rs b/src/fri/recursive_verifier.rs
index fb18c515..7ca8c739 100644
--- a/src/fri/recursive_verifier.rs
+++ b/src/fri/recursive_verifier.rs
@@ -112,7 +112,7 @@ impl<F: Extendable<D>, const D: usize> CircuitBuilder<F, D> {
         );
 
         let precomputed_reduced_evals =
-            PrecomputedReducedEvalsTarget::from_os_and_alpha(&os, alpha, self);
+            PrecomputedReducedEvalsTarget::from_os_and_alpha(os, alpha, self);
         for round_proof in &proof.query_round_proofs {
             self.fri_verifier_query_round(
                 zeta,
diff --git a/src/fri/verifier.rs b/src/fri/verifier.rs
index 59750373..22e0f24c 100644
--- a/src/fri/verifier.rs
+++ b/src/fri/verifier.rs
@@ -8,7 +8,7 @@ use crate::fri::FriConfig;
 use crate::hash::hash_n_to_1;
 use crate::merkle_proofs::verify_merkle_proof;
 use crate::plonk_challenger::Challenger;
-use crate::plonk_common::{reduce_with_powers, PlonkPolynomials};
+use crate::plonk_common::PlonkPolynomials;
 use crate::proof::{FriInitialTreeProof, FriProof, FriQueryRound, Hash, OpeningSet};
 use crate::util::scaling::ReducingFactor;
 use crate::util::{log2_strict, reverse_bits, reverse_index_bits_in_place};
@@ -112,7 +112,7 @@ pub fn verify_fri_proof<F: Field + Extendable<D>, const D: usize>(
         "Number of reductions should be non-zero."
     );
 
-    let precomputed_reduced_evals = PrecomputedReducedEvals::from_os_and_alpha(&os, alpha);
+    let precomputed_reduced_evals = PrecomputedReducedEvals::from_os_and_alpha(os, alpha);
     for round_proof in &proof.query_round_proofs {
         fri_verifier_query_round(
             zeta,