-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy pathtrace.rs
More file actions
635 lines (612 loc) · 30.8 KB
/
trace.rs
File metadata and controls
635 lines (612 loc) · 30.8 KB
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
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
use std::mem::MaybeUninit;
use std::sync::Arc;
use crate::witness::components::blake_g;
use crate::witness::components::blake_gate;
use crate::witness::components::blake_output;
use crate::witness::components::blake_round;
use crate::witness::components::blake_round_sigma;
use crate::witness::components::eq;
use crate::witness::components::m_31_to_u_32;
use crate::witness::components::qm31_ops;
use crate::witness::components::range_check_15;
use crate::witness::components::range_check_16;
use crate::witness::components::triple_xor_32;
use crate::witness::components::verify_bitwise_xor_4;
use crate::witness::components::verify_bitwise_xor_7;
use crate::witness::components::verify_bitwise_xor_8;
use crate::witness::components::verify_bitwise_xor_9;
use crate::witness::components::verify_bitwise_xor_12;
use circuit_common::Qm31OpsTraceGenerator;
use circuit_common::preprocessed::PreProcessedTrace;
use circuit_verifier::circuit_claim::CircuitClaim;
use circuit_verifier::circuit_claim::CircuitInteractionClaim;
use circuit_verifier::circuit_claim::CircuitInteractionElements;
use circuit_verifier::circuit_components::N_COMPONENTS;
use itertools::Itertools;
use num_traits::Zero;
use rayon::scope;
use stwo::core::channel::MerkleChannel;
use stwo::core::fields::qm31::QM31;
use stwo::prover::TreeBuilder;
use stwo::prover::backend::BackendForChannel;
use stwo::prover::backend::simd::SimdBackend;
use stwo::prover::poly::circle::PolyOps;
use stwo::prover::poly::twiddles::TwiddleTree;
pub struct TraceGenerator {
pub qm31_ops_trace_generator: Qm31OpsTraceGenerator,
}
pub fn write_trace<MC: MerkleChannel>(
context_values: &[QM31],
preprocessed_trace: Arc<PreProcessedTrace>,
output_addresses: &[usize],
tree_builder: &mut TreeBuilder<'_, '_, SimdBackend, MC>,
trace_generator: &TraceGenerator,
twiddles: &TwiddleTree<SimdBackend>,
) -> (CircuitClaim, [u32; N_COMPONENTS], CircuitInteractionClaimGenerator)
where
SimdBackend: BackendForChannel<MC>,
{
let preprocessed_trace_ref = preprocessed_trace.as_ref();
// Parent scope: eq/qm31_ops traces run as spawns alongside everything else.
let mut eq_result = MaybeUninit::uninit();
let mut qm31_ops_result = MaybeUninit::uninit();
let mut verify_bitwise_xor_8_state = MaybeUninit::uninit();
let mut verify_bitwise_xor_12_state = MaybeUninit::uninit();
let mut verify_bitwise_xor_4_state = MaybeUninit::uninit();
let mut verify_bitwise_xor_7_state = MaybeUninit::uninit();
let mut verify_bitwise_xor_9_state = MaybeUninit::uninit();
let mut range_check_16_state = MaybeUninit::uninit();
let mut range_check_15_state = MaybeUninit::uninit();
let mut triple_xor_32_state = MaybeUninit::uninit();
let mut blake_gate_claim_generator = MaybeUninit::uninit();
let mut blake_round_generator = MaybeUninit::uninit();
let mut blake_round_sigma_generator = MaybeUninit::uninit();
let mut blake_g_generator = MaybeUninit::uninit();
let mut blake_gate_polys_result = MaybeUninit::uninit();
let mut blake_gate_interaction_claim_gen_result = MaybeUninit::uninit();
let mut blake_round_polys_result = MaybeUninit::uninit();
let mut blake_round_log_size_result = MaybeUninit::uninit();
let mut blake_round_interaction_claim_gen_result = MaybeUninit::uninit();
let mut blake_round_sigma_polys_result = MaybeUninit::uninit();
let mut blake_round_sigma_interaction_claim_gen_result = MaybeUninit::uninit();
let mut blake_g_polys_result = MaybeUninit::uninit();
let mut blake_g_claim_icg = MaybeUninit::uninit();
let mut blake_output_polys_result = MaybeUninit::uninit();
let mut blake_output_claim_icg = MaybeUninit::uninit();
let mut triple_xor_32_polys_result = MaybeUninit::uninit();
let mut triple_xor_32_claim_icg = MaybeUninit::uninit();
let mut verify_bitwise_xor_8_result = MaybeUninit::uninit();
let mut verify_bitwise_xor_12_result = MaybeUninit::uninit();
let mut verify_bitwise_xor_4_result = MaybeUninit::uninit();
let mut verify_bitwise_xor_7_result = MaybeUninit::uninit();
let mut verify_bitwise_xor_9_result = MaybeUninit::uninit();
let mut range_check_15_result = MaybeUninit::uninit();
let mut range_check_16_result = MaybeUninit::uninit();
let mut blake_g_trace_data = MaybeUninit::uninit();
let mut triple_xor_32_trace_data = MaybeUninit::uninit();
let mut m_31_to_u_32_trace_data = MaybeUninit::uninit();
let mut m_31_to_u_32_claim_icg = MaybeUninit::uninit();
let mut m_31_to_u_32_polys_result = MaybeUninit::uninit();
scope(|s| {
// Eq and qm31_ops traces run for the full duration of the parent scope.
s.spawn(|_| {
let (trace, log_size, lookup_data) = qm31_ops::write_trace(
context_values,
preprocessed_trace_ref,
&trace_generator.qm31_ops_trace_generator,
);
let polys = SimdBackend::interpolate_columns(trace.to_evals(), twiddles);
qm31_ops_result.write((polys, log_size, lookup_data));
});
s.spawn(|_| {
let (trace, log_size, lookup_data) =
eq::write_trace(context_values, preprocessed_trace_ref);
let polys = SimdBackend::interpolate_columns(trace.to_evals(), twiddles);
eq_result.write((polys, log_size, lookup_data));
});
// Initialize claim generators in a subscope.
scope(|s| {
s.spawn(|_| {
verify_bitwise_xor_8_state
.write(verify_bitwise_xor_8::ClaimGenerator::new(preprocessed_trace.clone()));
});
s.spawn(|_| {
verify_bitwise_xor_12_state
.write(verify_bitwise_xor_12::ClaimGenerator::new(preprocessed_trace.clone()));
});
s.spawn(|_| {
verify_bitwise_xor_4_state
.write(verify_bitwise_xor_4::ClaimGenerator::new(preprocessed_trace.clone()));
});
s.spawn(|_| {
verify_bitwise_xor_7_state
.write(verify_bitwise_xor_7::ClaimGenerator::new(preprocessed_trace.clone()));
});
s.spawn(|_| {
verify_bitwise_xor_9_state
.write(verify_bitwise_xor_9::ClaimGenerator::new(preprocessed_trace.clone()));
});
s.spawn(|_| {
range_check_16_state
.write(range_check_16::ClaimGenerator::new(preprocessed_trace.clone()));
});
s.spawn(|_| {
range_check_15_state
.write(range_check_15::ClaimGenerator::new(preprocessed_trace.clone()));
});
s.spawn(|_| {
triple_xor_32_state.write(triple_xor_32::ClaimGenerator::new());
});
s.spawn(|_| {
blake_gate_claim_generator
.write(blake_gate::ClaimGenerator::new(preprocessed_trace.clone()));
});
s.spawn(|_| {
blake_round_generator.write(blake_round::ClaimGenerator::default());
});
s.spawn(|_| {
blake_round_sigma_generator
.write(blake_round_sigma::ClaimGenerator::new(preprocessed_trace.clone()));
});
s.spawn(|_| {
blake_g_generator.write(blake_g::ClaimGenerator::new());
});
});
// SAFETY: Claim generators were initialized by the subscope above.
// Move xor/range-check states out of MaybeUninit into owned locals so we can
// borrow them for blake_gate/blake_g/triple_xor_32, then move them into spawns.
let verify_bitwise_xor_8_state = unsafe { verify_bitwise_xor_8_state.assume_init() };
let verify_bitwise_xor_12_state = unsafe { verify_bitwise_xor_12_state.assume_init() };
let verify_bitwise_xor_4_state = unsafe { verify_bitwise_xor_4_state.assume_init() };
let verify_bitwise_xor_7_state = unsafe { verify_bitwise_xor_7_state.assume_init() };
let verify_bitwise_xor_9_state = unsafe { verify_bitwise_xor_9_state.assume_init() };
let range_check_16_state = unsafe { range_check_16_state.assume_init() };
let range_check_15_state = unsafe { range_check_15_state.assume_init() };
let mut triple_xor_32_state = unsafe { triple_xor_32_state.assume_init() };
let blake_gate_claim_generator = unsafe { blake_gate_claim_generator.assume_init() };
let mut blake_round_generator = unsafe { blake_round_generator.assume_init() };
let blake_round_sigma_generator = unsafe { blake_round_sigma_generator.assume_init() };
let mut blake_g_generator = unsafe { blake_g_generator.assume_init() };
// Sequential blake gate/round/sigma (they depend on each other).
// Spawn interpolation immediately after each write_trace.
let (blake_gate_trace, blake_gate_icg, blake_message_state, blake_output_component_input) =
blake_gate_claim_generator.write_trace(
context_values,
preprocessed_trace_ref,
&verify_bitwise_xor_8_state,
&range_check_16_state,
&range_check_15_state,
&mut blake_round_generator,
&mut triple_xor_32_state,
);
blake_gate_interaction_claim_gen_result.write(blake_gate_icg);
s.spawn(|_| {
blake_gate_polys_result
.write(SimdBackend::interpolate_columns(blake_gate_trace.to_evals(), twiddles));
});
let (blake_round_trace, blake_round_ls, blake_round_icg) = blake_round_generator
.write_trace(
&blake_round_sigma_generator,
&blake_message_state,
&mut blake_g_generator,
);
blake_round_log_size_result.write(blake_round_ls);
blake_round_interaction_claim_gen_result.write(blake_round_icg);
s.spawn(|_| {
blake_round_polys_result
.write(SimdBackend::interpolate_columns(blake_round_trace.to_evals(), twiddles));
});
let (blake_round_sigma_trace, _blake_round_sigma_claim, blake_round_sigma_icg) =
blake_round_sigma_generator.write_trace();
blake_round_sigma_interaction_claim_gen_result.write(blake_round_sigma_icg);
s.spawn(|_| {
blake_round_sigma_polys_result.write(SimdBackend::interpolate_columns(
blake_round_sigma_trace.to_evals(),
twiddles,
));
});
// blake_output is independent — spawn write_trace + interpolation directly.
s.spawn(|_| {
let blake_output_generator = blake_output::ClaimGenerator::new(
blake_output_component_input,
preprocessed_trace.clone(),
);
let (trace, claim, icg) = blake_output_generator.write_trace();
blake_output_polys_result
.write(SimdBackend::interpolate_columns(trace.to_evals(), twiddles));
blake_output_claim_icg.write((claim, icg));
});
// blake_g, triple_xor_32, and m31_to_u32 mutate xor/range-check states through shared
// refs, so they must complete before those states are consumed.
scope(|s| {
s.spawn(|_| {
let (trace, claim, icg) = blake_g_generator.write_trace(
&verify_bitwise_xor_8_state,
&verify_bitwise_xor_12_state,
&verify_bitwise_xor_4_state,
&verify_bitwise_xor_7_state,
&verify_bitwise_xor_9_state,
);
blake_g_trace_data.write(trace);
blake_g_claim_icg.write((claim, icg));
});
s.spawn(|_| {
let (trace, claim, icg) =
triple_xor_32_state.write_trace(&verify_bitwise_xor_8_state);
triple_xor_32_trace_data.write(trace);
triple_xor_32_claim_icg.write((claim, icg));
});
s.spawn(|_| {
let (trace, claim, icg) = m_31_to_u_32::write_trace(
context_values,
preprocessed_trace_ref,
&range_check_16_state,
);
m_31_to_u_32_trace_data.write(trace);
m_31_to_u_32_claim_icg.write((claim, icg));
});
});
// SAFETY: The subscope above guarantees blake_g, triple_xor_32 have finished
// mutating xor/range-check states. Interpolations and xor/range-check write_trace
// calls can now run in parallel.
s.spawn(|_| {
let trace = unsafe { blake_g_trace_data.assume_init() };
blake_g_polys_result
.write(SimdBackend::interpolate_columns(trace.to_evals(), twiddles));
});
s.spawn(|_| {
let trace = unsafe { triple_xor_32_trace_data.assume_init() };
triple_xor_32_polys_result
.write(SimdBackend::interpolate_columns(trace.to_evals(), twiddles));
});
s.spawn(|_| {
let trace = unsafe { m_31_to_u_32_trace_data.assume_init() };
m_31_to_u_32_polys_result
.write(SimdBackend::interpolate_columns(trace.to_evals(), twiddles));
});
s.spawn(|_| {
let (trace, _claim, interaction_claim_gen) = verify_bitwise_xor_8_state.write_trace();
let polys = SimdBackend::interpolate_columns(trace.to_evals(), twiddles);
verify_bitwise_xor_8_result.write((polys, interaction_claim_gen));
});
s.spawn(|_| {
let (trace, _claim, interaction_claim_gen) = verify_bitwise_xor_12_state.write_trace();
// verify_bitwise_xor_12 returns Vec<CircleEvaluation> directly, not ComponentTrace.
let polys = SimdBackend::interpolate_columns(trace, twiddles);
verify_bitwise_xor_12_result.write((polys, interaction_claim_gen));
});
s.spawn(|_| {
let (trace, _claim, interaction_claim_gen) = verify_bitwise_xor_4_state.write_trace();
let polys = SimdBackend::interpolate_columns(trace.to_evals(), twiddles);
verify_bitwise_xor_4_result.write((polys, interaction_claim_gen));
});
s.spawn(|_| {
let (trace, _claim, interaction_claim_gen) = verify_bitwise_xor_7_state.write_trace();
let polys = SimdBackend::interpolate_columns(trace.to_evals(), twiddles);
verify_bitwise_xor_7_result.write((polys, interaction_claim_gen));
});
s.spawn(|_| {
let (trace, _claim, interaction_claim_gen) = verify_bitwise_xor_9_state.write_trace();
let polys = SimdBackend::interpolate_columns(trace.to_evals(), twiddles);
verify_bitwise_xor_9_result.write((polys, interaction_claim_gen));
});
s.spawn(|_| {
let (trace, _claim, interaction_claim_gen) = range_check_15_state.write_trace();
let polys = SimdBackend::interpolate_columns(trace.to_evals(), twiddles);
range_check_15_result.write((polys, interaction_claim_gen));
});
s.spawn(|_| {
let (trace, _claim, interaction_claim_gen) = range_check_16_state.write_trace();
let polys = SimdBackend::interpolate_columns(trace.to_evals(), twiddles);
range_check_16_result.write((polys, interaction_claim_gen));
});
});
// SAFETY: All MaybeUninit values were initialized by the scope above.
let (
(eq_polys, eq_log_size, eq_lookup_data),
(qm31_ops_polys, qm31_ops_log_size, qm31_ops_lookup_data),
blake_gate_interaction_claim_gen,
blake_round_log_size,
blake_round_interaction_claim_gen,
blake_round_sigma_interaction_claim_gen,
blake_g_polys,
(blake_g_claim, blake_g_interaction_claim_gen),
blake_output_polys,
(blake_output_claim, blake_output_interaction_claim_gen),
triple_xor_32_polys,
(triple_xor_32_claim, triple_xor_32_interaction_claim_gen),
m_31_to_u_32_polys,
(m_31_to_u_32_claim, m_31_to_u_32_interaction_claim_gen),
(verify_bitwise_xor_8_polys, verify_bitwise_xor_8_interaction_claim_gen),
(verify_bitwise_xor_12_polys, verify_bitwise_xor_12_interaction_claim_gen),
(verify_bitwise_xor_4_polys, verify_bitwise_xor_4_interaction_claim_gen),
(verify_bitwise_xor_7_polys, verify_bitwise_xor_7_interaction_claim_gen),
(verify_bitwise_xor_9_polys, verify_bitwise_xor_9_interaction_claim_gen),
(range_check_15_polys, range_check_15_interaction_claim_gen),
(range_check_16_polys, range_check_16_interaction_claim_gen),
blake_gate_polys,
blake_round_polys,
blake_round_sigma_polys,
) = unsafe {
(
eq_result.assume_init(),
qm31_ops_result.assume_init(),
blake_gate_interaction_claim_gen_result.assume_init(),
blake_round_log_size_result.assume_init(),
blake_round_interaction_claim_gen_result.assume_init(),
blake_round_sigma_interaction_claim_gen_result.assume_init(),
blake_g_polys_result.assume_init(),
blake_g_claim_icg.assume_init(),
blake_output_polys_result.assume_init(),
blake_output_claim_icg.assume_init(),
triple_xor_32_polys_result.assume_init(),
triple_xor_32_claim_icg.assume_init(),
m_31_to_u_32_polys_result.assume_init(),
m_31_to_u_32_claim_icg.assume_init(),
verify_bitwise_xor_8_result.assume_init(),
verify_bitwise_xor_12_result.assume_init(),
verify_bitwise_xor_4_result.assume_init(),
verify_bitwise_xor_7_result.assume_init(),
verify_bitwise_xor_9_result.assume_init(),
range_check_15_result.assume_init(),
range_check_16_result.assume_init(),
blake_gate_polys_result.assume_init(),
blake_round_polys_result.assume_init(),
blake_round_sigma_polys_result.assume_init(),
)
};
tree_builder.extend_polys(eq_polys);
tree_builder.extend_polys(qm31_ops_polys);
tree_builder.extend_polys(blake_gate_polys);
tree_builder.extend_polys(blake_round_polys);
tree_builder.extend_polys(blake_round_sigma_polys);
tree_builder.extend_polys(blake_g_polys);
tree_builder.extend_polys(blake_output_polys);
tree_builder.extend_polys(triple_xor_32_polys);
tree_builder.extend_polys(m_31_to_u_32_polys);
tree_builder.extend_polys(verify_bitwise_xor_8_polys);
tree_builder.extend_polys(verify_bitwise_xor_12_polys);
tree_builder.extend_polys(verify_bitwise_xor_4_polys);
tree_builder.extend_polys(verify_bitwise_xor_7_polys);
tree_builder.extend_polys(verify_bitwise_xor_9_polys);
tree_builder.extend_polys(range_check_15_polys);
tree_builder.extend_polys(range_check_16_polys);
let output_values = output_addresses.iter().map(|addr| context_values[*addr]).collect_vec();
let log_sizes = [
eq_log_size,
qm31_ops_log_size,
blake_gate_interaction_claim_gen.log_size,
blake_round_log_size.log_size,
crate::circuit_air::components::blake_round_sigma::LOG_SIZE,
blake_g_claim.log_size,
blake_output_claim.log_size,
triple_xor_32_claim.log_size,
m_31_to_u_32_claim.log_size,
crate::circuit_air::components::verify_bitwise_xor_8::LOG_SIZE,
crate::circuit_air::components::verify_bitwise_xor_12::LOG_SIZE,
crate::circuit_air::components::verify_bitwise_xor_4::LOG_SIZE,
crate::circuit_air::components::verify_bitwise_xor_7::LOG_SIZE,
crate::circuit_air::components::verify_bitwise_xor_9::LOG_SIZE,
crate::circuit_air::components::range_check_15::LOG_SIZE,
crate::circuit_air::components::range_check_16::LOG_SIZE,
];
(
CircuitClaim { output_values },
log_sizes,
CircuitInteractionClaimGenerator {
eq_lookup_data,
qm31_ops_lookup_data,
blake_gate: blake_gate_interaction_claim_gen,
blake_round: blake_round_interaction_claim_gen,
blake_round_sigma: blake_round_sigma_interaction_claim_gen,
blake_g: blake_g_interaction_claim_gen,
blake_output: blake_output_interaction_claim_gen,
triple_xor_32: triple_xor_32_interaction_claim_gen,
m_31_to_u_32: m_31_to_u_32_interaction_claim_gen,
verify_bitwise_xor_8: verify_bitwise_xor_8_interaction_claim_gen,
verify_bitwise_xor_12: verify_bitwise_xor_12_interaction_claim_gen,
verify_bitwise_xor_4: verify_bitwise_xor_4_interaction_claim_gen,
verify_bitwise_xor_7: verify_bitwise_xor_7_interaction_claim_gen,
verify_bitwise_xor_9: verify_bitwise_xor_9_interaction_claim_gen,
range_check_15: range_check_15_interaction_claim_gen,
range_check_16: range_check_16_interaction_claim_gen,
},
)
}
pub struct CircuitInteractionClaimGenerator {
pub eq_lookup_data: eq::LookupData,
pub qm31_ops_lookup_data: qm31_ops::LookupData,
pub blake_gate: blake_gate::InteractionClaimGenerator,
pub blake_round: blake_round::InteractionClaimGenerator,
pub blake_round_sigma: blake_round_sigma::InteractionClaimGenerator,
pub blake_g: blake_g::InteractionClaimGenerator,
pub blake_output: blake_output::InteractionClaimGenerator,
pub triple_xor_32: triple_xor_32::InteractionClaimGenerator,
pub m_31_to_u_32: m_31_to_u_32::InteractionClaimGenerator,
pub verify_bitwise_xor_8: verify_bitwise_xor_8::InteractionClaimGenerator,
pub verify_bitwise_xor_12: verify_bitwise_xor_12::InteractionClaimGenerator,
pub verify_bitwise_xor_4: verify_bitwise_xor_4::InteractionClaimGenerator,
pub verify_bitwise_xor_7: verify_bitwise_xor_7::InteractionClaimGenerator,
pub verify_bitwise_xor_9: verify_bitwise_xor_9::InteractionClaimGenerator,
pub range_check_15: range_check_15::InteractionClaimGenerator,
pub range_check_16: range_check_16::InteractionClaimGenerator,
}
pub fn write_interaction_trace<MC: MerkleChannel>(
component_log_sizes: &[u32; N_COMPONENTS],
circuit_interaction_claim_generator: CircuitInteractionClaimGenerator,
tree_builder: &mut TreeBuilder<'_, '_, SimdBackend, MC>,
interaction_elements: &CircuitInteractionElements,
twiddles: &TwiddleTree<SimdBackend>,
) -> CircuitInteractionClaim
where
SimdBackend: BackendForChannel<MC>,
{
let mut component_log_size_iter = component_log_sizes.iter();
// Extract log sizes before parallel section.
let eq_log_size = *component_log_size_iter.next().unwrap();
let qm31_ops_log_size = *component_log_size_iter.next().unwrap();
// Write all interaction traces in parallel, including interpolation.
// Preallocate poly slots; each spawned task writes into its own mutable slice.
let mut all_polys: [Vec<_>; 16] = std::array::from_fn(|_| Vec::new());
let [
eq_polys,
qm31_ops_polys,
blake_gate_polys,
blake_round_polys,
blake_round_sigma_polys,
blake_g_polys,
blake_output_polys,
triple_xor_32_polys,
m_31_to_u_32_polys,
verify_bitwise_xor_8_polys,
verify_bitwise_xor_12_polys,
verify_bitwise_xor_4_polys,
verify_bitwise_xor_7_polys,
verify_bitwise_xor_9_polys,
range_check_15_polys,
range_check_16_polys,
] = &mut all_polys;
let mut claimed_sums = [QM31::zero(); 16];
let [
eq_claimed_sum,
qm31_ops_claimed_sum,
blake_gate_claimed_sum,
blake_round_claimed_sum,
blake_round_sigma_claimed_sum,
blake_g_claimed_sum,
blake_output_claimed_sum,
triple_xor_32_claimed_sum,
m_31_to_u_32_claimed_sum,
verify_bitwise_xor_8_claimed_sum,
verify_bitwise_xor_12_claimed_sum,
verify_bitwise_xor_4_claimed_sum,
verify_bitwise_xor_7_claimed_sum,
verify_bitwise_xor_9_claimed_sum,
range_check_15_claimed_sum,
range_check_16_claimed_sum,
] = &mut claimed_sums;
{
let eq_lookup_data = circuit_interaction_claim_generator.eq_lookup_data;
let qm31_ops_lookup_data = circuit_interaction_claim_generator.qm31_ops_lookup_data;
let blake_gate = circuit_interaction_claim_generator.blake_gate;
let blake_round = circuit_interaction_claim_generator.blake_round;
let blake_round_sigma = circuit_interaction_claim_generator.blake_round_sigma;
let blake_g = circuit_interaction_claim_generator.blake_g;
let blake_output = circuit_interaction_claim_generator.blake_output;
let triple_xor_32 = circuit_interaction_claim_generator.triple_xor_32;
let m_31_to_u_32 = circuit_interaction_claim_generator.m_31_to_u_32;
let verify_bitwise_xor_8 = circuit_interaction_claim_generator.verify_bitwise_xor_8;
let verify_bitwise_xor_12 = circuit_interaction_claim_generator.verify_bitwise_xor_12;
let verify_bitwise_xor_4 = circuit_interaction_claim_generator.verify_bitwise_xor_4;
let verify_bitwise_xor_7 = circuit_interaction_claim_generator.verify_bitwise_xor_7;
let verify_bitwise_xor_9 = circuit_interaction_claim_generator.verify_bitwise_xor_9;
let range_check_15 = circuit_interaction_claim_generator.range_check_15;
let range_check_16 = circuit_interaction_claim_generator.range_check_16;
scope(|s| {
s.spawn(|_| {
let (trace, claimed_sum) = eq::write_interaction_trace(
eq_log_size,
eq_lookup_data,
&interaction_elements.common_lookup_elements,
);
*eq_polys = SimdBackend::interpolate_columns(trace, twiddles);
*eq_claimed_sum = claimed_sum;
});
s.spawn(|_| {
let (trace, claimed_sum) = qm31_ops::write_interaction_trace(
qm31_ops_log_size,
qm31_ops_lookup_data,
&interaction_elements.common_lookup_elements,
);
*qm31_ops_polys = SimdBackend::interpolate_columns(trace, twiddles);
*qm31_ops_claimed_sum = claimed_sum;
});
s.spawn(|_| {
let (trace, claim) = blake_gate
.write_interaction_trace(&interaction_elements.common_lookup_elements);
*blake_gate_polys = SimdBackend::interpolate_columns(trace, twiddles);
*blake_gate_claimed_sum = claim.claimed_sum;
});
s.spawn(|_| {
let (trace, claim) = blake_round
.write_interaction_trace(&interaction_elements.common_lookup_elements);
*blake_round_polys = SimdBackend::interpolate_columns(trace, twiddles);
*blake_round_claimed_sum = claim.claimed_sum;
});
s.spawn(|_| {
let (trace, claim) = blake_round_sigma
.write_interaction_trace(&interaction_elements.common_lookup_elements);
*blake_round_sigma_polys = SimdBackend::interpolate_columns(trace, twiddles);
*blake_round_sigma_claimed_sum = claim.claimed_sum;
});
s.spawn(|_| {
let (trace, claim) =
blake_g.write_interaction_trace(&interaction_elements.common_lookup_elements);
*blake_g_polys = SimdBackend::interpolate_columns(trace, twiddles);
*blake_g_claimed_sum = claim.claimed_sum;
});
s.spawn(|_| {
let (trace, claim) = blake_output
.write_interaction_trace(&interaction_elements.common_lookup_elements);
*blake_output_polys = SimdBackend::interpolate_columns(trace, twiddles);
*blake_output_claimed_sum = claim.claimed_sum;
});
s.spawn(|_| {
let (trace, claim) = triple_xor_32
.write_interaction_trace(&interaction_elements.common_lookup_elements);
*triple_xor_32_polys = SimdBackend::interpolate_columns(trace, twiddles);
*triple_xor_32_claimed_sum = claim.claimed_sum;
});
s.spawn(|_| {
let (trace, claim) = m_31_to_u_32
.write_interaction_trace(&interaction_elements.common_lookup_elements);
*m_31_to_u_32_polys = SimdBackend::interpolate_columns(trace, twiddles);
*m_31_to_u_32_claimed_sum = claim.claimed_sum;
});
s.spawn(|_| {
let (trace, claim) = verify_bitwise_xor_8
.write_interaction_trace(&interaction_elements.common_lookup_elements);
*verify_bitwise_xor_8_polys = SimdBackend::interpolate_columns(trace, twiddles);
*verify_bitwise_xor_8_claimed_sum = claim.claimed_sum;
});
s.spawn(|_| {
let (trace, claim) = verify_bitwise_xor_12
.write_interaction_trace(&interaction_elements.common_lookup_elements);
*verify_bitwise_xor_12_polys = SimdBackend::interpolate_columns(trace, twiddles);
*verify_bitwise_xor_12_claimed_sum = claim.claimed_sum;
});
s.spawn(|_| {
let (trace, claim) = verify_bitwise_xor_4
.write_interaction_trace(&interaction_elements.common_lookup_elements);
*verify_bitwise_xor_4_polys = SimdBackend::interpolate_columns(trace, twiddles);
*verify_bitwise_xor_4_claimed_sum = claim.claimed_sum;
});
s.spawn(|_| {
let (trace, claim) = verify_bitwise_xor_7
.write_interaction_trace(&interaction_elements.common_lookup_elements);
*verify_bitwise_xor_7_polys = SimdBackend::interpolate_columns(trace, twiddles);
*verify_bitwise_xor_7_claimed_sum = claim.claimed_sum;
});
s.spawn(|_| {
let (trace, claim) = verify_bitwise_xor_9
.write_interaction_trace(&interaction_elements.common_lookup_elements);
*verify_bitwise_xor_9_polys = SimdBackend::interpolate_columns(trace, twiddles);
*verify_bitwise_xor_9_claimed_sum = claim.claimed_sum;
});
s.spawn(|_| {
let (trace, claim) = range_check_15
.write_interaction_trace(&interaction_elements.common_lookup_elements);
*range_check_15_polys = SimdBackend::interpolate_columns(trace, twiddles);
*range_check_15_claimed_sum = claim.claimed_sum;
});
s.spawn(|_| {
let (trace, claim) = range_check_16
.write_interaction_trace(&interaction_elements.common_lookup_elements);
*range_check_16_polys = SimdBackend::interpolate_columns(trace, twiddles);
*range_check_16_claimed_sum = claim.claimed_sum;
});
});
}
tree_builder.extend_polys(all_polys.into_iter().flatten());
CircuitInteractionClaim { claimed_sums }
}