Equi-X PoW in WebAssembly

Equi-X proof of work (the one Tor uses): a single module solves in the browser and verifies on the server, with a pure-JavaScript fallback when WebAssembly is disabled. This page measures, on this device, what a proof costs, to choose difficulty thresholds.

Source code · npm package · SHA-256, Argon2id, Equi-X comparison bench · Français

Device

Settings

Effort per part One Equi-X solution in “effort” is kept. Number of parts Several small proofs make the wait more regular. Memory per thread Equihash(n, 3) over HashX: each step doubles the memory and the time of an attempt. The server must verify with the same n. HashX programs Compiling each program makes an attempt over ten times faster in WebAssembly. Parallelism Adaptive (filsAdaptatifs): recommended for the general public web, where too many threads can get a phone tab killed. Web Workers Fixed number, prefilled like the package: one per core, no more than the expected attempts. 0: main thread. Engine The JavaScript engine gives the same proofs, more slowly. Repetitions Time is random: median and 90th percentile need several measurements. Verifications Measured on the first proof, as soon as it is found.

To run exactly the same test on several devices:

Forecasts

Known before any computation, from the settings and the package’s reference measurements (recent x86-64 laptop, one core).

Measurements on this device

Updated after each proof.

Computing the proof

#	Engine	n	Duration	Attempts	Attempts/s	Memory

Verification

Export

To compare several devices, keep these measurements (with the device and the settings, which can be imported again):