Commit 2023-11-25 17:07 a538c320
View on Github →feat: prove an upper bound on bitwise operations (#8598)
A simple result which shows that if x and y fit within n bits, then the result of any bitwise operation on x and y also
fits within n bits.