mirror of
https://github.com/TecharoHQ/anubis.git
synced 2026-04-10 18:48:44 +00:00
Closes #1159 This uses the binaryen tool wasm2js to compile the Anubis WASM blobs to JavaScript. This produces biblically large (520Ki) outputs when you inline both hashx and sha256 solvers, but this is a tradeoff that I'm willing to accept. The performance is good enough in my testing with JIT enabled. I fear that this may end up being terrible with JIT disabled. I have no idea if this will work on big endian or not. Signed-off-by: Xe Iaso <me@xeiaso.net>
106 lines
2.7 KiB
TypeScript
106 lines
2.7 KiB
TypeScript
import hashx from "../algorithms/wasm/hashx";
|
|
import sha256 from "../algorithms/wasm/sha256";
|
|
|
|
export interface Args {
|
|
data: string;
|
|
difficulty: number;
|
|
nonce: number;
|
|
threads: number;
|
|
algorithm: string;
|
|
}
|
|
|
|
interface AnubisExports {
|
|
anubis_work: (difficulty: number, initialNonce: number, threads: number) => number;
|
|
data_ptr: () => number;
|
|
result_hash_ptr: () => number;
|
|
result_hash_size: () => number;
|
|
set_data_length: (len: number) => void;
|
|
memory: WebAssembly.Memory;
|
|
}
|
|
|
|
const algorithms: Record<string, AnubisExports> = {
|
|
"hashx": hashx as AnubisExports,
|
|
"sha256": sha256 as AnubisExports,
|
|
};
|
|
|
|
addEventListener("message", async (event: MessageEvent<Args>) => {
|
|
const { data, difficulty, threads, algorithm } = event.data;
|
|
let { nonce } = event.data;
|
|
|
|
const obj = algorithms[algorithm];
|
|
if (obj == undefined) {
|
|
throw new Error(`unknown algorithm ${algorithm}, file a bug please`);
|
|
}
|
|
|
|
const {
|
|
anubis_work,
|
|
data_ptr,
|
|
result_hash_ptr,
|
|
result_hash_size,
|
|
set_data_length,
|
|
memory
|
|
} = obj;
|
|
function uint8ArrayToHex(arr: Uint8Array) {
|
|
return Array.from(arr)
|
|
.map((c) => c.toString(16).padStart(2, "0"))
|
|
.join("");
|
|
}
|
|
|
|
function hexToUint8Array(hexString: string): Uint8Array {
|
|
// Remove whitespace and optional '0x' prefix
|
|
hexString = hexString.replace(/\s+/g, '').replace(/^0x/, '');
|
|
|
|
// Check for valid length
|
|
if (hexString.length % 2 !== 0) {
|
|
throw new Error('Invalid hex string length');
|
|
}
|
|
|
|
// Check for valid characters
|
|
if (!/^[0-9a-fA-F]+$/.test(hexString)) {
|
|
throw new Error('Invalid hex characters');
|
|
}
|
|
|
|
// Convert to Uint8Array
|
|
const byteArray = new Uint8Array(hexString.length / 2);
|
|
for (let i = 0; i < byteArray.length; i++) {
|
|
const byteValue = parseInt(hexString.substr(i * 2, 2), 16);
|
|
byteArray[i] = byteValue;
|
|
}
|
|
|
|
return byteArray;
|
|
}
|
|
|
|
// Write data to buffer
|
|
function writeToBuffer(data: Uint8Array) {
|
|
if (data.length > 1024) throw new Error("Data exceeds buffer size");
|
|
|
|
// Get pointer and create view
|
|
const offset = data_ptr();
|
|
const buffer = new Uint8Array(memory.buffer, offset, data.length);
|
|
|
|
// Copy data
|
|
buffer.set(data);
|
|
|
|
// Set data length
|
|
set_data_length(data.length);
|
|
}
|
|
|
|
function readFromChallenge() {
|
|
const offset = result_hash_ptr();
|
|
const buffer = new Uint8Array(memory.buffer, offset, result_hash_size());
|
|
|
|
return buffer;
|
|
}
|
|
|
|
writeToBuffer(hexToUint8Array(data));
|
|
|
|
nonce = anubis_work(difficulty, nonce, threads);
|
|
const challenge = readFromChallenge();
|
|
const result = uint8ArrayToHex(challenge);
|
|
|
|
postMessage({
|
|
hash: result,
|
|
difficulty,
|
|
nonce,
|
|
});
|
|
}); |