
Carry and signed overflow in an eight-bit adder
Trace eight-bit additions to distinguish unsigned carry from signed overflow, then exhaustively check the sign-bit detection rule.
Foundation
The journal / Ideas in progress
Engineering & everyday learningSoftware, systems, and the things I’m learning along the way. From first principles to AI in production.
Find something to readA little theory. A lot of practice.

Trace eight-bit additions to distinguish unsigned carry from signed overflow, then exhaustively check the sign-bit detection rule.

Calculate propagation through a four-bit ripple-carry adder using explicit hypothetical gate delays, then connect the result to a register timing budget.

Replace a three-bit field in an eight-bit word, verify unaffected bits, and see why device registers need a separate access contract.