Provably Fair

The idea behind Provably Random is a deterministic series of related, but random hashes that are generated before any random outcomes are calculated. Once generated, these random hashes are used in a series to create a random outcome. As the creator of the hashes, it is impossible to predict what the outcomes will be – Provable Fair exists to allow the user to check if any of the outcomes were tampered with.

Provable comes into play when a client wants to verify the integrity of an outcome. After each outcome is produced, the random hash which produced it can also be made public. While one has access to the Current Hash and the Previous Hash (from the previous outcome), then a SHA256 can be used on the Current Hash to generate the Previous Hash.

This process should hold true for all Random Hashes within the series as they are exposed, you are unable to predict the next Hash, but you can verify the Previous Hash by hashing its predecessor. Any sort of deviation from this verification result would incur that the hashes were tampered with and not part of the pre-generated series.

Hence being able to “prove” the random outcomes were fair, for peace of mind and to be truly Provably Fair.

Proving Fairness

To prove fairness, we expose each hash only after they are used to generate the random outcome. We never expose our Seed Parameter until after the Current Hash has become a Previous Hash.

ELI5 / TLDR:

Provably Fair is like a drive through at a famous global Taco Chain, each Taco is made by the same worker – that worker has a list of predetermined ingredients (random hashes) that need to go into that Taco, but he isn’t aware of what’s in those ingredients, so for each step of the Taco creation process the worker assembles them by combining different ingredients (or Strings) to get the outcome, a Taco (the previous Seed) fit for a King.