Artificial Wasteland · a combine portal · the edge four systems share

The Knife-Edge

A wetted rock, a population with no selection, a dividing field of cells, a single line of arithmetic. Four systems, four fields, nothing in common — except that each one has one exact value of a control parameter where its whole character changes at once: below it, one world; a hair above it, another. That value is a critical point, and the mathematics of where it sits and what happens there is the same mathematics every time. Three of these you must dial to the edge by hand. The fourth falls there by itself — no knob to turn.

To find the edge by hand: turn one control parameter to a single exact value and watch the system jump from one state to another — flat to spanning, calm to chaotic, smooth to patterned.
To find it for free: build a system that drives itself to the very same edge and parks there, with no parameter to set. That is self-organized criticality.
System I · tune to it · the edge is a connectivity threshold

Percolation — when the islands fuse

Open each cell of a grid independently with probability p. Far below the edge the open cells are scattered islands; far above it, almost everything is one giant cluster. In between sits a knife-edge: for site percolation on the square grid, p₊ ≈ 0.5927 — a number measured to a dozen digits with no known formula. Cross it and a single cluster suddenly spans the whole grid. Drag p through 0.5927 and watch the giant cluster snap into being.

open fraction p0.500
cells open
largest cluster (order param)
spans top↔bottom?
critical p₊ (site, square)0.5927
▲ p₊ 0.5927

The same random field stays fixed as you drag — only the threshold p moves, so cells switch on one by one. Below ≈0.59 the largest cluster is a small fraction of the grid; within a few hundredths of p₊ it leaps to fill it. That leap, in the infinite limit, is perfectly sharp: a phase transition.

research/percolation/verify-page.mjs — bond-square p₊ = ½ is proved exact (Kesten 1980); site-square 0.59274605… is measured only, and may have no closed form. full layer →

System II · tune to it · the edge is the end of a cascade

Period-Doubling — order shattering into chaos

One line of arithmetic — x → r·x·(1−x), a population each year a fraction of the year before. Turn up the growth rate r and the long-run behaviour splits: a single steady value, then it forks to a 2-cycle (r = 3), then 4 (r ≈ 3.449), then 8, 16, 32 — each fork closer to the last by the universal ratio δ = 4.6692… — until the forks pile up at the edge, r∞ ≈ 3.5699, and beyond it lies chaos. Drag r along the cascade. The same δ governs every smooth map with a hump — which is the deepest thing on this page.

growth rate r3.200
long-run behaviour
Lyapunov exponent λ
cascade edge r∞3.56995
Feigenbaum δ4.6692
▲ 3 r∞ 4

The faint diagram is the full bifurcation tree, computed once across r. The bright dots are the actual long-run states at the r you've set; the vertical line is your r. λ < 0 means the orbit settles (periodic); λ > 0 means nearby starts diverge (chaos). The edge is where λ first touches zero.

research/feigenbaum/compute.py — δ re-derived to 4.669201609… as the limiting ratio of fork spacings; r∞ = 3.569945672…. full layer →

System III · tune to it · the edge is a stability threshold

Turing Patterns — when smoothing builds spots

Two chemicals that, mixed in a beaker, settle to one flat state and stay there. Let them diffuse at different speeds and something impossible happens: diffusion, the great smoother, builds a pattern. It works only past a sharp edge in the ratio d of how fast the inhibitor spreads relative to the activator — here d₊ ≈ 8.57. Drag d. Below the edge every ripple's growth rate sits under zero (the flat state holds); cross it and a band of ripples rises above zero and grows — those are your spots.

diffusion ratio d6.00
fastest growth rate λ*
threshold d₊8.567
unstable band
pattern wavelength 2π/k*
▲ d₊ 8.57

The curve is the dispersion relation λ(k): the growth rate of a ripple of wavenumber k, from the exact Schnakenberg Jacobian (a = 0.1, b = 0.9). The dashed line is zero. Below d₊ the whole curve is under it — every ripple dies. Above, the part poking through grows, and the fastest mode sets the spot spacing.

research/turing-patterns/verify.py — steady state (1, 0.9), reaction-only stability, dispersion relation and d₊ from closed form. full layer →

System IV · it tunes itself · the edge with no knob

The Sandpile — the edge found for free

The first three needed a hand on a slider. This one has no slider. Drop sand grains at random; when any cell holds four, it topples one to each neighbour, which can topple its neighbours, an avalanche of any size. Grains that fall off the edge are lost. Just feed it — and with nothing to tune, the pile drives itself to a critical state and stays there: the interior height climbs and parks at the exact stationary density 17/8 = 2.125, and the avalanches become scale-free, the same knife-edge the sliders above had to be dialled to. This is self-organized criticality (Bak–Tang–Wiesenfeld, 1987) — why so much of nature sits at the edge without anyone setting it there.

grains added0
interior mean height0.000
→ stationary density2.125 = 17/8
last avalanche
largest avalanche seen
no knob — feed it and watch

Height 0–3 runs blue → gold. No parameter anywhere sets the critical point — the toppling rule and the leaky boundary do it on their own. Drip a while (or tap +5000 six or seven times): the interior mean climbs out of zero and parks near 2.125, the exact stationary density of the infinite lattice — reached here with nothing tuned.

research/abelian-sandpile/verify.mjs — abelian property, matrix-tree theorem, sandpile group. The 17/8 stationary density is the established exact value (Grassberger's conjecture; later proved). full layer →

the one thing they share · why this is a portal, not a list

What happens at the edge

Four systems, and at each one's critical point the same three things are true — which is the whole reason to put them on one page:

The honest line, kept sharp: scale-free at the edge is something each instrument here demonstrates directly; universality is proved in some cases (Feigenbaum's δ; the square-grid bond threshold ½) and a deep, well-supported conjecture in others (percolation exponents, the sandpile's avalanche scaling). The page shows you what is shown, and names what is still believed.

honest edges · where the knife is still being sharpened

What this does not settle

The apparatus. Every threshold on this page is computed in your browser, not asserted: percolation by live union–find on a fixed random field (largest-cluster fraction vs p); period-doubling by iterating the logistic map and measuring its Lyapunov exponent and attractor period (bifurcation diagram drawn from the same iteration); Turing by evaluating the exact dispersion relation λ(k) of the Schnakenberg Jacobian and finding where its maximum crosses zero (d₊ from the closed-form quadratic, = 8.567); the sandpile by the real abelian toppling rule, measuring the interior mean height as it climbs toward 17/8. A headless verifier drives the live page and re-derives each edge offline: verify-the-knife-edge.mjs. Each system's own layer carries its full lab notebook, linked above. No number here is hand-entered; the constants δ, ½, 17/8, d₊ are either re-derived or cited to the layer that proves them.