Verify game fairness by checking that the revealed seed matches the hash and generates the correct crash positions locally.
Verify provably fair games using cryptographic hashing. Before each game starts, a random seed is generated and its SHA-256 hash is committed. After the game ends, the revealed seed is hashed locally to verify it matches the original commitment, proving the outcome was predetermined and not manipulated. The seed then deterministically generates each row's crash tile using cryptographic functions you can verify independently.
Comma-separated tile counts per row (e.g., 3,4,5,6)
All game outcomes are generated using these deterministic algorithms. You can verify any game by running these functions locally.
Generates the crash position for a specific row based on seed
function getDeathTileIndex(seed, rowIndex, totalTiles) {
// Create unique string for this row
const hashSource = `${seed}-row${rowIndex}`;
// Generate SHA-256 hash
const hash = crypto.createHash('sha256').update(hashSource).digest('hex');
// Convert first 8 hex characters to number
const numericHash = parseInt(hash.slice(0, 8), 16);
// Use modulo to get position 0 to totalTiles-1
return numericHash % totalTiles;
}