🎁Draw Secret Santa names without the hat.

✓ Tested & verified Updated: Aug 6, 2026 How the randomness works

Secret Santa generator

8 people in the hat — draw to see who gives to whom.

Single-cycle draw: nobody gets themselves, everyone gives and receives once

Everyone taking part — one per line

Try also

How do you draw Secret Santa names so nobody gets themselves?

Secret Santa is drawn as one circle: everyone in a random order, each person buying for the next along. That is the whole method here — the names are shuffled with Fisher–Yates, then joined into a single closed chain — first buys for second, second for third, and the last person buys for the first. Because the chain has no branches and no short loops, self-matches are impossible by construction, not prevented by a retry.

This matters because the obvious approach fails constantly. Pair a shuffled list against itself at random and the chance that nobody draws their own name is about 36.8% — the derangement probability, which converges on 1/e. So a naive draw needs redrawing roughly two times in three, and every redraw is another chance for someone to glimpse the screen.

One consequence worth knowing: a single chain also rules out mutual pairs. Nobody buys for the person who is buying for them, which most groups prefer and a few find surprising.

Two ways to draw the same names, with very different failure rates. The left column is the hat; the right column is what this page does.

	Random pairing	Single-cycle chain
Self-matches possible	Yes	No
Chance nobody draws themselves	about 36.8%	100%
Redraws needed	roughly 2 in 3	never
Mutual pairs (A buys for B, B for A)	possible	never
Everyone gives and receives once	yes	yes

That 36.8% is one of the more pleasing constants in everyday probability: it converges on 1 divided by e and stops moving almost immediately, so a group of eight and a group of eighty fail at very nearly the same rate. Building the chain instead of testing the pairs sidesteps the problem completely.

Need to shuffle the same names into a running order instead — for who opens presents first, say? The list randomizer handles that, and the random name picker will nominate whoever is hosting.

Frequently asked questions

Can someone draw their own name?

No, not in any circumstance. The draw builds one closed chain through everyone, so each name has a different name after it and the loop only closes at the end. There is no retry loop that might behave oddly on small groups, and no edge case at three or four people. Self-matching is not filtered out — it is structurally impossible.

Why do paper draws so often need a redraw?

Because random pairing goes wrong more often than not. The probability that a completely random assignment leaves nobody holding their own name is about 36.8%, and it stays close to that figure for any group larger than about five. So roughly two draws in three contain at least one self-match, which is why the hat comes round again and someone has to pretend they did not see.

Can I exclude couples or people who share a household?

Not directly — the generator takes a list of names and nothing else. The workable approach is to generate, look at the result, and redraw if a forbidden pairing appears, which is quick because the whole assignment is produced at once. Announce the exclusion rule before you draw, otherwise a redraw looks like someone reshuffling until they got what they wanted.

How do I run the draw remotely?

Paste the names, copy the page link and send it to the group, then agree who presses the button. Because the entries travel in the link, everyone sees the same list — but each press produces a fresh chain, so exactly one person should generate and share the result. The alternative is a video call where one person generates on a shared screen and everyone reads their own line.

Whoever presses the button can see all the pairs. Is that a problem?

It is the honest limitation of any single-screen draw. Two conventions handle it: either the organiser accepts being the person who knows and keeps quiet, or everyone sits together and looks at their own line while the others look away. What you should not do is paste the full assignment into the group chat, which happens every December somewhere.

How many people do I need?

Three is the smallest group where a chain draw makes sense — with two people it is not a secret, it is a swap. There is no upper limit, and the method scales without getting slower or more likely to fail. Around eight to twelve is where most workplace exchanges land, which is why the default list holds eight.

How the randomness works

The names are shuffled with the Fisher–Yates algorithm, using indices drawn from crypto.getRandomValues with rejection sampling so that every ordering is equally likely. The shuffled list is then read as a single cycle: each person gives to the next in the order, and the final person gives to the first. This makes self-matches impossible without any rejection or retry, and guarantees that every participant gives exactly one gift and receives exactly one. For a group of n people there are (n−1)! possible chains — 5,040 for eight names. The list is carried in the page URL for sharing; the assignment itself is never stored or transmitted.

Sources:

The draw is not the hard part

The mechanics are the easy part. What actually determines whether a Secret Santa works is everything the generator cannot touch: a budget everyone agrees on and nobody quietly exceeds, a date the presents actually arrive by, and a shared understanding of whether this is a joke-gift exchange or a real one. Mismatched expectations produce the classic scene where one person unwraps a novelty mug and the next unwraps something thoughtful and expensive.

Set the budget as a firm number rather than a range, since a range is read as its upper end by half the group and its lower end by the other half. Set a deadline before the party, not on the day. And say out loud whether anonymity survives the reveal — plenty of groups enjoy the guessing round, and a few find it excruciating.

The Secret Santa rules guide covers the arrangements that hold up, including how to handle exclusions and latecomers.