provekit-whir 0.1.1

An implementation of the WHIR polynomial commitment scheme
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44

use ark_ff::Field;

use super::{Evaluate, LinearForm};
use crate::algebra::{mixed_dot, multilinear_extend, scalar_mul_add, Embedding};

/// Linear form as an explicit covector over the field.
#[derive(Clone, Debug, PartialEq, Eq, Default)]
pub struct Covector<F: Field> {
    pub vector: Vec<F>,
}

impl<F: Field> LinearForm<F> for Covector<F> {
    fn size(&self) -> usize {
        self.vector.len()
    }

    fn mle_evaluate(&self, point: &[F]) -> F {
        multilinear_extend(&self.vector, point)
    }

    fn accumulate(&self, accumulator: &mut [F], scalar: F) {
        scalar_mul_add(accumulator, scalar, &self.vector);
    }
}

impl<F: Field> Covector<F> {
    pub const fn new(vector: Vec<F>) -> Self {
        Self { vector }
    }

    /// Any [`LinearForm<F>`] can be converted to a [`Covector<F>`].
    pub fn from(linear_form: &dyn LinearForm<F>) -> Self {
        let mut vector = vec![F::ZERO; linear_form.size()];
        linear_form.accumulate(&mut vector, F::ONE);
        Self { vector }
    }
}

impl<M: Embedding> Evaluate<M> for Covector<M::Target> {
    fn evaluate(&self, embedding: &M, vector: &[M::Source]) -> M::Target {
        assert_eq!(self.vector.len(), vector.len());
        mixed_dot(embedding, &self.vector, vector)
    }
}