Tor 0.4.9.2-alpha-dev
|
Equi-X is a CPU-friendly client puzzle with fast verification and small solution size (16 bytes). It is based on Equihash(60,3) with two major changes:
An Equi-X solution for nonce X
is a set of eight 16-bit indices i0, ..., i7
such that:
HX(i0) + HX(i1) + HX(i2) + HX(i3) + HX(i4) + HX(i5) + HX(i6) + HX(i7) = 0 (mod 260)
where HX
is a HashX function generated for nonce X
. Equi-X is therefore a variant of the subset sum problem. Each nonce value provides 2 solutions on average.
Equi-X also has additional requirements that prove that the solution was found using the Wagner's algorithm. See the Equihash paper for details.
Algorithm | n | k | memory | solution size | verification 1 | CPU perf. 2 | GPU perf. 3 |
---|---|---|---|---|---|---|---|
Equi-X | 60 | 3 | 1.8 MiB | 16 bytes | ~50 μs | 2400 Sol/s | ? |
Zcash | 200 | 9 | 144 MiB | 1344 bytes | >150 μs | 30 Sol/s | ~400 Sol/s 4 |
BTG | 144 | 5 | 2.5 GiB | 100 bytes | ~10 μs | 1 Sol/s | ~45 Sol/s 5 |
See devlog.md
You can support the development of Equi-X by sending XMR to this address: