Fix #577 Now displays all potential proofs with at least 3 zeros (constant defined)

app/lib/computation/blockProver.js

@@ -150,12 +150,11 @@ function BlockGenerator() {
 
         if (!msg.found) {
           const pow = msg.pow;
-          for (let i = 5; i >= 3; i--) {
-            const lowPowRegexp = new RegExp('^0{' + (i) + '}[^0]');
-            if (pow.match(lowPowRegexp)) {
-              logger.info('Matched %s zeros %s with Nonce = %s for block#%s', i, pow, msg.block.nonce, msg.block.number);
-              break;
-            }
+          const lowPowRegexp = new RegExp('^(0{2,})[^0]');
+          const matches = pow.match(lowPowRegexp);
+          // We log only proof with at least 3 zeros
+          if (matches && matches[1].length >= constants.PROOF_OF_WORK.MINIMAL_TO_SHOW) {
+            logger.info('Matched %s zeros %s with Nonce = %s for block#%s', matches[1].length, pow, msg.block.nonce, msg.block.number);
           }
         }
         // Continue...

app/lib/constants.js

@@ -257,6 +257,7 @@ module.exports = {
     TEST_PEERS_INTERVAL: 10 // In seconds
   },
   PROOF_OF_WORK: {
+    MINIMAL_TO_SHOW: 3,
     EVALUATION: 1000,
     RELEASE_MEMORY: 10000,
     UPPER_BOUND: [

app/lib/proof.js

@@ -79,7 +79,7 @@ process.on('message', (stuff) => co(function*() {
       if (charOK) {
         found = pow[nbZeros].match(new RegExp('[0-' + highMark + ']'));
       }
-      if (!found && nbZeros > 0 && j >= Math.max(1, nbZeros - 2)) {
+      if (!found && nbZeros > 0 && j >= constants.PROOF_OF_WORK.MINIMAL_TO_SHOW) {
         yield pSend({ found: false, pow: pow, block: block, nbZeros: nbZeros });
       }
       testsCount++;