Provably Memory-Hard Proofs of Work with Memory-Easy Verification

Jeremiah Blocki, Nathan Smearsoll. Provably Memory-Hard Proofs of Work with Memory-Easy Verification. In Benny Applebaum, Huijia (Rachel) Lin, editors, Theory of Cryptography - 23rd International Conference, TCC 2025, Aarhus, Denmark, December 1-5, 2025, Proceedings, Part IV. Volume 16271 of Lecture Notes in Computer Science, pages 512-544, Springer, 2025. [doi]

Abstract

Abstract is missing.