Provably fair: what it means in Mines and what it proves
What provably fair means: server seed hashes, client seeds and nonces, how to check a Mines round with SHA-256, and what the check proves and doesn’t prove.
この記事の内容 6セクション
Many online Mines games carry a “provably fair” label. It sounds like a guarantee that the game is fair. It’s something narrower and more technical: a way to check, after the fact, that the mine layout for a round was decided before you started clicking and wasn’t changed in response to your picks.
That’s a real and useful property. But it says nothing about how much the game pays, and that is where the house edge lives. This guide explains how the check works, step by step, and where it stops.
What does provably fair mean?
Provably fair means the game commits to its random result in advance, by publishing a cryptographic hash of a secret seed, and reveals the seed afterwards so you can recompute the result yourself and confirm it matches what you were shown.
In cryptography this is called a commitment scheme. Stanford’s CS 355 lecture notes on commitment schemes3 describe one as “the digital analog of a locked opaque box”: you can hand someone the locked box now and the key later. The box has two properties. It is hiding, because nobody can see inside before the key arrives, and binding, because once it’s handed over, the only thing that can come out of it is what was put in.
The same notes use a classic example: two people who want to flip a coin fairly over a chat app, where neither trusts the other to report the result honestly. A commitment lets one of them lock in a choice before seeing the other’s. Provably fair games use exactly that idea.
How does a provably fair Mines round work?
The game picks a secret server seed and shows you its SHA-256 hash. You supply (or accept) a client seed. Each round adds a counter called a nonce. The three together determine where the mines go. Later the server seed is revealed so you can check every round played with it.
- Commit. The game generates a long random server seed and publishes its hash. You can see the hash but not the seed.
- Add your input. You set a fresh, unpredictable client seed (a new random string, never one you used before). Because it is new and chosen after the server has committed, the server can’t have picked its seed to suit yours.
- Play. For each round, the server seed, client seed and nonce (0, 1, 2…) are combined to produce random numbers, which decide which of the 25 tiles hold mines. One way to do this is with a keyed hash such as HMAC, which NIST defines in FIPS 198-12 as a way to combine an approved hash function with a secret key. The exact recipe varies by game and should be published.
- Reveal. Typically, when you rotate to a new seed pair, the old server seed is shown in full.
- Verify. Hash the revealed seed with SHA-256 and confirm it matches the hash you were shown at the start. Then rerun the published recipe with the seed, your client seed and each nonce, and confirm the mine positions match the rounds you played.
Why can’t the game change the seed after you play?
Because it would need a different seed with the same SHA-256 hash, and SHA-256 is designed to make finding one computationally infeasible. If the revealed seed hashes to the value shown at the start, it’s the seed the game committed to.
SHA-256 is one of the hash algorithms in NIST’s Secure Hash Standard, FIPS 180-41. The standard calls these algorithms secure because “it is computationally infeasible 1) to find a message that corresponds to a given message digest, or 2) to find two different messages that produce the same message digest”. The first property is what keeps the seed hidden until it’s revealed; the second is what stops the game swapping it.
Hiding also depends on the seed being long and random. MIT’s 6.857 notes on applications of cryptography4 give the standard hash commitment as c = hash(x ‖ r), with r a random nonce: if the secret were short or guessable, you could simply try candidates until one matched the hash.
What does provably fair prove?
It proves that a round’s mine layout was fixed before you made your first pick and wasn’t altered based on the tiles you chose, as long as you check the hash and recompute the layout yourself.
That rules out a specific kind of cheating: a game that moves a mine under the tile you just clicked, or that quietly makes the board harder when you’re ahead. If the recomputed layout matches what you saw, the round played out from a layout chosen in advance.
What doesn’t provably fair prove?
It doesn’t prove the house edge is small, or anything about the return to player. Those are set by the payout multipliers, not by where the mines go, and a perfectly random layout can still come with payouts below the true odds.
What it shows
- The mines were placed before your first click
- The layout wasn’t changed in response to your picks
- The game used the seed it committed to
- Each round followed the published recipe
What it doesn’t show
- How big the house edge is
- The game’s return to player
- That the payout table is fair
- Anything at all, if nobody actually runs the check
The edge is in plain sight in the payout table. With 3 mines, the first tile is safe 22 times in 25, so a fair multiplier would be about 1.14×; a game paying less than that keeps the difference, however fairly the mines are placed. Our Mines odds guide shows how to work out a game’s edge from its own multipliers. UK rules treat this as separate information: the Gambling Commission requires games to tell players how likely they are to win5, for example as a return to player or a house edge.
How do you check a provably fair result yourself?
Rotate your seed so the old server seed is revealed, hash it with any independent SHA-256 tool, compare it with the hash you were shown before playing, then rerun the game’s published recipe and compare the mine layout.
- Write down the hash before you play. A commitment only helps if you know what was committed to. A screenshot is enough.
- Change the client seed. Set a fresh random one after each new server commitment, so the result depends on something the game couldn’t know or predict when it committed.
- Use independent code. A verifier hosted by the same game is convenient but checks itself. Any standard SHA-256 implementation will do for the hash step.
- Check a few rounds, not just one. Verification covers each round you recompute.
If the hashes don’t match, or the recipe isn’t published, the label means nothing. If they do match, you’ve confirmed the mines weren’t moved. You haven’t confirmed the game is a good deal, because by design it isn’t. New to the game? Start with how to play Mines.
出典
- NIST FIPS 180-4: Secure Hash Standard (SHS) (August 2015) csrc.nist.gov
- NIST FIPS 198-1: The Keyed-Hash Message Authentication Code (HMAC) (July 2008) csrc.nist.gov
- Stanford CS 355, Topics in Cryptography: Lecture 3, commitment schemes and coin flipping (April 2023) crypto.stanford.edu
- MIT 6.857 class notes: Applications of crypto math (March 2015) people.csail.mit.edu
- UK Gambling Commission: RTS 3, rules, game descriptions and the likelihood of winning gamblingcommission.gov.uk
Facts last checked November 2026. Spotted something out of date? Tell us at editor@mines.now.