From random bits to your range
The browser supplies random 32-bit words using crypto.getRandomValues(). We combine two words into a 64-bit value and reject the incomplete remainder of the requested interval before reducing it. BigInt arithmetic avoids precision loss even when safe integer endpoints span more than 2⁵³ values.
Without repeats
Floyd sampling selects unique offsets using memory proportional to the requested batch size. Fisher–Yates shuffling randomizes their order with the same unbiased integer primitive. Bingo instead chooses from its remaining balls.
What tests can tell us
Property tests check ranges and uniqueness; deterministic boundary tests check rejection behavior. Statistical smoke checks help find obvious errors but do not prove randomness. Browser cryptographic randomness is not a physical atmospheric-noise source.