Prism

Six worker fibers each compute a value and send it over one channel; a collector fiber receives them and sorts by id. A seeded-shuffle scheduler picks which runnable fiber goes next, so every seed is a different hostile interleaving, visible above as the run order scrambles. The collector sorts, so arrival order cannot reach the result: the formation below is byte-identical on every schedule. Policy is just a handler over the one effect.