The CuckatooN Proof-of-Work puzzle [1] requires 2^N bits of randomly accessed memory for efficient solving which parallelizes very well. In practice the random

The CuckatooN Proof-of-Work puzzle [1] requires 2^N bits of randomly accessed memory for efficient solving which parallelizes very well. In practice the random access is so slow that an alternative solver using 32 times more memory and mostly sequential access is much faster. [1] https://github.com/tromp/cuckoo https://github.com/tromp/cuckoo