Run results for: unbiased ranged random integer generation functions

Run details:

User agent: Mozilla/5.0 (X11; Linux x86_64; rv:140.0) Gecko/20100101 Firefox/140.0

Browser: Firefox 140

Operating system: Linux

Device Platform: Desktop

Date tested: 10 months ago

Test name	Executions per second
Classic 16	1896757.9 Ops/sec
Mul shf 16	1767623.9 Ops/sec
Imul shf 16	1831607.1 Ops/sec
Classic int	1693651.8 Ops/sec
Mul shf bigint	1315760.8 Ops/sec
Mul shf 32	685927.0 Ops/sec
java nextInt16(bound)	2055682.6 Ops/sec
java nextInt32(bound)	1652137.2 Ops/sec

Script Preparation code:

const ta16 = new Uint16Array(1);
const ta32 = new Uint32Array(1);
const bound = 13000;

Tests:

Classic 16
if ((bound & -bound) === bound) { window.crypto.getRandomValues(ta16); return bound * ta16[0] >>> 16; } const limit = 65536 - 65536 % bound; do { window.crypto.getRandomValues(ta16); } while (ta16[0] >= limit); return ta16[0] % bound;
Mul shf 16
if ((bound & -bound) === bound) { window.crypto.getRandomValues(ta16); return bound * ta16[0] >>> 16; } const limit = (-bound >>> 0) % bound; let value; do { window.crypto.getRandomValues(ta16); value = ta16[0] * bound; } while ((value & 65535) < limit); return value >>> 16;
Imul shf 16
if ((bound & -bound) === bound) { window.crypto.getRandomValues(ta16); return bound * ta16[0] >>> 16; } const limit = (-bound >>> 0) % bound; let value; do { window.crypto.getRandomValues(ta16); value = Math.imul(ta16[0], bound); } while ((value & 65535) < limit); return value >>> 16;
Classic int
if ((bound & -bound) === bound) { window.crypto.getRandomValues(ta32); return ta32[0] * bound / 4294967296 >>> 0; } const limit = 4294967296 - 4294967296 % bound; do { window.crypto.getRandomValues(ta32); } while (ta32[0] >= limit); return ta32[0] % bound;
Mul shf bigint
if ((bound & -bound) === bound) { window.crypto.getRandomValues(ta32); return ta32[0] * bound / 4294967296 >>> 0; } const limit = (-bound >>> 0) % bound; let bits, mLow; let mHigh; do { window.crypto.getRandomValues(ta32); bits = ta32[0] >>> 1; const m = BigInt(bits) * BigInt(bound); mLow = Number(m & 2147483647n); mHigh = Number(m >> 31n); } while (mLow < limit); return mHigh;
Mul shf 32
if ((bound & -bound) === bound) { window.crypto.getRandomValues(ta32); return ta32[0] * bound / 4294967296 >>> 0; } const limit = (-bound >>> 0) % bound; let value; do { window.crypto.getRandomValues(ta32); value = ta32[0] * bound; } while ((value & 4294967295) % bound < limit); return value / 4294967296 >>> 0;
java nextInt16(bound)
if ((bound & -bound) === bound) { crypto.getRandomValues(ta16); return bound * ta16[0] >>> 16; } let value; do { crypto.getRandomValues(ta16); value = ta16[0] % bound; } while (ta16[0] - value + (bound - 1) < 0); return value;
java nextInt32(bound)
if ((bound & -bound) === bound) { window.crypto.getRandomValues(ta32); return ta32[0] * bound / 4294967296 >>> 0; } let bits, value; do { window.crypto.getRandomValues(ta32); bits = ta32[0] >>> 1; value = bits % bound; } while (bits - value + (bound - 1) < 0); return value;

Run results for: unbiased ranged random integer generation functions

Classic 16

Mul shf 16

Imul shf 16

Classic int

Mul shf bigint

Mul shf 32

java nextInt16(bound)

java nextInt32(bound)