tasm_lib/arithmetic/u128/shift_right.rs
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195
use std::collections::HashMap;
use triton_vm::prelude::*;
use crate::prelude::*;
use crate::traits::basic_snippet::Reviewer;
use crate::traits::basic_snippet::SignOffFingerprint;
/// [Shift right][shr] for unsigned 128-bit integers.
///
/// # Behavior
///
/// ```text
/// BEFORE: _ [arg: u128] shift_amount
/// AFTER: _ [result: u128]
/// ```
///
/// # Preconditions
///
/// - input argument `arg` is properly [`BFieldCodec`] encoded
/// - input argument `shift_amount` is in `0..128`
///
/// # Postconditions
///
/// - the output is the input argument `arg` bit-shifted to the right by
/// input argument `shift_amount`
/// - the output is properly [`BFieldCodec`] encoded
///
/// [shr]: core::ops::Shr
#[derive(Debug, Default, Copy, Clone, Eq, PartialEq, Hash)]
pub struct ShiftRight;
impl ShiftRight {
pub const SHIFT_AMOUNT_TOO_BIG_ERROR_ID: i128 = 540;
}
impl BasicSnippet for ShiftRight {
fn inputs(&self) -> Vec<(DataType, String)> {
let arg = (DataType::U128, "arg".to_string());
let shift_amount = (DataType::U32, "shift_amount".to_string());
vec![arg, shift_amount]
}
fn outputs(&self) -> Vec<(DataType, String)> {
vec![(DataType::U128, "shifted_arg".to_string())]
}
fn entrypoint(&self) -> String {
"tasmlib_arithmetic_u128_shift_right".to_string()
}
fn code(&self, _: &mut Library) -> Vec<LabelledInstruction> {
let entrypoint = self.entrypoint();
let shift_amount_gt_32 = format!("{entrypoint}_shift_amount_gt_32");
triton_asm!(
// BEFORE: _ v_3 v_2 v_1 v_0 s
// AFTER: _ (v >> s)_3 (v >> s)_2 (v >> s)_1 (v >> s)_0
{entrypoint}:
/* bounds check */
push 128
dup 1
lt
assert error_id {Self::SHIFT_AMOUNT_TOO_BIG_ERROR_ID}
// _ v_3 v_2 v_1 v_0 s
/* special case if shift amount is greater than 32 */
dup 0
push 32
lt // _ v_3 v_2 v_1 v_0 s (s > 32)
skiz
call {shift_amount_gt_32}
// _ v_3 v_2 v_1 v_0 s
/* for an explanation, see snippet “u64::ShiftRight” */
push -1
mul
addi 32 // _ v_3 v_2 v_1 v_0 (32 - s)
push 2
pow // _ v_3 v_2 v_1 v_0 (2^(32 - s))
dup 0
pick 5
mul // _ v_2 v_1 v_0 (2^(32 - s)) v_3s
place 4
xb_mul // _ v_3s v_2s v_1s v_0s
pick 3
split // _ v_2s v_1s v_0s (v >> s)_3 c_2
pick 4
split // _ v_1s v_0s (v >> s)_3 c_2 (v_2 >> s) c_1
pick 5
split // _ v_0s (v >> s)_3 c_2 (v_2 >> s) c_1 (v_1 >> s) c_0
pick 6
split // _ (v >> s)_3 c_2 (v_2 >> s) c_1 (v_1 >> s) c_0 (v_0 >> s) trash
pop 1 // _ (v >> s)_3 c_2 (v_2 >> s) c_1 (v_1 >> s) c_0 (v_0 >> s)
add // _ (v >> s)_3 c_2 (v_2 >> s) c_1 (v_1 >> s) (v >> s)_0
place 4 // _ (v >> s)_3 (v >> s)_0 c_2 (v_2 >> s) c_1 (v_1 >> s)
add // _ (v >> s)_3 (v >> s)_0 c_2 (v_2 >> s) (v >> s)_1
place 3 // _ (v >> s)_3 (v >> s)_1 (v >> s)_0 c_2 (v_2 >> s)
add // _ (v >> s)_3 (v >> s)_1 (v >> s)_0 (v_2 >> s)_2
place 2 // _ (v >> s)_3 (v_2 >> s)_2 (v >> s)_1 (v >> s)_0
return
// BEFORE: _ [v: u128] s
// AFTER: _ [v >> i·32: u128] (s - i·32)
// such that i·32 <= s < (i+1)·32
{shift_amount_gt_32}:
addi -32 // _ v_3 v_2 v_1 v_0 (s - 32)
pick 1
pop 1 // _ v_3 v_2 v_1 (s - 32)
push 0
place 4 // _ 0 v_3 v_2 v_1 (s - 32)
dup 0
push 32
lt
skiz
recurse
return
)
}
fn sign_offs(&self) -> HashMap<Reviewer, SignOffFingerprint> {
let mut sign_offs = HashMap::new();
sign_offs.insert(Reviewer("ferdinand"), 0x9875596d880d6dd0.into());
sign_offs
}
}
#[cfg(test)]
mod tests {
use super::*;
use crate::test_prelude::*;
use rand::rngs::StdRng;
impl Closure for ShiftRight {
type Args = (u128, u32);
fn rust_shadow(&self, stack: &mut Vec<BFieldElement>) {
let (arg, shift_amount) = pop_encodable::<Self::Args>(stack);
assert!(shift_amount < 128);
push_encodable(stack, &(arg >> shift_amount));
}
fn pseudorandom_args(
&self,
seed: [u8; 32],
bench_case: Option<BenchmarkCase>,
) -> Self::Args {
let mut rng = StdRng::from_seed(seed);
match bench_case {
Some(BenchmarkCase::CommonCase) => (0x642, 20),
Some(BenchmarkCase::WorstCase) => (0x123, 127),
None => (rng.random(), rng.random_range(0..128)),
}
}
fn corner_case_args(&self) -> Vec<Self::Args> {
[0, 1 << 3, 1 << 64, u64::MAX.into(), 1 << 127, u128::MAX]
.into_iter()
.cartesian_product(0..128)
.collect()
}
}
#[test]
fn rust_shadow() {
ShadowedClosure::new(ShiftRight).test();
}
#[proptest]
fn too_large_shift_crashes_vm(arg: u128, #[strategy(128_u32..)] shift_amount: u32) {
test_assertion_failure(
&ShadowedClosure::new(ShiftRight),
InitVmState::with_stack(ShiftRight.set_up_test_stack((arg, shift_amount))),
&[ShiftRight::SHIFT_AMOUNT_TOO_BIG_ERROR_ID],
)
}
}
#[cfg(test)]
mod benches {
use super::*;
use crate::test_prelude::*;
#[test]
fn benchmark() {
ShadowedClosure::new(ShiftRight).bench();
}
}