Memory-hard function

This is an old revision of this page, as edited by Cassiopeia (talk | contribs) at 05:47, 19 November 2019 (CASSIOPEIA moved page Memory hard function to Draft:Memory hard function without leaving a redirect: Undersourced, incubate in draftspace (via script)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Memory hard function (MHF) is a family of functions that costs a significant amount of memory to evaluate. It is different from memory bound functions, the latter incurs cost by slowing down computation through memory latency. MHFs find their use as a form of proof-of-work.

Memory hard measure

There are different ways to measure the memory hardness of a function. A commonly seen measure is Cumulative Memory Complexity.