Proof-of-Space Plot Files Using Encrypted Proof Fragments
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 extending a proof of space blockchain by generating and storing a plot file through deterministic functions and seed values, encrypting subsets of bits to create proof fragments, and reconstructing complete values, while utilizing Beneš networks for compression and adjusting match index bits to control computational difficulty.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If proof of space blockchain is extended by generating plot files with complete entries, then the blockchain security and storage proof capability are improved, but the storage footprint and computational cost increase
Solution Approach 1:
The patent divides the plot file into multiple tables (first table, second table, third table) where each table contains specific types of entries. The first table stores initial entries, the second table stores forward-propagated entries, and the third table stores encrypted target bits. This segmentation allows the system to store only essential information in each table rather than complete entries everywhere, reducing overall storage requirements while maintaining security.
Solution Approach 2:
The patent extracts and stores only the most critical information in the plot file. Specifically, it stores initial entries in the first table, forward-propagated entries in the second table, and encrypted target bits in the third table. By taking out only the essential components needed for proof verification rather than storing complete entries, the storage footprint is reduced while still enabling security proofs.
2Reliability
If proof of space blockchain is extended with full entry storage, then the proof capability is improved, but the system becomes vulnerable to rental attacks and compression attacks
Solution Approach 1:
The patent applies preliminary anti-action by encrypting the target bits before storing them in the plot file. This encryption serves as a preemptive measure against rental attacks and compression attacks. The encrypted target bits cannot be easily manipulated or compressed by attackers, and the encryption key is only available during legitimate proof generation, preventing malicious use before it can occur.
Solution Approach 2:
The patent changes the state of the target bits from plaintext to encrypted form, fundamentally altering their properties. This parameter change (from readable to encrypted) makes the data resistant to compression attacks and rental attacks, as the encrypted form cannot be easily manipulated or replicated without the decryption key, thereby enhancing security while maintaining proof capability.
3Object-affected harmful factors
If match index bits are increased to control computational difficulty, then the attack cost increases, but the plot file size and processing complexity increase
Solution Approach 1:
The patent segments the plot file into multiple tables with different functions, which simplifies the processing of match index bits. By organizing data into structured tables (first table for initial entries, second table for forward-propagated entries, third table for encrypted target bits), the system can efficiently manage and process match index bits without overwhelming complexity, even as the number of bits increases to raise attack costs.
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.