Build a Half Adder
Combine fundamental gates to perform your absolute first arithmetic logic.
The Arithmetic Threshold
Computers process logic using gates, but they perform math using Adders. A Half Adder fundamentally adds two separate 1-bit binary inputs (A and B) producing a total Sum bit, and if it exceeds 1, pushing out a Carry overflow bit.
This logic leverages exactly two overlapping primitive gates mapping identical signal trajectories simultaneously.
Interactive Demonstration
Test running 1 + 1 mathematically inside the embedded visual physics simulation below. When both gates activate, the Sum violently returns to 0, but the Carry indicator lights up, calculating 10 (the binary representation of 2)!
| Input A | Input B | Carry (Overflow) | Sum |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 |
| 1 | 0 | 0 | 1 |
| 1 | 1 | 1 | 0 |