Compute A − B using two's complement in any bit width from 4 to 64. Get binary steps, carry-out, wrapped result, signed decimal output, and overflow detection instantly.
Range for selected bits:
Two's complement is the standard way digital systems represent signed integers in binary. In an n-bit system, the most significant bit acts as the sign bit: 0 for non-negative values and 1 for negative values. Instead of storing a separate sign and magnitude, two's complement encodes negative numbers so arithmetic hardware can reuse the same adder circuits for both addition and subtraction.
For example, in 8 bits, the value 00000101 represents +5. The value -5 is stored as the two's complement of 5: invert bits (11111010) and add 1, giving 11111011. This format eliminates dual zero representations and simplifies machine-level arithmetic.
Two's complement is efficient because subtraction can be turned into addition. Hardware designers avoid building separate subtraction logic by computing A - B as A + (~B + 1). This reduces circuit complexity, improves speed, and keeps arithmetic operations predictable across instruction sets.
From microcontrollers to desktop processors, this method remains universal. Whether you are debugging assembly code, learning digital electronics, building FPGA designs, or preparing for computer architecture exams, mastering two's complement subtraction is essential.
The algorithm used by this 2's complement subtraction calculator follows the same method hardware uses:
This process guarantees consistent wrapped arithmetic inside the selected bit width. If the exact mathematical answer is outside the representable range, the calculator flags signed overflow.
Overflow happens when the true mathematical result cannot be represented using the selected number of bits. For n bits, the signed range is:
-2^(n-1) to 2^(n-1)-1
In 8 bits, that is -128 to +127. If you compute 100 - (-50), the exact result is 150, which exceeds +127, so signed overflow occurs. The binary output still contains an n-bit wrapped value, but it is no longer the exact signed result you might expect in unlimited precision arithmetic.
Important: carry-out alone does not reliably indicate signed overflow. Signed overflow depends on representable range, not simply on the final carry bit.
Example 1: 13 − 5 in 8 bits
Example 2: 7 − 12 in 4 bits
Use this calculator to see each intermediate step clearly and verify binary arithmetic during homework, interview prep, and low-level programming tasks.
It performs two's complement operations and reports signed interpretation. The binary pattern can also be viewed as unsigned if needed, but overflow status is evaluated for signed range.
You can select from 4 to 64 bits. Larger widths are useful for systems programming and architecture demonstrations.
In fixed-width arithmetic, results wrap modulo 2^n. When the exact answer is outside the signed range, the wrapped value no longer matches unlimited-precision math, and this is expected behavior.
Yes. It is designed to show the exact sequence used in manual two's complement subtraction, making it ideal for digital logic and computer organization study sessions.