Add jnz component

Author: alon-f

crates/prover/src/components/jnz_opcode/component.rs

@@ -0,0 +1,161 @@
+use itertools::{chain, Itertools};
+use num_traits::One;
+use serde::{Deserialize, Serialize};
+use stwo_prover::constraint_framework::{
+    EvalAtRow, FrameworkComponent, FrameworkEval, RelationEntry,
+};
+use stwo_prover::core::backend::simd::m31::LOG_N_LANES;
+use stwo_prover::core::channel::Channel;
+use stwo_prover::core::fields::m31::M31;
+use stwo_prover::core::fields::qm31::SecureField;
+use stwo_prover::core::fields::secure_column::SECURE_EXTENSION_DEGREE;
+use stwo_prover::core::pcs::TreeVec;
+
+use crate::relations::{MemoryRelation, StateRelation};
+use crate::utils::component::{decode_opcode, is_bit};
+use crate::utils::{Selector, SelectorTrait};
+
+pub const N_TRACE_CELLS: usize = 19;
+
+// Assumes INSTRUCTION_BASE=K such that:
+/// `
+/// addap_imm = K
+/// jmp_abs_imm = K + 1
+/// jmp_rel_imm = K + 2
+/// `
+// TODO: organize opcodes so that K will work as detailed above, instead of just 0.
+pub const INSTRUCTION_BASE: M31 = M31::from_u32_unchecked(0);
+
+pub type Component = FrameworkComponent<Eval>;
+
+pub struct Eval {
+    pub claim: Claim,
+    pub memory_lookup: MemoryRelation,
+    pub state_lookup: StateRelation,
+}
+
+impl FrameworkEval for Eval {
+    fn log_size(&self) -> u32 {
+        std::cmp::max(self.claim.n_rows.next_power_of_two().ilog2(), LOG_N_LANES)
+    }
+
+    fn max_constraint_log_degree_bound(&self) -> u32 {
+        self.log_size() + 1
+    }
+
+    fn evaluate<E: EvalAtRow>(&self, mut eval: E) -> E {
+        let state = std::array::from_fn(|_| eval.next_trace_mask());
+        // Use initial state.
+        eval.add_to_relation(RelationEntry::new(&self.state_lookup, E::EF::one(), &state));
+        let [pc, ap, fp] = state;
+
+        // Assert flags are in range.
+        let [op_type, reg] = std::array::from_fn(|_| eval.next_trace_mask());
+        eval.add_constraint(is_bit::<E>(&op_type));
+        eval.add_constraint(is_bit::<E>(&reg));
+
+        // Check instruction.
+        let opcode = decode_opcode(
+            INSTRUCTION_BASE.into(),
+            &[
+                (op_type.clone(), 2), // [jmp abs, jmp rel]
+                (reg.clone(), 2),     // [ap, fp]
+            ],
+        );
+
+        let [off, imm] = std::array::from_fn(|_| eval.next_trace_mask());
+
+        eval.add_to_relation(RelationEntry::new(
+            &self.memory_lookup,
+            E::EF::one(),
+            &[
+                pc.clone(),
+                opcode.clone(),
+                off.clone(),
+                imm.clone(),
+            ],
+        ));
+        // Compute address.
+        let addr = eval.next_trace_mask();
+        eval.add_constraint(
+            addr.clone() - (Selector::select(&reg, [&(ap.clone()), &(fp.clone())]) + off),
+        );
+
+        let addr_val_arr: [E::F; 4] = std::array::from_fn(|_| eval.next_trace_mask());
+        eval.add_to_relation(RelationEntry::new(
+            &self.memory_lookup,
+            E::EF::one(),
+            &chain!([addr], addr_val_arr.clone()).collect_vec(),
+        ));
+        let val = E::combine_ef(addr_val_arr); 
+
+
+        // Check jnz condition.
+        let maybe_inverse_val = E::combine_ef(std::array::from_fn(|_| eval.next_trace_mask()));
+        let flag = eval.next_trace_mask();
+        eval.add_constraint(is_bit::<E>(&flag));
+
+        // flag == 0 iff val == 0 iff val is not invertible <=>
+        // ==> 0 = val * (1 - flag) + (1 - val * val^{-1}) * flag
+        eval.add_constraint(
+            val.clone() * (E::F::one() - flag.clone())
+                + (E::EF::one() - val.clone() * maybe_inverse_val) * flag.clone(),
+        );
+
+        // Assert new pc.
+        // The relative branch when taken is obvious.
+        let jmp_target_if_taken =
+            &Selector::select(&op_type, [&imm, &(pc.clone() + imm.clone())]);
+
+        let new_pc = eval.next_trace_mask();
+
+        eval.add_constraint(
+            new_pc.clone() - Selector::select(&flag, [&(pc + E::F::one()), jmp_target_if_taken]),
+        );
+
+        // Yield final state.
+        let new_state = [new_pc, ap, fp];
+        eval.add_to_relation(RelationEntry::new(
+            &self.state_lookup,
+            -E::EF::one(),
+            &new_state,
+        ));
+
+        eval.finalize_logup_in_pairs();
+        eval
+    }
+}
+
+#[derive(Copy, Clone, Serialize, Deserialize)]
+pub struct Claim {
+    pub n_rows: usize,
+}
+
+impl Claim {
+    pub fn log_sizes(&self) -> TreeVec<Vec<u32>> {
+        let log_size = std::cmp::max(self.n_rows.next_power_of_two().ilog2(), LOG_N_LANES);
+        let preprocessed_log_sizes = vec![log_size];
+        let trace_log_sizes = vec![log_size; N_TRACE_CELLS];
+        let interaction_log_sizes = vec![log_size; SECURE_EXTENSION_DEGREE * 3];
+        TreeVec::new(vec![
+            preprocessed_log_sizes,
+            trace_log_sizes,
+            interaction_log_sizes,
+        ])
+    }
+
+    pub fn mix_into(&self, channel: &mut impl Channel) {
+        channel.mix_u64(self.n_rows as u64);
+    }
+}
+
+#[derive(Clone, Serialize, Deserialize)]
+pub struct InteractionClaim {
+    pub log_size: u32,
+    pub claimed_sum: SecureField,
+}
+impl InteractionClaim {
+    pub fn mix_into(&self, channel: &mut impl Channel) {
+        channel.mix_felts(&[self.claimed_sum]);
+    }
+}

