4 ms·
The example is a coin flip but it could be any random based game by using a different algorithm than "number mod 2". You're correct that it can't act on real wo
by tylersmith 8y ago
The example is a coin flip but it could be any random based game by using a different algorithm than "number mod 2". You're correct that it can't act on real world data.
- nwah1 8y agoCould this be modified to support, say, a chess game?
- tylersmith 8y agoChess doesn't have any random element so it wouldn't need this kind of system. You could implement card games and board games that do have randomness like candyland. You could implement chess with only movement commitments and no atomic fair random number generation.
- detaro 8y agoSome aspects of it would be interesting for non-random games too, e.g. the payout if one player stops submitting moves, verifying who won, ..
- Retric 8y agoMore specifically xor 2 initially hidden integers and mod X + 1 gives you a random number from 1 to X. PS: Adding numbers mod X will provide a fair random number as long as at least one side provides a fair random number to start with. Which is a stronger guarantee if your making a real money wager.
- fyi1183 8y ago... with a bias if X is not a power of 2.
- deleted 8y ago[deleted]
- Retric 8y agoDepends on the maximum range provided. If both part's pick a X bit number then you need a power of 2. If they pick a number 1 to X then can use X.
- fyi1183 8y agoYou're right of course. Just remember to use addition mod X instead of xor in that case to combine the choices.