Coin Battles
Dice
Wheel
Roulette
Coin Flip
Ladder
Turtle Race
Baccarat
Bitto
Races

HashChain

Peergame uses a secret key with SHA-256 to generate a chain of 1,000,000 hashes.

Each round seed’s hash equals the previous round seed.

For example, 1,000,000th seed is the first round of the game.

Randomness

First, hash the combination of the current round seed and all participated transaction IDs in the previous round to create a random number.

Random number = hash (current round’s seed + previous round’s TxIDs)

Shuffling cards

The random number goes through the Fisher-Yates Shuffle algorithm to shuffle and randomly generate card orders also pick with equal probability.

What is Fisher-Yates Shuffle?

Card Order = hash (current round’s seed + previous round’s TxIDs) + shuffle algorithm

Game Result

Example

After we shuffle and generate a card order for 6 decks of cards. We select the first 6 cards with a random order for the game result. Please see the image below.

Generated Card Order

Player

Banker

Player

Banker

Player

Banker

or

Game Result

Player

Player

Player

Banker

Banker

Player Wins

GamesRacesPromotions
Peergame PartnersBlogFairnessHelp CenterContact