(k1,k2)-Quorum Systems for Parallel Payment Validation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing cryptocurrencies face inefficiencies in transaction processing, as they often require sequential validation, which limits throughput and increases latency, especially when multiple payments are made from the same account, due to the need for full quorum validation to prevent double spending.
Innovation Solution
The introduction of (k1,k2)-quorum systems, which allow for parallel validation of transactions with less than f+1 validators by using both intersection and non-intersection requirements to manage the number of concurrent transactions and prevent double spending, enabling partial spending and settlement transactions without fully exhausting the account balance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If full quorum validation is used to prevent double spending, then transaction safety is improved, but transaction throughput is reduced and latency is increased
Solution Approach 1:
The validation process is segmented into two stages: partial validation with smaller quorums for initial transaction processing, and full validation only when necessary for settlement. This allows most transactions to proceed with reduced validation requirements, improving throughput while maintaining safety through the two-stage approach
Solution Approach 2:
The system applies partial validation by using quorums of size less than the full f+1 required for complete safety guarantees. This partial action is sufficient for many transactions, allowing them to proceed faster, while full validation is reserved for critical settlement operations
2Reliability
If sequential validation is used to process multiple payments from the same account, then double spending is prevented, but transaction latency is increased
Solution Approach 1:
The system performs preliminary partial validation of transactions before final settlement. By validating transactions in advance with smaller quorums, the system can process multiple payments in parallel without waiting for full validation, reducing latency while maintaining safety through subsequent settlement checks
Solution Approach 2:
The validation requirement dynamically adjusts based on the transaction state. Initial transactions use reduced quorum requirements for faster processing, and the system transitions to full validation requirements only when settlement is needed, allowing parallel processing while preventing double spending
3Productivity
If multiple transactions are validated in parallel with less than f+1 validators, then transaction throughput is improved, but the complexity of managing concurrent transactions increases
Solution Approach 1:
The quorum management complexity is segmented by introducing distinct quorum types (partial validation quorums vs. full validation quorums) and separate validation stages. This segmentation allows parallel processing of multiple transactions with simpler individual quorum requirements while managing overall system complexity through structured validation phases
Solution Approach 2:
The system introduces an intermediary validation layer that processes transactions with reduced quorum requirements before final settlement. This intermediary stage acts as a mediator between transaction submission and final validation, simplifying the management of concurrent transactions by handling them in controlled stages
Data Source
AI summary
Examples of a computer-implemented framework and associated methods for executing payment transactions in parallel with less than f+1 validations are disclosed. The framework includes a novel quorum system called the (k1,k2)-quorum systems. In the presence of a non-adaptive adversary, these systems can be used to allow up to k1 transactions to be validated concurrently and asynchronously but prevent more than k2 transactions from being validated.