In [[cryptography]], a '''Memorymemory hard function''' (MHF) is a family of functionsfunction that costs a significant amount of memory to evaluate. It is different from [[memory bound function]]s, the latter incurs cost by slowing down computation through memory latency. MHFs find their use as a form of [[Proof of work|proof-of-work]].
