X-Git-Url: https://git.mxchange.org/?a=blobdiff_plain;ds=sidebyside;f=contrib%2Fchash%2Fchash.php;h=4911ba57036e2c22603c4abe0ccb738e22bd968d;hb=08a0c865dd2c8ee0b6dbf96f4f07e9ee0ce0f02b;hp=d6126e3920a8ce93bdc4495680fc8b9b8bd12f3e;hpb=a3e7ee7647e92396ffe3dbafafd94a820d31b110;p=core.git diff --git a/contrib/chash/chash.php b/contrib/chash/chash.php index d6126e39..4911ba57 100644 --- a/contrib/chash/chash.php +++ b/contrib/chash/chash.php @@ -1,259 +1,56 @@ array()); - -/** - * Continued-hashing - * - * @author Roland Haeder - * @copyright Copyright (c) 2013 by Core Developer Team - * @license See LICENSE (public-domain) - */ - -/** - * Calculates a simple but stronger hash from given string. No salts are being - * added here. - * - * @param $str The string to be hashed - * @return $hash The hash from string $str - */ -function hashString ($str) { - // Calculate strong hash from given string - $hash = mhash(HASH_ALGO, $str); - - // Return it hexadecimal-encoded - return bin2hex($hash); -} - -/** - * Multiple-hashes given string. This is done by hashing the given string and - * then hashing the generated hash again. - * - * @param $str The string to be hashed 4 times - * @return $hash The generated hash - */ -function multipleHashString ($str) { - // One less to go (see below) - $totalHashes = $GLOBALS['cycles'] - 1; - - // Generate hash from given hash - $hash = hashString($str); - - // Now over-hash it - for ($idx = 0; $idx < $totalHashes; $idx++) { - // Over-hash the given hash - $hash = hashString($hash); - } // END - for - - // Return it - return $hash; -} - -/** - * Calculates a "modula-hash" based given two hashes. - * - * @param $hash1 Hash 1 - * @param $hash2 Hash 2 - */ -function modulaHash ($hash1, $hash2) { - // Both must have same length - assert(strlen($hash1) === strlen($hash2)); - - // Init new hash - $modulaHash = ''; - - // "Walk" trough first hash and get every 2 byte of both hashes - for ($idx = 0; $idx < strlen($hash1); $idx += 2) { - // Init modula value - $mod = 0; - - // Get both hash parts and convert to ASCII number - $part1 = hexdec(substr($hash1, $idx, 2)); - $part2 = hexdec(substr($hash2, $idx, 2)); - - /* - * If part1 is larget part2, part1 is divident and vise-versa. But don't do it - * if one is zero - */ - if (($part1 > $part2) && ($part2 > 0)) { - // 'part1' is larger than 'part2' - $mod = $part1 % $part2; - } elseif (($part1 < $part2) && ($part1 > 0)) { - // 'part2' is larger than 'part1' - $mod = $part2 % $part1; - } - - // "Invert" the result against 255 - $mod = 255 - $mod; - - // Encode to hex, pre-pad it with zeros and add to new hash - $modulaHash .= padHex($mod); - } // END - for - - // Modula hash must have same length as input hash - assert(strlen($modulaHash) === strlen($hash1)); - - // Return modula hash - return $modulaHash; -} - -/** - * Calculates a "sqrt-hash" based given two hashes and single-hash it - * - * @param $hash1 Hash 1 - * @param $hash2 Hash 2 - */ -function sqrtHash ($hash1, $hash2) { - // Both must have same length - assert(strlen($hash1) === strlen($hash2)); - - // Init new hash - $sqrtHash = ''; - - // "Walk" trough first hash and get every 2 byte of both hashes - for ($idx = 0; $idx < strlen($hash1); $idx += 2) { - // Init modula value - $mod = 0; - - // Get both hash parts and convert to ASCII number - $part1 = hexdec(substr($hash1, $idx, 2)); - $part2 = hexdec(substr($hash2, $idx, 2)); - - // Calculate square root of both parts being multiplied and round up, then "invert" it against 255 - $sqrt = intval(255 - ceil(sqrt($part1 * $part2))); - - // Encode to hex, pre-pad it with zeros and add to new hash - $sqrtHash .= padHex($sqrt); - } // END - for - - // "sqrt-hash" must have same length as input hash - assert(strlen($sqrtHash) === strlen($hash1)); - - // Hash reversed "sqrt-hash" again and return it - return hashString(strrev($sqrtHash)); -} - -/** - * Converts a number between 0 and 255 into a zero-padded hexadecimal string - * - * @param $num Number between 0 and 255 - * @return $hex Hexadecimal string, padded with zeros - */ -function padHex ($num) { - // Must be a integer number and between 0 and 255 - assert(is_int($num)); - assert($num >= 0); - assert($num <= 255); +define('START_TIME' , microtime(true)); +define('CHECKPOINT_FILE' , 'chash.pos'); - // Convert it - $hex = str_pad(dechex($num), 2, '0', STR_PAD_LEFT); +// Hashes needed to complete a "block" +$GLOBALS['block_size'] = 100; +$GLOBALS['none_increment'] = (1 / pow(10, 20)); - // ... and return it - return $hex; -} +// Automatic saving interval in seconds +$GLOBALS['flush_file_time'] = 30; -/** - * Calculates sum from given hash - * - * @param $hash Hash to calculate sum from - * @return $sum Sum from given hash +/* + * How long (in seconds) to try to find a proper hash until the best root hash + * is taken. */ -function calculateSumFromHash ($hash) { - // Everything starts with zero ... - $sum = 0; - - // Loop through hash - for ($idx = 0; $idx < (strlen($hash) / 2); $idx++) { - // And add it - $sum = $sum + (hexdec(substr($hash, $idx, 2)) * $idx & 256); - } // END - for - - // And return it - return $sum; -} +$GLOBALS['restart_search_time'] = 1800; -/** - * Calculates new nonce - * - * @return void - */ -function calculateNonce () { - // Linear incrementation - $GLOBALS['nonce'] = $GLOBALS['nonce'] + NONCE_INCREMENT; -} +// Hashes per call +$GLOBALS['hash_cycles'] = 2; -/** - * Writes/flushes check-point file - * - * @param $hash Modula hash (or hash to save) - * @return void - */ -function flushCheckPointFile ($hash) { - // Display message - print ('FLUSHING: Writing ' . count($GLOBALS['found_hashes']) . ' blocks ...' . PHP_EOL); +// Total restarts +$GLOBALS['total_restarts'] = 0; - // Start timer - $timer = microtime(TRUE); +// Initial salt (may be overwritten by loading checkpoint file) +$GLOBALS['salt'] = Scrypt::generateSalt(); - // Flush data - file_put_contents(CHECK_POINT, $GLOBALS['total_blocks'] . ':' . $GLOBALS['total_reward'] . ':' . $GLOBALS['total_hashes'] . ':' . $GLOBALS['cycles'] . ':' . base64_encode($GLOBALS['nonce']) . ':' . $hash . ':' . $GLOBALS['root_hash'] . ':' . base64_encode(gzcompress(serialize($GLOBALS['found_hashes'])))); +// Starting difficulty +$GLOBALS['difficulty'] = 2; - // Set time - $GLOBALS['time_flush'] = microtime(TRUE); - print ('FLUSHING: Took ' . ($GLOBALS['time_flush'] - $timer) . ' seconds.' . PHP_EOL); -} +// Found hashes +$GLOBALS['found_hashes'] = array([]); /** - * Adds a found hash and flushes the checkpoint file + * Continued-hashing * - * @param $hash Hash to save + * @author Roland Haeder + * @copyright Copyright (c) 2013 by Core Developer Team + * @license See LICENSE (public-domain) */ -function addFoundHash ($hash) { - // Add hash to array - array_push($GLOBALS['found_hashes'][$GLOBALS['total_blocks']], array( - 'modula_hash' => $GLOBALS['modula_hash'], - 'genesis_hash' => $GLOBALS['genesis_hash'], - 'root_hash' => $GLOBALS['root_hash'], - 'nonce' => $GLOBALS['nonce'], - 'iter' => $GLOBALS['iteration'], - 'hashes_block' => $GLOBALS['hashes_block'], - 'nonce_hash' => $hash - )); - - // Found hash: - print ('FOUND: hash=' . $hash . ',nonce=' . $GLOBALS['nonce'] . ',iteration=' . $GLOBALS['iteration'] . ',foundTime()=' . (microtime(TRUE) - $GLOBALS['found_time'] ) . PHP_EOL); - - // Set time as a new hash was found - $GLOBALS['found_time'] = microtime(TRUE); - - // Flush check-point file after new hash is found - flushCheckPointFile($hash); - - // Use nonceHash as next modula hash - $GLOBALS['modula_hash'] = $hash; -} -/** - * Initializes nonce - * - * @return void - */ -function initNonce () { - $GLOBALS['nonce'] = 1 / (mt_rand() ^ pi()); - print (__FUNCTION__ . ': nonce=' . $GLOBALS['nonce'] . PHP_EOL); +// Is the check point there? +if (is_readable(CHECKPOINT_FILE)) { + // Load it + loadCheckpointFile(); +} else { + // Create nonce (very small) + initNonce(); } /* @@ -264,8 +61,8 @@ function initNonce () { $gensisHashes = array( // A famous quote from Deus Ex 2 - Invisible War multiplehashString('"Informations must be free." - AI Helios from Deus Ex'), - // My name + URL of my first StatusNet instance - multipleHashString('Roland Haeder, https://status.mxchange.org'), + // My name + URL of my GNUSocial instance + multipleHashString('Roland Haeder, https://social.mxchange.org'), // A famous quote from Linus Torwalds multipleHashString('"Software is like sex. Its better when its free." - Linus Torwalds'), // Well ... @@ -278,152 +75,132 @@ $gensisHashes = array( // FlightGear - Fly free! multipleHashString('FlightGear - Fly free!'), // Quote from Linus Torwalds - multipleHashString('Your code is shit.. your argument is shit.'), + multipleHashString('Your code is shit. Your argument is shit.'), ); -// Calculate "modula hash" from 1st/4th and 2nd/3rd -$modulaHashes = array( - // "Block" 0 - modulaHash($gensisHashes[0], $gensisHashes[3]), - modulaHash($gensisHashes[1], $gensisHashes[2]), - - // "Block" 1 - modulaHash($gensisHashes[4], $gensisHashes[7]), - modulaHash($gensisHashes[5], $gensisHashes[6]), +// Calculate first "block" +$genesisBlock = array( + hashString($gensisHashes[0] . $gensisHashes[3]), + hashString($gensisHashes[1] . $gensisHashes[2]), + hashString($gensisHashes[4] . $gensisHashes[7]), + hashString($gensisHashes[5] . $gensisHashes[6]), ); -// Calculate "sqrt hash" -$sqrtHashes = array( - sqrtHash($modulaHashes[0], $modulaHashes[1]), - sqrtHash($modulaHashes[2], $modulaHashes[3]) +// Calulcate final "genesis" hash +$genesisHash = hashString( + $genesisBlock[3] . + $genesisBlock[0] . + $genesisBlock[2] . + $genesisBlock[1] ); -// Calulcate modula hash -$GLOBALS['modula_hash'] = multipleHashString(modulaHash($sqrtHashes[0], $sqrtHashes[1])); +// Get all elements to get the last part out +$elements = explode('$', $genesisHash); // This is also the "genesis" hash and first root hash -$GLOBALS['genesis_hash'] = $GLOBALS['modula_hash']; -$GLOBALS['root_hash'] = $GLOBALS['modula_hash']; +$GLOBALS['current_hash'] = $genesisHash; +$GLOBALS['root_hash'] = $genesisHash; +$GLOBALS['sum_genesis'] = sumHash($elements[4]); // Output results -print ('hashes=' . print_r($gensisHashes, TRUE)); -print ('modulaHashes=' . print_r($modulaHashes, TRUE)); -print ('sqrtHashes=' . print_r($sqrtHashes, TRUE)); -print ('modulaHash=' . $GLOBALS['modula_hash'] . PHP_EOL); +print ('hashes=' . print_r($gensisHashes, true)); // Total reward + hashes -$GLOBALS['total_reward'] = 0; -$GLOBALS['total_hashes'] = 0; -$GLOBALS['total_blocks'] = 0; -$GLOBALS['found_time'] = microtime(TRUE); - -// Is the check point there? -if (is_readable(CHECK_POINT)) { - // Then load it - $checkPoint = file_get_contents(CHECK_POINT); - - // Explode it - $data = explode(':', $checkPoint); - - // Assert on count - assert(count($data) == 8); - - // 1st element is nonce, 2nd hash, 3rd found hashes - $GLOBALS['total_blocks'] = $data[0]; - $GLOBALS['total_reward'] = $data[1]; - $GLOBALS['total_hashes'] = $data[2]; - $GLOBALS['cycles'] = intval($data[3]); - $GLOBALS['nonce'] = base64_decode($data[4]); - $GLOBALS['modula_hash'] = $data[5]; - $GLOBALS['root_hash'] = $data[6]; - $GLOBALS['found_hashes'] = unserialize(gzuncompress(base64_decode($data[7]))); -} else { - // Create nonce (small) - initNonce(); -} +$GLOBALS['total_reward'] = 0; +$GLOBALS['total_hashes'] = 0; +$GLOBALS['total_found'] = 0; +$GLOBALS['total_blocks'] = 0; +$GLOBALS['found_time'] = microtime(true); // Output again -print ('modulaHash=' . $GLOBALS['modula_hash'] . PHP_EOL); print ('nonce=' . $GLOBALS['nonce'] . PHP_EOL); print ('found=' . count($GLOBALS['found_hashes'][$GLOBALS['total_blocks']]) . PHP_EOL); +print ('salt=' . $GLOBALS['salt'] . PHP_EOL); +print ('difficulty=' . $GLOBALS['difficulty'] . PHP_EOL); // Start "mining" -while (TRUE) { +while (true) { // Init hash-per-block counter and hashrate $GLOBALS['hashes_block'] = 0; - $hashrate = 0; + $hashRate = 1; - // Wait for BLOCK_SIZE iterations (= found hashes). This is one block - $timeBlock = microtime(TRUE); + // Wait for block_size iterations (= found hashes). This is one block + $timeBlock = microtime(true); $timeDisplay = $timeBlock; $GLOBALS['time_flush'] = $timeBlock; // Time waited for a good block again (no iteration) $timeBadHashes = 0; - while (count($GLOBALS['found_hashes'][$GLOBALS['total_blocks']]) <= BLOCK_SIZE) { + while (count($GLOBALS['found_hashes'][$GLOBALS['total_blocks']]) <= $GLOBALS['block_size']) { // Create hash from modulaHash ("genesis hash") and nonce - $nonceHash = multipleHashString($GLOBALS['modula_hash'] . $GLOBALS['nonce']); + $nonceHash = multipleHashString($GLOBALS['nonce'] . $GLOBALS['current_hash']); // Calculate sums $sumNonce = calculateSumFromHash($nonceHash); - $sumModula = calculateSumFromHash($GLOBALS['modula_hash']); // Init counter $GLOBALS['iteration'] = 0; $GLOBALS['iteration_second'] = 0; // Now start the "mining" ... - $timeHash = microtime(TRUE); - while ($sumNonce >= $sumModula) { + $timeHash = microtime(true); + while ($sumNonce < $GLOBALS['sum_genesis']) { // Calculate new nonce calculateNonce(); // And hash again - $nonceHash = multipleHashString($GLOBALS['modula_hash'] . $GLOBALS['nonce']); + $nonceHash = multipleHashString($GLOBALS['nonce'] . $GLOBALS['current_hash']); // Calculate sums $sumNonce = calculateSumFromHash($nonceHash); // Time spend in loop - $testTime = abs(microtime(TRUE) - $timeDisplay); + $testTime = abs(microtime(true) - $timeDisplay); // Calculate hashrate/sec - $hashrate = 1 / $testTime * $GLOBALS['iteration_second'] * $GLOBALS['cycles']; + $hashRate = 1 / $testTime * $GLOBALS['iteration_second'] * $GLOBALS['hash_cycles']; // Only every second if ($testTime >= 1) { // Display hash rate - print ('hashrate=' . round($hashrate) . ' hashes/sec,iterSecond=' . $GLOBALS['iteration_second'] . ' iterations/sec' . PHP_EOL); + print ('hashrate=' . round($hashRate) . ' hashes/sec,iterSecond=' . $GLOBALS['iteration_second'] . ' iterations/sec,difficulty=' . $GLOBALS['difficulty'] . PHP_EOL); // Reset timer - $timeDisplay = microtime(TRUE); + $timeDisplay = microtime(true); $GLOBALS['iteration_second'] = 0; - } // END - if + } // Time spend from last flush - $testTime = abs(microtime(TRUE) - $GLOBALS['time_flush']); + $testTime = abs(microtime(true) - $GLOBALS['time_flush']); // Only once per 10 seconds - if ($testTime >= FLUSH_BLOCKS_FILE_TIME) { + if ($testTime >= $GLOBALS['flush_file_time']) { // Flush check-point file - flushCheckPointFile($GLOBALS['modula_hash']); - } // END - if + flushCheckPointFile($GLOBALS['current_hash']); + } // Time spend from last found block - $testTime = abs(microtime(TRUE) - $GLOBALS['found_time']); + $testTime = abs(microtime(true) - $GLOBALS['found_time']); // Is the last found time to far away? - if ($testTime >= RESTART_SEARCH_TIME) { + if ($testTime >= $GLOBALS['restart_search_time']) { + // Count up restart and reduce difficulty, but never below 2 + $GLOBALS['total_restarts']++; + $GLOBALS['difficulty'] = max(2, ($GLOBALS['difficulty'] / 2)); + + // Output message + print('total_restarts=' . $GLOBALS['total_restarts'] . ' - Restarting ...'); + // Count all root (genesis) hashes - $rootHashes = array(); + $rootHashes = []; foreach ($GLOBALS['found_hashes'] as $block) { // "Walk" through all blocks foreach ($block as $hash) { if (!isset($hash['root_hash'])) { // Bad file - die('INCONSISTENCY: hash=' . print_r($hash, TRUE)); - } // END - if + die('INCONSISTENCY: hash=' . print_r($hash, true)); + } if (isset($rootHashes[$hash['root_hash']])) { // Count up @@ -432,86 +209,88 @@ while (TRUE) { // First entry found $rootHashes[$hash['root_hash']] = 1; } - } // END - foreach - } // END - foreach + } + } // Find best root hash $bestRootHash = ''; $bestRootCount = 0; foreach ($rootHashes as $hash => $count) { - // Debug message - //* NOISY-DEBUG: */ print ('hash=' . $hash . ',count=' . $count . ',bestRootHash=' . $bestRootHash . ',bestRootCount=' . $bestRootCount . PHP_EOL); - // Is a better one found? + //* NOISY-DEBUG: */ print ('hash=' . $hash . ',count=' . $count . ',bestRootHash=' . $bestRootHash . ',bestRootCount=' . $bestRootCount . PHP_EOL); if ($count > $bestRootCount) { // Remember it $bestRootHash = $hash; $bestRootCount = $count; - } // END - if - } // END - foreach + } + } // Output message print ('bestRootHash=' . $bestRootHash . ',bestRootCount=' . $bestRootCount . PHP_EOL); // Search for latest best root hash foreach ($GLOBALS['found_hashes'] as $block) { - // "Walk" through whole block counter-wise - for ($idx = (count($block) - 1); $idx > 0; $idx--) { + // "Walk" through whole block and search for first appearance of best root hash + foreach ($block as $idx => $hash) { // Is the root hash there? - if ($block[$idx]['root_hash'] == $bestRootHash) { + if ($hash['root_hash'] == $bestRootHash) { // Set found modula hash as new root and current modula hash - $GLOBALS['root_hash'] = $block[$idx]['modula_hash']; - $GLOBALS['modula_hash'] = $block[$idx]['modula_hash']; + $GLOBALS['root_hash'] = $hash['nonce_hash']; + setModulaHash($hash['nonce_hash']); print ('idx=' . $idx . ',modulaHash=' . $GLOBALS['root_hash'] . ' - Is now new root hash!' . PHP_EOL); // Reset "found time" (when a hash was found) - $GLOBALS['found_time'] = microtime(TRUE); + $GLOBALS['found_time'] = microtime(true); // Re-initialize nonce initNonce(); // Abort search break; - } // END - if - } // END - for - } // END - foreach - } // END - if + } + } + } + } // Next round $GLOBALS['iteration']++; $GLOBALS['iteration_second']++; - //print ('nonce=' . $GLOBALS['nonce'] . ',iteration=' . $GLOBALS['iteration'] . PHP_EOL); - //print ('nonceHash=' . $nonceHash . PHP_EOL); - //print ('sumNonce=' . $sumNonce . PHP_EOL); - //print ('sumModula=' . $sumModula . PHP_EOL); - } // END - while + //* NOISY-DEBUG: */ print('nonce=' . $GLOBALS['nonce'] . ',iteration=' . $GLOBALS['iteration'] . PHP_EOL); + //* NOISY-DEBUG: */ print('nonceHash=' . $nonceHash . PHP_EOL); + //* NOISY-DEBUG: */ print('sumNonce=' . $sumNonce . PHP_EOL); + //* NOISY-DEBUG: */ print('sumGenesis=' . $GLOBALS['sum_genesis'] . PHP_EOL); + } // If the iteration is zero, then no hash is found if ($GLOBALS['iteration'] == 0) { // Bad hash found - $timeBadHashes += abs(microtime(TRUE) - $timeHash); - - // And next round - print('BAD:nonce=' . $GLOBALS['nonce'] . PHP_EOL); + $timeBadHashes += abs(microtime(true) - $timeHash); // Nothing found, so calculate new nonce + //* NOISY-DEBUG: */ print('BAD:nonce=' . $GLOBALS['nonce'] . PHP_EOL); calculateNonce(); continue; - } // END - if + } // Add amount of hashes per block (multiple-hash) - $GLOBALS['hashes_block'] += $GLOBALS['iteration'] * $GLOBALS['cycles'] + $GLOBALS['cycles']; + $GLOBALS['hashes_block'] += $GLOBALS['iteration'] * $GLOBALS['hash_cycles'] + $GLOBALS['hash_cycles']; // Push found hash addFoundHash($nonceHash); - } // END - while + } + + // Flush check-point file + flushCheckPointFile($GLOBALS['current_hash']); // Time taken for one - $timeBlock = abs(microtime(TRUE) - $timeBlock); + $timeBlock = abs(microtime(true) - $timeBlock); // Calculate reward - $reward = abs($timeBlock - $timeBadHashes) / $hashrate * $GLOBALS['hashes_block'] / BLOCK_SIZE * 1000; - print ('timeBlock=' . $timeBlock . ',timeBadHashes=' . $timeBadHashes . ',hashesPerBlock=' . $GLOBALS['hashes_block'] .',reward=' . $reward . PHP_EOL); + $reward = abs($timeBlock - $timeBadHashes) / max(1, $hashRate) * $GLOBALS['hashes_block'] / max(1, $GLOBALS['block_size']) * 1000; + print('timeBlock=' . $timeBlock . ',timeBadHashes=' . $timeBadHashes . ',hashesPerBlock=' . $GLOBALS['hashes_block'] .',reward=' . $reward . PHP_EOL); + + // Increase difficulty + $GLOBALS['difficulty'] = $GLOBALS['difficulty']++; // Block completed $GLOBALS['total_hashes'] += $GLOBALS['hashes_block']; @@ -519,7 +298,7 @@ while (TRUE) { $GLOBALS['hashes_block'] = 0; // Init next block - $GLOBALS['found_hashes'][$GLOBALS['total_blocks']] = array(); + $GLOBALS['found_hashes'][$GLOBALS['total_blocks']] = []; // Calculate new nonce calculateNonce(); @@ -528,13 +307,10 @@ while (TRUE) { $GLOBALS['total_reward'] += $reward; // Calculate average block value - $blockValue = $GLOBALS['total_reward'] / $GLOBALS['total_blocks'] * $GLOBALS['total_hashes'] / (BLOCK_SIZE * $GLOBALS['total_blocks']); + $blockValue = $GLOBALS['total_reward'] / $GLOBALS['total_blocks'] * $GLOBALS['total_hashes'] / ($GLOBALS['block_size'] * $GLOBALS['total_blocks']); // Calculate reward per hour (= 3600 seconds) - $rewardPerHour = $GLOBALS['total_reward'] / abs(microtime(TRUE) - START_TIME) * 3600; + $rewardPerHour = $GLOBALS['total_reward'] / abs(microtime(true) - START_TIME) * 3600; print ('totalReward=' . $GLOBALS['total_reward'] . ',blockValue=' . $blockValue . ',rewardPerHour=' . $rewardPerHour . PHP_EOL); -} // END - while - -// [EOF] -?> +}