What “Provably Fair” Means
Provably fair uses cryptographic commitments (hashes) and deterministic generation so that the outcome can be verified after the round—without trusting a “black box”.
- The server commits to a seed by publishing its hash.
- Client seed + nonce are combined with the server seed to produce a deterministic roll.
- The roll is mapped to an outcome using a published drop table.
Status: the model is in place, and the verification UI/checker will be enabled during rollout.