From c684193033d339d858170faf8cc67a13f99358eb Mon Sep 17 00:00:00 2001 From: Daniel Lubarov Date: Fri, 23 Apr 2021 09:24:01 -0700 Subject: [PATCH] Rename a couple vars --- src/field/fft.rs | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/src/field/fft.rs b/src/field/fft.rs index fe3d2117..af7a42f6 100644 --- a/src/field/fft.rs +++ b/src/field/fft.rs @@ -41,10 +41,10 @@ pub fn fft(poly: PolynomialCoeffs) -> PolynomialValues { } pub(crate) fn fft_precompute(degree: usize) -> FftPrecomputation { - let degree_pow = log2_ceil(degree); + let degree_log = log2_ceil(degree); let mut subgroups_rev = Vec::new(); - for i in 0..=degree_pow { + for i in 0..=degree_log { let g_i = F::primitive_root_of_unity(i); let subgroup = F::cyclic_subgroup_known_order(g_i, 1 << i); let subgroup_rev = reverse_index_bits(subgroup); @@ -89,14 +89,14 @@ pub(crate) fn fft_with_precomputation_power_of_2( ); let half_degree = poly.len() >> 1; - let degree_pow = poly.log_len(); + let degree_log = poly.log_len(); // In the base layer, we're just evaluating "degree 0 polynomials", i.e. the coefficients // themselves. let PolynomialCoeffs { coeffs } = poly; let mut evaluations = reverse_index_bits(coeffs); - for i in 1..=degree_pow { + for i in 1..=degree_log { // In layer i, we're evaluating a series of polynomials, each at 2^i points. In practice // we evaluate a pair of points together, so we have 2^(i - 1) pairs. let points_per_poly = 1 << i; @@ -198,9 +198,9 @@ mod tests { coefficients: &PolynomialCoeffs, ) -> PolynomialValues { let degree = coefficients.len(); - let degree_pow = log2_strict(degree); + let degree_log = log2_strict(degree); - let g = F::primitive_root_of_unity(degree_pow); + let g = F::primitive_root_of_unity(degree_log); let powers_of_g = F::cyclic_subgroup_known_order(g, degree); let values = powers_of_g