Indexing the archive…
Your Universe of Digital Possibilities
Two fields of the same three hundred points. One is chance, with its clumps and voids; the other is that very scatter raked even — and it is the even one that looks random. Pick the field chance drew, twelve times. Then a web of nearest-neighbour threads measures both, and you pick again.
The mean distance from each point to its nearest neighbour, over what complete spatial randomness of the same density predicts — ½√(A/n) for n points in area A, plus Donnelly’s 1978 term for the points a boundary of perimeter P robs of neighbours. Chance sits at one; clumping pulls R below it, and anything that holds points apart — a rake, a planting, territory — pushes it above.
Let each seed hop to the centre of mass of its own cell, recompute the cells, and repeat. A random scatter relaxes into an even honeycomb — the identical assign-then-average loop as k-means clustering.
The exact central interval for K, the count of wins in n independent plays at win probability p — computed from the rules alone, before a single play. A record inside it is the rules working; a record outside it happens one time in twenty, and the band says so in advance. When the chance of each play is fixed before it is played but differs from play to play, the same band comes from the Poisson-binomial sum.
The eighth twin is the spatial inversion: the forgery is too ordered, and the eye prefers it. The rake is The Mosaic’s Lloyd loop, borrowed as the forger’s tool; the temporal twin of the lesson is The Pulse, where the tidy coin is the fake; and The Field keeps its rack title. Chance holds no one anywhere — so it clumps.