8-Bit Ripple-Carry Adder (2D)

This 2D companion draws the same 8-bit ripple-carry adder as a flat gate-level circuit diagram instead of an orbit-controlled 3D scene: each of the eight stages is a genuine full adder computed from XOR/AND/OR boolean logic — sum = A⊕B⊕Cin, carry = (A·B)+(Cin·(A⊕B)) — and the carry chain visibly ripples from the least-significant stage to the most-significant one, one gate-delay at a time, exactly the dependency that makes this adder topology slower than carry-lookahead designs. Toggle each bit of A and B directly, or randomize both operands, and watch the binary, decimal and carry-out/overflow readouts update once the ripple finishes.