Lab 6 of 10 · rank 05
Inputs D0, D1, S. Output Y equals D0 when S is 0, D1 when S is 1.
Learn first
Imagine a railway junction: one lever chooses which track goes through. When S is 0, Y copies D0; when S is 1, Y copies D1. The other input is ignored.
Computers use thousands of these to route data around. Build it with two ANDs (each one gated by S or not-S) joined by an OR.
Make notS with a NOT. AND D0 with notS; AND D1 with S. OR the two results into Y. Test all eight rows — only S should decide which data line you see.
Turn logic into a permanent, verifiable part.
Y = (D0 AND NOT S) OR (D1 AND S).
Par is 4 NAND. Using more still passes; fewer is just neater.
One grant per lab per wallet, materials only — WFR is earned by mining verified dies, never given away. The server re-checks your circuit before signing.
Turn this circuit into a verified die you own. It burns 0 NAND — the grant covers it.