MINT.JUNKIE

Provably Fair

Every rip is decided before reveal by a hash that combines a server seed, your client seed, and an incrementing nonce. We publish the server seed hash up front and the server seed on reveal. Paste the values below and reproduce the result exactly.

Run It Yourself

Paste the three values from any rip and compute the result locally. No data leaves your browser.

How it works

  1. Server generates a 32 byte random seed before you click rip.
  2. Server reveals the SHA 256 hash of that seed.
  3. You choose a client seed, or accept a random one.
  4. Server combines seed, client seed, and nonce, hashes with SHA 256, takes the first 8 hex chars as an integer modulo 10000 for the percentile.
  5. Percentile maps to floor, 1.25x, 2.5x, or ceiling.
  6. After reveal, server shows the original seed. You rerun the math here.

Percentile Map

0 to 6249Floor, 62.5 percent
6250 to 74991.25x, 12.5 percent
7500 to 87492.5x, 12.5 percent
8750 to 9999Ceiling, 12.5 percent

The exact formula

combined = SHA256(server_seed + ":" + client_seed + ":" + nonce)
percentile = parseInt(combined.slice(0, 8), 16) mod 10000

if percentile <= 6249: bucket = floor
elif percentile <= 7499: bucket = mid_low   (1.25x)
elif percentile <= 8749: bucket = mid_high  (2.5x)
else:                    bucket = ceiling