CIRCUIT PLAYGROUND
Flip the switches, press RUN, and a contract on BNB Chain computes the answer. Free forever — eval() and step() are view functions, so this is a read, not a transaction: no wallet, no gas, no signature. You are not simulating the circuit in your browser. The chain is doing the logic.
Starting on Behemoth circuit #2 — a plain NAND gate, five transistors.
① SET THE INPUTS
The first run happens automatically.
② WHAT THE CHAIN ANSWERED
LATCH STATE (FED BACK IN ON THE NEXT TICK)
idle
③ WHAT ACTUALLY HAPPENED
No magic and no backend logic — one eth_call, the same one you could make yourself. Bits pack little-endian: pin 0 is the lowest bit of byte 0, pin 8 is the lowest bit of byte 1.
SHOW THE RAW REQUEST AND RESPONSE
DO IT YOURSELF ON BSCSCAN
WHY THIS MATTERS
A circuit here is not a picture of a circuit. Every gate was paid for with a burned transistor token, and the logic table lives in contract storage on BNB Chain. When you press RUN, ~30 validators would agree on the same answer — the chain is the computer.
Circuits with latches (nState > 0) have memory, so eval() refuses them with has latch: use step. Those advance one clock tick at a time through step(), which returns the new state — feed it back in and you are clocking a machine. Behemoth's circuit #1 is the whole 47-bit CPU, and each tick is one instruction cycle of the slowest computer in the world.
Want to build one? Mint transistors, wire them on the canvas at tapeout.net, then tape out your own processor.