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

use super::{test_utility::*, DynProofExpr, ProofExpr};
use crate::base::{
    commitment::InnerProductProof,
    database::{table_utility::*, Column, TableRef, TableTestAccessor, TestAccessor},
};
use bumpalo::Bump;

#[test]
fn we_can_compute_the_correct_result_of_a_complex_bool_expr_using_first_round_evaluate() {
    let alloc = Bump::new();
    let data = table([
        borrowed_bigint(
            "a",
            [1, 2, 3, 4, 5, 5, 5, 5, 5, 5, 5, 5, 6, 7, 8, 9, 999],
            &alloc,
        ),
        borrowed_varchar(
            "b",
            [
                "g", "g", "t", "ghi", "g", "g", "jj", "f", "g", "g", "gar", "qwe", "g", "g", "poi",
                "zxc", "999",
            ],
            &alloc,
        ),
        borrowed_int128(
            "c",
            [
                3, 123, 3, 234, 3, 345, 3, 456, 3, 567, 3, 678, 3, 789, 3, 890, 999,
            ],
            &alloc,
        ),
    ]);
    let mut accessor = TableTestAccessor::<InnerProductProof>::new_empty_with_setup(());
    let t = TableRef::new("sxt", "t");
    accessor.add_table(t.clone(), data.clone(), 0);
    // (a <= 5 || b == "g") && c != 3
    let bool_expr: DynProofExpr = and(
        or(
            lte(column(&t, "a", &accessor), const_bigint(5)),
            equal(column(&t, "b", &accessor), const_varchar("g")),
        ),
        not(equal(column(&t, "c", &accessor), const_int128(3))),
    );
    let res = bool_expr.first_round_evaluate(&alloc, &data, &[]).unwrap();
    let expected_res = Column::Boolean(&[
        false, true, false, true, false, true, false, true, false, true, false, true, false, true,
        false, false, false,
    ]);
    assert_eq!(res, expected_res);
}