How Binary Addition Works: Carrying + Worked Examples
Binary addition uses four simple bit rules plus carrying. Learn the method, work through carry-chain examples, understand overflow, and check your own answers.
How Binary Addition Works: Carrying, Rules, and Worked Examples
A binary addition calculator adds numbers written in base 2 — the language of bits, where every digit is either 0 or 1. The good news: binary addition follows the exact same column-by-column, carry-the-overflow logic as the decimal addition you learned in school. There are only four single-bit rules to memorize, and once you know them you can add any two binary numbers by hand or verify what a calculator returns.
Here are the four rules in one breath: 0 + 0 = 0; 0 + 1 = 1; 1 + 0 = 1; and 1 + 1 = 10, which means write 0 and carry 1. The only twist compared to decimal is that binary "rolls over" at 2 instead of 10, so a carry happens much more often. In this guide we walk through those rules, work several examples including a carry chain, explain overflow, and show how binary addition connects to text and data encoding. If you want to see binary in action, our text-to-binary tool is linked below.
The Four Rules of Binary Addition
Every binary addition reduces to combining single bits in a column, just like decimal. Here is the complete rule set:
| Sum | Result bit | Carry |
|---|---|---|
| 0 + 0 | 0 | 0 |
| 0 + 1 | 1 | 0 |
| 1 + 0 | 1 | 0 |
| 1 + 1 | 0 | 1 (carry to next column) |
There is one more case you hit during a carry chain: 1 + 1 + 1 (two bits plus an incoming carry) equals 11 in binary, meaning you write 1 and carry 1. Keep that fifth case in your back pocket; it is the only thing that trips up beginners.
Why Binary Carries More Often Than Decimal
In decimal, a column overflows only when the sum reaches 10. In binary, the place values are 1, 2, 4, 8, 16 and so on, so a column overflows the moment the sum reaches 2. That is why "1 + 1 = 10" — there is no single digit for two in binary, so it rolls into the next place value just as "9 + 1 = 10" rolls over in decimal. Understanding place value is the key to never losing track of a carry.
Worked Example: Adding Two Binary Numbers
Let's add 1011 (which is 11 in decimal) and 0110 (which is 6 in decimal). The expected answer is 17, or 10001 in binary. Work right to left, column by column.
| Step (column) | Bits + carry | Write | Carry out |
|---|---|---|---|
| 1 (rightmost) | 1 + 0 | 1 | 0 |
| 2 | 1 + 1 | 0 | 1 |
| 3 | 0 + 1 + 1 (carry) | 0 | 1 |
| 4 | 1 + 0 + 1 (carry) | 0 | 1 |
| 5 (carry out) | 0 + 0 + 1 (carry) | 1 | 0 |
Reading the "Write" column from bottom to top gives 10001. Convert back: 16 + 0 + 0 + 0 + 1 = 17. The carry from column 2 propagated all the way through columns 3 and 4 — that is the carry chain in action, and it is exactly the work a binary addition calculator does instantly.
A Second Example: A Long Carry Chain
Add 1111 (15) and 0001 (1). Every column produces a carry:
- Column 1: 1 + 1 = write 0, carry 1.
- Column 2: 1 + 0 + 1 = write 0, carry 1.
- Column 3: 1 + 0 + 1 = write 0, carry 1.
- Column 4: 1 + 0 + 1 = write 0, carry 1.
- Column 5: 0 + 0 + 1 = write 1.
Result: 10000, which is 16. This mirrors decimal "9999 + 1 = 10000": a single carry ripples through every position. It is the binary equivalent of an odometer rolling over.
Comparing Binary and Decimal Side by Side
It helps to see the same addition in both bases at once. Take 5 + 3 = 8. In decimal that is a single trivial step. In binary, 5 is 101 and 3 is 011, and the work looks like this:
| Column | Bits + carry | Write | Carry |
|---|---|---|---|
| 1 (rightmost) | 1 + 1 | 0 | 1 |
| 2 | 0 + 1 + 1 (carry) | 0 | 1 |
| 3 | 1 + 0 + 1 (carry) | 0 | 1 |
| 4 (carry out) | 0 + 0 + 1 (carry) | 1 | 0 |
Result: 1000, which is 8. Three carries to produce a number that took zero carries in decimal. This is normal: binary trades digit simplicity (only 0 and 1) for more frequent carrying. Hardware does not mind — flipping a bit and propagating a carry is cheap and fast for a circuit, which is the whole point of using base 2.
How Hardware Adds: The Full Adder
Inside a processor, each column of a binary addition is handled by a small logic circuit called a full adder. It takes three inputs — the two bits being added plus any incoming carry — and produces two outputs: the sum bit and the carry-out bit. String enough full adders together, feeding each carry-out into the next adder's carry-in, and you can add numbers of any width. That chain of carry-outs is the physical version of the carry chain you traced by hand earlier. You do not need to design circuits to add binary, but it is satisfying to know the by-hand method and the silicon are doing the same thing.
What Is Overflow?
Computers store numbers in a fixed number of bits — often 8, 16, 32, or 64. If a sum needs more bits than the register holds, the extra carry has nowhere to go and is dropped, producing a wrong result. This is called overflow. For example, in an 8-bit unsigned register the largest value is 11111111 (255); adding 1 gives 100000000, but only the lower 8 bits are kept, so the stored result wraps around to 0. This wrap-around behavior is why understanding binary addition matters for real-world programming, not just exams.
How Binary Addition Connects to Text and Data
Every character you type is stored as a binary number under the hood — the letter "A" is 65, or 01000001 in binary. Arithmetic on those values, including addition, is how computers manipulate everything from text to images. If you want to see how characters map to bits before you start adding them, run a phrase through the Text To Binary converter and watch each letter turn into an 8-bit pattern. It makes the abstract idea of "everything is binary" concrete.
Tips for Adding Binary by Hand
- Always work right to left, exactly like decimal addition.
- Write the carry above the next column so you do not forget it.
- Remember the fifth case: 1 + 1 + 1 = write 1, carry 1.
- Sanity-check by converting both numbers to decimal, adding, and converting the answer back.
- Pad the shorter number with leading zeros so the columns line up.
With those habits, binary addition becomes mechanical. To go the other direction and explore how data is encoded, the Text To Binary tool is the quickest sandbox.
Frequently Asked Questions
What is 1 + 1 in binary?
1 + 1 equals 10 in binary, which represents the number two. You write a 0 in the current column and carry a 1 to the next column, exactly like 9 + 1 rolling over to 10 in decimal.
Why does binary carry so often?
Binary only has the digits 0 and 1, so a column overflows as soon as the sum reaches 2. Decimal does not overflow until 10, so carries are far more frequent in binary addition.
What does 1 + 1 + 1 equal in binary?
1 + 1 + 1 equals 11 in binary, which is three. You write a 1 in the current column and carry a 1. This case appears whenever two bits plus an incoming carry all equal 1.
What is binary overflow?
Overflow happens when the result of an addition needs more bits than the register can hold. The extra carry is dropped, so the stored value wraps around — for example, an 8-bit 255 + 1 becomes 0 instead of 256.
How do I check my binary addition is correct?
Convert both binary numbers to decimal, add them normally, then convert the decimal sum back to binary. If it matches your binary result, your addition is correct.
Is binary addition the same as decimal addition?
The method is identical: add column by column from right to left and carry overflow to the next column. The only difference is that binary rolls over at 2 instead of 10, so carries happen more often.
Why do computers use binary instead of decimal?
Electronic circuits reliably represent two states, on and off, which map naturally to 1 and 0. Binary makes hardware simpler and more error-resistant than trying to represent ten distinct voltage levels for decimal.
Want to see binary up close? Convert any phrase with the Text To Binary tool, then practice adding the resulting bit patterns. Browse more on the Binary Converter hub, or continue with our guides on binary to octal conversion and solving systems of equations.