Glossary

Provably Fair

A cryptographic system that lets players independently verify that a crash game's outcome was not manipulated — the crash point was committed to before the round began.

Provably fair is the crash game industry’s solution to a fundamental trust problem: how does a player know the casino didn’t change the outcome mid-round? Without cryptographic proof, you can’t. Provably fair provides that proof.

How the commitment scheme works

  1. Before the round: The server generates a random seed, computes its SHA-256 hash, and displays that hash publicly.
  2. During the round: The crash point is derived from the seed. Players see the multiplier rising but cannot compute the crash point from the hash alone.
  3. After the round: The server reveals the original seed.
  4. Verification: Anyone can apply SHA-256 to the revealed seed and confirm it matches the pre-round hash. If it matches, the server could not have changed the seed (and therefore the crash point) mid-round.
SHA-256(seed) = pre_round_hash ✓  →  round was fair
SHA-256(seed) ≠ pre_round_hash ✗  →  round was tampered with

What provably fair does NOT guarantee

  • It does not eliminate the house edge. The crash point distribution still has a built-in house advantage — provably fair proves fairness of execution, not favourability to the player.
  • It does not mean you’ll win. A provably fair game can still produce a losing session.
  • It requires checking. A casino can claim “provably fair” without implementing it correctly. Always verify that the pre-round hash is shown before the round starts — not just after.

Red flags

  • No pre-round hash displayed
  • Hash shown only after the round
  • No in-game verification tool
  • Provider cannot explain their seed derivation formula
  • Seed — the random value the crash point is derived from
  • Hash — the one-way function used to commit the seed
  • RNG — the underlying random number generation

Related terms

seedhashrngcrash point