Memory-hard function: Difference between revisions

Content deleted Content added
A40585 (talk | contribs)
Update some of the grammar and style, added a citation, there is still some improving to be done here.
Line 5:
 
== Memory hard measure ==
There are different ways to measure the memory hardness of a function. A commonly seen measure is Cumulative Memory Complexity (CMC). In a parallel model, CMC is the sum of the memory required to compute a function over every time step of the computation.<ref>(AS15) Alwen, Serbineko, [https://eprint.iacr.org/2014/238.pdf ''High Parallel Complexity Graphs and Memory-Hard Functions''], 2015</ref><ref>{{Citecite journalarxiv |last=Alwen |first=Joel |last2=Blocki |first2=Jeremiah |last3=Pietrzak |first3=Krzysztof |date=2017-07-07 |title=Sustained Space Complexity |url=http://arxiv.org/abs/1705.05313 |journal=arXiv:1705.05313 [cs]}}</ref>
 
Another viable measure is integrating memory against physical time.<ref>(MO16) Moran, Orlov, [https://eprint.iacr.org/2016/035.pdf ''Simple Proofs of Space-Time and Rational Proofs of Storage''], 2016</ref>