miden-air 0.22.3

Algebraic intermediate representation of Miden VM processor
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

//! Public input boundary constraints.
//!
//! Enforces that the stack trace entries matches the claimed public inputs:
//! - First row: stack[0..16] == stack_inputs[0..16]
//! - Last row:  stack[0..16] == stack_outputs[0..16]

use miden_crypto::stark::air::{AirBuilder, LiftedAirBuilder};

use crate::{
    MainTraceRow,
    constraints::tagging::{TaggingAirBuilderExt, ids::TAG_PUBLIC_INPUTS_BASE},
};

// CONSTANTS
// ================================================================================================

const STACK_DEPTH: usize = 16;

/// Number of public values at the tail of the public_values slice
/// (stack_inputs + stack_outputs + pc_transcript_state).
const TAIL_LEN: usize = STACK_DEPTH + STACK_DEPTH + 4;

// TAGGING CONSTANTS
// ================================================================================================

const STACK_INPUT_NAMESPACE: &str = "public_inputs.stack_input";
const STACK_OUTPUT_NAMESPACE: &str = "public_inputs.stack_output";

// ENTRY POINTS
// ================================================================================================

/// Enforces public input boundary constraints for the stack.
///
/// - First row: `stack[i] == stack_inputs[i]` for i in 0..16
/// - Last row:  `stack[i] == stack_outputs[i]` for i in 0..16
pub fn enforce_main<AB>(builder: &mut AB, local: &MainTraceRow<AB::Var>)
where
    AB: LiftedAirBuilder,
{
    // Copy public values into local arrays to release the immutable borrow on builder.
    let pv = builder.public_values();
    let n = pv.len();
    assert!(n >= TAIL_LEN, "public values too short: {n} < {TAIL_LEN}");
    let si: [AB::PublicVar; STACK_DEPTH] = core::array::from_fn(|i| pv[n - TAIL_LEN + i]);
    let so: [AB::PublicVar; STACK_DEPTH] =
        core::array::from_fn(|i| pv[n - TAIL_LEN + STACK_DEPTH + i]);

    // First row: stack[i] == stack_inputs[i]
    let input_ids: [usize; STACK_DEPTH] = core::array::from_fn(|i| TAG_PUBLIC_INPUTS_BASE + i);
    builder.tagged_list(input_ids, STACK_INPUT_NAMESPACE, |builder| {
        builder
            .when_first_row()
            .assert_zeros(core::array::from_fn::<_, STACK_DEPTH, _>(|i| {
                let stack_i: AB::Expr = local.stack[i].clone().into();
                let pv_i: AB::Expr = si[i].into();
                stack_i - pv_i
            }));
    });

    // Last row: stack[i] == stack_outputs[i]
    let output_ids: [usize; STACK_DEPTH] =
        core::array::from_fn(|i| TAG_PUBLIC_INPUTS_BASE + STACK_DEPTH + i);
    builder.tagged_list(output_ids, STACK_OUTPUT_NAMESPACE, |builder| {
        builder
            .when_last_row()
            .assert_zeros(core::array::from_fn::<_, STACK_DEPTH, _>(|i| {
                let stack_i: AB::Expr = local.stack[i].clone().into();
                let pv_i: AB::Expr = so[i].into();
                stack_i - pv_i
            }));
    });
}