On graphs of incremental proofs of sequential work

DOI10.1007/978-3-031-91832-2_7MaRDI QIDQ6951307zbMATH OpenFDO

Authors Hamza Abusalah

Publication date 29 July 2025

Full work available at URL https://doi.org/10.1007/978-3-031-91832-2_7

zbMATH Keywords

timestampingtime-lock puzzlesproofs of workdepth-robust graphs

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• An incremental PoSW for general weight distributions
• Depth-robust graphs and their cumulative memory complexity
• High Parallel Complexity Graphs and Memory-Hard Functions
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Incremental proofs of sequential work
• On sparse graphs with dense long paths
• Pebbling and Proofs of Work
• Publicly verifiable proofs of sequential work
• Reversible proofs of sequential work
• SNACKs for proof-of-space blockchains
• SNACKs: leveraging proofs of sequential work for blockchain light clients
• Simple proofs of sequential work
• Verifiable delay functions

This page was built for publication: On graphs of incremental proofs of sequential work

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6951307)