bellperson 0.27.0

zk-SNARK library
Documentation
use ff::{PrimeField, PrimeFieldBits};
use group::{
    Curve,
    prime::{PrimeCurve, PrimeCurveAffine},
};

use rayon::prelude::*;

pub fn get_mul_window_size(num_scalars: usize) -> usize {
    if num_scalars < 32 {
        3
    } else {
        (num_scalars as f64).ln().ceil() as usize
    }
}

pub fn get_window_table<T>(scalar_size: usize, window: usize, g: T) -> Vec<Vec<T::AffineRepr>>
where
    T: Curve,
    T::AffineRepr: Send,
{
    let in_window = 1 << window;
    let outerc = scalar_size.div_ceil(window);
    let last_in_window = 1 << (scalar_size - (outerc - 1) * window);

    let mut multiples_of_g = vec![vec![T::identity(); in_window]; outerc];

    let mut g_outer = g;
    let mut g_outers = Vec::with_capacity(outerc);
    for _ in 0..outerc {
        g_outers.push(g_outer);
        for _ in 0..window {
            g_outer = g_outer.double();
        }
    }
    multiples_of_g
        .par_iter_mut()
        .enumerate()
        .take(outerc)
        .zip(g_outers)
        .for_each(|((outer, multiples_of_g), g_outer)| {
            let cur_in_window = if outer == outerc - 1 {
                last_in_window
            } else {
                in_window
            };

            let mut g_inner = T::identity();
            for inner in multiples_of_g.iter_mut().take(cur_in_window) {
                *inner = g_inner;
                g_inner.add_assign(&g_outer);
            }
        });
    multiples_of_g
        .par_iter()
        .map(|s| s.iter().map(|s| s.to_affine()).collect())
        .collect()
}

pub fn windowed_mul<T>(
    outerc: usize,
    window: usize,
    multiples_of_g: &[Vec<T::Affine>],
    scalar: &T::Scalar,
) -> T
where
    T: PrimeCurve,
    T::Scalar: PrimeFieldBits,
{
    let modulus_size = <T::Scalar as PrimeField>::NUM_BITS as usize;
    let scalar_val: Vec<bool> = scalar.to_le_bits().into_iter().collect();

    let mut res = multiples_of_g[0][0].to_curve();
    for outer in 0..outerc {
        let mut inner = 0usize;
        for i in 0..window {
            if outer * window + i < modulus_size && scalar_val[outer * window + i] {
                inner |= 1 << i;
            }
        }
        res.add_assign(&multiples_of_g[outer][inner]);
    }
    res
}

pub fn multi_scalar_mul<T>(
    scalar_size: usize,
    window: usize,
    table: &[Vec<T::AffineRepr>],
    v: &[T::Scalar],
) -> Vec<T>
where
    T: PrimeCurve,
    T::Scalar: PrimeFieldBits,
{
    let outerc = scalar_size.div_ceil(window);
    assert!(outerc <= table.len());

    v.par_iter()
        .map(|e| windowed_mul::<T>(outerc, window, table, e))
        .collect::<Vec<_>>()
}