logos-storage/plonky2
1
0
Fork 0
mirror of https://github.com/logos-storage/plonky2.git synced 2026-04-18 17:43:14 +00:00
Code Issues Packages Projects Releases Wiki Activity

Small optimization

Browse Source
This commit is contained in:
wborgeaud 2022-02-08 18:24:28 +01:00
parent ae330ff6a7
commit 101b3bac64
1 changed files with 4 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
starky/src/recursive_verifier.rs
View File

@ -86,8 +86,10 @@ fn verify_stark_proof_with_challenges<
.try_into() .try_into()
.unwrap(), .unwrap(),
}; };
let zeta_pow_deg = builder.exp_power_of_2_extension(challenges.stark_zeta, degree_bits);
let z_h_zeta = builder.sub_extension(zeta_pow_deg, one);
let (l_1, l_last) = let (l_1, l_last) =
eval_l_1_and_l_last_recursively(builder, degree_bits, challenges.stark_zeta); eval_l_1_and_l_last_recursively(builder, degree_bits, challenges.stark_zeta, z_h_zeta);
let last = let last =
builder.constant_extension(F::Extension::primitive_root_of_unity(degree_bits).inverse()); builder.constant_extension(F::Extension::primitive_root_of_unity(degree_bits).inverse());
let z_last = builder.sub_extension(challenges.stark_zeta, last); let z_last = builder.sub_extension(challenges.stark_zeta, last);
@ -103,9 +105,7 @@ fn verify_stark_proof_with_challenges<
// Check each polynomial identity, of the form `vanishing(x) = Z_H(x) quotient(x)`, at zeta. // Check each polynomial identity, of the form `vanishing(x) = Z_H(x) quotient(x)`, at zeta.
let quotient_polys_zeta = &proof.openings.quotient_polys; let quotient_polys_zeta = &proof.openings.quotient_polys;
let zeta_pow_deg = builder.exp_power_of_2_extension(challenges.stark_zeta, degree_bits);
let mut scale = ReducingFactorTarget::new(zeta_pow_deg); let mut scale = ReducingFactorTarget::new(zeta_pow_deg);
let z_h_zeta = builder.sub_extension(zeta_pow_deg, one);
for (i, chunk) in quotient_polys_zeta for (i, chunk) in quotient_polys_zeta
.chunks(stark.quotient_degree_factor()) .chunks(stark.quotient_degree_factor())
.enumerate() .enumerate()
@ -138,12 +138,11 @@ fn eval_l_1_and_l_last_recursively<F: RichField + Extendable<D>, const D: usize>
builder: &mut CircuitBuilder<F, D>, builder: &mut CircuitBuilder<F, D>,
log_n: usize, log_n: usize,
x: ExtensionTarget<D>, x: ExtensionTarget<D>,
z_x: ExtensionTarget<D>,
) -> (ExtensionTarget<D>, ExtensionTarget<D>) { ) -> (ExtensionTarget<D>, ExtensionTarget<D>) {
let n = builder.constant_extension(F::Extension::from_canonical_usize(1 << log_n)); let n = builder.constant_extension(F::Extension::from_canonical_usize(1 << log_n));
let g = builder.constant_extension(F::Extension::primitive_root_of_unity(log_n)); let g = builder.constant_extension(F::Extension::primitive_root_of_unity(log_n));
let x_pow_n = builder.exp_power_of_2_extension(x, log_n);
let one = builder.one_extension(); let one = builder.one_extension();
let z_x = builder.sub_extension(x_pow_n, one);
let l_1_deno = builder.mul_sub_extension(n, x, n); let l_1_deno = builder.mul_sub_extension(n, x, n);
let l_last_deno = builder.mul_sub_extension(g, x, one); let l_last_deno = builder.mul_sub_extension(g, x, one);
let l_last_deno = builder.mul_extension(n, l_last_deno); let l_last_deno = builder.mul_extension(n, l_last_deno);