arXiv:2610.27249v1 Announce Type: new Abstract: Graph pebbling is the model in which the memory cost of memory-hard functions and proofs of space is measured, and pebbling lower bounds are the main way to argue that such constructions are secure. It has long seemed that the model is faithful to reality.

Read the full article at arXiv cs.CR →