Memory-hard function: Difference between revisions

Revision as of 22:50, 28 November 2019

Revision as of 20:18, 2 December 2019

Line 1:

In [[cryptography]], a '''memory hard function''' (MHF) is a function that costs a significant amount of [[Random-access memory|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]].

== Memory hard measure ==