Spin the Wheel of Names - Free Random Name Picker & Wheel Spinner

All names are loaded into memory, regardless of quantity.

// Load all names from database or input
const allNames = await loadAllNames(); // Could be 10, 100, or 100,000+ names
console.log(`Total names loaded: ${allNames.length}`);

Duration is intelligently scaled based on user preference and list size.

// Duration scales with both preference and list size
const durationSettings = {
  short: { baseMin: 2, baseMax: 4, scaleMin: 0.5, scaleMax: 0.75, cap: 7 },
  normal: { baseMin: 3, baseMax: 8, scaleMin: 0.5, scaleMax: 1, cap: 12 },
  long: { baseMin: 15, baseMax: 20, scaleMin: 1, scaleMax: 2.5, cap: 30 }
};

// Scale based on number of names (capped at 4000+)
const scaleFactor = Math.min(names.length / 1000, 4);
const minDuration = (setting.baseMin + scaleFactor * setting.scaleMin) * 1000;
const maxDuration = Math.min(setting.baseMax + scaleFactor * setting.scaleMax, setting.cap) * 1000;

// Examples for 5000 names:
// Short: 3.5-7 seconds | Normal: 5-12 seconds | Long: 20-30 seconds

Multiple cryptographically secure random values are generated for duration and winner selection.

// Use Web Crypto API for all randomness
const array = new Uint32Array(2);
crypto.getRandomValues(array);

// First value: Determine exact spin duration within range
const randomDurationMs = minDuration + ((array[0] / 0xFFFFFFFF) * (maxDuration - minDuration));

// Second value: Will be used for winner selection
const randomValue = array[1] / (0xffffffff + 1); // Value between 0 and 1

The random number determines which name from the full list wins.

// Select winner from complete list
const winnerIndex = Math.floor(randomValue * allNames.length);
const winner = allNames[winnerIndex];
console.log(`Winner selected: ${winner} (index ${winnerIndex} of ${allNames.length})`);

The wheel spins for the determined duration and lands on the selected winner.

// Spin wheel for calculated duration
spinWheel(randomDurationMs);

// Update wheel display to show winner
if (displayedNames.includes(winner)) {
  // Winner is visible on wheel - spin to it
  spinToSegment(displayedNames.indexOf(winner));
} else {
  // Winner not visible - add temporarily for display
  const tempWheel = [...displayedNames.slice(0, 249), winner];
  spinToSegment(249); // Spin to the winner's position
}

Equal Probability

Every name has exactly equal probability of being selected:

// For a list of N names:
Probability per name = 1/N

// Examples:
100 names: Each has 1% chance
1,000 names: Each has 0.1% chance
10,000 names: Each has 0.01% chance

No Bias Factors

• • Position in list doesn't matter
• • Length of name doesn't matter
• • Whether name is displayed on wheel doesn't matter
• • Previous selections don't influence future ones (unless name is removed)

Transparency Features

• • Complete algorithm is documented here
• • Console logs provide full visibility
• • Winner history is preserved and exportable
• • Results can be independently verified