PURED: A unified framework for resource-hard functions

ePrint Report: PURED: A unified framework for resource-hard functions

Alex Biryukov, Marius Lombard-Platet

Algorithm hardness can be described by 5 categories: hardness in computation, in sequential computation, in memory, in energy consumption (or bandwidth), in code size. Similarly, hardness can be a concern for solving or for verifying, depending on the context, and can depend on a secret trapdoor or be universally hard. Two main lines of research investigated such problems: cryptographic puzzles, that gained popularity thanks to blockchain consensus …

alex algorithm bandwidth code computation context energy eprint report framework functions hard memory report resource size