Lab 5 of 15 · rank 04
Inputs A, B, Cin. Outputs S, Cout. Three-bit addition.
Learn first
When you add long numbers, each column takes a carry from the previous one. A full adder handles that: it adds A, B and Cin, and gives a sum S and a carry out Cout.
It's two half adders chained: the first adds A and B, the second adds that sum to Cin. Cout is 1 if either half adder carried.
Half adder #1 on A and B gives S1 and C1. Half adder #2 on S1 and Cin gives S (the final sum) and C2. Cout = C1 OR C2 (OR is a NAND fed by two NOTs — or use the HA and OR cells from the library; they compile to NAND for you).
Turn logic into a permanent, verifiable part.
Two half adders plus an OR, or the FA macro.
Par is 9 NAND. Using more still passes here. To etch it as a verified die that mines, keep it within 18 NAND-equivalent (a LATCH counts 2): the verifier refuses bigger designs, so padding can't buy mining weight.
Turn this circuit into a verified die you own. It burns 0 NAND. Get materials at the Foundry.