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

Minor

Browse Source
This commit is contained in:
wborgeaud 2021-07-15 09:11:54 +02:00
parent becd0c969e
commit 0ba5916346
3 changed files with 3 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
src/fri/prover.rs
View File

@ -2,7 +2,6 @@ use crate::field::extension_field::{flatten, unflatten, Extendable};
use crate::field::field::Field;
use crate::fri::FriConfig;
use crate::hash::hash_n_to_1;
use crate::merkle_proofs::verify_merkle_proof;
use crate::merkle_tree::MerkleTree;
use crate::plonk_challenger::Challenger;
use crate::plonk_common::reduce_with_powers;
@ -140,9 +139,6 @@ fn fri_prover_query_round<F: Field + Extendable<D>, const D: usize>(
.iter()
.map(|t| (t.get(x_index).to_vec(), t.prove(x_index)))
.collect::<Vec<_>>();
for ((v, p), t) in initial_proof.iter().zip(initial_merkle_trees.iter()) {
verify_merkle_proof(v.clone(), x_index, t.root, p, false).unwrap();
}
for (i, tree) in trees.iter().enumerate() {
let arity_bits = config.reduction_arity_bits[i];
let arity = 1 << arity_bits;

1
src/polynomial/commitment.rs
View File

@ -321,6 +321,7 @@ mod tests {
use super::*;
use crate::circuit_data::CircuitConfig;
use crate::fri::FriConfig;
use crate::plonk_common::PlonkPolynomials;
fn gen_random_test_case<F: Field + Extendable<D>, const D: usize>(

7
src/recursive_verifier.rs
View File

@ -119,8 +119,6 @@ impl<F: Extendable<D>, const D: usize> CircuitBuilder<F, D> {
inner_common_data,
self,
);
dbg!(self.num_gates());
dbg!(self.generators.len());
}
}
@ -329,6 +327,7 @@ mod tests {
}
#[test]
#[ignore]
fn test_recursive_verifier() {
env_logger::init();
type F = CrandallField;
@ -351,7 +350,7 @@ mod tests {
let mut builder = CircuitBuilder::<F, D>::new(config.clone());
let two = builder.two();
let two = builder.hash_n_to_hash(vec![two], true).elements[0];
for i in 0..5000 {
for i in 0..1000 {
let two = builder.mul(two, two);
}
let data = builder.build();
@ -376,8 +375,6 @@ mod tests {
builder.add_recursive_verifier(pt, &config, &inner_data, &cd, &mut marked);
dbg!(builder.num_gates());
dbg!(builder.marked_targets.len());
let data = builder.build();
let recursive_proof = data.prove(pw);