Provably fair

The algorithm

1. The server generates a random 256-bit server seed and publishes its SHA-256 hash before the round.
2. A HMAC-SHA256 is computed over “clientSeed:nonce” using the server seed as the key.
3. The first 52 bits of the HMAC become u ∈ [0, 1).
4. The crash point is (1 − houseEdge) ÷ (1 − u), clamped to the maximum multiplier.
5. After the crash the server seed is revealed; hashing it must match the published hash.

u        = int(HMAC_SHA256(serverSeed, clientSeed + ':' + nonce)[0:13], 16) / 2^52
crash    = (1 - houseEdge) / (1 - u)
houseEdge = 1 - RTP

Current RTP: 97% · Maximum multiplier: 1000x

Verify a round

Enter a round ID from the live feed or the admin round list.