Hash-Based Fairness Verification

The cryptographic hashing technique behind provably fair games that lets players confirm an outcome was fixed before betting and not altered.

Definition

This is the mechanism underlying provably fair systems. Before a round, the operator computes a cryptographic hash of a secret seed and publishes the hash as a tamper-evident commitment; because hash functions are one-way, the hash reveals nothing about the seed but locks it in. After the round, the operator reveals the seed; the player re-hashes it to confirm it matches the earlier commitment and re-derives the outcome, usually combined with a player-supplied client seed. It proves the result was not changed after bets were placed. It does not verify that the odds are fair or reduce the house edge, and it only matters if the disclosed algorithm and seeds are genuinely the ones used.

Worked example

You record the pre-round hash, and after the round you hash the revealed seed yourself; a match proves the outcome was predetermined and untampered, though the game can still be built to favour the house.

Why it matters

Gives learners the concrete cryptography behind 'provably fair' and its precise limits; professionals use it to assess integrity claims accurately.

Related

Note: Verification only guarantees integrity if the algorithm and seed handling are honest and, ideally, independently audited; it cannot by itself confirm the RNG is unbiased or the odds fair.