Our commitment scheme makes manipulation impossible. The seed is calculated from publicly verifiable sources — no one can predict or influence the result.
SHA-256 hash is calculated and stored
participantHash = SHA256(participants[])Next random number from the decentralized beacon
drandRound = currentRound + 2Combination of all public inputs
seed = SHA256(hash | round | randomness)Fisher-Yates shuffle with seeded PRNG
result = shuffle(participants, seed)Whether one-time lottery or recurring rotation — the same verifiable random algorithm guarantees fairness.
“I don't want to argue anymore about whose turn it is.”
“Something I can sell to the works council as fair.”
“My followers should see that it's fair.”
Participant list is hashed before randomness is generated.