tasm_lib/arithmetic/u64/
and.rsuse std::collections::HashMap;
use triton_vm::prelude::*;
use crate::prelude::*;
use crate::traits::basic_snippet::Reviewer;
use crate::traits::basic_snippet::SignOffFingerprint;
#[derive(Debug, Copy, Clone, Eq, PartialEq, Hash)]
pub struct And;
impl BasicSnippet for And {
fn inputs(&self) -> Vec<(DataType, String)> {
["rhs", "lhs"]
.map(|side| (DataType::U64, side.to_string()))
.to_vec()
}
fn outputs(&self) -> Vec<(DataType, String)> {
vec![(DataType::U64, "(lhs & rhs)".to_string())]
}
fn entrypoint(&self) -> String {
"tasmlib_arithmetic_u64_and".to_string()
}
fn code(&self, _: &mut Library) -> Vec<LabelledInstruction> {
triton_asm!(
{self.entrypoint()}:
pick 2
and
place 2
and
pick 1
return
)
}
fn sign_offs(&self) -> HashMap<Reviewer, SignOffFingerprint> {
let mut sign_offs = HashMap::new();
sign_offs.insert(Reviewer("ferdinand"), 0xfd2a6e206fb3abab.into());
sign_offs
}
}
#[cfg(test)]
pub(crate) mod tests {
use super::*;
use crate::test_prelude::*;
impl Closure for And {
type Args = (u64, u64);
fn rust_shadow(&self, stack: &mut Vec<BFieldElement>) {
let (right, left) = pop_encodable::<Self::Args>(stack);
push_encodable(stack, &(left & right));
}
fn pseudorandom_args(
&self,
seed: [u8; 32],
bench_case: Option<BenchmarkCase>,
) -> Self::Args {
match bench_case {
Some(BenchmarkCase::CommonCase) => (u32::MAX.into(), 1 << 10),
Some(BenchmarkCase::WorstCase) => (u64::MAX, u64::MAX - 1),
None => StdRng::from_seed(seed).random(),
}
}
fn corner_case_args(&self) -> Vec<Self::Args> {
let edge_points = [1, 1 << 32, u64::MAX - 1]
.into_iter()
.flat_map(|p| [p - 1, p, p + 1]);
edge_points.clone().cartesian_product(edge_points).collect()
}
}
#[test]
fn rust_shadow() {
ShadowedClosure::new(And).test();
}
}
#[cfg(test)]
mod benches {
use super::*;
use crate::test_prelude::*;
#[test]
fn benchmark() {
ShadowedClosure::new(And).bench();
}
}