Skip to content

Game Math

Provably Fair

SlotCodex Editorial · Updated · Figures live from the SlotCodex database

Provably fair is a cryptographic scheme, used mainly by crypto casinos and crash games, that lets players verify game outcomes weren't manipulated. The casino commits to a hashed server seed before betting; combined with a player-controlled client seed and nonce, every result can be recomputed and audited afterwards.

Key Takeaways

  • Provably fair replaces "trust the auditor" with "verify it yourself": a cryptographic commit-reveal scheme makes retroactive manipulation of results detectable by any player.
  • The core trick is the commitment: the casino publishes a hash of its secret seed before you bet, and can't change the seed later without the hash mismatch exposing it.
  • Player input matters: a client seed you can edit guarantees the operator could not precompute outcomes tailored to you.
  • Provably fair proves integrity, not generosity — the house edge is unchanged, and the certified RTP math is a separate question entirely.
  • It's the de-facto standard in crypto casinos and crash/instant games (dice, Mines, Plinko, Aviator-style crash), and largely absent from traditional certified slots.

How Provably Fair Works

The construction rests on three values:

ComponentControlled byRole
Server seedCasinoSecret entropy; only its hash is shown up front
Client seedPlayer (editable)Prevents precomputed, player-targeted outcomes
NonceBoth (a counter)Increments per bet so each round differs

The protocol is a classic commit-reveal:

  1. Commit. The casino generates a random server seed and shows you its SHA-256 hash. A cryptographic hash is one-way and collision-resistant: the casino is now locked to that seed but you can't derive it.
  2. Personalize. You set (or accept) a client seed. Because the casino can't predict your seed choice, it can't have selected a server seed that produces favorable-to-house results for you specifically.
  3. Play. Each bet's outcome is computed deterministically, typically as HMAC-SHA256(serverSeed, clientSeed + ":" + nonce). Bytes of the digest are mapped to the game's outcome space — a dice roll, a card, a crash multiplier. The nonce increments with every bet.
  4. Reveal. When you rotate seeds (or on a schedule), the casino discloses the retired server seed. You hash it and compare with the original commitment, then recompute any or all past outcomes.

If a single recomputed result differs from what you were shown, you hold cryptographic proof of manipulation — publishable and independently checkable. That threat, rather than each player actually verifying every roll, is what enforces honesty.

Worked example (dice-style game)

Say the digest of HMAC-SHA256(serverSeed, "myseed:17") begins with bytes 3F 8A 92 C1. Take the first 4 bytes as a 32-bit integer (1,065,780,929), divide by 2³² to get a uniform number in [0,1) → 0.24814…, multiply by 100 → a roll of 24.81. Every step is public arithmetic: given the revealed seed, your seed and nonce 17, any script reproduces exactly 24.81. Nothing about the roll depended on secret server-side state at bet time.

Crash games: the flavor most people meet first

Crash titles (Aviator being the best-known archetype) adapt the same scheme to a shared round: the round's multiplier is derived from a pre-committed seed — in several implementations mixed with seeds contributed by participating players — and revealed after the plane flies away. Verification confirms the crash point was fixed before anyone bet, and the in-game "fairness" panel typically automates the check. Note what this does not say: the distribution of multipliers is still designed with a built-in margin for the house.

Provably Fair vs Certified RNG

Provably fairLab-certified RNG (e.g. GLI-19-style)
Who verifiesAny player, per outcomeAccredited lab, per build
What is verifiedOutcome integrity vs pre-commitmentRNG statistical quality + math model / RTP
Trust assumptionCryptography + your own checkThe lab, the regulator, deployment controls
Covers payout fairness (RTP)?NoYes
Typical habitatCrypto casinos, crash/instant gamesRegulated slots and casino platforms

The two are complements, not competitors. Provably fair without a certified math model proves you honestly received outcomes from a distribution you can't see. Certification without provably fair asks you to trust that the audited build is the one actually running. Mature crypto-native operators increasingly ship both; that combination is strictly stronger than either alone.

