lilium-sumcheck 0.1.0

generic Sumcheck implementation for Lilium
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

use crate::polynomials::Evals;

impl<T: Evals<V> + Copy, V, const N: usize> Evals<V> for [T; N] {
    type Idx = (usize, T::Idx);

    fn index(&self, index: Self::Idx) -> &V {
        let (idx, inner_idx) = index;
        self[idx].index(inner_idx)
    }

    fn combine<C: Fn(V, V) -> V>(&self, other: &Self, f: C) -> Self {
        let mut res: [T; N] = *self;
        for i in 0..N {
            res[i] = self[i].combine(&other[i], &f);
        }
        res
    }

    fn flatten(self, vec: &mut Vec<V>) {
        for elem in self.into_iter() {
            elem.flatten(vec);
        }
    }

    fn unflatten(elems: &mut std::vec::IntoIter<V>) -> Self {
        [(); N].map(|_| T::unflatten(elems))
    }
}