logos-storage/plonky2
1
0
Fork 0
mirror of https://github.com/logos-storage/plonky2.git synced 2026-01-08 00:33:06 +00:00
Code Issues Packages Projects Releases Wiki Activity

Unsuppress warnings

Browse Source
This commit is contained in:
Daniel Lubarov 2022-08-06 22:27:17 -04:00
parent 1e5383c63d
commit 385a990c50
5 changed files with 7 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
evm/src/keccak/keccak_stark.rs
View File

@ -194,7 +194,6 @@ impl<F: RichField + Extendable<D>, const D: usize> KeccakStark<F, D> {
} }
pub fn generate_trace(&self, inputs: Vec<[u64; NUM_INPUTS]>) -> Vec<PolynomialValues<F>> { pub fn generate_trace(&self, inputs: Vec<[u64; NUM_INPUTS]>) -> Vec<PolynomialValues<F>> {
#[allow(unused_mut)]
let mut timing = TimingTree::new("generate trace", log::Level::Debug); let mut timing = TimingTree::new("generate trace", log::Level::Debug);
// Generate the witness, except for permuted columns in the lookup argument. // Generate the witness, except for permuted columns in the lookup argument.

1
evm/src/memory/memory_stark.rs
View File

@ -192,7 +192,6 @@ impl<F: RichField + Extendable<D>, const D: usize> MemoryStark<F, D> {
} }
pub(crate) fn generate_trace(&self, memory_ops: Vec<MemoryOp>) -> Vec<PolynomialValues<F>> { pub(crate) fn generate_trace(&self, memory_ops: Vec<MemoryOp>) -> Vec<PolynomialValues<F>> {
#[allow(unused_mut)]
let mut timing = TimingTree::new("generate trace", log::Level::Debug); let mut timing = TimingTree::new("generate trace", log::Level::Debug);
// Generate most of the trace in row-major form. // Generate most of the trace in row-major form.

8
plonky2/src/fri/oracle.rs
View File

@ -71,7 +71,7 @@ impl<F: RichField + Extendable<D>, C: GenericConfig<D, F = F>, const D: usize>
rate_bits: usize, rate_bits: usize,
blinding: bool, blinding: bool,
cap_height: usize, cap_height: usize,
_timing: &mut TimingTree, timing: &mut TimingTree,
fft_root_table: Option<&FftRootTable<F>>, fft_root_table: Option<&FftRootTable<F>>,
) -> Self ) -> Self
where where
@ -79,15 +79,15 @@ impl<F: RichField + Extendable<D>, C: GenericConfig<D, F = F>, const D: usize>
{ {
let degree = polynomials[0].len(); let degree = polynomials[0].len();
let lde_values = timed!( let lde_values = timed!(
_timing, timing,
"FFT + blinding", "FFT + blinding",
Self::lde_values(&polynomials, rate_bits, blinding, fft_root_table) Self::lde_values(&polynomials, rate_bits, blinding, fft_root_table)
); );
let mut leaves = timed!(_timing, "transpose LDEs", transpose(&lde_values)); let mut leaves = timed!(timing, "transpose LDEs", transpose(&lde_values));
reverse_index_bits_in_place(&mut leaves); reverse_index_bits_in_place(&mut leaves);
let merkle_tree = timed!( let merkle_tree = timed!(
_timing, timing,
"build Merkle tree", "build Merkle tree",
MerkleTree::new(leaves, cap_height) MerkleTree::new(leaves, cap_height)
); );

6
plonky2/src/fri/prover.rs
View File

@ -23,7 +23,7 @@ pub fn fri_proof<F: RichField + Extendable<D>, C: GenericConfig<D, F = F>, const
lde_polynomial_values: PolynomialValues<F::Extension>, lde_polynomial_values: PolynomialValues<F::Extension>,
challenger: &mut Challenger<F, C::Hasher>, challenger: &mut Challenger<F, C::Hasher>,
fri_params: &FriParams, fri_params: &FriParams,
_timing: &mut TimingTree, timing: &mut TimingTree,
) -> FriProof<F, C::Hasher, D> ) -> FriProof<F, C::Hasher, D>
where where
[(); C::Hasher::HASH_SIZE]:, [(); C::Hasher::HASH_SIZE]:,
@ -33,7 +33,7 @@ where
// Commit phase // Commit phase
let (trees, final_coeffs) = timed!( let (trees, final_coeffs) = timed!(
_timing, timing,
"fold codewords in the commitment phase", "fold codewords in the commitment phase",
fri_committed_trees::<F, C, D>( fri_committed_trees::<F, C, D>(
lde_polynomial_coeffs, lde_polynomial_coeffs,
@ -46,7 +46,7 @@ where
// PoW phase // PoW phase
let current_hash = challenger.get_hash(); let current_hash = challenger.get_hash();
let pow_witness = timed!( let pow_witness = timed!(
_timing, timing,
"find proof-of-work witness", "find proof-of-work witness",
fri_proof_of_work::<F, C, D>(current_hash, &fri_params.config) fri_proof_of_work::<F, C, D>(current_hash, &fri_params.config)
); );

1
system_zero/src/system_zero.rs
View File

@ -69,7 +69,6 @@ impl<F: RichField + Extendable<D>, const D: usize> SystemZero<F, D> {
} }
pub fn generate_trace(&self) -> Vec<PolynomialValues<F>> { pub fn generate_trace(&self) -> Vec<PolynomialValues<F>> {
#[allow(unused_mut)]
let mut timing = TimingTree::new("generate trace", log::Level::Debug); let mut timing = TimingTree::new("generate trace", log::Level::Debug);
// Generate the witness, except for permuted columns in the lookup argument. // Generate the witness, except for permuted columns in the lookup argument.