Equihash: Asymmetric Proof-of-Work Based on the Generalized Birthday Problem

This paper shows how to construct an asymmetric proof-of-work (PoW) based on a computationally hard problem, which requires a lot of memory to generate a proof but is instant to verify, and introduces the new technique of algorithm binding to prevent cost amortization.