Provably Fair System

HMAC-SHA256 · WEB CRYPTO API · LIVE VERIFICATION · MAX CAP 10,000×

LIVE

MAX WIN CAP: 10,000×

All crash points capped at 10,000× to protect operator solvency. Enforced in the HMAC derivation formula.

SERVER SEED (HIDDEN UNTIL ROUND ENDS)

SHA-256 COMMITMENT (PUBLIC):

34d176cdfe5773797fc592e434eb1b7e3e390f0aa602b8d38dc168f0540cd674

CLIENT SEED

NONCE:

CRASH MULTIPLIER

5.82x

max(1.00, min(10,000, ⌊0.945 / r⌋)) where r = HMAC-SHA256(server, client:nonce)

FULL HMAC COMPUTATION

// Step 1: Seed Commitment (published BEFORE round)
commitment = SHA-256("demo_server_seed_2026")
         = 34d176cdfe5773797fc592e434eb1b7e3e390f0aa602b8d38dc168f0540cd674

// Step 2: HMAC-SHA256 (computed when round starts)
hash = HMAC-SHA256("demo_server_seed_2026", "survivor_demo_2026:1")
     = 29893032ed4917af57981d87a412894f9962ac3a9d025f10deeed14a1cc42b6d

// Step 3: Derive crash point
r = parseInt(hash[0..12], 16) / 2^52
  = 730707134436497 / 4503599627370496
  = 0.162249576982

crashPoint = max(1.00, min(10,000, ⌊(0.945 / r) × 100⌋ / 100))
           = 5.82x

Enter a round ID to independently verify its crash point was pre-determined and fair using HMAC-SHA256.

HOW PROVABLY FAIR WORKS

1. Before round: Server generates a random 256-bit seed via CSPRNG. Its SHA-256 hash (commitment) is published to all players. Player provides their own client seed.

2. During round: Crash point = f(HMAC-SHA256(serverSeed, clientSeed:nonce)). Neither party can influence the outcome alone. Max multiplier capped at 10,000×.

3. After round: Server reveals the actual server seed. Player independently recomputes HMAC-SHA256 and verifies the commitment hash matches.

4. Result: If the SHA-256(revealedSeed) matches the pre-published commitment, the round is cryptographically proven fair. No tampering is possible.

CRYPTOGRAPHIC STACK

SHA-256

Hash

HMAC-SHA256

HMAC

Web Crypto

API

10,000×

Max Cap