SEEDS FOR YOUR NEXT ROLL

<span class="bold">PREVIOUS ROLL DETAILS
<span id="no_previous_rolls_msg">You haven't rolled yet since

reloading the page. Your roll history for the last 10 days is available below.

CLICK HERE TO VERIFY YOUR ROLLS

This game is provably fair. What that means is that there is no way the site can cheat you by picking a number that is in our favour.

The way this works is that each roll is calculated using 3 parameters - the server seed, client seed and nonce. Out of these, we show you the client seed and nonce that will be used for your next roll along with a SHA256 hash of the server seed. You can also change the client seed if you wish. The server seed is the only part that is kept a secret until after the roll.

Then after you roll, under the section titled PREVIOUS ROLL DETAILS, we show you the server seed that was used and you can verify that this was the same server seed that we said we were going to use before the roll by checking if the SHA256 hash of this seed matches the SHA256 hash that we showed you before the roll.To know exactly how we calculate the rolls, read the section below titled How are rolls calculated?

After you roll, you can also click the link above named CLICK HERE TO VERIFY YOUR ROLLS to verify your roll using our javascript based roll verifier which uses the same seeds to re-calculate the roll right in your browser without any external communication.

How are rolls calculated?

1. Two strings are created :
   STRING1 = "[NONCE]: [SERVER SEED]:[NONCE]"
   STRING2 = "[NONCE]:[CLIENT SEED]:[NONCE]"<span id="previous_roll_strings" style="display:none;">
   For your last roll :
   STRING1 = "<span class="previous_nonce">[NONCE]:<span class="previous_server_seed">[SERVER SEED]:<span class="previous_nonce">[NONCE]"
   STRING2 = "<span class="previous_nonce">[NONCE]:<span class="previous_client_seed">[CLIENT SEED]:<span class="previous_nonce">[NONCE]"
2. Then HMACSHA512 is used to hash STRING1 with STRING2 as the secret key, giving us a 128 character hex string.
3. The first 8 characters of the hex string are taken and converted to a decimal.
4. This decimal is then divided by 429496.7295 and rounded off to the nearest whole number.
5. This whole number is used as your roll, with the maximum possible value being 10,000.

• AUTO
• SLOW
• INSTANT

1. At the beginning of each round, we generate a server seed for that round and show you the SHA256 hash of this seed.
2. When a lottery round has concluded, we make a list of all user id's and their lottery tickets and sort it in ascending order of the user id's.
3. We then use this list to assign ticket numbers for all tickets. For example if user id 1 has 10 tickets and user id 2 has 20 tickets, then user id 1 will have ticket numbers 0 to 9 and user id 2 will have ticket numbers from 10 to 29. This is done for all users.
4. Then the list containing the user id's, tickets held by each user and their ticket numbers is published in a text file. This file also contains the total number of tickets issued in the round and the server seed for that round.
5. A MD5 hash of this text file is calculated.
6. Then the current bitcoin block number is recorded and a block number that is 12 blocks into the future is decided on. The block hash of this future block is used as a "client seed" ie. a seed that we are not aware of when the list in step 4 has been published.
7. Then a tweet is made via our twitter account (https://twitter.com/freebitco) containing the link to the file generated in step 4, the MD5 hash of the file and the future bitcoin block number as determined in step 6. Since tweets cannot be edited, only deleted, this will provide a timestamp for when the list in step 4 was made, which can be compared to check that the bitcoin block determined in step 6 is in the future ie. we do not know the block hash of this block when the list is generated.
8. The winning ticket numbers will be calculated as described below:
   • A string (STRING1) is created - "[SERVER SEED]:[BLOCK HASH]:[WINNING POSITION]".
   • The SHA256 hash of STRING1 is calculated and the first 8 characters of this hash are taken (STRING2).
   • STRING2 is converted to a decimal which gives us a number between 0 and 4,294,967,295 (NUM1).
   • NUM1 is then multiplied by the (total number of tickets minus 1) and divided by 4,294,967,295 to get a number (NUM2) between 0 and the total number of tickets less 1.
   • NUM2 is then rounded off to the nearest whole number which is the winning ticket number.
   • The [WINNING POSITION] starts at 1 and is increased by 1 for picking the 10 winners.
     
     The user having the ticket with the lowest [WINNING POSITION] wins the first prize and so on.
   • If a user wins more than 1 prize, the number is discarded and [WINNING POSITION] is increased by 1 and the calculations are run again to pick a new user. This is to ensure that a user cannot win more than 1 prize in a round.

HOW IS THE SYSTEM FAIR?

The system described above that is used for picking the winners is provably fair because it has multiple safeguards in place to ensure that winners are picked randomly and fairly.

1. We provide a SHA256 hash of the server seed when a lottery round starts. If we change the server seed at any time, the SHA256 hash of the new seed will not match the hash we provided earlier. After a round has ended and we provide the server seed that will be used to pick winners, the hash of the seed we provide can be checked against the hash we provided originally and both should match.
2. We use a future bitcoin block hash as the "client seed" ie. a seed that we do not know of. All bitcoin block hashes are unique and nobody knows what the block hash of a future block will be until the block has been mined.
3. We use twitter to publish the future bitcoin block number, the list of users and their ticket numbers and the MD5 hash of the user list. It provides a timestamp to check if the block hash that we use is indeed in the future. Since tweets cannot be edited, only deleted - if we delete the tweet after the future block has been mined and publish a new one, it would be easy to catch us cheating by comparing the timestamp of the tweet and that of the bitcoin block. The timestamp of the tweet should always be lesser than the time timestamp of the bitcoin block whose hash is used as the client seed.
4. We provide a MD5 hash of the text file containing the list of users and their ticket numbers. If even a single character in the text file is changed after the MD5 hash in the tweet is published, the MD5 hash of the edited file will not match the MD5 hash provided in the tweet.