| 
									
										
										
										
											2025-04-28 20:12:27 +00:00
										 |  |  | /* | 
					
						
							|  |  |  | 	GoToSocial | 
					
						
							|  |  |  | 	Copyright (C) GoToSocial Authors admin@gotosocial.org | 
					
						
							|  |  |  | 	SPDX-License-Identifier: AGPL-3.0-or-later | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 	This program is free software: you can redistribute it and/or modify | 
					
						
							|  |  |  | 	it under the terms of the GNU Affero General Public License as published by | 
					
						
							|  |  |  | 	the Free Software Foundation, either version 3 of the License, or | 
					
						
							|  |  |  | 	(at your option) any later version. | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 	This program is distributed in the hope that it will be useful, | 
					
						
							|  |  |  | 	but WITHOUT ANY WARRANTY; without even the implied warranty of | 
					
						
							|  |  |  | 	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the | 
					
						
							|  |  |  | 	GNU Affero General Public License for more details. | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 	You should have received a copy of the GNU Affero General Public License | 
					
						
							|  |  |  | 	along with this program.  If not, see <http://www.gnu.org/licenses/>.
 | 
					
						
							|  |  |  | */ | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2025-05-03 16:45:25 +00:00
										 |  |  | import sha256 from "./sha256"; | 
					
						
							| 
									
										
										
										
											2025-04-28 20:12:27 +00:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2025-05-03 16:45:25 +00:00
										 |  |  | let compute = async function(challengeStr, diffStr) { | 
					
						
							| 
									
										
										
										
											2025-04-28 20:12:27 +00:00
										 |  |  | 	const textEncoder = new TextEncoder(); | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2025-05-03 16:45:25 +00:00
										 |  |  | 	// Get difficulty1 as number and generate
 | 
					
						
							|  |  |  | 	// expected zero ASCII prefix to check for.
 | 
					
						
							|  |  |  | 	const diff1 = parseInt(diffStr, 10); | 
					
						
							|  |  |  | 	const zeros = "0".repeat(diff1); | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 	// Calculate hex encoded prefix required to check solution, where we
 | 
					
						
							|  |  |  | 	// need diff1 no. chars in hex, and hex encoding doubles input length.
 | 
					
						
							|  |  |  | 	const prefixLen = diff1 / 2 + (diff1 % 2 != 0 ? 2 : 0); | 
					
						
							| 
									
										
										
										
											2025-04-28 20:12:27 +00:00
										 |  |  | 
 | 
					
						
							|  |  |  | 	let nonce = 0; | 
					
						
							|  |  |  | 	while (true) { // eslint-disable-line no-constant-condition
 | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2025-05-03 16:45:25 +00:00
										 |  |  | 		// Create possible solution string from challenge string + nonce.
 | 
					
						
							|  |  |  | 		const solution = textEncoder.encode(challengeStr + nonce.toString()); | 
					
						
							| 
									
										
										
										
											2025-04-28 20:12:27 +00:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2025-05-03 16:45:25 +00:00
										 |  |  | 		// Generate SHA256 hashsum of solution string, and hex encode the
 | 
					
						
							|  |  |  | 		// necessary prefix length we need to check for a valid solution.
 | 
					
						
							|  |  |  | 		const prefixArray = Array.from(sha256(solution).slice(0, prefixLen)); | 
					
						
							|  |  |  | 		const prefixHex = prefixArray.map(b => b.toString(16).padStart(2, "0")).join(""); | 
					
						
							| 
									
										
										
										
											2025-04-28 20:12:27 +00:00
										 |  |  | 
 | 
					
						
							|  |  |  | 		// Check if the hex encoded hash has
 | 
					
						
							|  |  |  | 		// difficulty defined zeroes prefix.
 | 
					
						
							| 
									
										
										
										
											2025-05-03 16:45:25 +00:00
										 |  |  | 		if (prefixHex.startsWith(zeros)) { | 
					
						
							|  |  |  | 			return nonce; | 
					
						
							| 
									
										
										
										
											2025-04-28 20:12:27 +00:00
										 |  |  | 		} | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 		// Iter.
 | 
					
						
							|  |  |  | 		nonce++; | 
					
						
							|  |  |  | 	} | 
					
						
							|  |  |  | }; | 
					
						
							| 
									
										
										
										
											2025-05-03 16:45:25 +00:00
										 |  |  | 
 | 
					
						
							|  |  |  | onmessage = async function(e) { | 
					
						
							|  |  |  | 	console.log('worker started'); // eslint-disable-line no-console
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 	const challenge = e.data.challenge; | 
					
						
							|  |  |  | 	const difficulty = e.data.difficulty; | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 	// Compute the nonce that produces solution with args.
 | 
					
						
							|  |  |  | 	let nonce = await compute(challenge, difficulty); | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | 	// Post the solution nonce back to caller.
 | 
					
						
							|  |  |  | 	postMessage({ nonce: nonce, done: true }); | 
					
						
							|  |  |  | }; |