|
|
|
|
|
by zeroer
3455 days ago
|
|
Here's an example: Let's say you have a card game with N players playing off a 52-card deck. Since log_2(52!) is less than 226, then you can randomly shuffle a deck of 52 cards with, say, 512 random bits. The dealer picks a random 512-bit number, X_0, and publishes a hash of X_0 to the players. Each of the N players, picks another random 512-bit number and publishes it. These are X_1, X_2, ..., X_N. The dealer xors X_0 through X_N to get a random seed to shuffle and deal out the deck. At the end, the dealer publishes X_0 so the players can verify the dealer wasn't cheating. |
|