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

PR feedback

Browse Source
This commit is contained in:
wborgeaud 2021-07-22 06:50:07 +02:00
parent db0121d74a
commit be2e870aee
3 changed files with 6 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
src/fri/recursive_verifier.rs
View File

@ -40,14 +40,14 @@ impl<F: Extendable<D>, const D: usize> CircuitBuilder<F, D> {
// TODO: Once the exponentiation gate lands, we won't need the bits and will be able to compute
// `g^(arity-rev_old_x_index)` directly.
let start = self.exp_from_complement_bits(gt, &old_x_index_bits);
let start = self.mul_many(&[start, gt, x]);
let coset_start = self.mul_many(&[start, gt, x]);
// The answer is gotten by interpolating {(x*g^i, P(x*g^i))} and evaluating at beta.
let points = g
.powers()
.map(|y| {
let yt = self.constant(y);
self.mul(start, yt)
self.mul(coset_start, yt)
})
.zip(evals)
.collect::<Vec<_>>();

4
src/fri/verifier.rs
View File

@ -31,12 +31,12 @@ fn compute_evaluation<F: Field + Extendable<D>, const D: usize>(
let mut evals = last_evals.to_vec();
reverse_index_bits_in_place(&mut evals);
let rev_old_x_index = reverse_bits(old_x_index, arity_bits);
let start = x * g.exp((arity - rev_old_x_index) as u64);
let coset_start = x * g.exp((arity - rev_old_x_index) as u64);
// The answer is gotten by interpolating {(x*g^i, P(x*g^i))} and evaluating at beta.
let points = g
.powers()
.zip(evals)
.map(|(y, e)| ((start * y).into(), e))
.map(|(y, e)| ((coset_start * y).into(), e))
.collect::<Vec<_>>();
let barycentric_weights = barycentric_weights(&points);
interpolate(&points, beta, &barycentric_weights)

2
src/gadgets/arithmetic.rs
View File

@ -174,6 +174,7 @@ impl<F: Extendable<D>, const D: usize> CircuitBuilder<F, D> {
let mut product = self.one();
for &bit in exponent_bits {
// TODO: Add base field select.
let current_ext = self.convert_to_ext(current);
let multiplicand = self.select(bit, current_ext, one_ext);
product = self.mul(product, multiplicand.0[0]);
@ -193,6 +194,7 @@ impl<F: Extendable<D>, const D: usize> CircuitBuilder<F, D> {
for &bit in exponent_bits {
let current_ext = self.convert_to_ext(current);
// TODO: Add base field select.
let multiplicand = self.select(bit, one_ext, current_ext);
product = self.mul(product, multiplicand.0[0]);
current = self.mul(current, current);