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

Useless mut

Browse Source
This commit is contained in:
wborgeaud 2021-10-04 10:09:17 +02:00
parent bbeb54c910
commit b4614991f7
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
src/fri/proof.rs
View File

@ -265,7 +265,7 @@ impl<F: RichField + Extendable<D>, const D: usize> CompressedFriProof<F, D> {
.collect::<Vec<_>>();
for mut index in indices.iter().copied() {
let mut initial_trees_proof = query_round_proofs.initial_trees_proofs[&index].clone();
let initial_trees_proof = query_round_proofs.initial_trees_proofs[&index].clone();
for (i, (leaves_data, proof)) in
initial_trees_proof.evals_proofs.into_iter().enumerate()
{
@ -275,7 +275,7 @@ impl<F: RichField + Extendable<D>, const D: usize> CompressedFriProof<F, D> {
}
for i in 0..num_reductions {
index >>= reduction_arity_bits[i];
let mut query_step = query_round_proofs.steps[i][&index].clone();
let query_step = query_round_proofs.steps[i][&index].clone();
steps_indices[i].push(index);
steps_evals[i].push(flatten(&query_step.evals));
steps_proofs[i].push(query_step.merkle_proof);