The purpose of this post is to show that our Crash game chain was chosen in a provably fair way.
A single crash point is generated by combining two different sha256 hashes (Server seed hash and client seed) together and turning the resulting piece of data (a single sha256) into a number.
However, in order to be considered provably fair, we have to pick those two pieces of data (sha256 hashes) in a very specific way. The datas have to be chosen in a way such that neither the house nor the player can predict the resulting crash point. That process takes place like so:
ServerSeed — Here we prove that we have calculated and committed to using a given game/hash chain before the client seed is known. We have generated a chain of 1,000,001 sha256 hashes, starting with a server secret that has been repeatedly fed the output of sha256 back into itself 1,000,001 times. With that, the final sha256 in the chain is: 0ce1fb975fec62bf55779e7ea6021bddea581ce1e350f61c174753dfa4b29aa8
ClientSeed — In order to prove that we have not intentionally selected a secret above that would generate favorable crash points for the house, the hashes from the game chain will be salted with a ClientSeed that we have no control of. The client seed will be the blockhash for EOS block #34415800.
Proof of existence — In order to prove that this message was written before EOS block #34415800 was created, we have embedded the ServerSeed and ClientSeed information as memo into the EOS blockchain #34132493 which is prior to block #34415800.
To play the game : https://trustdice.win/
To join our telegram group : https://t.me/trust_dice
To subscribe to our news channel : https://t.me/trustdicenews
