logos-storage/plonky2
1
0
Fork 0
mirror of https://github.com/logos-storage/plonky2.git synced 2026-05-28 20:59:26 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #857 from mir-protocol/non_tight_degree_bound

Browse Source 
Allow non-tight degree bound
This commit is contained in:
Daniel Lubarov 2023-01-03 22:29:45 -08:00 committed by GitHub
commit e4a5c2c968
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
3 changed files with 5 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -3,12 +3,12 @@ use alloc::vec::Vec;
use itertools::Itertools; use itertools::Itertools;
use maybe_rayon::*; use maybe_rayon::*;
use plonky2_field::types::Field;
use crate::field::extension::Extendable; use crate::field::extension::Extendable;
use crate::field::fft::FftRootTable; use crate::field::fft::FftRootTable;
use crate::field::packed::PackedField; use crate::field::packed::PackedField;
use crate::field::polynomial::{PolynomialCoeffs, PolynomialValues}; use crate::field::polynomial::{PolynomialCoeffs, PolynomialValues};
use crate::field::types::Field;
use crate::fri::proof::FriProof; use crate::fri::proof::FriProof;
use crate::fri::prover::fri_proof; use crate::fri::prover::fri_proof;
use crate::fri::structure::{FriBatchInfo, FriInstanceInfo}; use crate::fri::structure::{FriBatchInfo, FriInstanceInfo};
@ -189,13 +189,11 @@ impl<F: RichField + Extendable<D>, C: GenericConfig<D, F = F>, const D: usize>
&format!("reduce batch of {} polynomials", polynomials.len()), &format!("reduce batch of {} polynomials", polynomials.len()),
alpha.reduce_polys_base(polys_coeff) alpha.reduce_polys_base(polys_coeff)
); );
let quotient = composition_poly.divide_by_linear(*point); let mut quotient = composition_poly.divide_by_linear(*point);
quotient.coeffs.push(F::Extension::ZERO); // pad back to power of two
alpha.shift_poly(&mut final_poly); alpha.shift_poly(&mut final_poly);
final_poly += quotient; final_poly += quotient;
} }
// Multiply the final polynomial by `X`, so that `final_poly` has the maximum degree for
// which the LDT will pass. See github.com/mir-protocol/plonky2/pull/436 for details.
final_poly.coeffs.insert(0, F::Extension::ZERO);
let lde_final_poly = final_poly.lde(fri_params.config.rate_bits); let lde_final_poly = final_poly.lde(fri_params.config.rate_bits);
let lde_final_values = timed!( let lde_final_values = timed!(

4
plonky2/src/fri/recursive_verifier.rs
View File

@ -262,9 +262,7 @@ impl<F: RichField + Extendable<D>, const D: usize> CircuitBuilder<F, D> {
sum = self.div_add_extension(numerator, denominator, sum); sum = self.div_add_extension(numerator, denominator, sum);
} }
// Multiply the final polynomial by `X`, so that `final_poly` has the maximum degree for sum
// which the LDT will pass. See github.com/mir-protocol/plonky2/pull/436 for details.
self.mul_extension(sum, subgroup_x)
} }
fn fri_verifier_query_round<C: GenericConfig<D, F = F>>( fn fri_verifier_query_round<C: GenericConfig<D, F = F>>(

4
plonky2/src/fri/verifier.rs
View File

@ -157,9 +157,7 @@ pub(crate) fn fri_combine_initial<
sum += numerator / denominator; sum += numerator / denominator;
} }
// Multiply the final polynomial by `X`, so that `final_poly` has the maximum degree for sum
// which the LDT will pass. See github.com/mir-protocol/plonky2/pull/436 for details.
sum * subgroup_x
} }
fn fri_verifier_query_round< fn fri_verifier_query_round<