Revision as of 19:39, 26 December 2022 edit B.hogansnhu.edu (talk \| contribs) 3 edits m minor! sent.2-it is different_to_it differs, sent.3 MHFs are sometimes used in_to_use mhfs in items such as Tags: Newcomer task Newcomer task: copyedit ← Previous edit		Revision as of 19:41, 26 December 2022 edit undo B.hogansnhu.edu (talk \| contribs) 3 edits m →Memory hard measure: sent. 1 an 2 merge Tags: Newcomer task Newcomer task: copyedit Next edit →
Line 5: == Memory hard measure == There are different ways to measure the memory hardness of a function., Aand 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>{{cite arXiv \|last1=Alwen \|first1=Joel \|last2=Blocki \|first2=Jeremiah \|last3=Pietrzak \|first3=Krzysztof \|date=2017-07-07 \|title=Sustained Space Complexity \|class=cs.CR \|eprint=1705.05313 }}</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>

Memory-hard function: Difference between revisions