<?php
error_reporting(E_ALL | E_STRICT);
-define('HASH_ALGO' , MHASH_RIPEMD320);
-define('BLOCK_SIZE' , 100);
-define('NONCE_INCREMENT' , 0.0000000000000001);
define('START_TIME' , microtime(TRUE));
define('CHECK_POINT' , 'chash.pos');
-define('FLUSH_BLOCKS_FILE_TIME', 10);
-define('RESTART_SEARCH_TIME' , 3600);
+
+// Hashes needed to complete a "block"
+$GLOBALS['block_size'] = 100;
+$GLOBALS['none_increment'] = (1 / pow(10, 20));
+
+// Hashing algorythm
+$GLOBALS['hash_algo'] = MHASH_SHA256;
+
+// Automatic saving interval in seconds
+$GLOBALS['flush_file_time'] = 30;
+
+/*
+ * How long (in seconds) to try to find a proper hash until the best root hash
+ * is taken.
+ */
+$GLOBALS['restart_search_time'] = 1800;
// Hashes per call
-$GLOBALS['cycles'] = 3;
+$GLOBALS['hash_cycles'] = 5;
+
+// Total restarts
+$GLOBALS['total_restarts'] = 0;
// Found hashes
$GLOBALS['found_hashes'] = array(0 => array());
*/
function hashString ($str) {
// Calculate strong hash from given string
- $hash = mhash(HASH_ALGO, $str);
+ $hash = mhash($GLOBALS['hash_algo'], $str);
// Return it hexadecimal-encoded
return bin2hex($hash);
* @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++) {
+ for ($idx = 0; $idx < ($GLOBALS['hash_cycles'] - 1); $idx++) {
// Over-hash the given hash
$hash = hashString($hash);
} // END - for
// Both must have same length
assert(strlen($hash1) === strlen($hash2));
+ // Init propability array with 256 zeros
+ $propability = array_fill(0, 256, 0);
+
// Init new hash
$modulaHash = '';
$part1 = hexdec(substr($hash1, $idx, 2));
$part2 = hexdec(substr($hash2, $idx, 2));
+ // Debug message
+ //* NOISY-DEBUG: */ print 'part1=' . $part1 . ',part2=' . $part2 . PHP_EOL;
+
/*
* 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)) {
+ } elseif (($part2 > $part1) && ($part1 > 0)) {
// 'part2' is larger than 'part1'
$mod = $part2 % $part1;
}
- // "Invert" the result against 255
+ // $mod is now mostly a small number so try to "improve" it
+ //* NOISY-DEBUG: */ print 'mod[' . gettype($mod) . ']=' . $mod . ' - BEFORE!' . PHP_EOL;
+ $mod = (int) round(sqrt($mod * ($part1 + $part2 + $mod ^ 7) / 3));
+ //* NOISY-DEBUG: */ print 'mod[' . gettype($mod) . ']=' . $mod . ' - AFTER!' . PHP_EOL;
+
+ // Make sure it is valid
+ assert($mod >= 0);
+ assert($mod <= 255);
+
+ // "Invert" the result against 255 as zeros are not good for later calculations
$mod = 255 - $mod;
+ // Add it to propability array for debugging
+ $propability[$mod]++;
+
// Encode to hex, pre-pad it with zeros and add to new hash
$modulaHash .= padHex($mod);
} // END - for
+ // Debug propability array
+ $cnt = 0;
+ foreach ($propability as $value) {
+ // Is the value larger than one, means the number has been found at least once?
+ if ($value > 0) {
+ // Then count it
+ $cnt++;
+ } // END - if
+ } // END - foreach
+
+ // Debug message
+ //* NOISY-DEBUG: */ print('cnt=' . $cnt . '/' . strlen($hash1) / 2 . PHP_EOL);
+
// Modula hash must have same length as input hash
assert(strlen($modulaHash) === strlen($hash1));
// Loop through hash
for ($idx = 0; $idx < (strlen($hash) / 2); $idx++) {
// And add it
- $sum = $sum + (hexdec(substr($hash, $idx, 2)) * $idx & 256);
+ $sum = $sum + hexdec(substr($hash, $idx, 2));
} // END - for
// And return it
*/
function calculateNonce () {
// Linear incrementation
- $GLOBALS['nonce'] = $GLOBALS['nonce'] + NONCE_INCREMENT;
+ $GLOBALS['nonce'] += $GLOBALS['none_increment'];
}
/**
$timer = microtime(TRUE);
// 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']))));
+ file_put_contents(
+ CHECK_POINT,
+ $GLOBALS['total_blocks'] . ':' .
+ $GLOBALS['total_reward'] . ':' .
+ $GLOBALS['total_hashes'] . ':' .
+ $GLOBALS['total_found'] . ':' .
+ $GLOBALS['total_restarts'] . ':' .
+ $GLOBALS['hash_cycles'] . ':' .
+ base64_encode((float) $GLOBALS['nonce']) . ':' .
+ $hash . ':' .
+ $GLOBALS['root_hash'] . ':' .
+ base64_encode(gzcompress(serialize($GLOBALS['found_hashes'])))
+ );
// Set time
$GLOBALS['time_flush'] = microtime(TRUE);
* @param $hash Hash to save
*/
function addFoundHash ($hash) {
+ // Increment counter
+ $GLOBALS['total_found']++;
+
// 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'],
+ 'nonce' => (float) $GLOBALS['nonce'],
'iter' => $GLOBALS['iteration'],
'hashes_block' => $GLOBALS['hashes_block'],
+ 'hash_cycles' => $GLOBALS['hash_cycles'],
'nonce_hash' => $hash
));
// Found hash:
- print ('FOUND: hash=' . $hash . ',nonce=' . $GLOBALS['nonce'] . ',iteration=' . $GLOBALS['iteration'] . ',foundTime()=' . (microtime(TRUE) - $GLOBALS['found_time'] ) . PHP_EOL);
+ print ('FOUND: hash=' . $hash . ',nonce=' . $GLOBALS['nonce'] . ',total_found=' . $GLOBALS['total_found'] . PHP_EOL);
// Set time as a new hash was found
$GLOBALS['found_time'] = microtime(TRUE);
flushCheckPointFile($hash);
// Use nonceHash as next modula hash
- $GLOBALS['modula_hash'] = $hash;
+ setModulaHash($hash);
}
/**
print (__FUNCTION__ . ': nonce=' . $GLOBALS['nonce'] . PHP_EOL);
}
+/**
+ * Sets modula hash and calculates sum of it
+ *
+ * @param $hash Hash to set as "modula hash"
+ * @return void
+ */
+function setModulaHash ($hash) {
+ $GLOBALS['modula_hash'] = $hash;
+ $GLOBALS['sum_modula'] = calculateSumFromHash($GLOBALS['modula_hash']);
+}
+
/*
* 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
// 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
);
// Calulcate modula hash
-$GLOBALS['modula_hash'] = multipleHashString(modulaHash($sqrtHashes[0], $sqrtHashes[1]));
+setModulaHash(multipleHashString(modulaHash($sqrtHashes[0], $sqrtHashes[1])));
// This is also the "genesis" hash and first root hash
$GLOBALS['genesis_hash'] = $GLOBALS['modula_hash'];
print ('modulaHash=' . $GLOBALS['modula_hash'] . PHP_EOL);
// Total reward + hashes
-$GLOBALS['total_reward'] = 0;
-$GLOBALS['total_hashes'] = 0;
-$GLOBALS['total_blocks'] = 0;
-$GLOBALS['found_time'] = microtime(TRUE);
+$GLOBALS['total_reward'] = 0;
+$GLOBALS['total_hashes'] = 0;
+$GLOBALS['total_found'] = 0;
+$GLOBALS['total_blocks'] = 0;
+$GLOBALS['found_time'] = microtime(TRUE);
// Is the check point there?
if (is_readable(CHECK_POINT)) {
$data = explode(':', $checkPoint);
// Assert on count
- assert(count($data) == 8);
+ assert(count($data) == 10);
// 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])));
+ $GLOBALS['total_blocks'] = $data[0];
+ $GLOBALS['total_reward'] = $data[1];
+ $GLOBALS['total_hashes'] = $data[2];
+ $GLOBALS['total_found'] = $data[3];
+ $GLOBALS['total_restarts'] = $data[4];
+ $GLOBALS['hash_cycles'] = intval($data[5]);
+ $GLOBALS['nonce'] = (float) base64_decode($data[6]);
+ $GLOBALS['root_hash'] = $data[8];
+ $GLOBALS['found_hashes'] = unserialize(gzuncompress(base64_decode($data[9])));
+
+ // Set modula hash
+ setModulaHash($data[7]);
} else {
// Create nonce (small)
initNonce();
$GLOBALS['hashes_block'] = 0;
$hashrate = 0;
- // Wait for BLOCK_SIZE iterations (= found hashes). This is one block
+ // 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['modula_hash']);
// Calculate sums
$sumNonce = calculateSumFromHash($nonceHash);
- $sumModula = calculateSumFromHash($GLOBALS['modula_hash']);
// Init counter
$GLOBALS['iteration'] = 0;
// Now start the "mining" ...
$timeHash = microtime(TRUE);
- while ($sumNonce >= $sumModula) {
+ while ($sumNonce < $GLOBALS['sum_modula']) {
// Calculate new nonce
calculateNonce();
// And hash again
- $nonceHash = multipleHashString($GLOBALS['modula_hash'] . $GLOBALS['nonce']);
+ $nonceHash = multipleHashString($GLOBALS['nonce'] . $GLOBALS['modula_hash']);
// Calculate sums
$sumNonce = calculateSumFromHash($nonceHash);
$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) {
$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
$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
+ $GLOBALS['total_restarts']++;
+
+ // Output message
+ print('total_restarts=' . $GLOBALS['total_restarts'] . ' - Restarting ...');
+
// Count all root (genesis) hashes
$rootHashes = array();
foreach ($GLOBALS['found_hashes'] as $block) {
// 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)
//print ('nonce=' . $GLOBALS['nonce'] . ',iteration=' . $GLOBALS['iteration'] . PHP_EOL);
//print ('nonceHash=' . $nonceHash . PHP_EOL);
//print ('sumNonce=' . $sumNonce . PHP_EOL);
- //print ('sumModula=' . $sumModula . PHP_EOL);
+ //print ('sumModula=' . $GLOBALS['sum_modula'] . PHP_EOL);
} // END - while
// If the iteration is zero, then no hash is found
} // 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);
$timeBlock = abs(microtime(TRUE) - $timeBlock);
// Calculate reward
- $reward = abs($timeBlock - $timeBadHashes) / $hashrate * $GLOBALS['hashes_block'] / BLOCK_SIZE * 1000;
+ $reward = abs($timeBlock - $timeBadHashes) / $hashrate * $GLOBALS['hashes_block'] / $GLOBALS['block_size'] * 1000;
print ('timeBlock=' . $timeBlock . ',timeBadHashes=' . $timeBadHashes . ',hashesPerBlock=' . $GLOBALS['hashes_block'] .',reward=' . $reward . PHP_EOL);
// Block completed
$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;
projects / core.git / blobdiff