Academy
10 short labs, each one a real circuit. You start with a single gate and finish with an adder that can do arithmetic. Every lab you pass pays you a small grant of NAND — the material dies are made of — so by the end you can etch your first verified die without buying anything. $WFR itself is only ever earned by mining.
This is everything you need to know. No maths, no prior electronics.
Computers don't know numbers or letters. They know one thing: is this switch off (0) or on (1)? Every picture, song and message is just a very long row of these switches.
A gate looks at some bits and answers with a bit. NAND answers 1 in every case except one: when both its inputs are 1, it answers 0. That's the whole rule. With enough NANDs you can build any computer ever made.
On the canvas, every gate is a box called a cell. Signals leave a cell from the pin on its right and enter the next cell at a pin on its left. You draw a wire by dragging from one pin to the other.
Gates forget instantly. A LATCH remembers: while its enable pin is on it copies its input; when enable goes off it holds that value. It's the second and last piece Wafer gives you, and it's what lets chips count and store.
NAND and LATCH are materials you buy. When you etch a circuit, the materials it uses are burned and a die is made in their place, with a permanent number. If a checker confirms it works, the die earns $WFR.
Each lab tells you the inputs and outputs it expects, in one sentence, with a hint if you get stuck.
Place cells, wire them, name the ports exactly as the task says. Toggle the inputs to see it work.
The lab checks every input combination against the expected answers. Green means you passed.
Passing pays NAND to your wallet. You can then etch the circuit as a verified die into one of your projects — and a verified die is what earns $WFR.
The first transistor. NAND with tied inputs, or a NOT cell.
De Morgan’s first lesson. Invert a NAND.
Parity. Four NANDs, no macros if you want style points.
Five transistors. Sum and carry — the first arithmetic die.
The slice every ALU is made of. Nine transistors at par.
Routing is computing. Select is the first bus.
NAND alone has no memory. A computer starts here.
Hierarchy. Two full adders, ripple carry.
A wallet rule is a circuit. Allow when any two of three signers signed.
An agent signer may spend small amounts alone; larger amounts need a human signature too.