proof-of-sql 0.129.1

High performance zero knowledge (ZK) prover for SQL.
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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93

use crate::base::{polynomial::CompositePolynomial, scalar::Scalar};
use itertools::Itertools;

pub struct SumcheckTestCase<S: Scalar> {
    pub polynomial: CompositePolynomial<S>,
    pub num_vars: usize,
    pub sum: S,
}

impl<S: Scalar> SumcheckTestCase<S> {
    fn rand(
        num_vars: usize,
        max_multiplicands: usize,
        products: impl IntoIterator<Item = impl IntoIterator<Item = usize>>,
        rng: &mut (impl ark_std::rand::Rng + ?Sized),
    ) -> Self {
        let length = 1 << num_vars;
        let products_vec: Vec<Vec<usize>> = products
            .into_iter()
            .map(|p| p.into_iter().collect())
            .collect();
        let num_multiplicands = products_vec
            .iter()
            .map(|p| p.iter().max().copied().unwrap_or(0))
            .max()
            .unwrap_or(0)
            + 1;
        let polynomial = CompositePolynomial::<S>::rand(
            num_vars,
            max_multiplicands,
            std::iter::repeat_n(length, num_multiplicands),
            products_vec,
            rng,
        );
        let sum = polynomial.hypercube_sum(length);
        Self {
            polynomial,
            num_vars,
            sum,
        }
    }
}

pub fn sumcheck_test_cases<S: Scalar>(
    rng: &mut (impl ark_std::rand::Rng + ?Sized),
) -> impl Iterator<Item = SumcheckTestCase<S>> + '_ {
    (1..=8)
        .cartesian_product(0..=5)
        .flat_map(|(num_vars, max_multiplicands)| {
            [
                Some(vec![]),
                Some(vec![vec![]]),
                (max_multiplicands >= 1).then_some(vec![vec![0]]),
                (max_multiplicands >= 2).then_some(vec![vec![0, 1]]),
                (max_multiplicands >= 3).then_some(vec![
                    vec![0, 1, 2],
                    vec![3, 4],
                    vec![0],
                    vec![],
                ]),
                (max_multiplicands >= 5).then_some(vec![
                    vec![7, 0],
                    vec![2, 4, 8, 5],
                    vec![],
                    vec![3],
                    vec![1, 0, 8, 5, 0],
                    vec![3, 6, 9, 9],
                    vec![7, 8, 3],
                    vec![4, 3, 2],
                    vec![],
                    vec![9, 8, 2],
                ]),
                (max_multiplicands >= 3).then_some(vec![
                    vec![],
                    vec![1, 0],
                    vec![3, 6, 1],
                    vec![],
                    vec![],
                    vec![1, 8],
                    vec![1],
                    vec![8],
                    vec![6, 6],
                    vec![4, 6, 7],
                ]),
            ]
            .into_iter()
            .flatten()
            .map(move |products| (num_vars, max_multiplicands, products))
        })
        .map(|(num_vars, max_multiplicands, products)| {
            SumcheckTestCase::rand(num_vars, max_multiplicands, products, rng)
        })
}