Memory-hard function: Difference between revisions

Content deleted Content added
Copyedit. (This may be my first edit on Wikipedia, so please be gentle)
mNo edit summary
Line 2:
{{Multiple issues|{{More citations needed|date=December 2019}}{{original research|date=December 2019}}{{tone|date=January 2021}}}}
 
In [[cryptography]], a '''memory-hard function''' (MHF) is a function that costs a significant amount of [[random-access memory|memory]] to evaluate. It differs from a [[memory-bound function|memory-bound]] function, which incurs cost by slowing down computation through memory latency. MHFs can be used as [[proof of work]].
 
== Memory hard measure ==