zec
/
halo2
mirror of https://github.com/zcash/halo2.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Remove use of parallelize() from multiopen::prover

This commit is contained in:
therealyingtong 2020-10-14 08:16:14 +08:00
parent 742c15bb51
commit 2f7b46ffa1
1 changed files with 7 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

23
src/poly/multiopen/prover.rs
View File

@ -5,8 +5,8 @@ use super::super::{
use super::{Proof, ProverQuery};
use crate::arithmetic::{
eval_polynomial, get_challenge_scalar, kate_division, lagrange_interpolate, parallelize,
Challenge, Curve, CurveAffine, Field,
eval_polynomial, get_challenge_scalar, kate_division, lagrange_interpolate, Challenge, Curve,
CurveAffine, Field,
};
use crate::plonk::hash_point;
use crate::transcript::Hasher;
@ -53,20 +53,11 @@ impl<C: CurveAffine> Proof<C> {
new_poly: &Polynomial<C::Scalar, Coeff>,
blind: Blind<C::Scalar>,
evals: Vec<C::Scalar>| {
q_polys[set_idx]
.as_mut()
.map(|poly| {
parallelize(poly, |q, start| {
for (q, a) in q.iter_mut().zip(new_poly[start..].iter()) {
*q *= &x_4;
*q += a;
}
});
})
.or_else(|| {
q_polys[set_idx] = Some(new_poly.clone());
Some(())
});
if let Some(poly) = &q_polys[set_idx] {
q_polys[set_idx] = Some(poly.clone() * x_4 + new_poly);
} else {
q_polys[set_idx] = Some(new_poly.clone());
}
q_blinds[set_idx] *= x_4;
q_blinds[set_idx] += blind;
// Each polynomial is evaluated at a set of points. For each set,