Hi-lo guide
Super Hi-lo: committing to cards before they are dealt
"Super" does not describe a better or bigger game; it is the label this page inherited. The page explains the commit-reveal pattern that lets a hi-lo player confirm, after the fact, that the cards were fixed before any call was made.
The problem commit-reveal solves
A card game run by a server raises an obvious doubt: could the server look at the player's call and then pick a card that beats it? Showing the card source in advance would not help, because then the player could see every future card. The answer is to publish a fingerprint of the source first and reveal the source later.
The sequence, step by step
- The service generates a random server seed and keeps it secret.
- It publishes SHA-256 of that seed. This is the commitment. SHA-256 is one-way, so the hash does not reveal the seed.
- The player sets or accepts a client seed. Because the server committed first, it cannot tailor its seed to the client seed.
- Each draw uses the message client seed : nonce, where the nonce counts draws under this seed pair: 0, 1, 2 and so on.
- When the player asks to rotate, the service reveals the old server seed and publishes a commitment to a new one. The nonce restarts at 0.
- The player hashes the revealed seed, compares it with the old commitment, and recomputes any draw from that period.
Why a tiny change gives a new commitment
A commitment is useful only if the service cannot find a second seed with the same hash. SHA-256 makes that infeasible, and it also scrambles small edits completely. The two seeds below differ in their last character.
super-rotation-a1 | b8b4a4caaa4efe60f0096d4af70ee98811a70c19aa5afbdfc5bbae84dcff8c53 |
|---|---|
super-rotation-a2 | bfc981fa509a6199e87806e44ad9f6e548666eb391982a2158374be8fc003885 |
SHA-256 computed with Python's hashlib.
The nonce and many cards per seed
One server seed can serve thousands of draws because the nonce changes the HMAC message each time. Under server seed super-rotation-a1 and client seed super-client, nonce 0 gives rank 9, nonce 1 gives rank 7, and nonce 2 gives rank 2, using floor(float x 13) + 1. A hi-lo round with several calls simply uses consecutive draws.
Why rotation matters
- Until rotation, the server seed is hidden, so no draw under it can be checked yet. Rotating is what makes the past verifiable.
- A revealed seed must never be reused; anyone could then compute its future cards.
- Changing the client seed without rotating still changes the cards, but checking them still has to wait for the reveal.
Commit-reveal proves the cards were not chosen in response to calls. It says nothing about the house edge, which lives in the pay table; see the hash fairness guide for the general pattern.