openvm-mod-circuit-builder 2.0.1

Modular arithmetic framework for building OpenVM circuits.
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
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
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
use std::{cell::RefCell, rc::Rc};

use num_bigint::BigUint;
use num_traits::One;
use openvm_circuit_primitives::{bigint::utils::*, TraceSubRowGenerator};
use openvm_stark_backend::{
    any_air_arc_vec, p3_air::BaseAir, p3_field::PrimeCharacteristicRing,
    p3_matrix::dense::RowMajorMatrix, prover::AirProvingContext, StarkEngine, SystemParams,
};
use openvm_stark_sdk::{config::baby_bear_poseidon2::*, p3_baby_bear::BabyBear};

use crate::{
    test_utils::*, utils::biguint_to_limbs_vec, ExprBuilder, FieldExpr, FieldExprCols,
    FieldExpressionCoreRecordMut, FieldVariable, SymbolicExpr,
};

const LIMB_BITS: usize = 8;
use std::sync::Arc;

use openvm_circuit_primitives::var_range::VariableRangeCheckerChip;

fn create_field_expr_with_setup(
    builder: ExprBuilder,
) -> (FieldExpr, Arc<VariableRangeCheckerChip>, usize) {
    let prime = secp256k1_coord_prime();
    let (range_checker, _) = setup(&prime);
    let expr = FieldExpr::new(builder, range_checker.bus(), false);
    let width = BaseAir::<BabyBear>::width(&expr);
    (expr, range_checker, width)
}

fn create_field_expr_with_flags_setup(
    builder: ExprBuilder,
) -> (FieldExpr, Arc<VariableRangeCheckerChip>, usize) {
    let prime = secp256k1_coord_prime();
    let (range_checker, _) = setup(&prime);
    let expr = FieldExpr::new(builder, range_checker.bus(), true);
    let width = BaseAir::<BabyBear>::width(&expr);
    (expr, range_checker, width)
}

fn generate_direct_trace(
    expr: &FieldExpr,
    range_checker: &Arc<VariableRangeCheckerChip>,
    inputs: Vec<BigUint>,
    flags: Vec<bool>,
    width: usize,
) -> Vec<BabyBear> {
    let mut row = BabyBear::zero_vec(width);
    expr.generate_subrow((range_checker, inputs, flags), &mut row);
    row
}

fn generate_recorded_trace(
    expr: &FieldExpr,
    range_checker: &Arc<VariableRangeCheckerChip>,
    inputs: &[BigUint],
    flags: Vec<bool>,
    width: usize,
) -> Vec<BabyBear> {
    let mut buffer = vec![0u8; 1024];
    let mut record = FieldExpressionCoreRecordMut::new_from_execution_data(
        &mut buffer,
        inputs,
        expr.canonical_num_limbs(),
    );
    let data: Vec<u8> = inputs
        .iter()
        .flat_map(|x| biguint_to_limbs_vec(x, expr.canonical_num_limbs()))
        .collect();
    record.fill_from_execution_data(0, &data);

    let reconstructed_inputs: Vec<BigUint> = record
        .input_limbs
        .chunks(expr.canonical_num_limbs())
        .map(BigUint::from_bytes_le)
        .collect();

    let mut row = BabyBear::zero_vec(width);
    expr.generate_subrow((range_checker, reconstructed_inputs, flags), &mut row);
    row
}

fn verify_stark_with_traces(
    expr: FieldExpr,
    range_checker: Arc<VariableRangeCheckerChip>,
    trace: Vec<BabyBear>,
    width: usize,
) {
    let trace_matrix = RowMajorMatrix::new(trace, width);
    let range_trace = range_checker.generate_trace();
    let engine: BabyBearPoseidon2CpuEngine =
        BabyBearPoseidon2CpuEngine::new(SystemParams::new_for_testing(20));
    let ctxs = vec![
        AirProvingContext::simple_no_pis(trace_matrix),
        AirProvingContext::simple_no_pis(range_trace),
    ];
    engine
        .run_test(any_air_arc_vec![expr, range_checker.air], ctxs)
        .expect("Verification failed");
}

