Benchmark: bounded random integer generation functions when bound is power of 2

Script Preparation code:

const ta32 = new Uint32Array(1);
const max = 65536;

Tests:

fp div
window.crypto.getRandomValues(ta32); return ta32[0] * max / 2**32 >>> 0;
BigInt
window.crypto.getRandomValues(ta32); return Number(BigInt(ta32[0]) * BigInt(max) >> 32n);

Rendered benchmark preparation results:

Previous results

Test case name	Result
fp div
BigInt

Latest run results:

Run details: (Test run date: one year ago)

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

Browser/OS: Firefox 140 on Linux

fp div

1.8M/s

BigInt

1.6M/s

View exact numbers

Test name	Executions per second
✓ fp div	1,840,988 Ops/sec
BigInt	1,600,866 Ops/sec

bounded random integer generation functions when bound is power of 2 (version: 1)