tasm_lib/arithmetic/u64/
and.rs

1use std::collections::HashMap;
2
3use triton_vm::prelude::*;
4
5use crate::prelude::*;
6use crate::traits::basic_snippet::Reviewer;
7use crate::traits::basic_snippet::SignOffFingerprint;
8
9/// [Bitwise “and”][bitand] (“`&`”) for `u64`s.
10///
11/// ### Behavior
12///
13/// ```text
14/// BEFORE: _ [right: u64] [left: u64]
15/// AFTER:  _ [right & left: u64]
16/// ```
17///
18/// ### Preconditions
19///
20/// - all input arguments are properly [`BFieldCodec`] encoded
21///
22/// ### Postconditions
23///
24/// - the output is the bitwise “and” of the input
25/// - the output is properly [`BFieldCodec`] encoded
26///
27/// [bitand]: core::ops::BitAnd
28#[derive(Debug, Copy, Clone, Eq, PartialEq, Hash)]
29pub struct And;
30
31impl BasicSnippet for And {
32    fn inputs(&self) -> Vec<(DataType, String)> {
33        ["rhs", "lhs"]
34            .map(|side| (DataType::U64, side.to_string()))
35            .to_vec()
36    }
37
38    fn outputs(&self) -> Vec<(DataType, String)> {
39        vec![(DataType::U64, "(lhs & rhs)".to_string())]
40    }
41
42    fn entrypoint(&self) -> String {
43        "tasmlib_arithmetic_u64_and".to_string()
44    }
45
46    fn code(&self, _: &mut Library) -> Vec<LabelledInstruction> {
47        triton_asm!(
48            // BEFORE: _ rhs_hi rhs_lo lhs_hi lhs_lo
49            // AFTER:  _ (rhs & lhs)_hi (rhs & lhs)_lo
50            {self.entrypoint()}:
51                pick 2
52                and
53                // _ rhs_hi lhs_hi (rhs_lo & lhs_lo)
54
55                place 2
56                and
57                pick 1
58                // _ (lhs_hi & rhs_hi) (rhs_lo & lhs_lo)
59                // _ (rhs & lhs)_hi    (lhs & rhs)_lo
60
61                return
62        )
63    }
64
65    fn sign_offs(&self) -> HashMap<Reviewer, SignOffFingerprint> {
66        let mut sign_offs = HashMap::new();
67        sign_offs.insert(Reviewer("ferdinand"), 0xfd2a6e206fb3abab.into());
68        sign_offs
69    }
70}
71
72#[cfg(test)]
73pub(crate) mod tests {
74    use super::*;
75    use crate::test_prelude::*;
76
77    impl Closure for And {
78        type Args = (u64, u64);
79
80        fn rust_shadow(&self, stack: &mut Vec<BFieldElement>) {
81            let (right, left) = pop_encodable::<Self::Args>(stack);
82            push_encodable(stack, &(left & right));
83        }
84
85        fn pseudorandom_args(
86            &self,
87            seed: [u8; 32],
88            bench_case: Option<BenchmarkCase>,
89        ) -> Self::Args {
90            match bench_case {
91                Some(BenchmarkCase::CommonCase) => (u32::MAX.into(), 1 << 10),
92                Some(BenchmarkCase::WorstCase) => (u64::MAX, u64::MAX - 1),
93                None => StdRng::from_seed(seed).random(),
94            }
95        }
96
97        fn corner_case_args(&self) -> Vec<Self::Args> {
98            let edge_points = [1, 1 << 32, u64::MAX - 1]
99                .into_iter()
100                .flat_map(|p| [p - 1, p, p + 1]);
101
102            edge_points.clone().cartesian_product(edge_points).collect()
103        }
104    }
105
106    #[test]
107    fn rust_shadow() {
108        ShadowedClosure::new(And).test();
109    }
110}
111
112#[cfg(test)]
113mod benches {
114    use super::*;
115    use crate::test_prelude::*;
116
117    #[test]
118    fn benchmark() {
119        ShadowedClosure::new(And).bench();
120    }
121}
tasm_lib/arithmetic/u64/and.rs

tasm_lib/arithmetic/u64/
and.rs