fn extract_and_verify_result(
    expr: &FieldExpr,
    trace: &[BabyBear],
    expected: &BigUint,
    var_index: usize,
) {
    let FieldExprCols { vars, .. } = expr.load_vars(trace);
    assert!(var_index < vars.len(), "Variable index out of bounds");
    let generated = evaluate_biguint(&vars[var_index], LIMB_BITS);
    assert_eq!(generated, *expected);
}

fn test_trace_equivalence(
    expr: &FieldExpr,
    range_checker: &Arc<VariableRangeCheckerChip>,
    inputs: Vec<BigUint>,
    flags: Vec<bool>,
    width: usize,
) {
    let direct_trace =
        generate_direct_trace(expr, range_checker, inputs.clone(), flags.clone(), width);
    let recorded_trace = generate_recorded_trace(expr, range_checker, &inputs, flags, width);
    assert_eq!(
        direct_trace, recorded_trace,
        "Direct and recorded traces must be identical for inputs: {inputs:?}"
    );
}

#[test]
fn test_add() {
    let prime = secp256k1_coord_prime();
    let (_, builder) = setup(&prime);

    let x1 = ExprBuilder::new_input(builder.clone());
    let x2 = ExprBuilder::new_input(builder.clone());
    let mut x3 = x1 + x2;
    x3.save();
    let builder = builder.borrow().clone();

    let (expr, range_checker, width) = create_field_expr_with_setup(builder);

    let x = generate_random_biguint(&prime);
    let y = generate_random_biguint(&prime);
    let expected = (&x + &y) % &prime;
    let inputs = vec![x, y];

    let trace = generate_direct_trace(&expr, &range_checker, inputs, vec![], width);
    extract_and_verify_result(&expr, &trace, &expected, 0);
    verify_stark_with_traces(expr, range_checker, trace, width);
}

#[test]
fn test_div() {
    let prime = secp256k1_coord_prime();
    let (_, builder) = setup(&prime);

    let x1 = ExprBuilder::new_input(builder.clone());
    let x2 = ExprBuilder::new_input(builder.clone());
    let _x3 = x1 / x2; // auto save on division.
    let builder = builder.borrow().clone();

    let (expr, range_checker, width) = create_field_expr_with_setup(builder);

    let x = generate_random_biguint(&prime);
    let y = generate_random_biguint(&prime);
    let y_inv = y.modinv(&prime).unwrap();
    let expected = (&x * &y_inv) % &prime;
    let inputs = vec![x, y];

    let trace = generate_direct_trace(&expr, &range_checker, inputs, vec![], width);
    extract_and_verify_result(&expr, &trace, &expected, 0);
    verify_stark_with_traces(expr, range_checker, trace, width);
}

#[test]
fn test_auto_carry_mul() {
    let prime = secp256k1_coord_prime();
    let (_, builder) = setup(&prime);

    let mut x1 = ExprBuilder::new_input(builder.clone());
    let mut x2 = ExprBuilder::new_input(builder.clone());
    let mut x3 = &mut x1 * &mut x2;
    // The multiplication below will overflow, so it triggers x3 to be saved first.
    let mut x4 = &mut x3 * &mut x1;
    assert_eq!(x3.expr, SymbolicExpr::Var(0));
    x4.save();
    assert_eq!(x4.expr, SymbolicExpr::Var(1));

    let builder = builder.borrow().clone();
    let (expr, range_checker, width) = create_field_expr_with_setup(builder);

    let x = generate_random_biguint(&prime);
    let y = generate_random_biguint(&prime);
    let expected = (&x * &x * &y) % &prime; // x4 = x3 * x1 = (x1 * x2) * x1
    let inputs = vec![x, y];

    let trace = generate_direct_trace(&expr, &range_checker, inputs, vec![], width);
    let FieldExprCols { vars, .. } = expr.load_vars(&trace);
    assert_eq!(vars.len(), 2);
    extract_and_verify_result(&expr, &trace, &expected, 1);
    verify_stark_with_traces(expr, range_checker, trace, width);
}

