← all environments 01 · Core · Digital · v0.3.3
8-Bit Digital Adder
DigitalEight full-adder cells built from XOR/AND/OR primitives. Clicking an input port toggles a bit and dispatches one synchronous logic pass; high nets glow as the carry ripples left to right.
66 components · 89 connections · event-driven Boolean solver
the ahaAddition is fast, but the carry is a rumour — and a rumour has to travel.
why it works
Each bit of the answer needs two facts: the sum and the carry it hands upward, . The (XOR) tells you the bit; the AND/OR pair tells you whether a spilled over. Here is the catch a newcomer never sees on paper: bit cannot finish until bit has decided its carry. So the truth does not appear everywhere at once — it ripples, one cell at a time, from the least significant bit to the most. That travel time is exactly why real processors abandon this circuit for carry-lookahead.
governing model
structural inventory
- full-adder cell
- XOR + AND
- OR carry merge
- + Sum ports
boundaries
- -bit operands · –
- sum – with carry-out
- per-gate propagation delay
fault relay carry chain stuck-at-0
-
Type two numbers and watch the front move.
Set and , then watch the glow: the low bits settle first and a bright carry front climbs upward. You are literally watching information propagate. -
Toggle bit 0 of an all-ones operand.
Flip the lowest bit of and a single carry sweeps all the way to — one bit of input, eight cells of consequence. This is the worst case, . -
Throw the stuck-at-0 fault.
Freeze the carry chain and the sum silently loses its overflow. The bits still light up — the rumour just never arrives.
causal signal trace paused
Sample A, B, and The input register changes now; no sum output is allowed to jump ahead of the carry front.
step 1 / 10 Sample A, B, and Cᵢₙ
Loading 8-Bit Digital Adder model…