mirror of
https://github.com/logos-storage/plonky2.git
synced 2026-01-07 00:03:10 +00:00
Clippy
This commit is contained in:
parent
621c046fe4
commit
7d4e79f069
@ -2,7 +2,7 @@ use anyhow::{ensure, Result};
|
||||
|
||||
use crate::field::extension_field::{flatten, Extendable, FieldExtension, Frobenius};
|
||||
use crate::field::field::Field;
|
||||
use crate::field::lagrange::{barycentric_weights, interpolant, interpolate, interpolate2};
|
||||
use crate::field::lagrange::{barycentric_weights, interpolate, interpolate2};
|
||||
use crate::fri::FriConfig;
|
||||
use crate::hash::hash_n_to_1;
|
||||
use crate::merkle_proofs::verify_merkle_proof;
|
||||
|
||||
@ -4,7 +4,7 @@ use rayon::prelude::*;
|
||||
use crate::field::extension_field::Extendable;
|
||||
use crate::field::extension_field::{FieldExtension, Frobenius};
|
||||
use crate::field::field::Field;
|
||||
use crate::field::lagrange::{interpolant, interpolant2};
|
||||
use crate::field::lagrange::interpolant2;
|
||||
use crate::fri::{prover::fri_proof, verifier::verify_fri_proof, FriConfig};
|
||||
use crate::merkle_tree::MerkleTree;
|
||||
use crate::plonk_challenger::Challenger;
|
||||
@ -120,8 +120,6 @@ impl<F: Field> ListPolynomialCommitment<F> {
|
||||
.iter()
|
||||
.flat_map(|&i| &commitments[i].polynomials)
|
||||
.map(|p| p.to_extension());
|
||||
let single_os = [&os.constants, &os.plonk_s_sigmas, &os.quotient_polys];
|
||||
let single_evals = single_os.iter().flat_map(|v| v.iter());
|
||||
let single_composition_poly = reduce_polys_with_iter(single_polys, &mut alpha_powers);
|
||||
|
||||
let single_quotient = Self::compute_quotient1(zeta, single_composition_poly);
|
||||
|
||||
@ -26,7 +26,7 @@ impl<F: Field> PolynomialCoeffs<F> {
|
||||
.to_vec()
|
||||
.into();
|
||||
let mut q = rev_q.rev();
|
||||
let mut qb = &q * b;
|
||||
let qb = &q * b;
|
||||
let mut r = self - &qb;
|
||||
q.trim();
|
||||
r.trim();
|
||||
@ -59,8 +59,7 @@ impl<F: Field> PolynomialCoeffs<F> {
|
||||
quotient.coeffs[cur_q_degree] = cur_q_coeff;
|
||||
|
||||
for (i, &div_coeff) in b.coeffs.iter().enumerate() {
|
||||
remainder.coeffs[cur_q_degree + i] =
|
||||
remainder.coeffs[cur_q_degree + i] - (cur_q_coeff * div_coeff);
|
||||
remainder.coeffs[cur_q_degree + i] -= cur_q_coeff * div_coeff;
|
||||
}
|
||||
remainder.trim();
|
||||
}
|
||||
@ -97,7 +96,7 @@ impl<F: Field> PolynomialCoeffs<F> {
|
||||
let denominators = (0..a_eval.len())
|
||||
.map(|i| {
|
||||
if i != 0 {
|
||||
root_pow = root_pow * root_n;
|
||||
root_pow *= root_n;
|
||||
}
|
||||
denominator_g * root_pow - F::ONE
|
||||
})
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user