Blockchain Voting Share Combination via Knapsack Algorithm
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing automated voting processes face inefficiencies when dealing with varying numbers of votes from participants, as the computational demands of finding optimal combinations increase, especially in blockchain transactions that require a threshold number of signatures for validation.
Innovation Solution
A computer-implemented voting process that dynamically determines the required threshold number of shares based on participants' share holdings, using a knapsack algorithm to improve computational efficiency and account for estimated voting behavior, allowing for recursive determination of share combinations and efficient generation of predetermined values.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If existing automated voting processes are used to handle varying numbers of votes from participants, then the voting can be conducted, but the computational demands of finding optimal combinations increase significantly
Solution Approach 1:
The patent segments the voting process into distinct phases: share distribution phase, voting phase, and result determination phase. By dividing the computational task of finding optimal combinations into smaller sub-tasks that can be processed independently and in parallel, the system reduces the overall computational complexity while maintaining voting efficiency.
Solution Approach 2:
The patent performs preliminary actions by pre-distributing shares to participants before the actual voting occurs. The share distribution structure is established in advance, creating a framework that enables efficient voting without requiring complex real-time computations during the voting process itself.
2Reliability
If threshold signature schemes are implemented for blockchain transactions requiring multiple signatures, then security is improved, but the computational efficiency decreases
Solution Approach 1:
The patent changes key parameters of the threshold signature scheme by implementing optimized share distribution algorithms and efficient combination finding methods. By adjusting parameters such as the threshold value, share distribution structure, and combination search strategy, the system achieves both high security and improved transaction validation speed.
Solution Approach 2:
The patent replaces traditional mechanical approaches to threshold signing with optimized computational algorithms. Instead of using brute-force methods to find valid signature combinations, the system employs efficient search algorithms and data structures that dramatically reduce computational overhead while maintaining security requirements.
Data Source
Figure 1
Figure 2
AI summary
A computer implemented voting process (2) for executing a blockchain transaction, such as a transaction on the Bitcoin blockchain, is disclosed. The process comprises distributing shares (6) of a first common secret among a plurality of participants (4), wherein the first common secret implements an automated voting process (14) by the participants and is accessible to a first threshold number of shares and is inaccessible to less than the first threshold number of shares. The process further comprises determining (10, 12), based on different numbers of said shares of the first common secret held by a plurality of the participants, at least one combination of shares held by a plurality of the participants, to provide the first threshold number of shares.