#[test]
fn test_auto_carry_intmul() {
    let prime = secp256k1_coord_prime();
    let (_, builder) = setup(&prime);
    let mut x1: FieldVariable = ExprBuilder::new_input(builder.clone());
    let mut x2 = ExprBuilder::new_input(builder.clone());
    let mut x3 = &mut x1 * &mut x2;
    // The int_mul below will overflow:
    // x3 should have max_overflow_bits = 8 + 8 + log2(32) = 21
    // The carry bits = "max_overflow_bits - limb_bits + 1" will exceed 17 if it exceeds 17 + 8 - 1
    // = 24. So it triggers x3 to be saved first.
    let mut x4 = x3.int_mul(9);
    assert_eq!(x3.expr, SymbolicExpr::Var(0));
    x4.save();
    assert_eq!(x4.expr, SymbolicExpr::Var(1));

    let builder = builder.borrow().clone();
    let (expr, range_checker, width) = create_field_expr_with_setup(builder);

    let x = generate_random_biguint(&prime);
    let y = generate_random_biguint(&prime);
    let expected = (&x * &x * BigUint::from(9u32)) % &prime;
    let inputs = vec![x, y];

    let trace = generate_direct_trace(&expr, &range_checker, inputs, vec![], width);
    let FieldExprCols { vars, .. } = expr.load_vars(&trace);
    assert_eq!(vars.len(), 2);
    extract_and_verify_result(&expr, &trace, &expected, 1);
    verify_stark_with_traces(expr, range_checker, trace, width);
}

#[test]
fn test_auto_carry_add() {
    let prime = secp256k1_coord_prime();
    let (_, builder) = setup(&prime);

    let mut x1 = ExprBuilder::new_input(builder.clone());
    let mut x2 = ExprBuilder::new_input(builder.clone());
    let mut x3 = &mut x1 * &mut x2;
    let x4 = x3.int_mul(5);
    // Should not overflow, so x3 is not saved.
    assert_eq!(
        x3.expr,
        SymbolicExpr::Mul(
            Box::new(SymbolicExpr::Input(0)),
            Box::new(SymbolicExpr::Input(1))
        )
    );

    // Should overflow as this is 10 * x1 * x2.
    let mut x5 = x4.clone() + x4.clone();
    // cannot verify x4 as above is cloned.
    let x5_id = x5.save();
    // But x5 is var(1) implies x4 was saved as var(0).
    assert_eq!(x5.expr, SymbolicExpr::Var(1));

    let builder = builder.borrow().clone();
    let (expr, range_checker, width) = create_field_expr_with_setup(builder);

    let x = generate_random_biguint(&prime);
    let y = generate_random_biguint(&prime);
    let expected = (&x * &x * BigUint::from(10u32)) % &prime;
    let inputs = vec![x, y];

    let trace = generate_direct_trace(&expr, &range_checker, inputs, vec![], width);
    let FieldExprCols { vars, .. } = expr.load_vars(&trace);
    assert_eq!(vars.len(), 2);
    extract_and_verify_result(&expr, &trace, &expected, x5_id);
    verify_stark_with_traces(expr, range_checker, trace, width);
}