For Players

  • Actually change your client seed once. The scheme's per-player guarantee assumes the operator couldn't predict your seed; setting your own (any string) completes your side of the protocol.
  • Verify at least once per seed rotation. Most sites have a built-in verifier; independent open-source verifiers exist for popular games. One successful spot-check of a revealed seed validates the whole batch of rounds under it.
  • Red flags: no way to edit the client seed, server seed never revealed, hash shown after betting starts, or verifier tools that only run on the casino's own page with no documented algorithm.
  • Don't confuse fairness with value. A provably fair game with a 4% margin is exactly as costly as an opaque one — check the published RTP/edge and treat "provably fair" as a statement about honesty, not price. There is no strategy to "win provably fair" games; the phrase describes verification, not an exploit.
  • Solvency is out of scope. The cryptography says nothing about whether the site will actually pay withdrawals; licensing and reputation still matter.

For the Industry

  • Implementation discipline is the product. Publish the exact derivation algorithm, keep commitments immutable, rotate and reveal seeds predictably, and provide an offline-reproducible verifier. A provably fair badge with an unverifiable pipeline is worse than none — it converts a marketing asset into a documented liability.
  • Mixing player entropy (client seeds, multi-player contributions in crash rounds) is what elevates the scheme from "we pre-committed" to "we could not have targeted anyone"; single-sided commitments are the weakest acceptable form.
  • Regulatory posture varies. Most established regulators still require conventional RNG certification regardless of provably fair mechanics; treat the scheme as additive transparency, not a substitute for GLI-style testing where licensing demands it.
  • Catalog signal. For aggregators and databases, provably fair is a per-game capability flag largely correlated with the crash/instant vertical — worth modeling explicitly, as player demand for verifiable games is a measurable and growing segment.

Frequently Asked Questions

What is provably fair?

Provably fair is a system where game results are generated from a server seed (committed in advance as a hash), a client seed the player can change, and a bet counter. After the server seed is revealed, anyone can recompute past results and confirm the operator could not have altered outcomes mid-game.

How do provably fair crypto casino games work?

Before you bet, the casino shows you the SHA-256 hash of its secret server seed — a commitment it cannot change undetected. Each result is derived by an HMAC of the server seed, your client seed and an incrementing nonce. When the seed rotates, the old one is revealed so you can verify every round against the original hash.

How does provably fair work in Aviator and other crash games?

Crash games like Aviator publish a hash of the round's seed before the round starts; the crash multiplier is deterministically derived from that seed (often combined with seeds from players in the round). After the round, the seed is revealed, and anyone can recompute the multiplier and match it to the pre-committed hash.

Can you win using provably fair — does it improve the odds?

No. Provably fair verifies integrity, not generosity. The games remain negative-expectation: the house edge is coded into the payout rules exactly as in any casino game. Verification proves the operator didn't cheat on individual outcomes; it does not change RTP and offers no winning strategy.

How are provably fair random numbers generated?

Typically an HMAC-SHA256 (or similar keyed hash) of serverSeed, clientSeed and nonce produces a digest; a slice of the digest's bytes is converted into a number in the required range (dice roll, card index, crash multiplier). The construction is deterministic, so anyone with the inputs can reproduce the output.

Is provably fair better than a certified RNG?

They answer different questions. A lab-certified RNG (GLI-19-style testing) relies on trusting the auditor and the deployed build; provably fair lets each player verify each outcome directly but says nothing about payout fairness or operator solvency. Mature crypto casinos increasingly offer both.

Related Terms

Sources

  1. Stake documents the standard commit-reveal scheme: server seed hashed with SHA-256 and shown before betting, a player-changeable client seed, a nonce incrementing per bet, and reveal of the server seed on rotation for verification Stake (Help Center) (accessed 2026-07-20)
  2. BGaming's provably fair algorithm: round outcome plus a secret are hashed with SHA-256 and shown before the bet; the player supplies a client seed; after the round the inputs are revealed for verification BGaming (accessed 2026-07-20)
  3. HMAC (keyed-hash message authentication, e.g. HMAC-SHA256) is a standardized cryptographic construction — the primitive used for provably-fair outcome derivation IETF (RFC 2104) (accessed 2026-07-20)
  4. SHA-2 family hash algorithms (including SHA-256) are specified in NIST's Secure Hash Standard, establishing the one-way digest properties the commitment scheme relies on NIST (FIPS 180-4) (accessed 2026-07-20)

Sources & review status

Written and maintained by SlotCodex Editorial with AI assistance under the editorial process. Game figures are computed live from the SlotCodex catalog database; rules, math and regulatory facts are checked against public primary sources (see the Sources list above). Read how we source and review content.