Provable fairness
Every result is computed on the server before any animation starts, from seeds you can verify afterwards.
How it works
- 1Your server seed is 32 random bytes from the operating system’s cryptographically secure RNG. You see its SHA-256 hash in advance.
- 2Each roll is HMAC-SHA256(server seed, “client seed:nonce:round”), read as 32-bit numbers with rejection sampling — no modulo bias.
- 3For cases the roll (0–999,999) is mapped onto the cumulative odds, listed from the most valuable item down. Upgrades succeed when roll < chance × 1,000,000.
- 4Rotate your seed to reveal the old server seed and re-check every result below or in History.
roll = uint32(HMAC_SHA256(serverSeed, clientSeed + ":" + nonce + ":" + round)) mod 1,000,000 (rejection sampling)