use crate::components::prelude::*;
use crate::relations::VERIFY_BITWISE_XOR_12_RELATION_ID;
pub const ELEM_BITS: u32 = 12;
pub const EXPAND_BITS: u32 = 2;
pub const LIMB_BITS: u32 = ELEM_BITS - EXPAND_BITS;
pub const LOG_SIZE: u32 = (ELEM_BITS - EXPAND_BITS) * 2;
pub const N_MULT_COLUMNS: usize = 1 << (EXPAND_BITS * 2);
pub const N_TRACE_COLUMNS: usize = N_MULT_COLUMNS;
pub struct Eval {
pub claim: Claim,
pub common_lookup_elements: relations::CommonLookupElements,
}
#[derive(Copy, Clone, Serialize, Deserialize, CairoSerialize, CairoDeserialize)]
pub struct Claim {}
impl Claim {
pub fn log_sizes(&self) -> TreeVec<Vec<u32>> {
let trace_log_sizes = vec![LOG_SIZE; N_TRACE_COLUMNS];
let interaction_log_sizes =
vec![LOG_SIZE; SECURE_EXTENSION_DEGREE * N_MULT_COLUMNS.div_ceil(2)];
TreeVec::new(vec![vec![], trace_log_sizes, interaction_log_sizes])
}
pub fn mix_into(&self, _channel: &mut impl Channel) {}
}
#[derive(Copy, Clone, Serialize, Deserialize, CairoSerialize, CairoDeserialize)]
pub struct InteractionClaim {
pub claimed_sum: SecureField,
}
impl InteractionClaim {
pub fn mix_into(&self, channel: &mut impl Channel) {
channel.mix_felts(&[self.claimed_sum]);
}
}
pub type Component = FrameworkComponent<Eval>;
impl FrameworkEval for Eval {
fn log_size(&self) -> u32 {
LOG_SIZE
}
fn max_constraint_log_degree_bound(&self) -> u32 {
self.log_size() + 1
}
fn evaluate<E: EvalAtRow>(&self, mut eval: E) -> E {
let a_low = eval.get_preprocessed_column(PreProcessedColumnId {
id: "bitwise_xor_10_0".to_owned(),
});
let b_low = eval.get_preprocessed_column(PreProcessedColumnId {
id: "bitwise_xor_10_1".to_owned(),
});
let c_low = eval.get_preprocessed_column(PreProcessedColumnId {
id: "bitwise_xor_10_2".to_owned(),
});
for i in 0..1 << EXPAND_BITS {
for j in 0..1 << EXPAND_BITS {
let multiplicity = eval.next_trace_mask();
let a = a_low.clone() + E::F::from(M31(i << LIMB_BITS));
let b = b_low.clone() + E::F::from(M31(j << LIMB_BITS));
let c = c_low.clone() + E::F::from(M31((i ^ j) << LIMB_BITS));
eval.add_to_relation(RelationEntry::new(
&self.common_lookup_elements,
-E::EF::from(multiplicity),
&[VERIFY_BITWISE_XOR_12_RELATION_ID.into(), a, b, c],
));
}
}
eval.finalize_logup_in_pairs();
eval
}
}
#[cfg(test)]
mod tests {
use num_traits::Zero;
use rand::rngs::SmallRng;
use rand::{Rng, SeedableRng};
use stwo::core::fields::qm31::QM31;
use stwo_constraint_framework::expr::ExprEvaluator;
use super::*;
use crate::components::constraints_regression_test_values::VERIFY_BITWISE_XOR_12;
#[test]
fn verify_bitwise_xor_12_constraints_regression() {
let mut rng = SmallRng::seed_from_u64(0);
let eval = Eval {
claim: Claim {},
common_lookup_elements: relations::CommonLookupElements::dummy(),
};
let expr_eval = eval.evaluate(ExprEvaluator::new());
let assignment = expr_eval.random_assignment();
let mut sum = QM31::zero();
for c in expr_eval.constraints {
sum += c.assign(&assignment) * rng.gen::<QM31>();
}
VERIFY_BITWISE_XOR_12.assert_debug_eq(&sum);
}
}