#[test]
fn test_auto_carry_div() {
    let prime = secp256k1_coord_prime();
    let (_, builder) = setup(&prime);

    let mut x1 = ExprBuilder::new_input(builder.clone());
    let x2 = ExprBuilder::new_input(builder.clone());
    // The choice of scalar (7) needs to be such that
    // 1. the denominator 7x^2 doesn't trigger autosave, >=8 doesn't work.
    // 2. But doing a division on it triggers autosave, because of division constraint, <= 6 doesn't
    //    work.
    let mut x3 = x1.square().int_mul(7) / x2;
    x3.save();

    let builder = builder.borrow().clone();
    assert_eq!(builder.num_variables, 2); // numerator autosaved, and the final division

    let (expr, range_checker, width) = create_field_expr_with_setup(builder);

    let x = generate_random_biguint(&prime);
    let y = generate_random_biguint(&prime);
    let inputs = vec![x, y];

    let trace = generate_direct_trace(&expr, &range_checker, inputs, vec![], width);
    let FieldExprCols { vars, .. } = expr.load_vars(&trace);
    assert_eq!(vars.len(), 2);
    verify_stark_with_traces(expr, range_checker, trace, width);
}

fn make_addsub_chip(builder: Rc<RefCell<ExprBuilder>>) -> ExprBuilder {
    let x1 = ExprBuilder::new_input(builder.clone());
    let x2 = ExprBuilder::new_input(builder.clone());
    let x3 = x1.clone() + x2.clone();
    let x4 = x1.clone() - x2.clone();
    let (is_add_flag, is_sub_flag) = {
        let mut builder = builder.borrow_mut();
        let is_add = builder.new_flag();
        let is_sub = builder.new_flag();
        (is_add, is_sub)
    };
    let x5 = FieldVariable::select(is_sub_flag, &x4, &x1);
    let mut x6 = FieldVariable::select(is_add_flag, &x3, &x5);
    x6.save();
    let builder = builder.borrow().clone();
    builder
}

#[test]
fn test_select() {
    let prime = secp256k1_coord_prime();
    let (_, builder) = setup(&prime);
    let builder = make_addsub_chip(builder);

    let (expr, range_checker, width) = create_field_expr_with_flags_setup(builder);

    let x = generate_random_biguint(&prime);
    let y = generate_random_biguint(&prime);
    let expected = (&x + &prime - &y) % &prime;
    let inputs = vec![x, y];
    let flags: Vec<bool> = vec![false, true];

    let trace = generate_direct_trace(&expr, &range_checker, inputs, flags, width);
    extract_and_verify_result(&expr, &trace, &expected, 0);
    verify_stark_with_traces(expr, range_checker, trace, width);
}

#[test]
fn test_select2() {
    let prime = secp256k1_coord_prime();
    let (_, builder) = setup(&prime);
    let builder = make_addsub_chip(builder);

    let (expr, range_checker, width) = create_field_expr_with_flags_setup(builder);

    let x = generate_random_biguint(&prime);
    let y = generate_random_biguint(&prime);
    let expected = (&x + &y) % &prime;
    let inputs = vec![x, y];
    let flags: Vec<bool> = vec![true, false];

    let trace = generate_direct_trace(&expr, &range_checker, inputs, flags, width);
    extract_and_verify_result(&expr, &trace, &expected, 0);
    verify_stark_with_traces(expr, range_checker, trace, width);
}

fn test_symbolic_limbs(expr: SymbolicExpr, expected_q: usize, expected_carry: usize) {
    let prime = secp256k1_coord_prime();
    let (q, carry) = expr.constraint_limbs(
        &prime,
        LIMB_BITS,
        32,
        &((BigUint::one() << 256) - BigUint::one()),
    );
    assert_eq!(q, expected_q);
    assert_eq!(carry, expected_carry);
}

#[test]
fn test_symbolic_limbs_add() {
    let expr = SymbolicExpr::Add(
        Box::new(SymbolicExpr::Var(0)),
        Box::new(SymbolicExpr::Var(1)),
    );
    // x + y = pq, q should fit in q limb.
    // x+y should have 32 limbs, pq also 32 limbs.
    let expected_q = 1;
    let expected_carry = 32;
    test_symbolic_limbs(expr, expected_q, expected_carry);
}

