Skip to content

Commit

Permalink
Update prover.rs
Browse files Browse the repository at this point in the history
  • Loading branch information
AlekseiVambol authored Mar 3, 2024
1 parent 840da81 commit 540427f
Showing 1 changed file with 4 additions and 4 deletions.
8 changes: 4 additions & 4 deletions halo2_proofs/src/plonk/mv_lookup/prover.rs
Original file line number Diff line number Diff line change
Expand Up @@ -143,14 +143,14 @@ impl<F: WithSmallOrderMulGroup<3> + Ord> Argument<F> {
.collect::<Vec<_>>();
assert_eq!(invalid_ms.len(), blinding_factors);
for mi in invalid_ms {
assert_eq!(*mi, C::Scalar::zero());
assert_eq!(*mi, C::Scalar::ZERO);
}

// check sums
let alpha = C::Scalar::random(&mut rng);
let cs_input_sum =
|compressed_input_expression: &Polynomial<C::Scalar, LagrangeCoeff>| {
let mut lhs_sum = C::Scalar::zero();
let mut lhs_sum = C::Scalar::ZERO;
for &fi in compressed_input_expression
.iter()
.take(params.n() as usize - blinding_factors - 1)
Expand All @@ -161,13 +161,13 @@ impl<F: WithSmallOrderMulGroup<3> + Ord> Argument<F> {
lhs_sum
};

let mut lhs_sum = C::Scalar::zero();
let mut lhs_sum = C::Scalar::ZERO;

for compressed_input_expression in compressed_inputs_expressions.iter() {
lhs_sum += cs_input_sum(compressed_input_expression);
}

let mut rhs_sum = C::Scalar::zero();
let mut rhs_sum = C::Scalar::ZERO;
for (&ti, &mi) in compressed_table_expression.iter().zip(m_values.iter()) {
rhs_sum += mi * (ti + alpha).invert().unwrap();
}
Expand Down

0 comments on commit 540427f

Please sign in to comment.