Prism

A flock of boids over a toroidal world, in exact integer arithmetic. Drag the timeline: every frame reproduces from the step index alone.

Pause the swarm, poke one boid, and fork the timeline. Both branches persist side by side, git-graph style, and each replays byte-for-byte from its perturbed state.

A fiber swarm over a channel under a seeded-shuffle scheduler. Every hostile interleaving is different; every final state is byte-identical. The determinism theorem, counted live.

Browse seeded scheduler paths as nodes. Each interleaving is different, every final-state hash agrees, and clicking a node shows the concrete fiber trace that got there.

Two rods tumbling into chaos, integrated with a fixed-step symplectic scheme in pure Prism. Sensitive dependence, rendered bit-reproducible. Chaos, replayed exactly.

Freeze a running program into a portable envelope, fly its bytes to another tab, and resume it there, code identity checked by hash before the first step. A suspended computation, moved.

Every definition is stored under the hash of its content and its dependencies' hashes, a Merkle DAG. Edit one function and only its hash and the hashes above it move; unrelated code keeps its address.

A memoized cell graph. Change one source and only the affected cone recomputes; a derivation that re-runs to the same value cuts the cascade off by hash, so its dependents stay cached.