Trust-less Dealer-free Computational Task Pooling
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Blockchain-based computational tasks, such as mining and vanity address determination, are inefficient and insecure due to reliance on central dealers, which can lead to cheating and corruption, especially in peer-to-peer mining pools and vanity address distribution.
Innovation Solution
A trust-less, dealer-free method using a pooled resource group where participants generate their own key pairs, establishing a shared public key for collaborative problem-solving, leveraging Shamir's secret sharing scheme and elliptic curve properties to secure and verify solutions without a central authority.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a central dealer controls the mining pool server, then the pool can manage computational tasks and distribute rewards, but the system becomes susceptible to cheating, corruption, and single point of failure
Solution Approach 1:
The patent extracts the trusted dealer role from the system by implementing a dealer-free threshold signature scheme. Participants generate their own key pairs and collectively establish a shared public key without requiring a central authority, thereby eliminating the single point of failure while maintaining coordinated task management capability
Solution Approach 2:
The patent segments the centralized control function into distributed threshold signatures. Instead of one dealer controlling all operations, the system divides authority among multiple participants where any threshold number can collectively sign transactions, distributing trust and preventing corruption while maintaining operational efficiency
2Speed
If participants work in parallel to solve computational tasks, then the computation speed increases, but verifying solutions and maintaining security becomes more complex
Solution Approach 1:
The patent introduces shared public keys as an intermediary mechanism that enables parallel computation verification. Each participant uses the shared public key to verify solutions independently without complex inter-communication protocols, maintaining security while enabling parallel processing speed
3Ease of operation
If a dealer manages the pool server, then task distribution and reward allocation can be controlled, but the system creates a single point of failure and vulnerability to attacks
Solution Approach 1:
The patent implements preliminary action by having participants pre-generate their key pairs and collectively establish the shared public key before any computational tasks begin. This preliminary setup enables automatic task distribution and reward allocation through smart contracts without requiring ongoing dealer intervention, maintaining ease of operation while eliminating the single point of failure
Data Source
AI summary
A method is presented for secure determination of a solution (S) to a computational task by a pooled resource or group having a plurality of participants (P), the group operating in a trust-less, or dealer-free, system or manner. Access to a resource or reward is offered in exchange for the solution. Individuals generate their own key pair and use their public key to establish with the group an initial shared public key that they can all use to find a solution to the task. The resource or reward can be secured by the verified shared public key. Because the private keys of each participant were used in the determination of the initial shared public key that lead to the solution then participants must then collaborate to unlock the resource or reward because the corresponding shared private key can only be generated by all participants or a pre-agreed threshold of participants.