+print ('hashes=' . print_r($gensisHashes, true));
+
+// Total reward + hashes
+$GLOBALS['total_reward'] = 0;
+$GLOBALS['total_hashes'] = 0;
+$GLOBALS['total_found'] = 0;
+$GLOBALS['total_blocks'] = 0;
+$GLOBALS['found_time'] = microtime(true);
+
+// Output again
+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) {
+ // Init hash-per-block counter and hashrate
+ $GLOBALS['hashes_block'] = 0;
+ $hashRate = 1;
+
+ // 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']]) <= $GLOBALS['block_size']) {
+ // Create hash from modulaHash ("genesis hash") and nonce
+ $nonceHash = multipleHashString($GLOBALS['nonce'] . $GLOBALS['current_hash']);
+
+ // Calculate sums
+ $sumNonce = calculateSumFromHash($nonceHash);
+
+ // Init counter
+ $GLOBALS['iteration'] = 0;
+ $GLOBALS['iteration_second'] = 0;
+
+ // Now start the "mining" ...
+ $timeHash = microtime(true);
+ while ($sumNonce < $GLOBALS['sum_genesis']) {
+ // Calculate new nonce
+ calculateNonce();
+
+ // And hash again
+ $nonceHash = multipleHashString($GLOBALS['nonce'] . $GLOBALS['current_hash']);
+
+ // Calculate sums
+ $sumNonce = calculateSumFromHash($nonceHash);
+
+ // Time spend in loop
+ $testTime = abs(microtime(true) - $timeDisplay);
+
+ // Calculate hashrate/sec
+ $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,difficulty=' . $GLOBALS['difficulty'] . PHP_EOL);
+
+ // Reset timer
+ $timeDisplay = microtime(true);
+ $GLOBALS['iteration_second'] = 0;
+ }
+
+ // Time spend from last flush
+ $testTime = abs(microtime(true) - $GLOBALS['time_flush']);
+
+ // Only once per 10 seconds
+ if ($testTime >= $GLOBALS['flush_file_time']) {
+ // Flush check-point file
+ flushCheckPointFile($GLOBALS['current_hash']);
+ }
+
+ // Time spend from last found block
+ $testTime = abs(microtime(true) - $GLOBALS['found_time']);
+
+ // Is the last found time to far away?
+ 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 = [];
+ 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));
+ }
+
+ if (isset($rootHashes[$hash['root_hash']])) {
+ // Count up
+ $rootHashes[$hash['root_hash']]++;
+ } else {
+ // First entry found
+ $rootHashes[$hash['root_hash']] = 1;
+ }
+ }
+ }
+
+ // Find best root hash
+ $bestRootHash = '';
+ $bestRootCount = 0;
+ foreach ($rootHashes as $hash => $count) {
+ // 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;
+ }
+ }
+
+ // 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 and search for first appearance of best root hash
+ foreach ($block as $idx => $hash) {
+ // Is the root hash there?
+ if ($hash['root_hash'] == $bestRootHash) {
+ // Set found modula hash as new root and current 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);
+
+ // Re-initialize nonce
+ initNonce();
+
+ // Abort search
+ break;
+ }
+ }
+ }
+ }
+
+ // Next round
+ $GLOBALS['iteration']++;
+ $GLOBALS['iteration_second']++;
+ //* 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);
+
+ // Nothing found, so calculate new nonce
+ //* NOISY-DEBUG: */ print('BAD:nonce=' . $GLOBALS['nonce'] . PHP_EOL);
+ calculateNonce();
+ continue;
+ }
+
+ // Add amount of hashes per block (multiple-hash)
+ $GLOBALS['hashes_block'] += $GLOBALS['iteration'] * $GLOBALS['hash_cycles'] + $GLOBALS['hash_cycles'];
+
+ // Push found hash
+ addFoundHash($nonceHash);
+ }
+
+ // Flush check-point file
+ flushCheckPointFile($GLOBALS['current_hash']);
+
+ // Time taken for one
+ $timeBlock = abs(microtime(true) - $timeBlock);
+
+ // Calculate reward
+ $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']++;