From c16d93ab334f80ab906a87be2380437c5ea6d96a Mon Sep 17 00:00:00 2001
From: wborgeaud <williamborgeaud@gmail.com>
Date: Fri, 23 Jul 2021 17:31:00 +0200
Subject: [PATCH] scaling.rs -> reducing.rs

---
 src/fri/recursive_verifier.rs        | 2 +-
 src/fri/verifier.rs                  | 2 +-
 src/polynomial/commitment.rs         | 2 +-
 src/recursive_verifier.rs            | 2 +-
 src/util/mod.rs                      | 2 +-
 src/util/{scaling.rs => reducing.rs} | 0
 src/vanishing_poly.rs                | 2 +-
 7 files changed, 6 insertions(+), 6 deletions(-)
 rename src/util/{scaling.rs => reducing.rs} (100%)

diff --git a/src/fri/recursive_verifier.rs b/src/fri/recursive_verifier.rs
index 628b7861..50dded85 100644
--- a/src/fri/recursive_verifier.rs
+++ b/src/fri/recursive_verifier.rs
@@ -11,7 +11,7 @@ use crate::proof::{
     FriInitialTreeProofTarget, FriProofTarget, FriQueryRoundTarget, HashTarget, OpeningSetTarget,
 };
 use crate::target::Target;
-use crate::util::scaling::ReducingFactorTarget;
+use crate::util::reducing::ReducingFactorTarget;
 use crate::util::{log2_strict, reverse_index_bits_in_place};
 
 impl<F: Extendable<D>, const D: usize> CircuitBuilder<F, D> {
diff --git a/src/fri/verifier.rs b/src/fri/verifier.rs
index 27e775e6..8417dac1 100644
--- a/src/fri/verifier.rs
+++ b/src/fri/verifier.rs
@@ -10,7 +10,7 @@ use crate::merkle_proofs::verify_merkle_proof;
 use crate::plonk_challenger::Challenger;
 use crate::plonk_common::PlonkPolynomials;
 use crate::proof::{FriInitialTreeProof, FriProof, FriQueryRound, Hash, OpeningSet};
-use crate::util::scaling::ReducingFactor;
+use crate::util::reducing::ReducingFactor;
 use crate::util::{log2_strict, reverse_bits, reverse_index_bits_in_place};
 
 /// Computes P'(x^arity) from {P(x*g^i)}_(i=0..arity), where g is a `arity`-th root of unity
diff --git a/src/polynomial/commitment.rs b/src/polynomial/commitment.rs
index 356cd976..a2c9001b 100644
--- a/src/polynomial/commitment.rs
+++ b/src/polynomial/commitment.rs
@@ -15,7 +15,7 @@ use crate::plonk_common::PlonkPolynomials;
 use crate::polynomial::polynomial::{PolynomialCoeffs, PolynomialValues};
 use crate::proof::{FriProof, FriProofTarget, Hash, HashTarget, OpeningSet, OpeningSetTarget};
 use crate::timed;
-use crate::util::scaling::ReducingFactor;
+use crate::util::reducing::ReducingFactor;
 use crate::util::{log2_ceil, log2_strict, reverse_bits, reverse_index_bits_in_place, transpose};
 
 /// Two (~64 bit) field elements gives ~128 bit security.
diff --git a/src/recursive_verifier.rs b/src/recursive_verifier.rs
index c4d2cba0..7cf37895 100644
--- a/src/recursive_verifier.rs
+++ b/src/recursive_verifier.rs
@@ -4,7 +4,7 @@ use crate::context;
 use crate::field::extension_field::Extendable;
 use crate::plonk_challenger::RecursiveChallenger;
 use crate::proof::{HashTarget, ProofWithPublicInputsTarget};
-use crate::util::scaling::ReducingFactorTarget;
+use crate::util::reducing::ReducingFactorTarget;
 use crate::vanishing_poly::eval_vanishing_poly_recursively;
 use crate::vars::EvaluationTargets;
 
diff --git a/src/util/mod.rs b/src/util/mod.rs
index 83a97881..9176563a 100644
--- a/src/util/mod.rs
+++ b/src/util/mod.rs
@@ -1,6 +1,6 @@
 pub mod marking;
 pub mod partial_products;
-pub mod scaling;
+pub mod reducing;
 pub(crate) mod timing;
 
 use crate::field::field::Field;
diff --git a/src/util/scaling.rs b/src/util/reducing.rs
similarity index 100%
rename from src/util/scaling.rs
rename to src/util/reducing.rs
diff --git a/src/vanishing_poly.rs b/src/vanishing_poly.rs
index 540ab86b..e3e4284c 100644
--- a/src/vanishing_poly.rs
+++ b/src/vanishing_poly.rs
@@ -9,7 +9,7 @@ use crate::plonk_common;
 use crate::plonk_common::{eval_l_1_recursively, ZeroPolyOnCoset};
 use crate::target::Target;
 use crate::util::partial_products::{check_partial_products, check_partial_products_recursively};
-use crate::util::scaling::ReducingFactorTarget;
+use crate::util::reducing::ReducingFactorTarget;
 use crate::vars::{EvaluationTargets, EvaluationVars, EvaluationVarsBase};
 
 /// Evaluate the vanishing polynomial at `x`. In this context, the vanishing polynomial is a random