ProvablyHero
18+

Dice verification

Duelbits Dice reference verifier

Calculate the published algorithm with disclosed inputs.

Reference

Reference implementation of the published algorithm. We have not yet obtained a revealed server seed for a captured round, so recorded rounds have not been cryptographically replayed.

Enter the full hash saved before play. A hash copied afterwards does not establish earlier timing. Why timing matters

All calculations run in your browser. Seeds are not submitted, placed in the URL or included in replay analytics. This is not a payout, cashback or currency-settlement check.

How the published Dice algorithm works

Duelbits hashes the UTF-8 text serverSeed:clientSeed:nonce with SHA-256. The first eight hex digits become an unsigned 32-bit integer; modulo 10,000 and division by 100 produce a result from 0.00 to 99.99. The saved commitment is SHA-256 of the server seed text.

Reference evidence and limits

Our implementation follows Duelbits’ published fairness code and is tested against an independent SHA-256 calculation. We have not yet obtained a revealed server seed for a captured round, so this is Reference evidence.

Thirteen zero-stake Dice rounds cover Under, Over and interval modes. Announced multipliers at 20%, 40%, 50% and 80% match 100 / (win chance in percent × 1.01), implying about 99.01% nominal RTP before rakeback. This checks announced values, not the generated results or final settlement.

During our check, Duelbits’ seed history did not load, so no demo server seed could be revealed and matched. That is a gap in our evidence, not evidence of manipulation. The status stays Reference until disclosed rounds replay.

For Plinko, see the Duelbits Plinko verifier.

Availability depends on your region.

FAQ

Why is this Reference rather than Verified?

The published algorithm is implemented and tested, but our captures do not contain revealed server seeds needed to replay recorded rounds. A successful synthetic example does not supply that evidence.

Can the saved server hash reveal the original seed?

No. The operator must disclose the previous seed. A hash alone does not allow a result to be reconstructed.