#[test]
fn test_symbolic_limbs_sub() {
    let expr = SymbolicExpr::Sub(
        Box::new(SymbolicExpr::Var(0)),
        Box::new(SymbolicExpr::Var(1)),
    );
    // x - y = pq, q should fit in q limb.
    // x - y should have 32 limbs, pq also 32 limbs.
    let expected_q = 1;
    let expected_carry = 32;
    test_symbolic_limbs(expr, expected_q, expected_carry);
}

#[test]
fn test_symbolic_limbs_mul() {
    let expr = SymbolicExpr::Mul(
        Box::new(SymbolicExpr::Var(0)),
        Box::new(SymbolicExpr::Var(1)),
    );
    // x * y = pq, and x,y can be up to 2^256 - 1 so q can be up to ceil((2^256 - 1)^2 / p) which
    // has 257 bits, which is 33 limbs x * y has 63 limbs, but p * q can have 64 limbs since q
    // is 33 limbs
    let expected_q = 33;
    let expected_carry = 64;
    test_symbolic_limbs(expr, expected_q, expected_carry);
}

#[test]
fn test_recorded_execution_records() {
    let prime = secp256k1_coord_prime();
    let (_, builder) = setup(&prime);

    let x1 = ExprBuilder::new_input(builder.clone());
    let x2 = ExprBuilder::new_input(builder.clone());
    let mut x3 = x1 + x2;
    x3.save();
    let builder = builder.borrow().clone();

    let (expr, range_checker, width) = create_field_expr_with_setup(builder);

    let x = generate_random_biguint(&prime);
    let y = generate_random_biguint(&prime);
    let expected = (&x + &y) % &prime;
    let inputs = vec![x.clone(), y.clone()];
    let flags: Vec<bool> = vec![];

    // Test record creation and reconstruction
    let mut buffer = vec![0u8; 1024];
    let mut record = FieldExpressionCoreRecordMut::new_from_execution_data(
        &mut buffer,
        &inputs,
        expr.canonical_num_limbs(),
    );
    let data: Vec<u8> = inputs
        .iter()
        .flat_map(|x| biguint_to_limbs_vec(x, expr.canonical_num_limbs()))
        .collect();
    record.fill_from_execution_data(0, &data);
    assert_eq!(*record.opcode, 0);

    // Verify input reconstruction preserves data
    let reconstructed_inputs: Vec<BigUint> = record
        .input_limbs
        .chunks(expr.canonical_num_limbs())
        .map(BigUint::from_bytes_le)
        .collect();
    assert_eq!(reconstructed_inputs.len(), inputs.len());
    for (original, reconstructed) in inputs.iter().zip(reconstructed_inputs.iter()) {
        assert_eq!(original, reconstructed);
    }

    // Test standard execution and verification using reconstructed inputs
    let trace = generate_direct_trace(&expr, &range_checker, reconstructed_inputs, flags, width);
    extract_and_verify_result(&expr, &trace, &expected, 0);
    verify_stark_with_traces(expr, range_checker, trace, width);
}

#[test]
fn test_trace_mathematical_equivalence() {
    let prime = secp256k1_coord_prime();
    let (_, builder) = setup(&prime);

    let x1 = ExprBuilder::new_input(builder.clone());
    let x2 = ExprBuilder::new_input(builder.clone());
    let x3 = &mut (x1.clone() * x2.clone()) + &mut (x1.clone().square());
    let mut x4 = x3.clone() / x2.clone(); // This will trigger auto-save
    x4.save();
    let builder = builder.borrow().clone();

    let (expr, range_checker, width) = create_field_expr_with_setup(builder);

    for _ in 0..10 {
        let x = generate_random_biguint(&prime);
        let y = generate_random_biguint(&prime);

        let expected = {
            let temp = (&x * &y + &x * &x) % &prime;
            let y_inv = y.modinv(&prime).unwrap();
            (temp * y_inv) % &prime
        };

        let inputs = vec![x.clone(), y.clone()];
        let flags: Vec<bool> = vec![];

        // Test direct/recorded equivalence
        test_trace_equivalence(&expr, &range_checker, inputs.clone(), flags.clone(), width);

        // Verify the actual computation is correct
        let direct_row = generate_direct_trace(&expr, &range_checker, inputs.clone(), flags, width);
        let FieldExprCols { vars, .. } = expr.load_vars(&direct_row);
        extract_and_verify_result(&expr, &direct_row, &expected, vars.len() - 1);
    }
}