crates/prover/src/components/jnz_opcode/mod.rs

@@ -0,0 +1,159 @@
+pub mod component;
+pub mod prover;
+
+pub use component::{Claim, Component, Eval, InteractionClaim};
+pub use prover::ClaimGenerator;
+
+#[cfg(test)]
+mod tests {
+
+    use itertools::{chain, Itertools};
+    use num_traits::Zero;
+    use rand::rngs::SmallRng;
+    use rand::{Rng, SeedableRng};
+    use stwo_prover::constraint_framework::{
+        FrameworkComponent, FrameworkEval, TraceLocationAllocator,
+    };
+    use stwo_prover::core::backend::simd::qm31::PackedSecureField;
+    use stwo_prover::core::backend::simd::SimdBackend;
+    use stwo_prover::core::channel::Blake2sChannel;
+    use stwo_prover::core::fields::m31::M31;
+    use stwo_prover::core::fields::qm31::QM31;
+    use stwo_prover::core::pcs::{CommitmentSchemeProver, PcsConfig};
+    use stwo_prover::core::poly::circle::{CanonicCoset, PolyOps};
+    use stwo_prover::core::vcs::blake2_merkle::Blake2sMerkleChannel;
+
+    use super::*;
+    use crate::components::jnz_opcode::component::INSTRUCTION_BASE;
+    use crate::components::memory;
+    use crate::input::instructions::VmState;
+    use crate::relations;
+
+    #[test]
+    fn test_jnz_opcode() {
+        const LOG_HEIGHT: u32 = 8;
+        const LOG_BLOWUP_FACTOR: u32 = 1;
+
+        let mut rng = SmallRng::seed_from_u64(0);
+
+        #[allow(clippy::erasing_op, clippy::identity_op)]
+        let jnz_rel_ap = INSTRUCTION_BASE + M31(1 + 0 * 2);
+        #[allow(clippy::erasing_op, clippy::identity_op)]
+        let jnz_abs_fp = INSTRUCTION_BASE + M31(0 + 1 * 2);
+
+        #[allow(clippy::erasing_op, clippy::identity_op)]
+        let add_ap_ap_fp = INSTRUCTION_BASE + M31(0 + 0 * 2 + 1 * 4 + 1 * 8 + 0 * 16);
+        #[allow(clippy::erasing_op, clippy::identity_op)]
+        let mul_fp_fp_ap_appp = INSTRUCTION_BASE + M31(1 + 1 * 2 + 1 * 4 + 0 * 8 + 1 * 16);
+        let x: QM31 = rng.gen();
+        let y: QM31 = rng.gen();
+        let z: QM31 = rng.gen();
+
+        // Initialize at pc=0, ap=2, fp=4 with:
+        //  pc -> 0: [ap] = [fp] + [fp]
+        //        1: [fp + 1] = [fp + 2] * [ap + 1]; ap++
+        //  ap -> 2: 2X
+        //        3: Y
+        //  fp -> 4: X
+        //        5: Z * Y
+        //        6: Z
+        let mut memory_claim_generator = memory::ClaimGenerator {
+            values: vec![PackedSecureField::from_array([
+                QM31::from_m31_array([add_ap_ap_fp, M31(0), M31(0), M31(0)]),
+                QM31::from_m31_array([mul_fp_fp_ap_appp, M31(1), M31(2), M31(1)]),
+                x + x,
+                y,
+                x,
+                z * y,
+                z,
+                QM31::zero(),
+                QM31::zero(),
+                QM31::zero(),
+                QM31::zero(),
+                QM31::zero(),
+                QM31::zero(),
+                QM31::zero(),
+                QM31::zero(),
+                QM31::zero(),
+            ])],
+            // Dummy multiplicities
+            multiplicities: vec![1; 16],
+        };
+
+        let claim_generator = ClaimGenerator::new(
+            chain!(
+                vec![
+                    VmState {
+                        pc: 0,
+                        ap: 2,
+                        fp: 4,
+                    };
+                    128
+                ],
+                vec![
+                    VmState {
+                        pc: 1,
+                        ap: 2,
+                        fp: 4,
+                    };
+                    128
+                ]
+            )
+            .collect_vec(),
+        );
+
+        let twiddles = SimdBackend::precompute_twiddles(
+            CanonicCoset::new(LOG_HEIGHT + LOG_BLOWUP_FACTOR)
+                .circle_domain()
+                .half_coset,
+        );
+
+        let channel = &mut Blake2sChannel::default();
+        let config = PcsConfig::default();
+        let commitment_scheme =
+            &mut CommitmentSchemeProver::<SimdBackend, Blake2sMerkleChannel>::new(
+                config, &twiddles,
+            );
+
+        // Preprocessed.
+        let tree_builder = commitment_scheme.tree_builder();
+        tree_builder.commit(channel);
+
+        let mut tree_builder = commitment_scheme.tree_builder();
+        let (claim, interaction_claim_generator) =
+            claim_generator.write_trace(&mut tree_builder, &mut memory_claim_generator);
+
+        tree_builder.commit(channel);
+        let mut tree_builder = commitment_scheme.tree_builder();
+
+        let memory_relation = relations::MemoryRelation::draw(channel);
+        let state_relation = relations::StateRelation::draw(channel);
+        let interaction_claim = interaction_claim_generator.write_interaction_trace(
+            &mut tree_builder,
+            &memory_relation,
+            &state_relation,
+        );
+        tree_builder.commit(channel);
+
+        let trace_location_allocator = &mut TraceLocationAllocator::default();
+        let component = FrameworkComponent::new(
+            trace_location_allocator,
+            Eval::new(claim, memory_relation, state_relation),
+            interaction_claim.claimed_sum,
+        );
+
+        let trace_polys = commitment_scheme
+            .trees
+            .as_ref()
+            .map(|t| t.polynomials.iter().cloned().collect_vec());
+
+        stwo_prover::constraint_framework::assert_constraints(
+            &trace_polys,
+            CanonicCoset::new(LOG_HEIGHT),
+            |eval| {
+                component.evaluate(eval);
+            },
+            interaction_claim.claimed_sum,
+        )
+    }
+}