Build a random number generator out of logic gates. Every tick, the circuit reads its register, runs the gates, and writes the result back. Whatever reaches OUTPUT is tested, and the bits that pass are certified and paid for.
Stuck on a stage? The guide explains what each one asks for, with folded hints that never give the whole answer.
This is an alpha. Costs and tests will be tuned, and a later update may have to reset saves. Your progress lives only in this browser.
Bits per second = clock ÷ gates × bits per tick × quality × the grade's pay. Each gate costs a clock cycle per tick, so a small circuit that passes beats a big one that passes. Your bits are always certified at whichever unlocked grade pays best.
Bits alone don't buy the big unlocks. Wider registers, stricter grades and faster clocks also ask your circuit to prove something first, like a long loop or a quality score. Once proven, it stays proven. If you close the page with the circuit running, it keeps earning at half rate for up to 8 hours.
The analyzer runs your circuit from its seed and reads a sample twice: right after the seed, and again 40,009 ticks later. The worse of the two counts. Quality is the product of every test's score.
A circuit like this never creates randomness. It only stretches its seed: the same seed always gives the same bits. Passing statistical tests is not proof of randomness, and it says nothing about whether the output is safe for passwords or keys. The tests here are small versions of real ones (monobit, runs, autocorrelation, poker, serial, Berlekamp–Massey linear complexity).
Space run or pause · . step · Delete remove part · Esc cancel wiring · Ctrl+Z / Ctrl+Y undo / redo