#[test]
fn test_record_arena_allocation_patterns() {
    let prime = secp256k1_coord_prime();
    let (_, builder) = setup(&prime);

    let x1 = ExprBuilder::new_input(builder.clone());
    let x2 = ExprBuilder::new_input(builder.clone());
    let mut x3 = x1 + x2;
    x3.save();
    let builder = builder.borrow().clone();

    let (expr, _range_checker, _width) = create_field_expr_with_setup(builder);

    let inputs = vec![
        generate_random_biguint(&prime),
        generate_random_biguint(&prime),
    ];

    // Test record creation with various input sizes
    let mut buffer = vec![0u8; 1024];
    let mut record = FieldExpressionCoreRecordMut::new_from_execution_data(
        &mut buffer,
        &inputs,
        expr.canonical_num_limbs(),
    );
    let data: Vec<u8> = inputs
        .iter()
        .flat_map(|x| biguint_to_limbs_vec(x, expr.canonical_num_limbs()))
        .collect();
    record.fill_from_execution_data(0, &data);
    assert_eq!(*record.opcode, 0);

    // Test with maximum inputs
    let max_inputs = vec![BigUint::one(); 40]; // MAX_INPUT_LIMBS / 4
    let mut max_buffer = vec![0u8; 2048];
    let max_record =
        FieldExpressionCoreRecordMut::new_from_execution_data(&mut max_buffer, &max_inputs, 4);
    assert_eq!(*max_record.opcode, 0);

    // Test input reconstruction
    let reconstructed_inputs: Vec<BigUint> = record
        .input_limbs
        .chunks(expr.canonical_num_limbs())
        .map(BigUint::from_bytes_le)
        .collect();
    assert_eq!(reconstructed_inputs.len(), inputs.len());
    for (original, reconstructed) in inputs.iter().zip(reconstructed_inputs.iter()) {
        assert_eq!(original, reconstructed);
    }
}

#[test]
fn test_tracestep_tracefiller_roundtrip() {
    let prime = secp256k1_coord_prime();
    let (_, builder) = setup(&prime);

    let x1 = ExprBuilder::new_input(builder.clone());
    let x2 = ExprBuilder::new_input(builder.clone());
    let x3 = x1.clone() * x2.clone();
    let x4 = x3.clone() + x1.clone();
    let mut x5 = x4.clone();
    x5.save();
    let builder_data = builder.borrow().clone();

    let (expr, _range_checker, _width) = create_field_expr_with_setup(builder_data);

    let inputs = vec![
        generate_random_biguint(&prime),
        generate_random_biguint(&prime),
    ];

    let vars_direct = expr.execute(&inputs, &[]);

    // Test record creation and reconstruction roundtrip
    let mut buffer = vec![0u8; 1024];
    let mut record = FieldExpressionCoreRecordMut::new_from_execution_data(
        &mut buffer,
        &inputs,
        expr.canonical_num_limbs(),
    );
    let data: Vec<u8> = inputs
        .iter()
        .flat_map(|x| biguint_to_limbs_vec(x, expr.canonical_num_limbs()))
        .collect();
    record.fill_from_execution_data(0, &data);

    let reconstructed_inputs: Vec<BigUint> = record
        .input_limbs
        .chunks(expr.canonical_num_limbs())
        .map(BigUint::from_bytes_le)
        .collect();
    let vars_reconstructed = expr.execute(&reconstructed_inputs, &[]);

    // All intermediate variables must be preserved
    assert_eq!(vars_direct.len(), vars_reconstructed.len());
    for (direct, reconstructed) in vars_direct.iter().zip(vars_reconstructed.iter()) {
        assert_eq!(
            direct, reconstructed,
            "Variable preservation failed in roundtrip"
        );
    }
}

