The Collection
Wait in the Siding
Dijkstra, 1961: turn a line of arithmetic into something a machine can run, using one railway siding. Numbers go straight through, and operators wait until something weaker arrives. Type an expression, watch its tree grow from the line, change the rules, or work the points yourself.
Brackets and precedence never reach the machine. They only decide who waits, and once the order is settled neither is needed. School's rules are one convention among several, and each gives a different answer.
November 5, 2026 № 110 ↗Could Have Known
Lamport, 1978: five people, drifting clocks, only letters. Two events have an order only if a chain of letters joins them, and one counter, bumped past every stamp that arrives, never contradicts it. Click an event to light what it could have known, drag between lines to post a letter, and switch clocks.
Without a shared clock, "before" can only mean "could have told you". Everything else is neither first nor second, and the best clock is the one honest enough to say so.
November 4, 2026 № 109 ↗Back With More
Bellman and Ford, 1956–58: find the best exchange from one currency to every other by checking every trade, again and again, n − 1 times. If one extra pass still finds an improvement, some loop of trades pays. Click a currency to start there, click an arrow to sweeten its rate, or raise the mispricing.
Take logs and multiplying rates becomes adding distances, so a loop that makes money is a road shorter than standing still. Knowing when you must be finished turns one more improvement into proof.
November 3, 2026 № 108 ↗Whoever's Left Standing
Boyer and Moore, 1981: find the majority in a stream holding just a candidate and a count. A matching ballot adds one, any other cancels one, and an arc joins each cancelled pair. Change the share and arrival order, drag across ballots to repaint them, then watch the recount.
A party with more than half can't be paired off completely, so two numbers are enough to find it. But surviving isn't winning: without a recount, the last one standing proves nothing.
November 2, 2026 № 107 ↗Only When Wrong
Rosenblatt, 1958: a line learns to split pink from violet by checking one point at a time and moving only when it gets one wrong. Every nudge leaves a trace. Click to add points, shrink the gap, then try XOR, where no line works and it never stops until you give it one more feature.
A learner that changes only when it's wrong is still guaranteed to settle if an answer exists, and the room between the two sides, not the number of examples, sets how long that takes.
November 1, 2026 № 106 ↗The Same Swaps Every Time
Batcher, 1968: a sort with no decisions. Values ride along wires, and fixed comparators put the smaller of each pair on top, whatever the input. Pick bitonic, odd–even merge or transposition, click a comparator to knock it out, then test every input of 0s and 1s.
A sort that never looks before it acts can do every column of work at once. And to trust it on every list of numbers, you only need to check the lists made of 0s and 1s.
October 31, 2026 № 105 ↗Cut Every Corner
Chaikin, 1974: to smooth a jagged outline, keep only the points a quarter and three quarters along each edge, then do it again. A few passes and it settles onto a quadratic B-spline. Drag the corners, draw your own shape, and move where the knife falls.
Smoothness needs no formula, only the same small compromise repeated: each pass splits every sharp turn in two. Cut exactly at the middle, though, and nothing is left to split, so the corners stay.
October 30, 2026 № 104 ↗Odd Means Inside
Shimrat, 1962: to tell whether a point is inside a shape, shoot a ray from it and count the edges it crosses. Odd means inside. Move the probe, turn the ray, walk the edges one at a time, and watch the even–odd and winding rules disagree on stars that cross themselves.
Whether you're enclosed is a question about the whole shape with a local answer: look one way and count the walls. Once a shape crosses itself, "inside" stops being a fact and becomes a rule you choose.
October 29, 2026 № 103 ↗Two to a Column
Walker's alias method, 1974, with Vose's 1991 bookkeeping: cut the tall bars of a lopsided distribution to top up the short ones, until every column is exactly full and holds at most two outcomes. Watch it build, drag any bar to change the odds, then throw darts.
Any lopsided odds can be redrawn as equal columns, each split between just two outcomes. After that, choosing among a million possibilities costs the same as choosing between two: one die, one coin.
October 28, 2026 № 102 ↗One Wall at a Time
Sutherland and Hodgman, 1974: cut any polygon to a convex window by facing one wall at a time. Each pass walks the shape's edges and keeps ends and crossings by four rules. Step through it, drag the shape or the window, or let it drift into stained glass.
A cut against many walls is one easy cut, repeated. The price shows at the seams: a concave shape split in two comes back as one polygon, stitched by zero-width bridges along the wall.
October 27, 2026 № 101 ↗The Longest Streak
HyperLogLog, 2007: count the distinct visitors in a stream with a few bytes per bucket. Each hash picks a spoke with its first bits, and the spoke keeps only its longest run of leading zeros. Speed up the stream, add repeats, change the bucket count and watch the estimate track the truth.
A run of ten heads takes about a thousand flips, so the rarest thing you saw tells you roughly how much you saw. Average many such streaks and a few hundred bytes count millions.
October 26, 2026 № 100 ↗One Bit at a Time
Gray, 1947: list every number so each differs from the last in one bit, by mirroring the list and putting 0 on the top half and 1 on the bottom. Watch it build, spin it on an encoder disc against plain binary with misaligned sensors, then watch it solve the Tower of Hanoi.
The danger in changing several things at once is the moment in between, when anyone looking sees a mix that never existed. Choose an order where each step changes one thing, and every glimpse is either old or new.
October 25, 2026 № 099 ↗Socks Before Shoes
Kahn, 1962: to order tasks so nothing comes before what it depends on, count each task's incoming arrows, do any task at zero, cross off its arrows and repeat. Watch a professor get dressed, bake bread or plan a degree; drag between tasks to add arrows, tap one to delete it, or try Catch-22.
Respecting every dependency rarely pins down one plan; it leaves a pile of things you're free to do next. When that pile is empty but work remains, no schedule can help: something waits on itself.
October 24, 2026 № 098 ↗Every Bridge Once
Hierholzer, 1873: to draw a figure in one stroke, walk any unused edge until you're stuck, back up to the first corner with edges left, walk a new loop there and splice it in. Try Königsberg, a star or a lattice, tap edges away, or double back over odd corners.
Count before you search: a single stroke exists only if zero or two corners have an odd number of edges. When it does, the laziest walk works, because every dead end can be patched with a loop.
October 23, 2026 № 097 ↗Pinned by Three
Welzl, 1991: find the smallest circle around a set of points by shuffling them, then walking through. Any point outside gets pinned to the edge and the search restarts. Watch the three nested loops on a strip, add or drag points, and try orders built to be slow.
Three nested loops that look cubic finish in expected linear time, because a shuffled point is rarely one of the few that hold the circle up. The randomness keeps the answer exact and makes the work quick.
October 22, 2026 № 096 ↗Put Back Exactly
Knuth's Dancing Links, 2000: tile a board with the twelve pentominoes as an exact-cover search, where each placement unlinks every option it clashes with and backtracking relinks them in reverse. Numbers show how many ways each gap can still be filled. Change the board, the branching rule and the speed.
Branch wherever there are fewest choices and a doomed board gives itself away at once. Undoing needs no record either: a removed node still remembers its neighbours, so putting it back takes two assignments.
October 21, 2026 № 095 ↗The Dullest Way Down
Avidan and Shamir, 2007: to make a picture narrower, find the dullest connected path of pixels from top to bottom, one per row, and delete it. Repeat. Drag the width, paint what to protect or erase, and compare it with squashing and cropping.
Each pixel only asks which of the three above it was cheapest to reach, and the best route through the whole picture falls out. It never decides what matters, only what nobody would miss.
October 20, 2026 № 094 ↗The Leftmost Pile
Patience sorting: deal a shuffled deck, always onto the leftmost pile whose top card is bigger, and the number of piles is exactly the longest increasing run hidden in the deck. Step through the deal, tap to add your own cards, or run thousands of decks.
Every pile runs downhill, so no climb can use two cards from one pile, and one pointer per card builds a climb touching every pile. A smallest partition and a longest chain certify each other.
October 19, 2026 № 093 ↗Square What's Left
Euclid, around 300 BC: to find the greatest common divisor of two numbers, cut the biggest square you can from an a × b rectangle, then do the same to what's left. The last square is the answer. Drag the corner to reshape it, or map every pair at once.
Dividing instead of subtracting means the step count grows with the number of digits, not the size of the numbers. The slowest pairs are consecutive Fibonacci numbers, rectangles that stay nearly golden at every cut.
October 18, 2026 № 092 ↗Nobody in the Circle
Bowyer and Watson, 1981: to add a point to a Delaunay triangulation, break every triangle whose circumscribed circle it lands in, then join the point to the rim of the hole. Tap to add points, drag or remove them, and switch on every circle or the Voronoi dual.
One local promise, that no triangle's circle holds another point, quietly makes the thinnest triangle as fat as possible. Join the circles' centres and the Voronoi diagram appears for free.
October 17, 2026 № 091 ↗Any Three Will Do
Shamir, 1979: hide a secret as the height where a curve crosses zero, then hand out points on that curve. Any three rebuild it by Lagrange interpolation; two leave every secret equally possible. Tap shares to hold them, change the threshold, or split a word byte by byte.
Two points fit a parabola through any height you like, so two shares say nothing at all and the third says everything. Keeping the secret means leaving every answer equally true.
October 16, 2026 № 090 ↗Said It Before
Lempel and Ziv, 1977: compress text by replacing anything already said with a pointer back to it: go back this far, copy this many, add one new letter. Watch arcs leap across a rhyme, hover any letter to trace where it was first written, then decode it from the pointers alone.
Compression is noticing you have said it before. LZ77 keeps no dictionary because the text already written is the dictionary, and a copy may even overlap itself, reading letters it is still writing.
October 15, 2026 № 089 ↗Straight on a Staircase
Bresenham, 1962: draw a straight line on a grid of squares with one running integer, adding the rise each step and taking a diagonal whenever it spills past zero. Step it cell by cell, drag the ends, then fan thousands of lines into moiré or weave times-table string art.
Many problems that seem to need fractions only need a comparison. Keep a running tally of how far off you are, and act when it crosses a line.
October 14, 2026 № 088 ↗Move to the Middle
Lloyd's k-means, 1957: give every point to its nearest centre, move every centre to the middle of its points, and repeat until nobody switches. Step it half a move at a time, drag centres, spray points, or run twelve restarts to see where bad seeds get stuck.
Guess one half of a chicken-and-egg problem, solve the other, alternate — it never gets worse. But it settles in the nearest valley, not the deepest, so start from a few places.
October 13, 2026 № 087 ↗Keep the Farthest
Ramer, Douglas and Peucker, 1972–73: to simplify a line, draw a chord between its ends, find the point farthest from it, and keep that point only if it strays more than ε — then repeat on each half. Drag ε, watch the recursion decide, draw your own line, or race it against keeping every k-th point.
A good summary is not an even sample; it is a promise about the worst thing left out. Name your tolerance, then keep exactly the points that would break it.
October 12, 2026 № 086 ↗The Bit That Lied
Hamming, 1950: wrap every eleven bits in five parity checks, and when one bit flips in transit, the checks that fail spell out its position in binary. Flip cells in a sixteen-bit block yourself, then raise the noise and watch a picture arrive bare and protected.
Four yes-or-no questions are enough to pick one of sixteen places. Arranged redundancy does not just notice a mistake — it says where the mistake is.
October 11, 2026 № 085 ↗One Swap Too Many
Fisher and Yates, 1938: shuffle by drawing each swap partner from the cards you have not settled yet. Beside it runs the famous near-miss that draws from the whole deck. Both grids fill live — change the deck size, or deal twenty thousand hands at once.
A five-card deck has 120 orders and the buggy loop has 3,125 equally likely paths. 120 does not divide 3,125, so it cannot be fair — the bias is arithmetic, not bad luck.
September 12, 2026 № 084 ↗Two Speeds, No Memory
Floyd, 1969: follow any rule that maps a finite set into itself and the path has to close into a lasso — a tail, then a loop. A tortoise steps once per tick, a hare twice, and where they collide gives up both numbers. Drag the sliders to reshape the rule.
Spend a constant factor more time and your memory stops depending on the problem at all. Two pointers replace a set that grows without bound — and a random rule closes its loop after about √n steps, not n.
September 11, 2026 № 083 ↗Farther Than the Wall
Bentley, 1975: every point is also a wall, halving its region, alternating vertical and horizontal. A query falls to the cell it lands in, then argues its way back up, skipping any half whose wall is farther than its best guess. Move the pointer to place it; click to add points.
Everything behind a wall is at least as far away as the wall — so one comparison can discard a thousand points, exactly and provably. Until the dimensions climb and every wall is close.
September 10, 2026 № 082 ↗The Likeliest Story
Viterbi, 1967: a walker in a corridor of ten rooms, doors painted in a few repeating colours, and a sensor that lies one time in five. Watch the trellis fill column by column, hover any cell for the best story ending there, then race it against the per-step answer.
The most likely sequence of states is not the sequence of most likely states. Guess step by step and you win on points while describing a walk nobody could have taken.
September 9, 2026 № 081 ↗Only Rearranged
Burrows and Wheeler, 1994: write out every rotation of a text, sort them, and keep only the last column. Watch the rows slide into order and that column fall into blocks. Then press undo, and the whole text walks back out of one column.
It compresses nothing and loses nothing. A reversible shuffle can't add information — it can only move the redundancy somewhere a much dumber algorithm can already see it.
September 8, 2026 № 080 ↗Balanced by Accident
William Pugh's skip list, 1990: a sorted linked list where every value flips a coin to decide how many express lanes it stands in. Watch a search start on the top lane and fall down the skyline, drag the coin to trade memory against comparisons, and switch the lanes off to see the crawl underneath.
A balanced structure with no balancing code: nothing is ever rearranged, because nothing was arranged on purpose. The randomness lives in the structure, not the data — so no input can be crafted to make it slow.
September 7, 2026 № 079 ↗Who Has to Move
Karger's 1997 hash ring, the trick under every sharded cache: hash the servers and the keys onto one circle, and give each key to the first server clockwise. Click the ring to add a server, click a server to lose it, and watch how few keys change hands — then switch to hash mod N.
Modulo hashing balances perfectly and moves almost everything when the cluster changes size. The ring trades a little balance for locality — and virtual nodes buy the balance back.
September 6, 2026 № 078 ↗Fair Without Remembering
Vitter's Algorithm R, 1985: take a uniform sample of k items from a stream of unknown length, holding nothing but the k. Each arrival is kept with chance k/i and evicts a survivor at random. Watch the histogram of who survives flatten over thousands of runs — then switch to a fixed coin flip and watch it tilt.
The chance of keeping the next item falls towards nothing as the stream runs, yet every position ends up equally likely — and the stream's length is never used. Fairness didn't need to know how big the population was.
September 5, 2026 № 077 ↗Whoever Points at You
Brin and Page, 1998: a page's score is the sum of the scores of whatever points at it, split between that page's links — circular, so you guess and iterate until it stops moving. Drag between pages to rewire the web, or send one random surfer wandering to the same answer.
Counting inbound links is trivial to fake; borrowing importance from whoever already has some is not. Build a link farm and watch the most-linked page finish sixth.
September 4, 2026 № 076 ↗Where You Cut
Hoare's 1961 quicksort, one partition at a time: draw a line at the pivot's height, sweep everything under it to the left, and that bar is home for good. Choose the pivot yourself, or hand an already-sorted array to the wrong strategy and watch the call tree topple into a staircase.
Quicksort does all its work in the split and none in the join. The whole gap between n log n and n² is one choice — where you cut — made again at every level.
September 3, 2026 № 075 ↗What Nobody Reached
Eratosthenes' sieve, drawn on Ulam's spiral: each prime in turn strikes out its own multiples, tinting the grid by smallest factor, until nothing is left to strike. Play it, step it, hover any cell to read it, or switch to Sacks' spiral and watch the diagonals appear.
It never asks whether a number is prime — no test, no division, only repeated addition. The primes are simply whatever nobody managed to reach.
September 1, 2026 № 074 ↗Nothing but Left Turns
Graham's 1972 scan: sort the points once, walk them in order, and back out of every right turn. Watch the stack push a corner and pop it three points later. Switch to gift wrapping, then change the cloud from a disc to a ring, and watch its cost explode.
A loop inside a loop isn't automatically quadratic: every point is pushed once and popped at most once, so the scan is linear and the log n lives entirely in the sort.
August 30, 2026 № 073 ↗Only If It Joins Strangers
Kruskal, 1956: sort every possible link by length, then take each one only if its two ends aren't already connected. Islands of colour swallow each other until one network reaches every town. Shuffle the order for a tree that costs five times as much, or cut the longest links to find the clusters.
Greedy usually walks you into a trap; here it can't. The cheapest link across any divide must be in the answer, so grabbing the shortest thing that joins two strangers isn't merely decent — it's provably optimal.
August 29, 2026 № 072 ↗Never Look Back
Knuth, Morris and Pratt, 1977: when a match breaks partway, the characters it did match are the needle's own opening — so the search slides forward without the text pointer ever going back. Watch the scan, hover the table for the piece it keeps, and compare the work each strategy leaves behind.
A failure is information. The naive scan throws away everything it just learned and starts again one place to the right; keeping it buys not speed on average, but the disappearance of the worst case.
August 28, 2026 № 071 ↗One Reason Is Enough
Minimax with alpha–beta pruning, drawn as the tree it actually walks: play a square and watch every reply it weighs, one row deeper each move. Turn pruning off and the whole tree fills in for the same answer. Change which move it tries first and the dark regions move.
You need an exact score only for the move you take. For the rest, one reply that's already worse ends it — refuting is cheaper than pricing, and a good first guess is what makes searching affordable.
August 27, 2026 № 070 ↗Only Straight Lines
de Casteljau's 1959 method draws a curve without ever computing one: interpolate between the control points, then between those results, and keep going until a single point is left. Drag the dots, scrub t to watch the scaffold fold, or split the curve in two at the point you're on.
Every curve on a screen is straight lines all the way down — the smoothness lives in the recursion, not in the primitive. Flatten it and you see what the machine actually draws.
August 25, 2026 № 069 ↗Sure of Absence
Burton Bloom's 1970 filter remembers a set without storing a word of it: hash each item to a few bit positions and flip them on. Type anything to ask, press Enter to add it, and hover a bit to see which words share it.
A no is a proof; a yes is only a lead. Keep adding words and watch the filter start vouching for strangers — the error is one-sided by design, and that's what makes it cheap.
August 23, 2026 № 068 ↗The Narrowest Place
Ford and Fulkerson's 1956 maximum flow, one augmenting path at a time: flood the network for a route with room left, then push as much as its tightest pipe allows. When the flood finally fails, the pipes it couldn't cross are the minimum cut. Tap any pipe to widen it and watch what doesn't happen.
The most you can push through a network equals the cheapest way to sever it. Widen anything off that cut and throughput moves by exactly zero — effort spent away from the bottleneck isn't partly wasted, it's entirely wasted.
August 22, 2026 № 067 ↗Aim at the Corners
A light in a dark room, and the geometry that says exactly what it can see: cast three rays at every wall corner, sort the hits by angle, join them up. Move the pointer to carry the light; switch to a brute-force fan of rays and watch it cut the corners it steps over.
Uniform sampling is the expensive way to be wrong. A shadow's edge can only turn where a wall ends, so aim at the corners — the exact answer costs less than a bad approximation.
August 21, 2026 № 066 ↗Nothing Too Close
Bridson's 2007 sampler, one dart at a time: pick a point that still has elbow room, throw darts into the ring around it, keep any that lands no nearer than r to anything else. Flip to plain uniform random at the same point count and watch the clumps and bald patches arrive.
Independent randomness clumps — that is simply what independence looks like. What people mean by "evenly random" is a different distribution altogether, one with a rule against closeness, and it is the pattern your retina uses.
August 20, 2026 № 065 ↗Short Words for Common Things
Huffman's 1952 term paper, merge by merge: take the two rarest symbols, join them under one node, put it back in the queue, repeat. The shortest codes fall out on the commonest letters. Type your own message, hover a letter to light up its path and its bits, or try a text that's almost all one character.
Price should track surprise. Huffman is optimal among codes that spend whole bits on whole symbols — and when one symbol carries nearly everything, that last constraint is the entire gap.
August 19, 2026 № 064 ↗Who Asks First
Gale and Shapley's 1962 deferred acceptance, the algorithm behind the medical residency match: one side works down its list asking, the other holds the best offer so far and trades up whenever something better knocks. Hover anyone to read their whole ranking, then flip who does the asking.
Stable is not the same as fair. The side that asks lands the best stable matching that exists for it, and the side that waits the worst — same tastes, same rules, only the order of speaking.
August 18, 2026 № 063 ↗Where the Error Goes
Floyd and Steinberg's half-page paper from 1976: a pixel has to round to a colour it isn't, so hand the leftover error to the neighbours not yet decided. Drag error passed on to zero and the picture bands into flat plates; turn it up and black and white alone read as continuous tone. Paint light on the scene; hover a dot for its debt.
Rounding error doesn't vanish when you ignore it — it piles up where you stopped looking. Keep an account of what you dropped and pay it forward, and the average stays honest even though no single pixel can be.
August 17, 2026 № 062 ↗Three Ways to Be Wrong
Levenshtein's 1965 distance, computed the way Wagner and Fischer taught in 1974: fill a grid where every cell asks only three neighbours, then walk back through it to recover the actual edits. Type any two words, hover a cell to see the three choices it had, and watch one word morph into the other.
The distance is the cheap part; the walk back is the answer, because it says which edits, not just how many. Dynamic programming is mostly the habit of writing down what you would otherwise recompute.
August 16, 2026 № 061 ↗Show of Hands
Hough's 1962 line detector never looks for a line. Every point votes for all the lines that could pass through it — one sinusoid each — and the curves cross wherever points are collinear. Hover the vote map to see the line any cell stands for; drag on the scene to add points.
Finding is often harder than counting. Let every scrap of evidence vote for whatever it's consistent with, and the answer arrives as agreement — though how many votes count as proof is still your call, not the arithmetic's.
August 5, 2026 № 060 ↗Worse On Purpose
Kirkpatrick's 1983 trick, borrowed from metallurgy: to untangle a travelling-salesman tour, allow swaps that make it worse — freely while hot, never once cold. Watch spaghetti pull itself into a clean loop; the pink flashes are the backwards steps. Flip to greedy and it stops dead at the first tour it can't improve, a tenth longer.
Getting stuck is rarely a lack of effort — it's a policy of never going backwards. Temperature isn't part of the problem; it's how much you're willing to lose right now for a look somewhere else.
August 4, 2026 № 059 ↗Best Guess
A Kalman filter (Kálmán, 1960 — flying on Apollo by 1966) tracks a target through a noisy sensor: new belief = old belief + gain × surprise, the gain recomputed each step from its own uncertainty. The violet ellipse is that uncertainty, breathing as the signal comes and goes. Drag the target to feel the lag; wind down assumed agility for a smooth, hopeless sceptic.
The gain answers a question that isn't about spacecraft: how far should new evidence move me? Never a personality trait — a ratio of how confident I am against how noisy the source is, kept explicit and up to date.
August 3, 2026 № 058 ↗Shannon's Machine
The crudest ancestor of a language model: Shannon's 1948 trick of generating text by counting what tends to follow what. Pick a source, choose how much memory the machine gets, and watch it climb from XFOML-grade static to fluent clauses — turning pink when it stops composing and starts quoting.
Nothing in here understands a word, yet at order five it produces plausible syntax — the register was in the arithmetic all along. Fluency is cheap, and sounding right is not evidence of being right.
August 2, 2026 № 057 ↗Self-Organizing Map
Kohonen's 1982 network, the oldest one you can watch learn: every neuron is a dot wired to lattice neighbours, and training just drags the nearest neuron — and its neighbours, by a hair — toward each data point. A tangled ball opens like a paper flower and drapes itself over the data. Drag to pour fresh points; try the Ring for an honest failure.
Every flat map of something complicated trades distances for neighbourhoods — the same bargain behind every t-SNE plot, which is why the clusters are trustworthy and the gaps between them mostly aren't.
August 1, 2026 № 056 ↗Plucked from Noise
A twelve-line instrument: fill a buffer with random numbers, loop it, and average each sample with its neighbour as you go — Karplus–Strong (1983), and it sounds unmistakably like a plucked string. Watch jagged noise organise into a smooth repeating wave within a few dozen trips round the loop; the readout even shows how many cents sour the quantised pitch runs.
The loop doesn't create the pitch — noise already contains every frequency, and the loop only decides which parts are allowed to keep coming back. Character is often just what survived something forgetful, repeated.
July 26, 2026 № 055 ↗Pass It On
Every rounding routine throws the remainder away; Floyd–Steinberg error diffusion hands it to the neighbours who haven't been decided yet. Watch the haze of its own past mistakes drift ahead of the scan line, compare kernels with real personalities, and flip raster to serpentine to dissolve the worms crawling through the midtones.
Dithering gives up being right about any single pixel in exchange for being right about every neighbourhood — and your eye, which is a blur filter, reconstructs for free. When you can't be accurate, carry the remainder forward.
July 23, 2026 № 054 ↗Quincunx
Galton's 1870s bean machine, honest to the bead: every ball makes one independent coin flip per peg, so the bell curve is the sum itself, not a picture of one — with the exact binomial and Gaussian limit drawn on top. Flip to log-y and watch the tails fill for minutes; push the bias and the pile slides but stays bell-shaped.
The central limit theorem promises a bell only for sums of many small, independent effects with finite variance — and every clause is load-bearing. Break one and the bell goes with it, which is exactly where the ruin lives.
July 22, 2026 № 053 ↗Diamond–Square
The algorithm that gave computers mountains (Fournier, Fussell & Carpenter, 1982 — the maths behind Vol Libre and the Genesis planet). Four corners become five points, then nine, then a coastline; step through the passes and watch the map decide its shape by level two. One exponent runs from alpine chaos to rolling farmland; hit creases to see the grid leak through.
Self-similarity is a budget: the same rule runs at every scale, but the first random number places a continent and the millionth adjusts a pebble. Coarse decisions are permanent, no matter how much detail comes after.
July 21, 2026 № 052 ↗Vortex Street
A fluid that never writes down Navier–Stokes: lattice-Boltzmann keeps nine numbers per cell, relaxes them toward equilibrium, and slides each along its own arrow — that's the whole solver. Drag the obstacle and push the inflow until the symmetric wake snaps into the alternating von Kármán vortex street, its shedding period measured live by a probe downstream.
Nothing in the code says “alternate” — the street is what happens when inertia outruns viscosity's ability to smooth things over. The useful question is rarely what the rules are, but how near the threshold you're sitting.
July 20, 2026 № 051 ↗Ariadne
Two opposite walks on one lattice: a recursive backtracker carves a perfect maze out of solid stone, then A* floods the corridors to excavate the single shortest path back through it. Watch a dead end unwind twenty cells in a frame — a stack made visible. Drag the heuristic to 0 for Dijkstra, past 1 to trade the guarantee for speed.
A* is just Dijkstra plus a guess about the distance ahead, and the guess only has to be honest — never overstating what remains. Stay honest and you keep the shortest path guaranteed while doing a fraction of the digging.
July 19, 2026 № 050 ↗Basins
Cayley asked in 1879: run Newton's method from here — which root do you reach? The quadratic splits the plane along a line; the cubic interlocks three territories along a boundary with no smooth piece anywhere, each pixel coloured by the root it surrenders to. Hover to trace an orbit; try z³ − 2z + 2 for lagoons that never converge.
Zoom anywhere on the edge and you'll never find just two colours meeting — every boundary point touches all three basins at once. The tangle is what “no majority anywhere” has to look like when you're forced to draw it.
July 18, 2026 № 049 ↗Substrate
Jared Tarbell's 2003 crack-propagation classic, rebuilt from scratch: cracks travel in straight lines, die on collision, and spawn new cracks at right angles to the network, while sand-painter brushes shade the regions they carve. Watch scratches reorganise into an unplanned city; nudge wander for medieval crescents, click to open a fresh fault line.
Every boundary in the finished image is a collision that got remembered — no line was ever planned as a wall; each is the full stop of some other line's journey, promoted into structure.
July 17, 2026 № 048 ↗Logistic Map
One line of arithmetic — x → r·x·(1−x) — holds the whole road into chaos. The bifurcation diagram draws itself live as the steady population splits into two, four, eight values, then noise, with clean windows of order inside the storm. Drag to scrub r; box-zoom into any fork to find the same tree at every scale.
Nothing is added at the moment things get complicated — the same five-character rule that parks on one value explodes into chaos when a single dial moves. Complexity here isn't built; it's uncovered.
July 16, 2026 № 047 ↗Space-Filling Curves
A single line with no thickness that passes through every point of a square. Painted as a rainbow, Hilbert's 1891 curve keeps nearby colours in coherent blobs; Z-order teleports in diagonal leaps; snake scanning shatters them into stripes. Drag Order to fold it finer; hover any cell to read its place along the line.
Whenever you flatten something rich into one ordered list — pixels in memory, map coordinates in a database key — you're choosing a space-filling curve, and the choice quietly decides what counts as “nearby.”
July 15, 2026 № 046 ↗Space Colonization
A tree that grows itself by reaching: every tip looks at the light points within range, steps toward their average, and consumes any it touches — trunk, crown and twigs all emerge from the competition (Runions' 2007 venation algorithm). Drag anywhere to pour fresh light and watch the canopy throw a new limb toward your cursor.
Nothing in the code wants to be a tree — the shape is the fossil record of many tips racing for a limited resource. Ask not “who drew this” but “where was the light, and who got there first?”
July 14, 2026 № 045 ↗Hydraulic Erosion
Rain carves a landscape live: each droplet rolls downhill, scours rock while moving fast, and drops its load where it slows. Ridgelines sharpen, valleys deepen, and branching rivers appear that exist nowhere in the code. Drag to pour a private cloudburst and tear open a canyon; hit New land for a fresh island.
A landscape is a record, not a design — every valley is the memory of water that has already drained away, the fossil of a very simple thing done a very large number of times.
July 13, 2026 № 044 ↗Schelling's Segregation
Thomas Schelling's 1971 model: agents perfectly content to be outnumbered two-to-one still curdle a mixed grid into single-colour continents, because each moves only when its own mild threshold is crossed. Drag the tolerance to find the tipping point with your thumb; stir any patch and watch it re-sort.
A pattern in a crowd is not proof of a matching intention. Before reading a collective result as a collective desire, ask what the smallest individual preference is that would paint the same picture — it's often far weaker than the picture makes it look.
July 12, 2026 № 043 ↗Mandelbrot & Julia
The most famous fractal, shown for what it secretly is: an index. Hover the Mandelbrot map and the Julia set that point stands for draws itself alongside — one connected piece inside the black body, shattered dust a whisker outside. Scroll to dive into the coastline; click to pin a c, or let it sweep.
A single yes-or-no question — does the orbit of z → z² + c stay bounded? — decides an entire world's shape. Sometimes the deepest fact about a thing is only knowable by running it and seeing where it goes.
July 11, 2026 № 042 ↗Chaos Game
Keep one point, roll a die to pick one of a few shrinking maps, jump, plot, repeat — Barnsley's iterated function system. Out of pure coin-tossing climbs a fern exact down to the leaflet, or Sierpiński's triangle, a dragon curve, a tree. Click to fling the point off-screen and watch it snap back in a few jumps.
Random moves, fixed destination. The fern isn't stored anywhere — it's the one set of points all the maps agree to leave alone, and randomness is only the brush that reveals it.
July 10, 2026 № 041 ↗Force-Directed Graph
A graph arrives with no coordinates — so pretend every node is a magnet shoving the others away and every link a spring, then let go (Eades, 1984). Meshes, trees and clustered islands settle out with nobody positioning anything. Grab a node and haul it; the whole web stretches, ripples, and flows back.
This is how nearly every network diagram you've seen gets drawn — and the shape is a found equilibrium, not a truth. Nudge the springs and the identical graph tells a different-looking story.
July 9, 2026 № 040 ↗Rule 30
A single row of cells and a rule that fits in one byte, history piling up as a picture. Rule 90 draws Sierpiński's triangle, Rule 110 can compute anything — and Rule 30 boils one black cell into static so random Mathematica shipped it as a random-number generator. Drag the dial through all 256 rules, or flip single bits.
Randomness doesn't have to come from somewhere random: a fully deterministic rule and one tidy seed can pour out a stream you can't tell from coin tosses. When something looks impossibly rich, first ask — is it just a simple rule, iterated?
July 8, 2026 № 039 ↗Snowflake
Clifford Reiter's 2005 model: vapour diffuses on a hexagonal grid and a cell freezes the instant it holds enough water — that's the whole rule, yet a branching six-armed crystal grows from a single seed. Tune vapour and diffusion to walk from stubby plates to lacy stellar dendrites; click to drop a new seed.
Matching symmetry doesn't need a matcher. The six arms agree because identical rules in identical weather make identical shapes — no arm can see the others, so they can't help agreeing.
July 7, 2026 № 038 ↗Kuramoto Sync
Kuramoto's 1975 equation live: every oscillator sweeps its own clock and only ever nudges its phase a hair toward its neighbours'. Turn the coupling past a threshold and confetti snaps into travelling bands pulsing in unison, the meter reading the true order parameter. Drag to sweep a patch into phase.
Synchrony isn't obedience. Fireflies, applause, pacemaker cells, a power grid holding 60 Hz — coordinated timing is what weak local coupling looks like once it crosses a threshold, not a command handed down.
July 6, 2026 № 037 ↗Belousov–Zhabotinsky
The chemical clock chemists insisted couldn't exist — Belousov's paper was rejected for “violating thermodynamics” — run as an excitable medium: every pixel cycles fire → rest → recover, and out of pure static, rotating spirals and target rings organise themselves in seconds. Drag to stir in a wavefront; three sliders tip heartbeat into froth.
The secret is the enforced pause: a spot that has fired must rest before firing again, so waves only travel outward and a spiral sustains itself forever. Your heartbeat is this pulse; a spiral loose in the heart wall is fibrillation.
July 5, 2026 № 036 ↗Standard Map
Chirikov's kicked rotor — two lines of arithmetic that became the standard model of chaos. Every dot is one orbit's state revisited hundreds of times: nested rings at a gentle kick, fraying into a grey chaotic sea with stubborn islands of order as you turn it up. Sweep K across the cliff, or click to drop a glowing orbit.
Order and chaos aren't two places on the map — they're braided together at the same setting. The knob doesn't decide whether the system is chaotic; it decides how much of it is, and where.
July 4, 2026 № 035 ↗Percolation
Flip an independent coin for every cell and ask one question: does an open path link top to bottom? Drag p through the threshold near 0.593 and one cluster abruptly outgrows the rest and stitches itself across the whole screen, lighting up pink as it bridges. Hit Sweep to ride back and forth across the cliff.
A network can be almost entirely built and still carry nothing — then a hair more connectivity flips it into one spanning thing, all at once. Connectedness doesn't arrive gradually; it has a cliff.
July 3, 2026 № 034 ↗Euclidean Rhythms
Ask Euclid's algorithm to space k beats as evenly as possible around n steps and out fall the world's traditional rhythms — the tresillo, bossa nova, West African bells (Toussaint, 2004). Every hit is a bare oscillator synthesized live. Nudge each ring's fill, let different lengths drift into polyrhythm, tap to add your own beat.
“Evenly spaced” sounds like the most boring instruction imaginable, yet it seeds nearly every groove humans dance to. Richness is often a few dead-simple patterns running side by side, never quite lining up.
July 2, 2026 № 033 ↗Metaballs
Blobs with no edges: each is a soft glow of influence, summed wherever they overlap, and a single threshold splits the field into inside and outside. Marching squares chains the outline live, so two drifting blobs grow a smooth neck of skin as they meet. Drop the grid resolution to see the facets, or watch the corners vote.
A boundary doesn't have to be a thing you place — it can be a level you choose. Nudge the threshold and “one thing or two?” changes without anything in the world having moved.
July 1, 2026 № 032 ↗Verlet Cloth
A hanging sheet you can grab, drag and tear — built from Jakobsen's 2001 game trick: points that remember where they just were, plus links nagged back toward their rest length a few times a frame. Pin and unpin corners, add wind, slash in Tear mode and over-stretched links simply let go.
You don't always need to solve the hard problem in one shot. State every rule locally — “stay this far from your neighbour” — and relax them over and over until the sheet quietly agrees with itself. Close, fast and stable beats perfect.
June 30, 2026 № 031 ↗Gravity Ballet
Newton's one law, a handful of point masses, and the oldest open problem in mathematical physics: three bodies have no formula, only step-by-step fate. Load the figure-eight to watch three stars share one looping track, or a chaos cluster to see one slingshotted off-screen for good. Drag to fling a star; click to drop one.
Deterministic and predictable are not the same word. No randomness anywhere, yet the only way to know where three bodies go is to live the trajectory out. Fixed rules, open future.
June 29, 2026 № 030 ↗Quasicrystal
Five plain striped gratings, overlaid at equal angles and added up, bloom into etched ten-pointed stars your eye keeps trying to lock onto and can't — the “forbidden” symmetry that earned Shechtman ridicule, then a Nobel. Slide symmetry to 6 for an honest honeycomb; back to 5 and repetition dissolves. Drag to steer, scroll to zoom.
Order doesn't require repetition. A quasicrystal is fully determined, sharply structured, diffracting like a gem — and aperiodic forever. Some rules were never going to repeat.
June 28, 2026 № 029 ↗Fireflies
Riverbanks of fireflies flashing in perfect unison, explained: each dot keeps its own rhythm and does one social thing — speed up a touch when a neighbour is ahead, ease off when one is behind. Nudge the coupling past its threshold and the whole field suddenly breathes as one. Drag to pin a patch into phase.
Nobody decides to sync. Below a certain coupling the tiny corrections do nothing; above it they snowball into one shared beat — your heartbeat, neurons firing in step, applause finding its rhythm.
June 27, 2026 № 028 ↗Lenia
Conway's Life made smooth (Chan, 2019): cells are continuous, neighbourhoods are soft rings, growth is gentle — and out swim soft creatures, the Orbium glider holding its shape like a jellyfish as it crosses the field. Drag to paint life, tap to drop a glider, slide between sterile, teeming and boiling.
The lifelike quality — coherence, motion, self-repair — may not depend on being built from discrete bits at all. What matters is holding yourself together while the world keeps trying to smear you out.
June 26, 2026 № 027 ↗Superformula Garden
Diatoms, flowers, snowflakes, gears and urchin shells — every one the same polar equation at different settings (Gielis, 1997). Turn the symmetry dial and a triangle becomes a twenty-pointed sun; nudge the exponents and a hard star melts into a soft bloom. Hit surprise for a fresh species, or go solo for one giant flower.
A lot of nature's variety isn't a pile of separate inventions — it's one rule explored across its range. When two things look unrelated, ask whether they're the same kind seen at different settings.
June 25, 2026 № 026 ↗L-System Garden
A plant grown from language: rewrite a one-letter axiom by fixed rules until the string is thousands of characters long, then let a turtle draw it — fern, weed, willow or bush, each branch a smaller copy of the whole. Drag the generations slider to unfold the detail; nudge the angle from stiff conifer to drooping willow.
The plant isn't stored as a picture but as instructions that refer to themselves — that's how a seed can fit a tree. Complexity doesn't have to be written out in full; it just has to be foldable.
June 24, 2026 № 025 ↗Langton's Ant
One ant, two rules for all time: turn right on light, left on dark, flip the square, step. Tidy symmetric blobs give way to ten thousand steps of apparent noise — and then, every single time, a 104-step cycle laying an endless highway to infinity. Edit the rule string, drop in extra ants, drag to follow.
You can read the rules in full and still never see the highway coming. Some deterministic things are knowable only by living them forward — the shortcut past the messy steps was never on offer.
June 23, 2026 № 024 ↗Magnetic Pendulum
A pendulum over a ring of magnets, asked for every starting point at once: each pixel is coloured by the magnet a pendulum dropped there finally settles over. Calm pools of solid colour near each magnet shatter into fractal lace between them. Click to drop a live swing; tune friction, pull and magnet count.
The physics is completely fixed, yet over much of the plane you can't say where it lands without running it. The tangled regions are where a hair's-width nudge flips the outcome entirely.
June 22, 2026 № 023 ↗Abelian Sandpile
Pour sand one grain at a time; any square holding four grains topples one to each neighbour, and one grain can cascade across the whole board. A tall column collapses into the same crisp fourfold mandala every time — the toppling order doesn't matter (that's the “abelian” part). Click or drag to pour.
Nobody sets the dial to “critical” — the pile pours itself to the exact slope where the next grain might do nothing or everything, and lives there. Earthquakes, fires and crashes stack to the brink as a matter of course.
June 21, 2026 № 022 ↗Ising Model
A lattice of spins, each with one urge: fall in line with your four neighbours — unless temperature makes you reckless. Drag the temperature through Tᴄ ≈ 2.269 and static curdles into vast continents of agreement, magnetisation jumping off zero. Flip patches by dragging, add a field bias, quench it from hot.
Nobody tips the lattice over — below the critical temperature, agreement simply becomes the cheaper option, discovered locally one nudge at a time. The interesting question is rarely who decided; it's what the temperature was.
June 20, 2026 № 021 ↗Differential Growth
A closed loop told to keep growing inside a space that won't grow with it — so it folds. Points stay near their ring-neighbours, push away from crowds, and split wherever the curve stretches; restless never-crossing meanders nest like brain coral. Drag to nudge the curve and watch it heal.
Nobody draws the wrinkles — they're what “keep growing with nowhere to go” is forced to look like. When you see something intricately convoluted, ask what was being squeezed.
June 19, 2026 № 020 ↗Penrose Tiling
Two rhombi that tile the infinite plane with no gaps and no repeats, grown live by deflation: every tile cuts into smaller copies at the golden ratio, the same sunburst blooming at each finer scale. Drag the depth slider; pan and zoom to find suns, stars and decagons at every magnification.
Order and periodicity are not the same thing: these tiles follow strict local rules everywhere, are fivefold symmetric — and never once return to where they started. Real quasicrystals do it with atoms.
June 18, 2026 № 019 ↗Cyclic Cellular Automaton
Rock-paper-scissors with up to twenty hands, played at once by every pixel: a cell flips to the colour that beats it as soon as enough neighbours hold it. From television snow, rotating spiral waves wind themselves up and never settle. Drag to paint fresh noise; tune the cycle length, threshold and reach.
No one places a spiral — a core is just a spot where the colours happened to wrap the whole cycle, and once it exists it pumps waves forever. Motion that can't stop has to curl into order.
June 17, 2026 № 018 ↗Apollonian Gasket
Circles packed inside circles, grown live from Descartes' Circle Theorem: the gap between three kissing circles holds exactly one more, forever, each computed — not faked — from a single quadratic in the curvatures. Watch it bloom coarse-to-fine; tune depth and the smallest circle, or reshuffle the seed.
Every gap looks like emptiness, but it's a fully-determined invitation: given the three circles around it, exactly one circle fits, nameable before it's drawn. The structure is the holes, resolved.
June 16, 2026 № 017 ↗Stable Fluid
Jos Stam's 1999 “Stable Fluids” solver, the trick that first made smoke practical in films and games. Drag to inject dye and push the current; your shove blooms into vortices that keep curling long after you let go. Flip to Velocity mode to see the invisible field the dye was riding all along.
The colours are a passenger — the real thing is an unseen velocity field. Each frame the solver removes any flow that would compress the fluid, and that one constraint is what bends a straight push into a vortex.
June 15, 2026 № 016 ↗Truchet Tiles
Square tiles carrying two quarter-circle arcs, each flipped by a single coin-toss — yet because neighbouring arcs always join cleanly, sprawling labyrinths, loops and islands assemble that no tile ever planned. Re-roll tiles by dragging; slide the orientation bias to snap static into clean diagonals.
Nothing in a single tile knows about a curve — the richness isn't in the binary choice, it's in the adjacency. Constraints at the boundaries turn a pile of coin flips into a pattern.
June 14, 2026 № 015 ↗Dendrite
Diffusion-limited aggregation: each particle wanders at random until it touches the crystal, then freezes there forever — branching fractals assembled one accident at a time, the same maths behind frost ferns and electroplated metal. Grow from a point, floor or ring; lower the stickiness to thicken the fronds.
A bump that sticks out is easiest for the next random walker to hit, so tips race ahead while hollows starve — the same rich-get-richer geometry as lightning, river networks and city sprawl.
June 13, 2026 № 014 ↗Chladni Plate
A vibrating square plate, recreated from Ernst Chladni's 1787 demonstration. Thousands of grains of sand are shaken off the moving regions and pile up along the nodal lines — the places the plate holds perfectly still — drawing crisp, symmetric figures. Drag the two mode numbers to retune the plate and watch grids, stars and mandalas reorganise; click to sprinkle more sand.
The sand never draws the loud part of the wave — it draws the silence, mapping out exactly where nothing is moving. Structure often lives in the gaps: the still points a busy system organises itself around.
June 12, 2026 № 013 ↗Wave Function Collapse
A whole grid starts as pure uncertainty — every cell holds every possible pipe-tile at once. The algorithm repeatedly finds the most-constrained cell, forces it to pick a tile, then ripples that decision outward so neighbours drop the options that no longer fit. Watch certainty spread until an endless, perfectly-connected maze has built itself. Click to drop your own seed; recolour, resize, or solve it instantly.
It never grows from a seed — it sieves. By always collapsing the cell with the fewest choices left, each decision constrains the rest, and a globally consistent pattern falls out of nothing but local edge-matching. When everything's uncertain, resolve the spot with the least freedom first.
June 11, 2026 № 012 ↗Slime Mould
Tens of thousands of brainless agents each follow one rule: sniff three points ahead, steer toward the strongest scent, and leave a little scent of your own behind. From that, a living, branching transport network assembles, breathes, and reorganises — the same Physarum behaviour that famously re-drew the Tokyo rail map. Drag to seed new arms; tune the senses to reshape the web.
Nobody designs the network. Each agent slightly prefers the path someone just went down, so faint trails either get reinforced into glowing arteries or quietly evaporate. Ant trails, worn footpaths, and the busiest links online all grow this way — coordination by leaving marks, not by anyone in charge.
June 10, 2026 № 011 ↗Phyllotaxis Garden
A generative sunflower head built from one rule: place each floret a fixed turn around from the last, then push it outward. Drag the turning angle past the golden angle (137.5°) and a wasteful scatter of spokes snaps into the dense, interlocking spirals of a real seed head — with Fibonacci arm counts. Or hit Spin to sweep it.
The golden angle wins because it's the most irrational turn there is — it never lines up with an earlier floret, so it never wastes a gap. Sometimes the best way to fill a space is to never quite come back to where you've already been.
June 9, 2026 № 010 ↗Harmonograph
A virtual version of the Victorian pendulum drawing machine: four decaying sine waves on two axes braid into looping figures that spiral gently inward as they run out of energy. Tune the frequency ratios, phase, and damping, or shuffle for a fresh curve.
Beauty doesn't come from the parts being complicated — each pendulum is the simplest motion there is. It comes from how two simple things are tuned against each other, and the grace of something almost-regular winding down.
June 8, 2026 № 009 ↗Murmuration
Hundreds of simple agents follow just three local rules — separation, alignment, cohesion — and self-organise into a living, flowing flock. Tune the rules, change the flock size, and sweep your mouse through to gather or scatter them.
Coordination doesn't need a leader or a plan. A whole sky moving as one can be nothing more than a great many small things, each paying attention only to what's right next to it.
June 7, 2026 № 008 ↗Fourier Drawing Machine
Draw any shape with your mouse, then watch it decomposed into spinning circles — epicycles — that trace the original path. A slider controls how many harmonics to use, from crude approximation to perfect reconstruction.
Every complicated thing you see can be described as a stack of simple patterns at different scales. The big circles capture the broad strokes; the tiny ones add the fine detail. Understanding doesn't always mean grasping the whole at once.
June 6, 2026 № 007 ↗Lorenz Attractor
A 3D butterfly-shaped chaotic system rendered with trailing particles. Rotate the view with mouse drag and adjust sigma, rho, and beta parameters to watch the attractor reshape in real time.
Tiny differences in starting position lead to completely different paths — yet every path stays on the same strange attractor. Unpredictability and structure aren't opposites.
June 5, 2026 № 006 ↗Game of Life
Conway's cellular automata with paintable cells, adjustable speed, and preset patterns. Click to toggle cells, watch the colony evolve under four simple rules.
Complexity doesn't require complicated ingredients — four rules that a child can learn produce structures no one has fully catalogued after fifty years of trying.
June 4, 2026 № 005 ↗Voronoi Diagram
Click to place seed points and watch coloured regions form in real time as each pixel finds its nearest neighbour. Drag seeds to reshape the tessellation.
Boundaries aren't drawn by rulers — they emerge from proximity. Every Voronoi edge is the set of points equidistant from two seeds; influence doesn't need walls, just presence.
June 3, 2026 № 004 ↗Ripple Tank
A sheet of virtual water solving the wave equation in real time. Click to drop oscillating sources and watch their ripples meet, double, and cancel — including a working double-slit experiment.
Two influences arriving at the same place don't always reinforce each other — line them up wrong and two strong waves cancel into perfect stillness; absence isn't always nothing happening.
June 2, 2026 № 003 ↗Strange Attractors
One point, chased through the de Jong equations hundreds of thousands of times a frame, accumulating into glowing fractal dust. Drag to fly through the parameter space.
A perfectly deterministic rule, with no randomness at all, can trace a shape of endless non-repeating intricacy — knowing the rule exactly is not the same as knowing the future.
June 1, 2026 № 002 ↗Reaction Diffusion
Two virtual chemicals interact and diffuse: the balance of feed vs. kill rate determines whether you get leopard spots, coral branches, a maze, or worms.
Complex, specific pattern doesn't need a blueprint — a leopard's spots aren't stored anywhere; they emerge from local chemistry running everywhere at once.
May 31, 2026 № 001 ↗Flow Field
Thousands of particles drifting through an invisible, ever-shifting vector field. Move your mouse to bend the current.
Beautiful, complicated wholes often come from one simple rule, followed faithfully at scale — and you tend the field rather than steer each particle.
May 30, 2026