Blog · Fairness & Anti-Cheating

Cryptographic Entropy in Poker Shuffles, Explained Simply

Fairness & Verification Published September 27, 2026 · Fair Poker Research Team

When people ask whether an online poker shuffle is fair, they usually ask, "Is it random?" A better question is more precise: where did the unpredictability come from, and can anyone verify that the deck was not steered afterward?

That first part is called entropy. In plain English, entropy is fresh uncertainty. A poker system needs enough unpredictable input before it turns numbers into a deck order. Without it, even a huge deck space can become guessable.

Entropy means nobody can predict the starting point

A computer cannot create magic. It gathers unpredictable signals from the device and operating system, then uses cryptographic tools to stretch that uncertainty into usable random bytes. Browser security documentation describes the Web Crypto API as giving access to a cryptographically strong random number generator, and crypto.getRandomValues() is the normal browser interface for this kind of work: MDN Web Crypto.

That is very different from a casual function such as Math.random. A casual random function may be fine for animations, colors, or simple games, but it is not designed for security decisions. A poker shuffle is a security decision because money-like incentives, reputation, or table fairness can depend on it, even when the site uses only play chips.

For a fuller foundation, see how random a shuffle really is. The deck has an enormous number of possible orders, but the security question is not the size of the space alone. It is whether an attacker can narrow the space by guessing the seed.

Why weak entropy can still look random

A weak shuffle can pass a casual eye test. The cards may look mixed. Big hands may appear. Bad beats may happen. None of that proves the starting input was strong.

The danger is predictability. If a seed is based on a clock, a short number, a repeatable browser value, or any input an attacker can guess, the attacker may not need to search every possible deck. They can search the smaller set of likely seeds. This is why security standards discuss random bit generation, entropy sources, and deterministic random bit generators separately. NIST's SP 800-90 publications are technical, but the broad lesson is simple: secure random output depends on both a sound generator and a sound source of uncertainty: NIST random bit generation publications.

In poker terms, a shuffle that "looks random" is not enough. A fair system needs randomness that was hard to predict before the hand began.

Entropy does not replace proof

Good entropy answers one question: could someone predict the random input? It does not answer every fairness question.

A traditional poker site may use excellent randomness and still ask players to trust that the server used it honestly. A provably fair system goes further. It records commitments, reveals values later, and lets players recompute the result. That is why client seed vs server seed matters: more than one party contributes to the result, and the order of commit and reveal prevents one side from changing its input after seeing the other side's input.

Entropy is the locked door. Verification is the camera on the door. You want both: unpredictability before the shuffle, and evidence after the shuffle.

This is also why RNG vs provably fair is not just a branding difference. RNG quality is about generating hard-to-predict numbers. Provable fairness is about letting players check that the numbers were used as promised.

What players should look for

You do not need to audit source code to ask better questions. Look for clear answers to these points:

Fair Poker focuses on verifiable play-money poker, so the important promise is not "trust us, our shuffle is random." The better promise is: the shuffle process should leave enough evidence for a player or researcher to check the result independently.

Final thought

Cryptographic entropy is the raw uncertainty that makes a poker shuffle hard to predict. It is necessary, but it is not the whole story. A trustworthy online poker system combines strong entropy, careful commitments, replayable records, and honest limits about what cryptography can and cannot solve.

Curious how provable fairness is built?

Fair Poker is a non-profit open-source research project on verifiable Texas Hold’em fairness: the deck is co-encrypted and shuffled by participant browsers, there is no dealing server, and every hand can be verified independently. The project provides no gaming service to the public; the full source is published — download it and run your own instance to study it.

Download the source

This site is a non-profit open-source research project and provides no gaming service to the public; the demo is research-testing only with valueless test chips — no real-money gambling. This article is educational content, not betting advice.

← Back to all articles