It computes
A full 8-bit ALU sits behind thirty-two opcodes. Arithmetic, logic, shifts, memory, branches, input and output all run through the same gate table.
ONE PRIMITIVE · ONE EDGE PER BLOCK · ROBINHOOD CHAIN
Runnet CPU is a gate-level 8-bit processor built from NAND gates and walked one clock edge at a time. The browser runs the same netlist the contracts are designed to execute, so the machine on this page is computation, not a video of computation.
The machine is small enough to inspect and complete enough to behave like a real processor. Its gate table, assembler, browser machine and chain logic all follow the same RN-8 design.
A full 8-bit ALU sits behind thirty-two opcodes. Arithmetic, logic, shifts, memory, branches, input and output all run through the same gate table.
Sixteen registers and 256 bytes of RAM are latched with the machine. State survives from one edge to the next instead of being reconstructed by the interface.
Each step carries an input value. Programs can read it through the input port and place a result on the output port for another contract or application to use.
The ROM and every sponsored input are enough to replay the machine from reset. A deterministic processor makes every historical edge independently checkable.
Press step and the browser evaluates all 2,161 NAND gates in topological order, then latches every flip-flop together. The white pixels in the die view are gates that changed on the current edge.
The processor description places logic one primitive at a time. The optimiser removes dead and duplicate work, verification runs against the resulting netlist, and that same table feeds both the browser and the contract toolchain.
One primitive. Adders, muxes, decoders and storage are composed from it.
The builder lays out the processor in call order, which is already dependency order.
Constants fold, repeated logic is shared, and logic with no reader disappears.
Exhaustive arithmetic and differential machine checks must pass before output is written.
The gate array and chip contracts can be compiled, deployed and compared edge by edge.
The opcode field is completely occupied. The row matching the instruction currently executing in the machine above lights white.
| OP | MNEMONIC | FORM | EFFECT |
|---|
Runnet CPU lives on Robinhood Chain. Its public clock is designed so any connected wallet can take the next edge when the live machine is available.
No wallet connected.
Read the current public machine state directly from Robinhood Chain when the live processor is online.
Write RN-8 assembly, run it across the real 2,161-gate netlist, and take a working program toward Robinhood Chain.
The reference chip carries the Runnet identity and the $RUNNET ticker. New programs can be assembled and simulated from the workbench.
1. Write or paste RN-8 assembly.
2. Assemble against the shipped opcode table.
3. Run it on all 2,161 NAND gates in your browser.
4. Deploy the silicon and chip contracts to Robinhood Chain.
5. Advance the live machine through its public chain clock.
The browser executes the full processor locally, while Robinhood Chain carries the public machine state. Every edge can be inspected from gates to registers.
Every clock edge evaluates the full topological gate table.
Exhaustive combinational vectors in the silicon build before the netlist is emitted.
The processor runs directly in the browser with no remote emulator service.
New silicon is added beside deployed silicon rather than replacing it. The contracts already expose the shape of the gate array through a specification interface.
8-bit gate-level processor, browser machine, assembler and Robinhood Chain clock.
Program workbench, chip design data, factory deployment and per-chip token integration.
16-bit and later generations produced from the same primitive and validated through the same interface.
Off-chain execution with a disputed edge recomputed by the deployed gate array.