Equihash 算法发明者的原版论文
作者: Alex Biryukov, Dmitry Khovratovich
In this paper we solve this open problem and show how to construct an
asymmetric proof-of-work (PoW) based on a computationally-hard problem, which requires
a great deal of memory to generate a proof (called a ”memory-hardness” feature) but is instant
to verify. Our primary proposal, Equihash, is a PoW based on the generalized birthday problem
and enhanced Wagner’s algorithm for it.
