2023-11-13 11:03:50 -05:00
|
|
|
use plonky2::field::extension::Extendable;
|
|
|
|
|
use plonky2::field::packed::PackedField;
|
|
|
|
|
use plonky2::field::types::Field;
|
|
|
|
|
use plonky2::hash::hash_types::RichField;
|
|
|
|
|
use plonky2::iop::ext_target::ExtensionTarget;
|
|
|
|
|
use plonky2::plonk::circuit_builder::CircuitBuilder;
|
|
|
|
|
|
|
|
|
|
use crate::constraint_consumer::{ConstraintConsumer, RecursiveConstraintConsumer};
|
|
|
|
|
use crate::cpu::columns::CpuColumnsView;
|
|
|
|
|
|
|
|
|
|
pub(crate) fn eval_packed<P: PackedField>(
|
|
|
|
|
lv: &CpuColumnsView<P>,
|
|
|
|
|
nv: &CpuColumnsView<P>,
|
|
|
|
|
yield_constr: &mut ConstraintConsumer<P>,
|
|
|
|
|
) {
|
2023-12-08 17:57:45 -05:00
|
|
|
// The MSTORE_32BYTES opcodes are differentiated from MLOAD_32BYTES
|
|
|
|
|
// by the 5th bit set to 0.
|
|
|
|
|
let filter = lv.op.m_op_32bytes * (lv.opcode_bits[5] - P::ONES);
|
2023-12-13 18:35:17 -05:00
|
|
|
let new_offset = nv.mem_channels[0].value;
|
2023-11-13 11:03:50 -05:00
|
|
|
let virt = lv.mem_channels[2].value[0];
|
|
|
|
|
// Read len from opcode bits and constrain the pushed new offset.
|
|
|
|
|
let len_bits: P = lv.opcode_bits[..5]
|
|
|
|
|
.iter()
|
|
|
|
|
.enumerate()
|
|
|
|
|
.map(|(i, &bit)| bit * P::Scalar::from_canonical_u64(1 << i))
|
|
|
|
|
.sum();
|
|
|
|
|
let len = len_bits + P::ONES;
|
2023-12-13 18:35:17 -05:00
|
|
|
yield_constr.constraint(filter * (new_offset[0] - virt - len));
|
|
|
|
|
for &limb in &new_offset[1..] {
|
|
|
|
|
yield_constr.constraint(filter * limb);
|
|
|
|
|
}
|
2023-11-13 11:03:50 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
pub(crate) fn eval_ext_circuit<F: RichField + Extendable<D>, const D: usize>(
|
|
|
|
|
builder: &mut CircuitBuilder<F, D>,
|
|
|
|
|
lv: &CpuColumnsView<ExtensionTarget<D>>,
|
|
|
|
|
nv: &CpuColumnsView<ExtensionTarget<D>>,
|
|
|
|
|
yield_constr: &mut RecursiveConstraintConsumer<F, D>,
|
|
|
|
|
) {
|
2023-12-08 17:57:45 -05:00
|
|
|
// The MSTORE_32BYTES opcodes are differentiated from MLOAD_32BYTES
|
|
|
|
|
// by the 5th bit set to 0.
|
|
|
|
|
let filter =
|
|
|
|
|
builder.mul_sub_extension(lv.op.m_op_32bytes, lv.opcode_bits[5], lv.op.m_op_32bytes);
|
2023-12-13 18:35:17 -05:00
|
|
|
let new_offset = nv.mem_channels[0].value;
|
2023-11-13 11:03:50 -05:00
|
|
|
let virt = lv.mem_channels[2].value[0];
|
|
|
|
|
// Read len from opcode bits and constrain the pushed new offset.
|
|
|
|
|
let len_bits = lv.opcode_bits[..5].iter().enumerate().fold(
|
|
|
|
|
builder.zero_extension(),
|
|
|
|
|
|cumul, (i, &bit)| {
|
|
|
|
|
builder.mul_const_add_extension(F::from_canonical_u64(1 << i), bit, cumul)
|
|
|
|
|
},
|
|
|
|
|
);
|
2023-12-13 18:35:17 -05:00
|
|
|
let diff = builder.sub_extension(new_offset[0], virt);
|
2023-11-13 11:03:50 -05:00
|
|
|
let diff = builder.sub_extension(diff, len_bits);
|
|
|
|
|
let constr = builder.mul_sub_extension(filter, diff, filter);
|
|
|
|
|
yield_constr.constraint(builder, constr);
|
2023-12-13 18:35:17 -05:00
|
|
|
for &limb in &new_offset[1..] {
|
|
|
|
|
let constr = builder.mul_extension(filter, limb);
|
|
|
|
|
yield_constr.constraint(builder, constr);
|
|
|
|
|
}
|
2023-11-13 11:03:50 -05:00
|
|
|
}
|