It was the Bitcointalk forum that inspired us to create Bitcointalksearch.org - Bitcointalk is an excellent site that should be the default page for anybody dealing in cryptocurrency, since it is a virtual gold-mine of data. However, our experience and user feedback led us create our site; Bitcointalk's search is slow, and difficult to get the results you need, because you need to log in first to find anything useful - furthermore, there are rate limiters for their search functionality.
The aim of our project is to create a faster website that yields more results and faster without having to create an account and eliminate the need to log in - your personal data, therefore, will never be in jeopardy since we are not asking for any of your data and you don't need to provide them to use our site with all of its capabilities.
We created this website with the sole purpose of users being able to search quickly and efficiently in the field of cryptocurrency so they will have access to the latest and most accurate information and thereby assisting the crypto-community at large.
Flow:
1- Generating a random RSA pair and publishing the public key
2- Announce the starting of the round (timestamp == now())
3- At the end of the round fetch the following:
- Last litecoin block generated (Timestamp, BlockNumber and BlockHash)
4- Sign the block hash with the round private key, the one that corresponds to the public key announced at the beginning
of the round.
5- Generate this JSON array with the round information:
$round_array {
"round_timestamp": $timestamp,
"round_publickey": $publickey,
"litecoin_block": $round_block_number_match,
"litecoin_block_timestamp": $round_block_timestamp_match,
"litecoin_block_hash": $round_block_hash_match,
"litecoin_block_hash_signature": $round_signature,
"bets_detail": {[{[id_bet:xx],[user_id:xx],[satoshiamount:xx],[round_id:xx],[timestamp:xx]}]}, {[{[id_bet:xx],[user_id:xx],[satoshiamount:xx],[round_id:xx],[timestamp:xx]}]}
*JSON above is not formatted well, it is just to give the main idea.
6- Calculate SHA256Sum for the JSON array, five times, one per horse.
7- Assign each hash to the horses respectfully; 1,2,3, etc.
8- Sort them according to this compare function:
function cmp_result($a, $b)
{
if (intval(substr($a['hash'], 32, 5)) == intval(substr($b['hash'], 32, 5))) {
return 0;
}
return (intval(substr($a['hash'], 32, 5)) < intval(substr($b['hash'], 32, 5))) ? -1 : 1;
}
*Basically compare the hashes from the 32rd byte -> 37th byte.
9- The final sorted array of hashes determines who is the first, second, third, fourth and last horse to win.
We will add more info and examples and we are still in beta, The final release will include buttons on page to download such information for personal re-verification of results. Please share your opinions about how fair and random this method is. And if we can improve its fairness. Thank you for reading and good day
- Bithorse.co development team