Memory-hard function: Difference between revisions

Revision as of 12:16, 8 November 2020

Revision as of 00:25, 6 January 2021

Line 1:

{{short description|Computer algorithm that requires a lot of memory}}

{{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 significant amount of [[random-access memory|memory]] to evaluate. It is different from a [[memory-bound function]]; the latter incurs cost by slowing down computation through memory latency. MHFs find their use as a form of [[proof of work]].