Open Autoparallel opened 3 months ago
We should provide a proof for:
fn rotate_right<const N: usize>(x: u32) -> u32 { (x >> N) | (x << (32 - N) }
as it is used throughout other calculations in SHA-256.
Good insight for this would be the u32add already implemented in Binius.
We should provide a proof for:
as it is used throughout other calculations in SHA-256.
Good insight for this would be the u32add already implemented in Binius.