A machine that keeps running.

A real WaferMachine — a binary ripple counter built from four chained TFF cells, running the exact formula WaferCore.eval executes on chain.

CLKTFF 0T=10TFF 1T=10TFF 2T=10TFF 3T=10
PAUSEDdie #4-BIT-CNT
0
0x0 · 0000
0
0 stages
4 TFF
0x0000…0000

Pipeline

one eval per master clock — the ripple settles across the chain
CLOCKedge in
Q0 TFFbit 0
Q1·Q2 TFFripple
COMMITstate root

Register bits

Q3 · Q2 · Q1 · Q0 — the counter's persistent state
Q3Q2Q1Q0
0
0
0
0

Waveform

CLK, Q0..Q3 — last cycles, live

Live trace

every state transition, in order
Client-side reference simulation of the exact gate formula WaferCore runs on-chain. Etch this netlist, register it, start a WaferMachine — it then runs one tick per BNB Chain block, forever.

How this maps to Wafer

every piece of this demo is a real, already-shipped primitive — nothing here is aspirational
The die4 chained TFF gates (op 17) — counter4Netlist() in the Studio's preset library
Registering itWaferCore.register(dieId, code) — stored once as pointer-contract bytecode, immutable forever
One clockeval(dieId, inputs, state) → (outputs, nextState) — exactly the formula animating on this page
Running forevera WaferMachine replays one cycle per block; stateAt(block) answers any past block, no keeper required
New this roundTFF / JKFF / SRLATCH plus composed register/counter/shift-register presets — sequential state is now a few clicks in the Studio