Proof-of-Space Plot Files to Resist Rental and Compression Attacks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing blockchain systems face challenges in efficiently proving storage allocation and are vulnerable to rental attacks and compression attacks, which compromise network security.
Innovation Solution
A method for generating a proof of space blockchain using a deterministic function to create a plot file with reduced storage footprint and increased computational cost for malicious nodes, involving the generation of forward-propagated entries and encrypted proof fragments, along with Beneš compression to optimize storage and security.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional proof of space methods are used, then storage allocation can be proven, but the system is vulnerable to rental attacks and compression attacks
Solution Approach 1:
The plot file is divided into multiple tables (first table, second table, third table) with different entry types (initial entries, forward-propagated entries, proof fragments). This segmentation prevents attackers from compressing or renting the entire proof structure efficiently, as each table requires specific computational work to generate and validate.
Solution Approach 2:
The plot file is generated in advance with deterministic functions creating relationships between entries before any proof is needed. The forward-propagated entries and proof fragments are pre-computed with embedded cryptographic relationships, making it computationally infeasible for attackers to replicate or compress these proofs on-demand.
2Reliability
If proof fragments with full storage details are stored, then complete proof verification is enabled, but storage footprint increases
Solution Approach 1:
The proof fragments store only essential cryptographic elements (hashed values, forward-propagated entries) rather than complete storage allocation details. The deterministic function and embedded seed values allow full verification of storage proof without storing redundant information, reducing the plot file size while maintaining verification integrity.
Solution Approach 2:
Instead of storing complete storage allocation records, the system uses cryptographic hashes and deterministic reproductions of storage proofs. The plot file contains compressed representations that can be verified through cryptographic computation rather than direct storage comparison.
Data Source
AI summary
A method includes: generating a set of output entries based on a set of initial entries; identifying a matching pair of entries in the set of output entries; generating a first forward-propagated entry in a second set of entries based on the first matching pair of entries; identifying a second matching pair of entries in the second set of entries; identifying a group of initial entries associated with the second matching pair of entries; extracting a subset of bits, in a set of target bits, from each initial entry in the group of initial entries; generating a second forward-propagated entry—representing a proof fragment—in a third set of entries in a third table by encrypting the set of target bits; generating a plot file representing a set of tables including the third table; and storing the plot file.