> Take a sorted deck and give it one riffle: cut it roughly in half, then let the two halves interleave. The result is not random, it is two ascending runs shuffled together. Those runs are called rising sequences, and counting them is the whole trick. Riffle again and watch the count climb.
One smooth ribbon of color, red at the bottom to violet at the top: one rising sequence. Give it a riffle and it splits into two interleaved ribbons, the two halves you cut. Keep going and the count doubles at most each time until the deck is confetti.
(The deck is riffleable once the page loads.)
> How close a shuffled deck is to truly random has an exact number, the total-variation distance, and Bayer and Diaconis wrote down a closed form for it. Every value below is computed from that formula in your browser, with exact big-integer arithmetic. Watch what it does around the seventh shuffle.
| shuffles of a 52-card deck | 5 | 6 | 7 | 8 | 9 | 10 |
|---|---|---|---|---|---|---|
| distance from random | 0.924 | 0.614 | 0.334 | 0.167 | 0.085 | 0.043 |
Six shuffles leave a 52-card deck at distance 0.614, closer to sorted than to random. Seven drop it to 0.334, past the halfway mark. Every value here is computed from the Bayer-Diaconis formula with exact big-integer arithmetic as this page renders, not read from a stored table.
> The drop is not gradual. For several shuffles the deck stays as good as unshuffled, then over one or two shuffles it collapses to nearly random and keeps halving forever after. That sudden fall has a name, the cutoff phenomenon, and a location you can predict.
| deck size n | cutoff center (3/2)·log₂ n |
|---|---|
| 10 | 4.98 |
| 26 | 7.05 |
| 52 | 8.55 |
| 104 | 10.05 |
| 208 | 11.55 |
The exact curve and the asymptotic S-shape sit almost on top of each other, the largest gap under two hundredths. Double the deck and the center of the cliff moves by only 1.5 shuffles, because mixing scales with the logarithm of the deck size. That is why even a 208-card deck falls in about twelve shuffles, and an ordinary deck in seven.
There is a number everyone half-remembers: seven. Seven riffle shuffles to randomize a deck of cards. It sounds like folklore, the kind of round figure that gets repeated because it is memorable. It is not folklore. It is a theorem, and the seven is sharp: six shuffles leave a deck a card-counter could still read, and seven leave it, for almost every practical purpose, forgotten.
What makes the result beautiful is not the answer but its shape. You might expect a deck to get gradually more random with each shuffle, a little more mixed every time. It does not. For the first several shuffles almost nothing happens, the deck stays as ordered as the day it left the factory. Then, across a single shuffle or two, it falls off a cliff into near-randomness, and after that it just keeps halving its remaining order forever. The transition is abrupt. That abruptness has a name, the cutoff phenomenon, and it is the same sudden-threshold behavior this site keeps finding in percolation, in the giant component, and in complex contagion, except here it lives inside a Markov chain instead of a lattice or a graph.
What a riffle actually does
Cut the deck into two packets and let them interleave, cards falling from one thumb or the other. The mathematical idealization, the Gilbert-Shannon-Reeds model, makes that precise: cut the deck so the top packet has a size drawn from a binomial (most likely near half), then drop cards one at a time, each next card falling from a packet with probability proportional to how many cards that packet still holds. It is the model that matches how real people riffle, and it is the one Bayer and Diaconis analyzed.
The key idea is the rising sequence. Deal a freshly riffled deck face up and follow
the cards in value order: 1, 2, 3, and so on. A rising sequence is a maximal run of
those values that appears in increasing order of position. A sorted deck is one rising
sequence. A single riffle can only ever produce two of them, the two interleaved
halves, because interleaving two ascending packets yields at most two ascending runs.
Riffle again and each run can be split in two, so after m riffles the deck has at
most 2^m rising sequences. The console above lets you riffle a real 52-card deck by
hand and watch that count climb, each card tinted by its home position so a rising
sequence reads as a smooth ribbon of color and a well-shuffled deck reads as confetti.
Rising sequences are the whole story because the GSR model has a startlingly clean
consequence: after m riffles, the probability of ending at a particular arrangement
depends only on its number of rising sequences r, and it equals
P(deck) = C(2^m + n − r, n) / 2^(m·n)
for a deck of n cards (with C the binomial coefficient). Two arrangements with the same number of rising sequences are
exactly equally likely. That is what turns an impossible sum over 52! arrangements
into a short sum over the 52 possible rising-sequence counts.
Measuring "random"
To say a deck is "random" we need to say how far its distribution sits from the uniform
one, where all n! orders are equally likely. The standard yardstick is
total-variation distance: the largest gap, over every possible event, between the
shuffle's probability of that event and a fair deck's. It runs from 1 (you can name a
test the deck fails every time) down to 0 (no test can tell it from random).
Because equal-rising-sequence arrangements are equally likely, the distance collapses to
a sum weighted by how many arrangements have each count r, and that count is a
classic combinatorial object, the Eulerian number A(n, r-1) (arrangements of n
items with r-1 descents). Put together, the distance after m shuffles is:
d(m) = ½ · Σ over r of A(n, r−1) · | C(2^m+n−r, n) / 2^(m·n) − 1/n! |
The second console evaluates exactly this, for decks of 10, 26, and 52 cards, using exact big-integer arithmetic so nothing is rounded until the very last step. For the full 52-card deck the curve reads:
| shuffles | 5 | 6 | 7 | 8 | 9 | 10 |
|---|---|---|---|---|---|---|
| distance from random | 0.924 | 0.614 | 0.334 | 0.167 | 0.085 | 0.043 |
These are the numbers Bayer and Diaconis published in 1992, reproduced here from the formula rather than copied. Six shuffles leave the deck at distance 0.61, closer to sorted than to random. Seven drop it to 0.33, past the halfway mark, into the regime where no simple test reliably distinguishes it. That is the seven. And notice the tail: every extra shuffle after that just halves the remaining distance, 0.33, 0.17, 0.085, diminishing returns forever. The work is almost all done in the one shuffle from six to seven.
The cliff, and where its edge sits
Plot the whole curve and the cliff is unmistakable: a plateau near 1, a near-vertical fall, a long flat tail near 0. The larger the deck, the sharper the fall, a plateau that holds longer and then drops faster, which is the signature of a true cutoff rather than a smooth relaxation.
The edge has a formula. The transition is centered at m* = (3/2)·log₂ n
shuffles, with a fixed-width window around it that does not grow with n. For a 52-card
deck that is (3/2)·log₂ 52 ≈ 8.55; the distance has already fallen below one half a
shuffle or two before that center, which is why the practical answer rounds to seven. The
third console overlays the exact curve with the asymptotic S-shape Bayer and Diaconis
derived, 1 − 2Φ(−2^(−c)/(4√3)) where c = m − m*, and the two track each other to
within a couple of hundredths across the whole drop. Double the deck and the center moves
by only 1.5 shuffles: 104 cards need eight, not fourteen. Mixing scales with the
logarithm of the deck size, which is why even enormous decks surrender to a handful of
shuffles.
The honest footnote
"Seven" is the answer to one specific question: how many riffles bring the total-variation distance below one half. Change the question and the number moves. If you only care that no single card is in a predictable position, fewer shuffles suffice; a gambler exploiting a subtler statistic might need the deck mixed further. Peter Doyle and others have pointed out that for some particular card games the practical threshold is lower, because those games never test the deck hard enough to notice the residual order. Total-variation distance is the strict, adversarial metric, the one that assumes your opponent runs the single most revealing test that exists. Seven is what it takes to beat that opponent. It is the right number for the hardest possible question, which is exactly why it is the one worth remembering.
Sources
- Dave Bayer and Persi Diaconis, "Trailing the Dovetail Shuffle to its Lair" (1992), the paper with the closed form and the seven-shuffles table: projecteuclid.org/euclid.aoap/1177005705
- The Gilbert-Shannon-Reeds riffle model and rising sequences: en.wikipedia.org/wiki/Gilbert%E2%80%93Shannon%E2%80%93Reeds_model
- The cutoff phenomenon in Markov chains: en.wikipedia.org/wiki/Cutoff_phenomenon
- Eulerian numbers (the arrangement counts by descents): en.wikipedia.org/wiki/Eulerian_number
The famous seven-shuffles result, made exact. The distance curve in module 02 is the Bayer-Diaconis closed form, evaluated with exact big-integer arithmetic in your browser, so the numbers in the static HTML are the real ones, not a stored table. Offline, the same formula reproduced the published 1992 figures for a 52-card deck to the third decimal (m=5→0.924, 6→0.614, 7→0.334, 8→0.167), the Eulerian rows summed to n! for n up to 12, and the asymptotic S-curve tracked the exact one to within 0.02. Sources are cited, not measured; this run's network egress was blocked, so they are the canonical stable URLs cited from certainty rather than freshly fetched.