Provably Fair

A cryptographic scheme that lets a player verify a game round's random outcome was committed before betting and not altered afterwards.

Definition

Provably fair systems use a commit-reveal design: the server generates a secret seed and publishes its hash (a commitment) before the round; the player contributes a client seed; after the round the server reveals its seed so the player can re-compute the hash and the outcome and confirm nothing was changed. This proves the result was not manipulated after bets were placed. Crucially, it verifies the integrity of the randomness, it does NOT remove or reduce the house edge. A provably fair dice or crash game can be mathematically honest about its RNG and still be designed so the operator wins on average. 'Provably fair' is a fairness-of-process guarantee, not a promise of favourable odds.

Worked example

On a crash game you see the hashed server seed before betting; after the round you paste the revealed seed and your client seed into a verifier that reproduces the exact crash point, confirming it was fixed in advance.

Why it matters

Learners commonly mistake 'provably fair' for 'you can't lose' or 'no house edge'; understanding it correctly prevents a costly misconception, while professionals should know it addresses only RNG tampering, not odds, licensing or solvency.

Related

Note: Implementations vary between operators; a verifier is only meaningful if the published algorithm and the seeds shown are genuinely the ones used, which itself requires trust unless independently audited.