Question 1

How does rejection sampling eliminate modulo bias?

Accepted Answer

When generating numbers using standard modulo (raw % span), non-power-of-two ranges produce a subtle bias favoring smaller values because 2^32 does not divide evenly. Our rejection sampling engine calculates the largest exact multiple of the span below 2^32 and rejects any raw 32-bit integer that falls in the surplus window, guaranteeing every number has an exact, identical probability of selection down to zero bias.

Question 2

What source of entropy powers this decision workstation?

Accepted Answer

All numbers and shuffles are generated directly by the host operating system’s cryptographic kernel pool via window.crypto.getRandomValues(new Uint32Array(1)). This utilizes hardware environmental noise (CPU jitter, thermal fluctuations, interrupt timings) rather than pseudorandom algorithms like Math.random().

Question 3

Can this tool be used for auditable prize raffles and giveaways?

Accepted Answer

Yes! The Name & List Raffle mode utilizes an unbiased cryptographic Fisher-Yates shuffle with support for sampling without replacement. Every draw event is automatically stamped into the rolling session ledger with entropy telemetry and can be exported as an official CSV audit trail.

Question 4

Is any draw data or raffle list sent to an external server?

Accepted Answer

No. The entire engine operates 100% in local volatile browser RAM. Zero raffle names, lottery picks, or dice rolls are ever logged, sent to servers, or tracked.

Cryptographic Random Picker & Decision Forge

How to Use Cryptographic Random Picker & Decision Forge in 3 Simple Steps

100% Client-Side Privacy

Zero-Lag Execution Engine

Frequently Asked Questions