Yeah, I&#x27;m wondering how that would look at the assembly level. In the &quot;x + y - z&quot; example we get an overflow from the &quot;x + y&quot; and an underflow when we add z. So you&#x27;d have to check if the number of overflows and the number of underflows are equal, and the assembly would probably be really slow. You&#x27;d want some kind of bounds check optimization to try and remove as many of those checks as you can.<p>Fortunately, I don&#x27;t think these issues will appear too often (at least they haven&#x27;t in my experience), and you can probably get away with just adding unit tests. To be completely thorough you should probably use some sort of formal modeling and proof system, which I would like to see someone try and develop for Rust.