-
Notifications
You must be signed in to change notification settings - Fork 112
/
Copy pathlogup.rs
266 lines (246 loc) · 8.58 KB
/
logup.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
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
use std::ops::{Mul, Sub};
use itertools::Itertools;
use num_traits::{One, Zero};
use super::EvalAtRow;
use crate::core::backend::simd::column::SecureColumn;
use crate::core::backend::simd::m31::{PackedBaseField, LOG_N_LANES};
use crate::core::backend::simd::prefix_sum::inclusive_prefix_sum;
use crate::core::backend::simd::qm31::PackedSecureField;
use crate::core::backend::simd::SimdBackend;
use crate::core::backend::Column;
use crate::core::channel::Channel;
use crate::core::fields::m31::BaseField;
use crate::core::fields::qm31::SecureField;
use crate::core::fields::secure_column::SecureColumnByCoords;
use crate::core::fields::FieldExpOps;
use crate::core::lookups::utils::Fraction;
use crate::core::poly::circle::{CanonicCoset, CircleEvaluation};
use crate::core::poly::BitReversedOrder;
use crate::core::ColumnVec;
/// Evaluates constraints for batched logups.
/// These constraint enforce the sum of multiplicity_i / (z + sum_j alpha^j * x_j) = claimed_sum.
pub struct LogupAtRow<E: EvalAtRow> {
/// The index of the interaction used for the cumulative sum columns.
pub interaction: usize,
/// The total sum of all the fractions divided by n_rows.
pub cumsum_shift: SecureField,
/// The evaluation of the last cumulative sum column.
pub fracs: Vec<Fraction<E::EF, E::EF>>,
pub is_finalized: bool,
pub log_size: u32,
}
impl<E: EvalAtRow> Default for LogupAtRow<E> {
fn default() -> Self {
Self::dummy()
}
}
impl<E: EvalAtRow> LogupAtRow<E> {
pub fn new(interaction: usize, claimed_sum: SecureField, log_size: u32) -> Self {
Self {
interaction,
cumsum_shift: claimed_sum / BaseField::from_u32_unchecked(1 << log_size),
fracs: vec![],
is_finalized: true,
log_size,
}
}
// TODO(alont): Remove this once unnecessary LogupAtRows are gone.
pub fn dummy() -> Self {
Self {
interaction: 100,
cumsum_shift: SecureField::one(),
fracs: vec![],
is_finalized: true,
log_size: 10,
}
}
}
/// Ensures that the LogupAtRow is finalized.
/// LogupAtRow should be finalized exactly once.
impl<E: EvalAtRow> Drop for LogupAtRow<E> {
fn drop(&mut self) {
assert!(self.is_finalized, "LogupAtRow was not finalized");
}
}
/// Interaction elements for the logup protocol.
#[derive(Clone, Debug, PartialEq, Eq)]
pub struct LookupElements<const N: usize> {
pub z: SecureField,
pub alpha: SecureField,
pub alpha_powers: [SecureField; N],
}
impl<const N: usize> LookupElements<N> {
pub fn draw(channel: &mut impl Channel) -> Self {
let [z, alpha] = channel.draw_felts(2).try_into().unwrap();
let mut cur = SecureField::one();
let alpha_powers = std::array::from_fn(|_| {
let res = cur;
cur *= alpha;
res
});
Self {
z,
alpha,
alpha_powers,
}
}
pub fn combine<F: Clone, EF>(&self, values: &[F]) -> EF
where
EF: Clone + Zero + From<F> + From<SecureField> + Mul<F, Output = EF> + Sub<EF, Output = EF>,
{
assert!(
self.alpha_powers.len() >= values.len(),
"Not enough alpha powers to combine values"
);
values
.iter()
.zip(self.alpha_powers)
.fold(EF::zero(), |acc, (value, power)| {
acc + EF::from(power) * value.clone()
})
- EF::from(self.z)
}
pub fn dummy() -> Self {
Self {
z: SecureField::one(),
alpha: SecureField::one(),
alpha_powers: [SecureField::one(); N],
}
}
}
// SIMD backend generator for logup interaction trace.
pub struct LogupTraceGenerator {
log_size: u32,
/// Current allocated interaction columns.
trace: Vec<SecureColumnByCoords<SimdBackend>>,
/// Denominator expressions (z + sum_i alpha^i * x_i) being generated for the current lookup.
denom: SecureColumn,
}
impl LogupTraceGenerator {
pub fn new(log_size: u32) -> Self {
let trace = vec![];
let denom = SecureColumn::zeros(1 << log_size);
Self {
log_size,
trace,
denom,
}
}
/// Allocate a new lookup column.
pub fn new_col(&mut self) -> LogupColGenerator<'_> {
let log_size = self.log_size;
LogupColGenerator {
gen: self,
numerator: SecureColumnByCoords::<SimdBackend>::zeros(1 << log_size),
}
}
/// Finalize the trace. Returns the trace and the total sum of the last column.
/// The last column is shifted by the cumsum_shift.
pub fn finalize_last(
mut self,
) -> (
ColumnVec<CircleEvaluation<SimdBackend, BaseField, BitReversedOrder>>,
SecureField,
) {
let mut last_col_coords = self.trace.pop().unwrap().columns;
// Compute cumsum_shift.
let coordinate_sums = last_col_coords.each_ref().map(|c| {
c.data
.iter()
.copied()
.sum::<PackedBaseField>()
.pointwise_sum()
});
let claimed_sum = SecureField::from_m31_array(coordinate_sums);
let cumsum_shift = claimed_sum / BaseField::from_u32_unchecked(1 << self.log_size);
let packed_cumsum_shift = PackedSecureField::broadcast(cumsum_shift);
last_col_coords.iter_mut().enumerate().for_each(|(i, c)| {
c.data
.iter_mut()
.for_each(|x| *x -= packed_cumsum_shift.into_packed_m31s()[i])
});
let coord_prefix_sum = last_col_coords.map(inclusive_prefix_sum);
let secure_prefix_sum = SecureColumnByCoords {
columns: coord_prefix_sum,
};
self.trace.push(secure_prefix_sum);
let trace = self
.trace
.into_iter()
.flat_map(|eval| {
eval.columns.map(|col| {
CircleEvaluation::new(CanonicCoset::new(self.log_size).circle_domain(), col)
})
})
.collect_vec();
(trace, claimed_sum)
}
}
/// Trace generator for a single lookup column.
pub struct LogupColGenerator<'a> {
gen: &'a mut LogupTraceGenerator,
/// Numerator expressions (i.e. multiplicities) being generated for the current lookup.
numerator: SecureColumnByCoords<SimdBackend>,
}
impl LogupColGenerator<'_> {
/// Write a fraction to the column at a row.
pub fn write_frac(
&mut self,
vec_row: usize,
numerator: PackedSecureField,
denom: PackedSecureField,
) {
debug_assert!(
denom.to_array().iter().all(|x| *x != SecureField::zero()),
"{:?}",
("denom at vec_row {} is zero {}", denom, vec_row)
);
unsafe {
self.numerator.set_packed(vec_row, numerator);
*self.gen.denom.data.get_unchecked_mut(vec_row) = denom;
}
}
/// Finalizes generating the column.
pub fn finalize_col(mut self) {
let denom_inv = PackedSecureField::invert_many(&self.gen.denom.data);
#[allow(clippy::needless_range_loop)]
for vec_row in 0..(1 << (self.gen.log_size - LOG_N_LANES)) {
unsafe {
let value = self.numerator.packed_at(vec_row) * denom_inv[vec_row];
let prev_value = self
.gen
.trace
.last()
.map(|col| col.packed_at(vec_row))
.unwrap_or_else(PackedSecureField::zero);
self.numerator.set_packed(vec_row, value + prev_value)
};
}
self.gen.trace.push(self.numerator)
}
}
#[cfg(test)]
mod tests {
use super::LookupElements;
use crate::core::channel::Blake2sChannel;
use crate::core::fields::m31::BaseField;
use crate::core::fields::qm31::SecureField;
use crate::core::fields::FieldExpOps;
#[test]
fn test_lookup_elements_combine() {
let mut channel = Blake2sChannel::default();
let lookup_elements = LookupElements::<3>::draw(&mut channel);
let values = [
BaseField::from_u32_unchecked(123),
BaseField::from_u32_unchecked(456),
BaseField::from_u32_unchecked(789),
];
assert_eq!(
lookup_elements.combine::<BaseField, SecureField>(&values),
BaseField::from_u32_unchecked(123)
+ BaseField::from_u32_unchecked(456) * lookup_elements.alpha
+ BaseField::from_u32_unchecked(789) * lookup_elements.alpha.pow(2)
- lookup_elements.z
);
}
}