#[test]
fn test_direct_recorded_with_complex_operations() {
    let prime = secp256k1_coord_prime();
    let (_, builder) = setup(&prime);

    let x1 = ExprBuilder::new_input(builder.clone());
    let x2 = ExprBuilder::new_input(builder.clone());
    let x3 = ExprBuilder::new_input(builder.clone());

    let numerator = x1.clone() * x2.clone() + x3.clone();
    let denominator = x1.clone() + x2.clone();
    let mut result = numerator / denominator;
    result.save();

    let builder_data = builder.borrow().clone();
    let (expr, range_checker, width) = create_field_expr_with_setup(builder_data);

    // Test edge cases with small and large numbers
    let test_cases = vec![
        (
            BigUint::from(1u32),
            BigUint::from(2u32),
            BigUint::from(3u32),
        ),
        (
            BigUint::from(100u32),
            BigUint::from(200u32),
            BigUint::from(300u32),
        ),
        (
            generate_random_biguint(&prime),
            generate_random_biguint(&prime),
            generate_random_biguint(&prime),
        ),
    ];

    for (x, y, z) in test_cases {
        let inputs = vec![x.clone(), y.clone(), z.clone()];
        let flags = vec![];

        // Test direct/recorded equivalence
        test_trace_equivalence(&expr, &range_checker, inputs.clone(), flags.clone(), width);

        // Verify mathematical correctness
        let expected = {
            let num = (&x * &y + &z) % &prime;
            let den_inv = (&x + &y).modinv(&prime).unwrap();
            (num * den_inv) % &prime
        };

        let direct_row = generate_direct_trace(&expr, &range_checker, inputs, flags, width);
        let FieldExprCols { vars, .. } = expr.load_vars(&direct_row);
        extract_and_verify_result(&expr, &direct_row, &expected, vars.len() - 1);
    }
}

#[test]
fn test_concurrent_direct_recorded_simulation() {
    // Simulate mixed direct/recorded execution to ensure RecordArena abstraction works correctly
    let prime = secp256k1_coord_prime();
    let (_, builder) = setup(&prime);

    let x1 = ExprBuilder::new_input(builder.clone());
    let x2 = ExprBuilder::new_input(builder.clone());
    let mut x3 = x1 + x2;
    x3.save();
    let builder_data = builder.borrow().clone();

    let (expr, range_checker, width) = create_field_expr_with_setup(builder_data);

    // Simulate multiple "concurrent" executions with different modes
    let execution_scenarios = vec![
        ("direct", true),
        ("recorded", false),
        ("direct", true),
        ("recorded", false),
    ];

    let mut all_traces = Vec::new();

    for (name, is_direct) in execution_scenarios {
        let inputs = vec![
            generate_random_biguint(&prime),
            generate_random_biguint(&prime),
        ];

        let trace = if is_direct {
            generate_direct_trace(&expr, &range_checker, inputs.clone(), vec![], width)
        } else {
            generate_recorded_trace(&expr, &range_checker, &inputs, vec![], width)
        };

        all_traces.push((name, inputs, trace));
    }

    // Verify each trace is mathematically valid
    for (_, inputs, trace) in &all_traces {
        let expected = (&inputs[0] + &inputs[1]) % &prime;
        extract_and_verify_result(&expr, trace, &expected, 0);
    }

    // Verify that direct and recorded with same inputs produce same results
    let same_inputs = vec![BigUint::from(123u32), BigUint::from(456u32)];
    test_trace_equivalence(&expr, &range_checker, same_inputs, vec![], width);
}