◉ cell soupA world of possibilities v0.9.10lcrh.github.io

Roll a living world. See what evolves.

Preparing the sunlight habitat…
SunlightCloud shadowCorpse—
Pinch or scroll to zoom · drag to pan · tap to inspect · R to roll
—living cells
0:00simulated time
—actual speed
—edible corpses
—landed attacks
—confirmed kills
—divisions

Red traces: attacks · cyan tails: thrust · gold rings: eating · green arrows: energy gifts · Max advances 24 ticks between drawings.

Population history

Attacks & population pressure

Landed attacks—
Confirmed kills—
Pressure deaths—

Same time window as population history, with separate vertical scales. Rates average each sampling interval. Kills count cells whose energy was depleted by an attack; shield-only hits and other deaths are excluded. Pressure deaths count cells whose usable energy was depleted by a population-pressure hit; their remains can be eaten. Totals start at world creation.

Where the energy goes

Energy in—
Energy out—

Colored bands show actual usable energy gained or spent, with separate vertical scales. Storing and mobilizing move energy between pools; gifts move it between cells. These transfers appear on the relevant sides, so intake is not all newly produced energy. Failed actions spend no action energy; ordinary computation costs still apply.

Execution trace compression

Actual instruction paths from up to 32 living cells, followed for 256 ticks. A fresh sample starts about once a simulated minute.

—gzip size / original byte
—after shuffling event order
—smaller thanks to ordering

Preparing an execution sample…

Simple loops also compress well. This measures repetition and ordering, not intelligence or evolutionary complexity by itself. Register values and physics are excluded.

Experimental coarse observer

Behavioral epiplexity estimate

How much structure a small predictor learns from the whole world's behavior. Random colors and the camera view are excluded.

—learned model size
—unpredicted behavior
—shuffled model size

Recording behavior…

Green: behavior · gray: shuffled baseline

What this estimate means

Every two simulated seconds, the GPU records a coarse map of cell density, links, motion, recent activity, energy and reserves. Eleven bounded predictors compete to describe a 32-sample window. The smallest combined model and prediction code wins; the displayed estimate is that model's size in bits. Prediction error is checked on separate, unseen frames.

This is a limited observer, not a universal complexity score or a measure of intelligence. Simple repetition and noise should need small models. Population changes and physics can also create learnable patterns. The shuffled comparison preserves each channel's frequencies while removing spatial and temporal order. Compare scores with the same sampling and model settings.

Epiplexity paper ↗

Save genome

This saves a world setup or observed genome, not a running population. Copy JSON if downloads are unavailable.

Download JSON