Content deleted Content added
No edit summary |
Cwmhiraeth (talk | contribs) Added tags to the page using Page Curation (refimprove, original research) |
||
Line 1:
{{Multiple issues|{{refimprove|date=December 2019}}{{original research|date=December 2019}}}}
In [[cryptography]], a '''memory hard function''' (MHF) is a function that costs 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]].
| |||