How Does a Random Name Picker Work?
Learn how a picker cleans a list, maps secure random values to entries and presents an auditable result without uploading names.
Random Picker Tools · Editorial Policy · Published · Updated
How Does a Random Name Picker Work?
A random name picker converts the cleaned list into indexed entries, requests an unbiased random index from the browser Web Crypto API, and returns the entry at that position. When several winners are requested without repeats, it shuffles a copy of the list and takes the required number of positions.
Recommended process
- Split the input at line breaks and remove empty lines.
- Apply the selected duplicate policy before counting eligible entries.
- Use rejection-sampled Web Crypto integers instead of Math.random().
- Display the selected names as text and optionally remove them from the working list.
Worked example
A facilitator has eight eligible speakers and needs two. With repeat winners disabled, the picker shuffles all eight names once and returns the first two positions. Those names can then be removed so the next selection starts from the remaining six.
What to check before using the result
- Confirm that each line represents one eligible person.
- Decide whether identical display names are duplicates or different people.
- Do not change the list after seeing a result.
How the random step is handled
Random Picker Tools uses the browser Web Crypto API for selection, rejection sampling for unbiased integers and a Fisher–Yates shuffle for complete list orders. The organizer still controls eligibility, duplicate rules, consent, accessibility and legal requirements.
Privacy note
Normal picking and shuffling happen in the browser. Use initials or non-sensitive identifiers when possible, avoid unnecessary source data, and create a share link only when temporary server storage is appropriate.