From 207c3af05bd0370ab9f5559fbe82bec48ac94754 Mon Sep 17 00:00:00 2001 From: Thomas Lynch Date: Sat, 17 Sep 2022 04:04:27 +1000 Subject: [PATCH] Patch some bugs in the updated challenge.js especially related to the fallback mode --- haproxy/js/challenge.js | 14 ++++++-------- 1 file changed, 6 insertions(+), 8 deletions(-) diff --git a/haproxy/js/challenge.js b/haproxy/js/challenge.js index 4ebe130..954c26e 100644 --- a/haproxy/js/challenge.js +++ b/haproxy/js/challenge.js @@ -1,4 +1,5 @@ function finishPow(combined, answer) { + document.cookie='z_ddos_pow='+combined+'#'+answer+';expires=Thu, 31-Dec-37 23:55:55 GMT; path=/; SameSite=Strict; '+(location.protocol==='https:'?'Secure=true; ':''); const submitButton = document.querySelector('input[type=submit]') if (submitButton) { //button is shown only if captcha is enabled @@ -21,7 +22,6 @@ if (window.Worker && crypto.subtle) { workers.forEach(w => w.terminate()); const [workerId, answer] = e.data; console.log('Worker', workerId, 'returned answer', answer, 'in', Date.now()-start+'ms'); - document.cookie='z_ddos_pow='+combined+'#'+answer+';expires=Thu, 31-Dec-37 23:55:55 GMT; path=/; SameSite=Strict; '+(location.protocol==='https:'?'Secure=true; ':''); const dummyTime = 5000 - (Date.now()-start); window.setTimeout(() => finishPow(combined, answer), dummyTime); } @@ -35,19 +35,17 @@ if (window.Worker && crypto.subtle) { } else { console.warn('No webworker or crypto.subtle support, using legacy method in main/UI thread!'); function sha256(ascii){function rightRotate(value,amount){return(value>>>amount)|(value<<(32-amount))};var mathPow=Math.pow;var maxWord=mathPow(2,32);var lengthProperty='length';var i,j;var result='';var words=[];var asciiBitLength=ascii[lengthProperty]*8;var hash=sha256.h=sha256.h||[];var k=sha256.k=sha256.k||[];var primeCounter=k[lengthProperty];var isComposite={};for(var candidate=2;primeCounter<64;candidate+=1){if(!isComposite[candidate]){for(i=0;i<313;i+=candidate){isComposite[i]=candidate}hash[primeCounter]=(mathPow(candidate,.5)*maxWord)|0;k[primeCounter++]=(mathPow(candidate,1/3)*maxWord)|0}}ascii+='\x80';while(ascii[lengthProperty]%64-56){ascii+='\x00';}for(i=0;i>8){return;}words[i>>2]|=j<<((3-i)%4)*8}words[words[lengthProperty]]=((asciiBitLength/maxWord)|0);words[words[lengthProperty]]=(asciiBitLength);for(j=0;j>>3))+w[i-7]+(rightRotate(w2,17)^rightRotate(w2,19)^(w2>>>10)))|0);var temp2=(rightRotate(a,2)^rightRotate(a,13)^rightRotate(a,22))+((a&hash[1])^(a&hash[2])^(hash[1]&hash[2]));hash=[(temp1+temp2)|0].concat(hash);hash[4]=(hash[4]+temp1)|0}for(i=0;i<8;i+=1){hash[i]=(hash[i]+oldHash[i])|0}}for(i=0;i<8;i+=1){for(j=3;j+1;j-=1){var b=(hash[i]>>(j*8))&255;result+=((b<16)?0:'')+b.toString(16)}}return result} - let challengeIndex = parseInt(challenge[0], 16); + const challengeIndex = parseInt(challenge[0], 16)*2; let i = 0 , result; while(true) { result = sha256(challenge+i); - if(result[challengeIndex] === 0x00 - && result[challengeIndex+1] === 0x41){ - console.log('Worker thread found solution:', i); - postMessage([id, i]); + if (result.substring(challengeIndex, challengeIndex+4) === '0041'){ + console.log('Main thread found solution:', i, result); break; } - i++; + ++i; } const dummyTime = 5000 - (Date.now()-start); - window.setTimeout(() => finishPow(combined, result), dummyTime); + window.setTimeout(() => finishPow(combined, i), dummyTime); }