From a3e7ee7647e92396ffe3dbafafd94a820d31b110 Mon Sep 17 00:00:00 2001 From: =?utf8?q?Roland=20H=C3=A4der?= Date: Fri, 27 Jun 2014 11:58:07 +0200 Subject: [PATCH] Rewrites MIME-Version: 1.0 Content-Type: text/plain; charset=utf8 Content-Transfer-Encoding: 8bit Signed-off-by: Roland Häder --- contrib/chash/chash.php | 248 +++++++++++++++++++++++++++------------- 1 file changed, 170 insertions(+), 78 deletions(-) diff --git a/contrib/chash/chash.php b/contrib/chash/chash.php index ed9265f3..d6126e39 100644 --- a/contrib/chash/chash.php +++ b/contrib/chash/chash.php @@ -1,11 +1,13 @@ $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); +} + /* * Calculate "genesis" hashes, please note that these "genesis strings" are now * known to the public as you can read them here in source code and therefore I @@ -231,7 +268,7 @@ $gensisHashes = array( multipleHashString('Roland Haeder, https://status.mxchange.org'), // A famous quote from Linus Torwalds multipleHashString('"Software is like sex. Its better when its free." - Linus Torwalds'), - // Possible truth ;-) + // Well ... multipleHashString('September 11 is a big lie.'), // GNU is not Uni* @@ -240,7 +277,7 @@ $gensisHashes = array( multipleHashString('WINE Is Not an Emulator.'), // FlightGear - Fly free! multipleHashString('FlightGear - Fly free!'), - // Linus Torwalds Quote + // Quote from Linus Torwalds multipleHashString('Your code is shit.. your argument is shit.'), ); @@ -262,21 +299,23 @@ $sqrtHashes = array( ); // Calulcate modula hash -$modulaHash = multipleHashString(modulaHash($sqrtHashes[0], $sqrtHashes[1])); +$GLOBALS['modula_hash'] = multipleHashString(modulaHash($sqrtHashes[0], $sqrtHashes[1])); -// This is also the "genesis hash" -$genesisHash = $modulaHash; +// This is also the "genesis" hash and first root hash +$GLOBALS['genesis_hash'] = $GLOBALS['modula_hash']; +$GLOBALS['root_hash'] = $GLOBALS['modula_hash']; // Output results print ('hashes=' . print_r($gensisHashes, TRUE)); print ('modulaHashes=' . print_r($modulaHashes, TRUE)); print ('sqrtHashes=' . print_r($sqrtHashes, TRUE)); -print ('modulaHash=' . $modulaHash . PHP_EOL); +print ('modulaHash=' . $GLOBALS['modula_hash'] . PHP_EOL); // Total reward + hashes -$totalReward = 0; +$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)) { @@ -287,29 +326,31 @@ if (is_readable(CHECK_POINT)) { $data = explode(':', $checkPoint); // Assert on count - assert(count($data) == 6); + assert(count($data) == 8); // 1st element is nonce, 2nd hash, 3rd found hashes $GLOBALS['total_blocks'] = $data[0]; - $GLOBALS['total_hashes'] = $data[1]; - $GLOBALS['cycles'] = intval($data[2]); - $nonce = base64_decode($data[3]); - $modulaHash = $data[4]; - $GLOBALS['found_hashes'][$GLOBALS['total_blocks']] = unserialize(gzuncompress(base64_decode($data[5]))); + $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) - $nonce = 1 / mt_rand(); + initNonce(); } // Output again -print ('modulaHash=' . $modulaHash . PHP_EOL); -print ('nonce=' . $nonce . PHP_EOL); +print ('modulaHash=' . $GLOBALS['modula_hash'] . PHP_EOL); +print ('nonce=' . $GLOBALS['nonce'] . PHP_EOL); print ('found=' . count($GLOBALS['found_hashes'][$GLOBALS['total_blocks']]) . PHP_EOL); // Start "mining" while (TRUE) { // Init hash-per-block counter and hashrate - $hashesPerBlock = 0; + $GLOBALS['hashes_block'] = 0; $hashrate = 0; // Wait for BLOCK_SIZE iterations (= found hashes). This is one block @@ -322,24 +363,24 @@ while (TRUE) { while (count($GLOBALS['found_hashes'][$GLOBALS['total_blocks']]) <= BLOCK_SIZE) { // Create hash from modulaHash ("genesis hash") and nonce - $nonceHash = multipleHashString($modulaHash . $nonce); + $nonceHash = multipleHashString($GLOBALS['modula_hash'] . $GLOBALS['nonce']); // Calculate sums $sumNonce = calculateSumFromHash($nonceHash); - $sumModula = calculateSumFromHash($modulaHash); + $sumModula = calculateSumFromHash($GLOBALS['modula_hash']); // Init counter - $iter = 0; - $iterSecond = 0; + $GLOBALS['iteration'] = 0; + $GLOBALS['iteration_second'] = 0; // Now start the "mining" ... $timeHash = microtime(TRUE); while ($sumNonce >= $sumModula) { // Calculate new nonce - $nonce = calculateNonce($nonce); + calculateNonce(); // And hash again - $nonceHash = multipleHashString($modulaHash . $nonce); + $nonceHash = multipleHashString($GLOBALS['modula_hash'] . $GLOBALS['nonce']); // Calculate sums $sumNonce = calculateSumFromHash($nonceHash); @@ -348,100 +389,151 @@ while (TRUE) { $testTime = abs(microtime(TRUE) - $timeDisplay); // Calculate hashrate/sec - $hashrate = 1 / $testTime * $iterSecond * $GLOBALS['cycles']; + $hashrate = 1 / $testTime * $GLOBALS['iteration_second'] * $GLOBALS['cycles']; // Only every second if ($testTime >= 1) { // Display hash rate - print ('hashrate=' . round($hashrate) . ' hashes/sec,iterSecond=' . $iterSecond . ' iterations/sec' . PHP_EOL); + print ('hashrate=' . round($hashrate) . ' hashes/sec,iterSecond=' . $GLOBALS['iteration_second'] . ' iterations/sec' . PHP_EOL); // Reset timer $timeDisplay = microtime(TRUE); - $iterSecond = 0; + $GLOBALS['iteration_second'] = 0; } // END - if // Time spend from last flush $testTime = abs(microtime(TRUE) - $GLOBALS['time_flush']); // Only once per 10 seconds - if ($testTime >= 10) { + if ($testTime >= FLUSH_BLOCKS_FILE_TIME) { // Flush check-point file - flushCheckPointFile($nonce, $modulaHash); + flushCheckPointFile($GLOBALS['modula_hash']); + } // END - if + + // Time spend from last found block + $testTime = abs(microtime(TRUE) - $GLOBALS['found_time']); + + // Is the last found time to far away? + if ($testTime >= RESTART_SEARCH_TIME) { + // Count all root (genesis) hashes + $rootHashes = array(); + 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 + + if (isset($rootHashes[$hash['root_hash']])) { + // Count up + $rootHashes[$hash['root_hash']]++; + } else { + // 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? + 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--) { + // Is the root hash there? + if ($block[$idx]['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']; + 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); + + // Re-initialize nonce + initNonce(); + + // Abort search + break; + } // END - if + } // END - for + } // END - foreach } // END - if // Next round - $iter++; - $iterSecond++; - //print ('nonce=' . $nonce . ',iter=' . $iter . PHP_EOL); + $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 // If the iteration is zero, then no hash is found - if ($iter == 0) { + if ($GLOBALS['iteration'] == 0) { // Bad hash found $timeBadHashes += abs(microtime(TRUE) - $timeHash); // And next round - //print('BAD:nonce=' . $nonce . PHP_EOL); + print('BAD:nonce=' . $GLOBALS['nonce'] . PHP_EOL); // Nothing found, so calculate new nonce - $nonce = calculateNonce($nonce); + calculateNonce(); continue; } // END - if // Add amount of hashes per block (multiple-hash) - $hashesPerBlock += $iter * $GLOBALS['cycles'] + $GLOBALS['cycles']; + $GLOBALS['hashes_block'] += $GLOBALS['iteration'] * $GLOBALS['cycles'] + $GLOBALS['cycles']; // Push found hash - array_push($GLOBALS['found_hashes'][$GLOBALS['total_blocks']], array( - 'modula_hash' => $modulaHash, - 'genesis_hash' => $genesisHash, - 'nonce' => $nonce, - 'iter' => $iter, - 'hashes_block' => $hashesPerBlock, - 'nonce_hash' => $nonceHash - )); - - // Found hash: - print ('FOUND: nonceHash=' . $nonceHash . ',nonce=' . $nonce . ',iter=' . $iter . PHP_EOL); - - // Flush check-point file after new hash is found - flushCheckPointFile($nonce, $nonceHash); - - // Use nonceHash as next modula hash - $modulaHash = $nonceHash; + addFoundHash($nonceHash); } // END - while - // Time taken for one block + // Time taken for one $timeBlock = abs(microtime(TRUE) - $timeBlock); // Calculate reward - $reward = abs($timeBlock - $timeBadHashes) / $hashrate * $hashesPerBlock / BLOCK_SIZE * 1000; - print ('timeBlock=' . $timeBlock . ',timeBadHashes=' . $timeBadHashes . ',hashesPerBlock=' . $hashesPerBlock .',reward=' . $reward . PHP_EOL); + $reward = abs($timeBlock - $timeBadHashes) / $hashrate * $GLOBALS['hashes_block'] / BLOCK_SIZE * 1000; + print ('timeBlock=' . $timeBlock . ',timeBadHashes=' . $timeBadHashes . ',hashesPerBlock=' . $GLOBALS['hashes_block'] .',reward=' . $reward . PHP_EOL); // Block completed - $GLOBALS['total_hashes'] += $hashesPerBlock; + $GLOBALS['total_hashes'] += $GLOBALS['hashes_block']; $GLOBALS['total_blocks']++; - $hashesPerBlock = 0; + $GLOBALS['hashes_block'] = 0; // Init next block $GLOBALS['found_hashes'][$GLOBALS['total_blocks']] = array(); // Calculate new nonce - $nonce = calculateNonce($nonce); + calculateNonce(); // Add reward to total - $totalReward += $reward; + $GLOBALS['total_reward'] += $reward; // Calculate average block value - $blockValue = $totalReward / $GLOBALS['total_blocks'] * $GLOBALS['total_hashes'] / (BLOCK_SIZE * $GLOBALS['total_blocks']); + $blockValue = $GLOBALS['total_reward'] / $GLOBALS['total_blocks'] * $GLOBALS['total_hashes'] / (BLOCK_SIZE * $GLOBALS['total_blocks']); // Calculate reward per hour (= 3600 seconds) - $rewardPerHour = $totalReward / abs(microtime(TRUE) - START_TIME) * 3600; + $rewardPerHour = $GLOBALS['total_reward'] / abs(microtime(TRUE) - START_TIME) * 3600; - print ('totalReward=' . $totalReward . ',blockValue=' . $blockValue . ',rewardPerHour=' . $rewardPerHour . PHP_EOL); + print ('totalReward=' . $GLOBALS['total_reward'] . ',blockValue=' . $blockValue . ',rewardPerHour=' . $rewardPerHour . PHP_EOL); } // END - while // [EOF] -- 2.30.2