The following pages link to Proofs of Space (Q3457086):
Displaying 17 items.
- Static-memory-hard functions, and modeling the cost of space vs. time (Q1629397) (← links)
- Minting mechanism for proof of stake blockchains (Q2229280) (← links)
- Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks (Q2958121) (← links)
- Proof of Space from Stacked Expanders (Q3179360) (← links)
- Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond (Q3181039) (← links)
- Proofs of Catalytic Space (Q5090438) (← links)
- Resource Burning for Permissionless Systems (Invited Paper) (Q5100943) (← links)
- Depth-Robust Graphs and Their Cumulative Memory Complexity (Q5270356) (← links)
- Scrypt Is Maximally Memory-Hard (Q5270357) (← links)
- Consensus in Data Management: From Distributed Commit to Blockchain (Q5886006) (← links)
- Permissionless and asynchronous asset transfer (Q6096037) (← links)
- A comprehensive review on blockchains for Internet of Vehicles: challenges and directions (Q6101340) (← links)
- stoRNA: stateless transparent proofs of storage-time (Q6558607) (← links)
- SNACKs for proof-of-space blockchains (Q6573987) (← links)
- Defending hash tables from algorithmic complexity attacks with resource burning (Q6614003) (← links)
- PURED: a unified framework for resource-hard functions (Q6623350) (← links)
- Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation (Q6648200) (← links)
