@anonympins/fingerprint 0.6.7 → 0.7.1

package/src/js/mongodb-store.js

@@ -49,7 +49,7 @@ export function createMongoDbStore(db, collectionName = 'fingerprint_store') {
         reconnecting = false;
         clearInterval(interval);
       } catch (err) {
-        // Toujours déconnecté
+        // Connection still down, continue retry loop
       }
     }, 5000);
     if (interval.unref) interval.unref();

package/src/js/optimization.worker.js

@@ -1,28 +1,28 @@
-/**
- * @file @/optimization.worker.js
- * @description Web Worker générique pour exécuter les algorithmes d'optimisation de la bibliothèque `Optimization`.
- * Ce script s'exécute sur un thread séparé pour ne pas bloquer l'interface utilisateur.
- */
-
-import {parentPort, workerData} from 'worker_threads';
-import {Optimization} from './library.js'; // Assurez-vous que le chemin est correct
-
-if (parentPort) {
-    parentPort.on('message', async () => { // Le message est vide, on utilise workerData
-        const { solverName, solverArgs } = workerData;
-
-        // Gérer les solveurs imbriqués (ex: 'Operators.solvePortfolio')
-        const solverFunction = solverName.split('.').reduce((obj, prop) => obj && obj[prop], Optimization);
-
-        if (typeof solverFunction === 'function') {
-            try {
-                const result = await solverFunction(...solverArgs);
-                parentPort.postMessage(result);
-            } catch (error) {
-                parentPort.postMessage({ error: error.message, stack: error.stack });
-            }
-        } else {
-            parentPort.postMessage({ error: `Solver '${solverName}' not found or is not a function in Optimization library.` });
-        }
-    });
+/**
+ * @file @/optimization.worker.js
+ * @description Generic Web Worker running optimization routines from `Optimization`.
+ * Runs on a dedicated worker thread to maintain main thread responsiveness.
+ */
+
+import {parentPort, workerData} from 'worker_threads';
+import {Optimization} from './library.js';
+
+if (parentPort) {
+    parentPort.on('message', async () => { // Empty message payload; parameters loaded via workerData
+        const { solverName, solverArgs } = workerData;
+
+        // Resolve nested solver paths (e.g. 'Operators.solvePortfolio')
+        const solverFunction = solverName.split('.').reduce((obj, prop) => obj && obj[prop], Optimization);
+
+        if (typeof solverFunction === 'function') {
+            try {
+                const result = await solverFunction(...solverArgs);
+                parentPort.postMessage(result);
+            } catch (error) {
+                parentPort.postMessage({ error: error.message, stack: error.stack });
+            }
+        } else {
+            parentPort.postMessage({ error: `Solver '${solverName}' not found or is not a function in Optimization library.` });
+        }
+    });
 }

package/src/js/pow.solver.inline.js

@@ -1,20 +1,107 @@
 /**
  * @file @/pow.solver.inline.js
- * @description Contient les fonctions côté client pour résoudre les différents types de challenges Proof-of-Work.
- * Fichier compatible avec l'injection directe dans un script HTML (sans `export`).
+ * @description Client-side functions to solve various Proof-of-Work challenges.
+ * Compatible with direct HTML script injection (no `export`).
  */
 
 'use strict';
 
 function secureRandom() {
-    if (typeof window !== 'undefined' && (window.crypto || window.msCrypto)) {
+    if (typeof globalThis !== 'undefined' && globalThis.crypto && globalThis.crypto.getRandomValues) {
         const array = new Uint32Array(1);
-        (window.crypto || window.msCrypto).getRandomValues(array);
-        return array[0] / 0x100000000;
+        globalThis.crypto.getRandomValues(array);
+        return array[0] / 0xffffffff;
     }
     return Math.random();
 }
+function sha256Sync(bytes) {
+    if (bytes instanceof ArrayBuffer) {
+        bytes = new Uint8Array(bytes);
+    } else if (typeof bytes === 'string') {
+        bytes = new TextEncoder().encode(bytes);
+    } else if (ArrayBuffer.isView(bytes) && !(bytes instanceof Uint8Array)) {
+        bytes = new Uint8Array(bytes.buffer, bytes.byteOffset, bytes.byteLength);
+    }
+
+    var l = bytes.length;
+    var bitLen = l * 8;
+    var K = new Uint32Array([
+        0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
+        0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
+        0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76ca1422,
+        0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
+        0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
+        0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
+        0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
+        0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2
+    ]);
+    var H = new Uint32Array([
+        0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a,
+        0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19
+    ]);
+
+    // Standard SHA-256 padding
+    var padLen = (((l + 8) >> 6) + 1) << 6;
+    var buf = new Uint8Array(padLen);
+    buf.set(bytes);
+    buf[l] = 0x80;
+
+    var view = new DataView(buf.buffer);
+    // 64-bit big-endian length in bits (padLen - 8)
+    var highBitLen = Math.floor(bitLen / 0x100000000);
+    view.setUint32(padLen - 8, highBitLen >>> 0);
+    view.setUint32(padLen - 4, bitLen >>> 0);
+
+    var W = new Int32Array(64);
+    for (var i = 0; i < padLen; i += 64) {
+        for (var t = 0; t < 16; t++) {
+            // Explicit big-endian read (false)
+            W[t] = view.getInt32(i + t * 4, false);
+        }
+        for (var t = 16; t < 64; t++) {
+            var s0 = ((W[t - 15] >>> 7) | (W[t - 15] << 25)) ^ ((W[t - 15] >>> 18) | (W[t - 15] << 14)) ^ (W[t - 15] >>> 3);
+            var s1 = ((W[t - 2] >>> 17) | (W[t - 2] << 15)) ^ ((W[t - 2] >>> 19) | (W[t - 2] << 13)) ^ (W[t - 2] >>> 10);
+            W[t] = (W[t - 16] + s0 + W[t - 7] + s1) | 0;
+        }
+        var a = H[0], b = H[1], c = H[2], d = H[3], e = H[4], f = H[5], g = H[6], h = H[7];
+        for (var t = 0; t < 64; t++) {
+            var S1 = ((e >>> 6) | (e << 26)) ^ ((e >>> 11) | (e << 21)) ^ ((e >>> 25) | (e << 7));
+            var ch = (e & f) ^ ((~e) & g);
+            var temp1 = (h + S1 + ch + K[t] + W[t]) | 0;
+            var S0 = ((a >>> 2) | (a << 30)) ^ ((a >>> 13) | (a << 19)) ^ ((a >>> 22) | (a << 10));
+            var maj = (a & b) ^ (a & c) ^ (b & c);
+            var temp2 = (S0 + maj) | 0;
+            h = g; g = f; f = e; e = (d + temp1) | 0;
+            d = c; c = b; b = a; a = (temp1 + temp2) | 0;
+        }
+        H[0] = (H[0] + a) | 0;
+        H[1] = (H[1] + b) | 0;
+        H[2] = (H[2] + c) | 0;
+        H[3] = (H[3] + d) | 0;
+        H[4] = (H[4] + e) | 0;
+        H[5] = (H[5] + f) | 0;
+        H[6] = (H[6] + g) | 0;
+        H[7] = (H[7] + h) | 0;
+    }
+    var hex = '';
+    for (var i = 0; i < 8; i++) {
+        hex += (H[i] >>> 0).toString(16).padStart(8, '0');
+    }
+    return hex;
+}
 
+async function safeDigestSha256Hex(bytes) {
+    const cryptoObj = (typeof globalThis !== 'undefined' && globalThis.crypto) ? globalThis.crypto : (typeof window !== 'undefined' ? window.crypto : null);
+    if (cryptoObj && cryptoObj.subtle && typeof cryptoObj.subtle.digest === 'function') {
+        try {
+            const buf = await cryptoObj.subtle.digest("SHA-256", bytes);
+            return Array.from(new Uint8Array(buf)).map(b => b.toString(16).padStart(2, '0')).join('');
+        } catch (e) {
+            // Fallback on failure
+        }
+    }
+    return sha256Sync(bytes);
+}
 function cyrb53(str, seed = 0) {
     const safeStr = (typeof str === 'string' ? str : String(str || '')).slice(0, 10000);
     let h1 = 0xdeadbeef ^ seed,
@@ -53,6 +140,25 @@ function generateBlock(seed, blockIndex, blockSize = 1024) {
     return block;
 }
 
+async function readSpaceBlock(blockIdx) {
+    const db = await openDb();
+    const transaction = db.transaction("blocks", "readonly");
+    const store = transaction.objectStore("blocks");
+    const getReq = store.get(blockIdx);
+    return new Promise((resolve, reject) => {
+        getReq.onsuccess = () => {
+            const block = getReq.result;
+            if (block) {
+                const hex = Array.from(block).map(b => b.toString(16).padStart(2, '0')).join('');
+                resolve(hex);
+            } else {
+                reject(new Error("Block not found"));
+            }
+        };
+        getReq.onerror = () => reject(getReq.error);
+    });
+}
+
 async function loadTfjs() {
     if (typeof tf !== 'undefined') return tf;
     if (typeof window !== 'undefined') {
@@ -149,12 +255,11 @@ async function solveSpaceChallenge(seed, queries, nonce, clientSecret, peerBlock
     const finalBlock = new Uint8Array(finalCombined.length + nonceBytes.length);
     finalBlock.set(finalCombined);
     finalBlock.set(nonceBytes, finalCombined.length);
-    
-    const buf = await crypto.subtle.digest("SHA-256", finalBlock);
-    return Array.from(new Uint8Array(buf)).map(b => b.toString(16).padStart(2, '0')).join('');
+
+    return await safeDigestSha256Hex(finalBlock);
 }
 
-// --- Fonctions d'optimisation copiées/adaptées de library.js pour le client ---
+// --- Optimization functions adapted from library.js for client usage ---
 
 function paretoDominates(objectivesA, objectivesB) {
     let aIsBetterInOne = false;
@@ -475,7 +580,7 @@ const ClientOptimizers = {
 
         const mutate = (solution) => {
             const newSolution = [...solution];
-            const i = Math.floor(Math.random() * 4);
+            const i = Math.floor(secureRandom() * 4);
             const mutationFactors = [500, 1000, 0.1, 2];
             newSolution[i] += (secureRandom() - 0.5) * mutationFactors[i];
             return newSolution;
@@ -717,11 +822,11 @@ async function solveOptimizationTask(initialPopulation, generations) {
 }
 
 /**
- * Résout un challenge CPU basé sur une cible en utilisant un bloc de base binaire.
- * @param {Uint8Array} baseBlock - Le bloc de données initial (nonce, secret, fp) fourni par le serveur.
- * @param {bigint} target - La cible à atteindre.
- * @param {Function} progressCallback - Callback pour les mises à jour de progression.
- * @returns {Promise<number>} La solution (un nombre entier).
+ * Solves a target-based CPU challenge using a binary base block.
+ * @param {Uint8Array} baseBlock - Initial data block (nonce, secret, fp) provided by the server.
+ * @param {bigint} target - Target difficulty to reach.
+ * @param {Function} progressCallback - Progress update callback.
+ * @returns {Promise<number>} Solution integer.
 */
 async function solveCpuTargetInline(baseBlock, target, progressCallback) {
     // --- FIX: Add validation for the target to prevent BigInt conversion errors ---
@@ -741,33 +846,74 @@ async function solveCpuTargetInline(baseBlock, target, progressCallback) {
         const targetStr = typeof target === 'string' ? target : target.toString(16);
         const targetPtr = wasmModule._malloc(targetStr.length + 1);
         for (let i = 0; i < targetStr.length; i++) {
-            wasmModule.HEAP8[targetPtr + i] = targetStr.charCodeAt(i);
+            wasmModule.HEAPU8[targetPtr + i] = targetStr.charCodeAt(i);
+        }
+        wasmModule.HEAPU8[targetPtr + targetStr.length] = 0; // Null-terminator
+        try {
+            const solution = wasmModule._solve_cpu_target(ptr, len, targetPtr);
+            return solution;
+        } finally {
+            wasmModule._free(ptr);
+            wasmModule._free(targetPtr);
         }
-        wasmModule.HEAP8[targetPtr + targetStr.length] = 0;
-        const solution = wasmModule._solve_cpu_target(ptr, len, targetPtr);
-        wasmModule._free(ptr);
-        wasmModule._free(targetPtr);
-        return solution;
     }
 
         // Try Web Worker execution first if supported and not blocked by CSP
         if (typeof window !== 'undefined' && typeof Worker !== 'undefined') {
             try {
+                const staticWorkerPath = window.ClientLibrary?.workerPath || (window.ClientConfig && window.ClientConfig.workerPath);
+                const sha256FnStr = sha256Sync.toString();
+                if (staticWorkerPath) {
+                    return await new Promise((resolve, reject) => {
+                        const worker = new Worker(staticWorkerPath);
+                        worker.onmessage = (event) => {
+                            if (event.data && event.data.type === 'progress') {
+                                if (progressCallback) progressCallback(event.data.solution);
+                            } else if (event.data && event.data.type === 'success') {
+                                resolve(event.data.solution);
+                                worker.terminate();
+                            } else if (event.data && event.data.solution !== undefined) {
+                                // Fallback for backward compatibility with previous signature
+                                resolve(event.data.solution);
+                                worker.terminate();
+                            }
+                        };
+                        worker.onerror = (err) => {
+                            worker.terminate();
+                            reject(err);
+                        };
+                        worker.postMessage({ baseBlock, target: cpuTarget.toString() });
+                    });
+                }
                 return await new Promise((resolve, reject) => {
                     const workerCode = `
                         self.onmessage = async (e) => {
                             const { baseBlock, target } = e.data;
                             const cpuTarget = BigInt(target);
                             const encoder = new TextEncoder();
-                            let cpuSolution = 0;
+                            const hasSubtle = typeof self.crypto !== 'undefined' && self.crypto && self.crypto.subtle && typeof self.crypto.subtle.digest === 'function';
+                             const sha256Fallback = ${sha256FnStr};
+                             let cpuSolution = 0;
                             while (true) {
                                 const solutionBytes = encoder.encode(String(cpuSolution));
                                 const finalBlock = new Uint8Array(baseBlock.length + solutionBytes.length);
                                 finalBlock.set(baseBlock);
                                 finalBlock.set(solutionBytes, baseBlock.length);
-                                const buf = await crypto.subtle.digest("SHA-256", finalBlock);
-                                const hashHex = Array.from(new Uint8Array(buf)).map(b => b.toString(16).padStart(2, '0')).join('');
-                                if (BigInt('0x' + hashHex) < cpuTarget) break;
+                                let hashHex = '';
+                                 if (hasSubtle) {
+                                     try {
+                                         const buf = await self.crypto.subtle.digest("SHA-256", finalBlock);
+                                         const arr = new Uint8Array(buf);
+                                         for (let j = 0; j < arr.length; j++) {
+                                             hashHex += arr[j].toString(16).padStart(2, '0');
+                                         }
+                                     } catch (subtleErr) {
+                                         hashHex = sha256Fallback(finalBlock);
+                                     }
+                                 } else {
+                                     hashHex = sha256Fallback(finalBlock);
+                                 }
+                                 if (BigInt('0x' + hashHex) < cpuTarget) break;
                                 cpuSolution++;
                                 if (cpuSolution % 25000 === 0) {
                                     self.postMessage({ type: 'progress', solution: cpuSolution });
@@ -802,24 +948,23 @@ async function solveCpuTargetInline(baseBlock, target, progressCallback) {
     while (true) {
         const solutionBytes = encoder.encode(String(cpuSolution));
         
-        // Concaténation binaire directe : c'est plus rapide et plus sûr.
+        // Direct binary concatenation: faster and safer.
         const finalBlock = new Uint8Array(baseBlock.length + solutionBytes.length);
         finalBlock.set(baseBlock);
         finalBlock.set(solutionBytes, baseBlock.length);
 
         if (cpuSolution === 0) {
-            // Pour le débogage, on peut afficher le message reconstruit.
+            // For debugging, print reconstructed message.
             const reconstructedMsg = new TextDecoder().decode(finalBlock);
             console.log(`[FP Client Solve] Hashing message: "${reconstructedMsg}"`);
         }
 
-        const buf = await crypto.subtle.digest("SHA-256", finalBlock);
-        const hashHex = Array.from(new Uint8Array(buf)).map(b => b.toString(16).padStart(2, '0')).join('');
-        // --- AJOUT DE LOGS POUR LE DÉBOGAGE CÔTÉ CLIENT ---
+        const hashHex = await safeDigestSha256Hex(finalBlock);
+        // --- CLIENT-SIDE DEBUG LOGS ---
         if (cpuSolution === 0) { // Log only the first attempt
             console.log(`[FP Client Solve] Attempt 0 hash: "0x${hashHex}"`);
         }
-        // --- FIN DES LOGS ---
+        // --- END DEBUG LOGS ---
         if (BigInt('0x' + hashHex) < cpuTarget) break;
         cpuSolution++;
             if (cpuSolution % 50000 === 0) {
@@ -835,28 +980,28 @@ async function solveCpuTargetInline(baseBlock, target, progressCallback) {
 }
 
 /**
- * Résout un challenge CPU basé sur une cible (version Web Worker).
- * @param {string} message - Le message à hasher (ex: `ip:nonce:solution:secret`).
- * @param {bigint} target - La cible à atteindre.
- * @returns {Promise<number>} La solution (un nombre entier).
+ * Solves a target-based CPU challenge (Web Worker version).
+ * @param {string} message - Message to hash (e.g. `ip:nonce:solution:secret`).
+ * @param {bigint} target - Target difficulty to reach.
+ * @returns {Promise<number>} Solution integer.
  */
 async function solveCpuTarget(message, target) {
     // Vérifie si les Web Workers sont supportés par le navigateur.
     if (typeof(Worker) === "undefined") {
         console.warn("Web Workers not supported. Falling back to main thread calculation (UI may freeze).");
-        // Ici, on pourrait remettre l'ancienne implémentation comme solution de secours.
-        // Pour la clarté, nous supposons que les workers sont disponibles.
+        // An inline fallback implementation could be placed here if needed.
+        // For clarity, we assume workers are available.
         throw new Error("Web Worker support is required for CPU challenges.");
     }
 
     return new Promise((resolve, reject) => {
-        // Crée un worker à partir du script dédié. Le chemin doit être accessible publiquement.
-        // Assurez-vous que `pow.worker.js` est servi par votre serveur statique.
+        // Create worker from dedicated script. The path must be publicly accessible.
+        // Ensure `pow.worker.js` is served by your static file server.
         const worker = new Worker('./pow.worker.js');
 
         worker.onmessage = (event) => {
             resolve(event.data.solution);
-            worker.terminate(); // Nettoie le worker une fois le travail terminé.
+            worker.terminate(); // Clean up worker once finished.
         };
 
         worker.onerror = (error) => {
@@ -864,16 +1009,16 @@ async function solveCpuTarget(message, target) {
             worker.terminate();
         };
 
-        // Envoie les données du challenge au worker pour qu'il commence le calcul.
+        // Send challenge data to worker to begin computation.
         worker.postMessage({ message, target });
     });
 }
 
 /**
- * Résout un challenge basé sur la mémoire.
- * @param {string} seed - La graine pour l'initialisation de la mémoire.
- * @param {number} difficulty - La difficulté (en Mo).
- * @returns {Promise<number>} La solution (nombre entier).
+ * Solves a memory-hard challenge.
+ * @param {string} seed - Seed for memory initialization.
+ * @param {number} difficulty - Difficulty in MB.
+ * @returns {Promise<number>} Solution integer.
  */
 async function solveMemory(seed, difficulty) {
     const wasmModule = typeof window !== 'undefined' ? (window.wasmModule || (window.ClientLibrary && window.ClientLibrary.wasmModule)) : null;
@@ -895,8 +1040,7 @@ async function solveMemory(seed, difficulty) {
     if (numBlocks === 0) return { solution: 0, merkleRoot: '', proofs: {} };
 
     async function hashBlock(block) {
-        const buf = await crypto.subtle.digest("SHA-256", block.buffer);
-        return Array.from(new Uint8Array(buf)).map(b => b.toString(16).padStart(2, '0')).join('');
+        return await safeDigestSha256Hex(block.buffer);
     }
 
     function hexToBytes(hex) {
@@ -927,8 +1071,7 @@ async function solveMemory(seed, difficulty) {
             const left = currentLayer[i];
             const right = currentLayer[i + 1] || left;
             const combined = hexToBytes(left + right);
-            const hashBuf = await crypto.subtle.digest("SHA-256", combined);
-            const hashHex = Array.from(new Uint8Array(hashBuf)).map(b => b.toString(16).padStart(2, '0')).join('');
+            const hashHex = await safeDigestSha256Hex(combined);
             nextLayer.push(hashHex);
         }
         tree.push(nextLayer);
@@ -977,12 +1120,12 @@ async function solveMemory(seed, difficulty) {
 }
 
 /**
- * Résout un challenge de type "Problème du Voyageur de Commerce" (TSP).
- * NOTE: Ceci est une implémentation simple (heuristique du plus proche voisin) et n'est pas garantie
- * de trouver la solution optimale, mais elle est suffisante pour un challenge.
- * @param {Array<{x: number, y: number}>} cities - Les coordonnées des villes.
- * @param {number} targetMaxDistance - La distance maximale acceptable.
- * @returns {Promise<{path: number[], distance: number}>} Le chemin et la distance.
+ * Solves a Traveling Salesperson Problem (TSP) challenge.
+ * NOTE: Uses a nearest-neighbor heuristic which may not find the global optimum,
+ * but is sufficient for verification challenges.
+ * @param {Array<{x: number, y: number}>} cities - City coordinates.
+ * @param {number} targetMaxDistance - Maximum acceptable distance.
+ * @returns {Promise<{path: number[], distance: number}>} Tour path and distance.
  */
 async function solveTsp(cities, targetMaxDistance) {
     // Utility function to calculate the distance between two cities
@@ -1041,9 +1184,9 @@ async function solveTsp(cities, targetMaxDistance) {
 }
 
 /**
- * Fonction principale qui reçoit un objet challenge et le résout.
- * @param {object} challenge - L'objet challenge reçu du serveur.
- * @returns {Promise<object>} Un objet contenant la ou les solutions.
+ * Main entry point to resolve a received challenge payload.
+ * @param {object} challenge - Challenge payload received from the server.
+ * @returns {Promise<object>} Object containing solution(s).
  */
 async function solveChallenge(challenge, fingerprint = '') { // fingerprint parameter was already here, but unused in some calls
     const { type, nonce, clientSecret, cpuTarget, memDifficulty, cities, clientIp, targetMaxDistance, queries, sizeMb } = challenge;
@@ -1069,7 +1212,7 @@ async function solveChallenge(challenge, fingerprint = '') { // fingerprint para
             solutions.cpu = await solveCpuTargetInline(baseBlockBytes, target, null);
             break;
         case 'cpu_mem':
-            // Pour les appels API, le client IP n'est pas connu, on ne le met pas dans le message
+            // For API calls, client IP is omitted from client-side message reconstruction
             const memSeed = `:${nonce}:${clientSecret}`;
             const [cpuSol, memSol] = await Promise.all([
                 (async () => {
@@ -1083,7 +1226,7 @@ async function solveChallenge(challenge, fingerprint = '') { // fingerprint para
             solutions.mem = memSol;
             break;
         case 'cpu_mem_inline':
-            // Version inline pour compatibilité HTML avec IP incluse
+            // Inline version for HTML compatibility with IP
             const memSeedInline = `:${nonce}:${clientSecret}`;
             const [cpuSolInline, memSolInline] = await Promise.all([
                 (async () => {
@@ -1112,11 +1255,12 @@ async function solveChallenge(challenge, fingerprint = '') { // fingerprint para
     return solutions;
 }
 
-// --- Compatibilité pour l'injection directe dans le HTML ---
-// Si le script est chargé dans un navigateur (window existe), on attache les fonctions nécessaires à window.
+// --- Direct HTML script injection compatibility ---
+// If loaded in browser context (window exists), expose methods on window.
 if (typeof window !== 'undefined') {
     window.solveCpuChallengeInline = solveCpuTargetInline;
     window.solveMemoryChallenge = solveMemory;
+    window.readSpaceBlock = readSpaceBlock;
     window.solveTspChallenge = solveTsp;
     window.solveChallenge = solveChallenge;
 }