In binary arithmetic, occurs when the result of an operation exceeds the maximum value that can be represented with the given number of bits.

When an overflow occurs, the result may wrap around or be , leading to incorrect calculations.

In some programming languages, binary overflow can cause an to be thrown, while others may wrap the result around to a minimum value.

In signed representations, overflow can cause a positive number to become and vice versa.

When binary overflow happens, the most significant bit is often lost, leading to an incorrect .

A common example of binary overflow is when adding two large together, resulting in a value that cannot be stored in the designated bits.