Giveaways
Fairness check of the giveaway
Recalculate the result according to the published secret and the list of participants.
| Place | Participant | SHA-256(secret : number : name) |
|---|
-
1
Secret hash
First, we calculate SHA-256(secret) and compare it with the hash that was published before the draw. Different values mean that the secret was replaced.
-
2
Hash of each line
For the participant with number i, we calculate h = SHA-256(secret + ":" + i + ":" + name). The number is the position of the line in the list, starting from 1.
-
3
Sorting and winners
All h are sorted in ascending order (in case of equality — by row number). The first N participants are the winners.
h = SHA-256(secret + ":" + (index + 1) + ":" + name)
A giveaway is a tool for random selection, not a lottery. The organizer is responsible for compliance with the legislation of the Russian Federation: Federal Law No. 138-FZ "On Lotteries" (lotteries are conducted only by decision of the Government of the Russian Federation) and Federal Law No. 38-FZ "On Advertising" (promotional events). The website does not conduct lotteries, bets are not accepted, prizes are not paid. Legal information
How to verify a giveaway
The verification takes one minute and does not require trust in the organizer: you only need the secret, the list of participants in the original order, and the number of winners.
- Take the secret from the draw protocol — it is 32 hex characters next to the word 'REVEAL'.
- Insert the list of participants line by line, in the same order as in the draw.
- Enter the number of winners N and click 'Check'.
- Compare the hash of the secret with the published commit, and the list of winners with the announced one.
What does hash mean
A hash is a fixed-length fingerprint of data. The same string always gives the same SHA-256, and changing even a single character completely changes the result. Therefore, the organizer cannot 'rewrite' the secret: a new secret will give a different hash.
Commit is published before the draw and binds the organizer with a promise, reveal reveals the secret afterwards. If the SHA-256 of the revealed secret matches the published hash, the obligation is fulfilled.
Is it possible to forge the result
It is impossible to substitute winners without changing the result: any change of a name or the order of lines changes all the hashes. Finding another secret with the same SHA-256 is computationally impossible — this is a property of a cryptographic hash function, not a promise of the website.
The only thing that needs to be checked separately is that the hash was indeed published until start. To do this, save the link to the publication: a channel post, a screenshot, or an archived copy. Without this evidence, the scheme remains an honest word.
Why the order of participants is important
The row number is included in the formula, so the same person in different positions gets different hashes. When checking, the list must be inserted in the same order and with the same composition: otherwise, the result will consistently not match — this is not an error, but a different condition of the task.