Game：Crash Fairness
Is The Game Fair?
We are a fair and impartial prediction and guessing platform. Our goal is to eliminate all unfair factors and make players feel comfortable and have fun.
We have generated a total of 10 million hashes (the generation chain is verifiable), and each hash corresponds to a Crash multiplier.
We release these 10 million numbers in reverse order, each corresponding to one turn of the game (i.e. we have 10 million turns in total).
In other words, the crash number of each turn already exists and is not calculated after the game starts. Players can therefore place their bet without concern.
Will The Game Be Manipulated By The Platform? GitHub Verify
The integrity check value is key to verifying whether there is any official manipulation; The test algorithm is provided as follows.
Example: 6b5124897c3c48d0e46cc9249f08c7e560792459f1bad1171224643b5d2be231
Take a random value in the 2^52 range, namely 16^13, i.e. a 13-bit hexadecimal number (because the hash value is hexadecimal, 2^52 === 16^13)6b5124897c3c4 (0x6b5124897c3c4 equals 1887939992208324 in the decimal system).
Distribute the random value to 0~1, by dividing it by the maximum value of 13 fs, namely 0x6b5124897c3c4/0x10000000000000. Given the discrete random nature of the hash value, we then can think that any hash value can be transformed into a random number of 0~1, 1887939992208324/4503599627370496 = 0.419206889692064.
Make the house edge 1%. Further to calculate 99/(1-X), where X is the random value calculated at Step 2. When X is 0, the result is 99; when X is 1, the result is positive infinite; when X is 0.01, the result is 100; when X is less than 0.01, the result is less than 100.
Conclusion: The overall random number distribution is 99 to positive infinite; and when the random number distribution is 0~0.01, the result is less than 100.
99/(1-0.419206889692064) = 170.45656748150867
All values less than 100 will be set to 100. In other words, there is a probability of 1% that 100 will appear. Round off the number and divide it by 100 to get the final result.
170/100 = 1.70
Conclusion: The hash value used in the game is inverse ordered. Therefore, with the SHA256 algorithm, a previous hash used in the game can be calculated from its subsequent hash. Since there is one-to-one correspondence between the key and the value of hash, we can draw the conclusion that if a hash can be used to calculate the hash that precedes it, then this hash should have been already generated when the preceding prize is announced. Similarly, the entire hash chain is generated at the very beginning and cannot be changed once generated. Otherwise, it cannot pass verification by SHA256, and as far as the payout is concerned, this is nothing more than a probability game in which crash is a given. The official organizer cannot manipulate any game set. Therefore, CRASH is more transparent than other gambling methods. This is the cornerstone on which our game is built.
Simple calculation:
When the 13-bit hash value is 8000000000000 = 1.98, 0xb000000000 = 3.168, 0xc000000000 = 3.96, that is, the first digit is greater than 8((16-8)/16≈0.5), the result is approximately 2x; when the first digit is greater than b((16-11)/16≈0.3), the result is approximately 3x; and when the first digit is greater than c((16-12)/16≈0.25), the result is approximately 4x, and the same rule applies to the rest.
When the 13-bit hash value is f000000000000 = 15.84, ff00000000000 = 253.44, fff000000
Game：Ultimate Dice Fairness
How are results calculated?
To get the results.
First we calculate the hash value of the combination with HMAC_SHA256. This gives us a 64-character hexadecimal string: hash = HMAC_SHA256 (clientSeed:nonce, serverSeed).
Finally, we take 8 characters of the hash and convert it to an int32 value. Then we divide the converted value by 0x100000000, multiply it by 10000 so that the resulting number conforms to the constraints of the dice range.
Note: A new seed must be set to verify the previous data (the server seed is encrypted).
Did you really need to know this? Probably not. It’s there for those who expect transparency and precision in a provably fair game of chance.
We put our "cards on the table."
Good luck!
Game：Twist Fairness
Fairness Verification
Q: How is the game result generated?
A random number between 0 and 99,999 is generated using a provably fair algorithm. That process is described below.
The random number (between 0 and 99,999) is then matched to the probability table and the corresponding symbol from the table is the game result.
Q: How is the random number generated?
First, combine the server seed, client seed and the nonce to get the SHA512 hash.
We use the combination to compute the HMAC_SHA512 hash. This gives us a 128-character hex string: hash = HMAC_SHA512 (clientSeed:nonce, serverSeed)
Then we take the first 5 characters of the 128 character hex string and convert them to a decimal number from 0 to 1,048,575 (16 ^ 5-1). If it is less than 1 million, it is used as the random number. If it is more than 1 million, we use the next five characters from the same 128 character hex string. We are able to repeat the process up to 25 times.
In very rare cases ((48,576 / 1,000,000) ^ 25) When converting to decimal, none of the 25 trials are below 1 million, we use the remaining 3 characters and convert them to your random number
Code example:
The following code example can be used to verify bets:
function get (serverSeed, clientSeed, nonce) { var hash = hmac_sha512(this.client_seed + ":" +this.nonce, this.server_seed); var index = 0; do { var lucky = parseInt (hash.substr (index, 5), 16); index + = 5; } while (lucky> = 1000000); return lucky; }
How to use the probability table ?
Layer = How high you climbed each of the three columns and the effect it has on the probability range of each symbol.
Example: You currently have 2 layers of Green gems, 1 layer of Purple gems, and 3 layers of Red gems. This means that the layer for reference on the next spin is layer 213. The random number you obtained from the SHA512 hash, converted to decimal, as described above, is 503140. The corresponding layer in your table is Layer 213. The range is Dark gem [200800 + 122711 + 92033, 200800 + 122711 + 92033 +146113)
Action Spin:
If the top circle reaches the top level, the first 10 characters of the HMAC_SHA512 hash value are converted into decimal numbers and modulo 5 to get a random number of [0,4], which corresponds to 100-500 times the prize in turn.
Code example:
function get (serverSeed, clientSeed, nonce) { var hash = hmac_sha512(this.client_seed + ":" +this.nonce, this.server_seed); var lucky = parseInt (hash.substr (0, 10), 16); return lucky%5; }
Game：Cave Fairness
Fairness Verification
Q: How is the game result generated?
A random number between 0 and 99,999 is generated using a provably fair algorithm. That process is described below.
The random number (between 0 and 99,999) is then matched to the probability table and the corresponding symbol from the table is the game result.
Q: How is the random number generated?
First, combine the server seed, client seed and the nonce to get the SHA512 hash.
We use the combination to compute the HMAC_SHA512 hash. This gives us a 128-character hex string: hash = HMAC_SHA512 (clientSeed:nonce, serverSeed)
Then we take the first 5 characters of the 128 character hex string and convert them to a decimal number from 0 to 1,048,575 (16 ^ 5-1). If it is less than 1 million, it is used as the random number. If it is more than 1 million, we use the next five characters from the same 128 character hex string. We are able to repeat the process up to 25 times.
In very rare cases ((48,576 / 1,000,000) ^ 25) When converting to decimal, none of the 25 trials are below 1 million, we use the remaining 3 characters and convert them to your random number
Code example:
The following code example can be used to verify bets:
function get (serverSeed, clientSeed, nonce) { var hash = hmac_sha512(this.client_seed + ":" +this.nonce, this.server_seed); var index = 0; do { var lucky = parseInt (hash.substr (index, 5), 16); index + = 5; } while (lucky> = 1000000); return lucky; }
How to use the probability table ?
Layer = How high you climbed each of the three columns and the effect it has on the probability range of each symbol.
Left = Book symbol
Middle = Cross symbol
Right = Gem symbol
Ghost = Skull symbol
Blank = No symbol
Example: You currently have 2 layers of books, 1 layer of crosses, and 3 layers of gems. This means that the layer for reference on the next spin is layer 213. The random number you obtained from the SHA512 hash, converted to decimal, as described above, is 503140. The corresponding layer in your table is Layer 213. The range is Ghost [200800 + 122711 + 92033, 200800 + 122711 + 92033 +146113)
Action Spin:
If the middle tower reaches the top level, the first 10 characters of the HMAC_SHA512 hash value are converted into decimal numbers and modulo 5 to get a random number of [0,4], which corresponds to 100-500 times the prize in turn.
Code example:
function get (serverSeed, clientSeed, nonce) { var hash = hmac_sha512(this.client_seed + ":" +this.nonce, this.server_seed); var lucky = parseInt (hash.substr (0, 10), 16); return lucky%5; }