-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathqap.rs
201 lines (184 loc) · 5.18 KB
/
qap.rs
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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
use crate::modules::algebra::field::Field;
use crate::modules::algebra::polynomial::Polynomial;
use crate::modules::arithmetization::r1cs::R1CS;
pub struct QAP<F: Field> {
pub m: usize,
pub d: usize,
pub ell_i_vec: Vec<Polynomial<F>>,
pub r_i_vec: Vec<Polynomial<F>>,
pub o_i_vec: Vec<Polynomial<F>>,
pub t: Polynomial<F>,
}
impl<F: Field> QAP<F> {
pub fn from_r1cs(r1cs: &R1CS<F>) -> QAP<F> {
let x: Vec<F> = (1..=r1cs.m).map(F::from_value).collect();
let interpolate = |rows: &[Vec<F>]| {
(0..r1cs.d)
.map(|i| {
let column: Vec<F> = rows.iter().map(|row| row[i].clone()).collect();
Polynomial::<F>::interpolate(&x, &column)
})
.collect::<Vec<Polynomial<F>>>()
};
let ell_i_vec = interpolate(&r1cs.left);
let r_i_vec = interpolate(&r1cs.right);
let o_i_vec = interpolate(&r1cs.out);
let t = Polynomial::<F>::from_monomials(&x);
QAP {
m: r1cs.m,
d: r1cs.d,
ell_i_vec,
r_i_vec,
o_i_vec,
t,
}
}
}
#[cfg(test)]
mod tests {
use super::*;
use num_traits::One;
use num_traits::Zero;
use crate::modules::algebra::field::{FiniteFieldElement, ModEIP197};
type F = FiniteFieldElement<ModEIP197>;
#[test]
fn test_qap_single_multiplication() {
// z = x * y
// (1, z, x, y) = (1, 3690, 82, 45)
let left = vec![vec![F::zero(), F::zero(), F::one(), F::zero()]];
let right = vec![vec![F::zero(), F::zero(), F::zero(), F::one()]];
let out = vec![vec![F::zero(), F::one(), F::zero(), F::zero()]];
let r1cs = R1CS::new(left, right, out);
let qap = QAP::from_r1cs(&r1cs);
let ground_truth_ell_i_vec = vec![
Polynomial::<F>::zero(),
Polynomial::<F>::zero(),
Polynomial::<F>::one(),
Polynomial::<F>::zero(),
];
let ground_truth_r_i_vec = vec![
Polynomial::<F>::zero(),
Polynomial::<F>::zero(),
Polynomial::<F>::zero(),
Polynomial::<F>::one(),
];
let ground_truth_o_i_vec = vec![
Polynomial::<F>::zero(),
Polynomial::<F>::one(),
Polynomial::<F>::zero(),
Polynomial::<F>::zero(),
];
for i in 0..(qap.d) {
assert_eq!(qap.ell_i_vec[i], ground_truth_ell_i_vec[i]);
assert_eq!(qap.r_i_vec[i], ground_truth_r_i_vec[i]);
assert_eq!(qap.o_i_vec[i], ground_truth_o_i_vec[i]);
}
}
#[test]
fn test_qap_multi_multiplication() {
let left = vec![
vec![
F::zero(),
F::zero(),
F::one(),
F::zero(),
F::zero(),
F::zero(),
F::zero(),
F::zero(),
],
vec![
F::zero(),
F::zero(),
F::zero(),
F::zero(),
F::one(),
F::zero(),
F::zero(),
F::zero(),
],
vec![
F::zero(),
F::zero(),
F::zero(),
F::zero(),
F::zero(),
F::zero(),
F::one(),
F::zero(),
],
];
let right = vec![
vec![
F::zero(),
F::zero(),
F::zero(),
F::one(),
F::zero(),
F::zero(),
F::zero(),
F::zero(),
],
vec![
F::zero(),
F::zero(),
F::zero(),
F::zero(),
F::zero(),
F::one(),
F::zero(),
F::zero(),
],
vec![
F::zero(),
F::zero(),
F::zero(),
F::zero(),
F::zero(),
F::zero(),
F::zero(),
F::one(),
],
];
let out = vec![
vec![
F::zero(),
F::zero(),
F::zero(),
F::zero(),
F::zero(),
F::zero(),
F::one(),
F::zero(),
],
vec![
F::zero(),
F::zero(),
F::zero(),
F::zero(),
F::zero(),
F::zero(),
F::zero(),
F::one(),
],
vec![
F::zero(),
F::one(),
F::zero(),
F::zero(),
F::zero(),
F::zero(),
F::zero(),
F::zero(),
],
];
let r1cs = R1CS::new(left, right, out);
let _qap = QAP::from_r1cs(&r1cs);
/*
for i in 0..(qap.d) {
println!("ell - {}: {}", i, qap.ell_i_vec[i]);
}
assert!(false);
*/
}
}