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

Remove pruning

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

14
src/fri/proof.rs
View File

@ -1,4 +1,4 @@
use std::collections::{HashMap, HashSet};
use std::collections::HashMap;
use itertools::izip;
use serde::{Deserialize, Serialize};
@ -264,17 +264,8 @@ impl<F: RichField + Extendable<D>, const D: usize> CompressedFriProof<F, D> {
})
.collect::<Vec<_>>();
let mut seen_indices = vec![HashSet::new(); num_reductions + 1];
for mut index in indices.iter().copied() {
let mut initial_trees_proof = query_round_proofs.initial_trees_proofs[&index].clone();
if !seen_indices[0].insert(index) {
initial_trees_proof
.evals_proofs
.iter_mut()
.for_each(|(_, p)| {
p.siblings = vec![];
});
}
for (i, (leaves_data, proof)) in
initial_trees_proof.evals_proofs.into_iter().enumerate()
{
@ -285,9 +276,6 @@ 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();
if !seen_indices[1 + i].insert(index) {
query_step.merkle_proof.siblings = vec![];
}
steps_indices[i].push(index);
steps_evals[i].push(flatten(&query_step.evals));
steps_proofs[i].push(query_step.merkle_proof);