Most "provably fair" games today rely on a commit-reveal model that has a subtle flaw: the server chooses its seed hash privately. This allows for a "Seed Grinding" attack where the house pre-computes millions of outcomes and commits only to the seed that favors them.
I wrote this post to explain how to close that gap using public entropy beacons (Drand). By tying the outcome to a future Drand round that neither the player nor the server knows at the time of commitment, you get a trustless result without needing a slow blockchain.
The logic is simple: Hash(Player_Seed : Server_Seed : Future_Drand_Sig).
I’ve written a deep dive on why traditional commitment schemes have a "last-mover advantage" and how this triple-mix eliminates it. Would love to hear the community's thoughts on the trade-off between the 10s settlement delay and the added security.
2 comments
[ 26.5 ms ] story [ 597 ms ] threadI wrote this post to explain how to close that gap using public entropy beacons (Drand). By tying the outcome to a future Drand round that neither the player nor the server knows at the time of commitment, you get a trustless result without needing a slow blockchain.
Live Demo (Dice Roll): https://blockrand.net/live.html
The logic is simple: Hash(Player_Seed : Server_Seed : Future_Drand_Sig).
I’ve written a deep dive on why traditional commitment schemes have a "last-mover advantage" and how this triple-mix eliminates it. Would love to hear the community's thoughts on the trade-off between the 10s settlement delay and the added security.