THE FOLD / LOOT / THE JACKPOT / THE BIRTHDAY
THE BIRTHDAY
23 people, 50% collision — pairs, not people
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
The birthday paradox. How many people must be in a room before two of them probably share a birthday? Intuition says a lot — there are 365 days. The answer is just 23. With 23 people the chance of a shared birthday is already over 50%; with 50 it is 97%.
The reason is that collisions are about pairs, not people. k people make k(k−1)/2 pairs, and that count grows quadratically, so it reaches n around k ≈ 1.18·√n — square-root-small. The exact probability of no collision is a shrinking product, 1 · (1−1/n) · (1−2/n) · …. This is not a party trick: it is why a birthday attack finds a hash collision in about √(2bits) tries, halving a hash function’s security in bits.
LIT verified live: the collision formula matches simulation to within 1% across cases, 23 people cross 50% (P = 0.5073), and the √n threshold holds (window.__birthday.formulaMatchesEmpirical && p23over50). FIG no framing; the product formula, the √n threshold, and the crypto consequence are exact.
The reason is that collisions are about pairs, not people. k people make k(k−1)/2 pairs, and that count grows quadratically, so it reaches n around k ≈ 1.18·√n — square-root-small. The exact probability of no collision is a shrinking product, 1 · (1−1/n) · (1−2/n) · …. This is not a party trick: it is why a birthday attack finds a hash collision in about √(2bits) tries, halving a hash function’s security in bits.
LIT verified live: the collision formula matches simulation to within 1% across cases, 23 people cross 50% (P = 0.5073), and the √n threshold holds (window.__birthday.formulaMatchesEmpirical && p23over50). FIG no framing; the product formula, the √n threshold, and the crypto consequence are exact.
2 HOW IT WAS WEAVED · AI + HUMAN
David (human) seated this in THE JACKPOT, beside THE COIN-FLIP HEAP and THE RANK — the loot domain of odds and long-run chance. The birthday paradox is the odds everyone gets wrong — and the engine behind Pollard’s rho (THE RHO) and every collision attack. AVAN (AI) built the instrument: the exact product, the empirical check, the pair count.
The weave: David names the seat (the surprising odds); I make the crossover visible and the formula checkable — the rising probability in 1D, the live experiment in 2D, the colliding ring in 3D. The sphere is the seam. Credit: Richard von Mises (1939); the birthday attack in cryptography.
The weave: David names the seat (the surprising odds); I make the crossover visible and the formula checkable — the rising probability in 1D, the live experiment in 2D, the colliding ring in 3D. The sphere is the seam. Credit: Richard von Mises (1939); the birthday attack in cryptography.
3 ONE DIMENSION
The collision probability climbing as people are added, and the moment it crosses 50% — at just 23 for 365 days. The curve rises far faster than intuition expects, because every new person pairs with all the others already there.
4 TWO DIMENSIONS · INTERACTIVE
Add people and watch their random birthdays land on the calendar; the first repeat flashes a collision. The theoretical S-curve shows how likely that was by now — and it agrees with what actually happens. Change n and see the √n threshold move.
5 THREE DIMENSIONS + AVAN’S INVERSE
People as a turning ring, each a thread to their birthday-slot — green, the crowd fanning out across the year.
AVAN’s addition (the inverse-companion): the magenta threads are a colliding pair — two people, one day. Intuition counts people and expects the threshold near half of n. The inverse truth counts pairs: k people make about k²/2 of them, so collisions become likely at only √n. The quadratic number of pairs is the whole secret — and it is exactly why a birthday attack needs only the square root of a hash’s space, halving its bits of security. The surprise dissolves the moment you stop counting who is there and start counting who could match. The green is the crowd; the magenta is the pair that makes the improbable ordinary.
LIT The birthday paradox (Richard von Mises, 1939; the birthday attack in cryptography). Verified live: the exact collision formula 1 - product(1-i/n) matches simulation to within 1% across cases, 23 people cross 50% (P = 0.5073), and the sqrt(n) threshold (~1.18*sqrt(n)) holds (window.__birthday.formulaMatchesEmpirical && p23over50, both true). The quadratic pair count that drives the square-root threshold and the crypto consequence (halving hash security in bits) are exact.
FIG No metaphor is doing the work: the product formula, the 23-crosses-50% fact, the sqrt(n) threshold, and the match to simulation are all real and checked. The 'paradox' is only that intuition counts people while the math counts pairs — a genuine, demonstrated explanation.
FIG No metaphor is doing the work: the product formula, the 23-crosses-50% fact, the sqrt(n) threshold, and the match to simulation are all real and checked. The 'paradox' is only that intuition counts people while the math counts pairs — a genuine, demonstrated explanation.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of THE JACKPOT · David Lee Wise (ROOT0), with AVAN