Single Estimator Demo

Watch the Cincinnati Algorithm Learn from a Bit Stream

How it works: The estimator receives randomly generated bits (70% red/1, 30% blue/0), compares its internal state with random bits, and decides whether to extend or modify its memory. This matches the original cincinnati.py example!

Input Mode:

Input Bit Stream:

Max Estimator Length:

Total Iterations: 0 / 40

Bit 0 (Blue)

Bit 1 (Red)

Current Input

Current Output

Cincinnati Algorithm Visualization

Left: Observation (star) | Right: Estimator (pie wedges with random bit underlines)

Estimated Probability (should converge to ~0.70):

Formula: bit[0]×0.5 + bit[1]×0.25 + bit[2]×0.125 + ...

Processing History (Cycle: 0)

Click "Step Once" to begin...