Proof-of-Spacetime Consensus for Decentralized Storage Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Distributed computing systems face challenges in verifying that a computing node has stored specified data for a specified time period without relying on a single coordinator, and in efficiently utilizing storage resources for decentralized data storage networks.
Innovation Solution
The implementation of Proof-of-Spacetime, which involves a task-performing computing node generating a proof of storage and the distributed system verifying it, with the probability of a candidate prover being selected as a leader proportional to their assigned storage, facilitating the creation of new blocks in a blockchain-based file storage system.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a single coordinator is used to verify data storage, then verification reliability is improved, but system decentralization deteriorates
Solution Approach 1:
The patent extracts the verification function from a single coordinator and distributes it across multiple nodes in the network. Each node independently verifies storage proofs submitted by storage providers, eliminating the single point of control while maintaining verification reliability through distributed consensus.
Solution Approach 2:
The patent introduces cryptographic proofs (Proof-of-Spacetime) as intermediaries between storage providers and verifiers. These proofs enable trustless verification where storage providers can prove data storage without requiring direct trust in a coordinator, and verifiers can validate claims without accessing the actual stored data.
2Reliability
If Proof-of-Spacetime verification is implemented, then data storage verification reliability is improved, but computational complexity increases
Solution Approach 1:
The patent performs computationally intensive operations in advance: storage providers generate cryptographic commitments and proofs offline before submission. The Verkle tree structures are pre-computed and committed to, so that during verification, nodes only need to perform lightweight checks on the pre-computed proofs rather than re-computing everything from scratch.
Solution Approach 2:
The patent uses cryptographic copies and commitments (Verkle tree hashes, commitment schemes) that represent large amounts of data in compact forms. Instead of verifying actual data storage directly, the system verifies cryptographic proofs that are much smaller and faster to process, maintaining reliability while reducing computational complexity.
3Productivity
If leader selection is based on storage amount, then resource utilization is improved, but selection complexity increases
Solution Approach 1:
The patent implements a feedback mechanism where storage providers continuously submit Proof-of-Spacetime evidence, and the system updates leader weights based on verified storage amounts. This creates a dynamic, incentive-compatible system where nodes are rewarded proportionally to their actual storage contribution, automatically optimizing resource utilization without complex manual configuration.
Solution Approach 2:
The patent changes the selection parameter from static metrics (like computational power in traditional PoW) to dynamic storage-based metrics. Leader selection probability is adjusted based on verified storage amounts, transforming the consensus mechanism to prioritize storage resource contribution while using cryptographic proofs to simplify the verification process.
4Adaptability or versatility
If decentralized verification is implemented, then system adaptability is improved, but verification speed deteriorates
Solution Approach 1:
The patent segments the verification process into independent parallel tasks where different nodes verify different storage proofs simultaneously. The Verkle tree structure allows verification to be divided into discrete proof checks that can be processed in parallel across the network, maintaining decentralization while improving overall verification throughput.
Data Source
AI summary
One method includes: (a) forwarding an input challenge to a prover at a start time, the input challenge having a time-stamp; (b) receiving a proof of storage responsive to the input challenge from the prover; (c) generating a new input challenge based on the proof of storage and forwarding the new input challenge to the prover; (d) repeating steps (b) and (c) resulting in a final proof; (e) receiving a proof result based on the final proof, the proof result having a time-stamp; (f) determining that the time between the start time time-stamp and the proof result time-stamp is less than a specified period of time; and (g) determining a winning prover from a plurality of candidate provers where a probability of a candidate prover being a winning prover is proportional to the candidate prover's assigned storage which is indicated at least in part by the candidate miner's proof result.