Blockchain Transaction Clustering to Reduce Search Complexity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Blockchain networks face inefficiencies due to the dispersion of context-related transactions, particularly in private networks using consensus schemes like Proof of Authority (PoA), leading to overhead and increased search complexity for similar transactions.
Innovation Solution
A method and system that assigns a leader node to cluster context-related transactions into the same or adjacent blocks, allowing non-leader nodes to validate and, if necessary, re-form blocks to ensure all transactions are grouped efficiently, reducing search complexity to O(log log c).
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If transactions are broadcast to all nodes in the network, then all nodes can compete to mine the same transactions, but context-related transactions become dispersed across different blocks increasing search complexity
Solution Approach 1:
The patent segments the blockchain network into leader nodes and non-leader nodes with distinct responsibilities. Leader nodes are assigned to cluster and mine specific transactions, while non-leader nodes validate. This segmentation prevents context-related transactions from being dispersed across all blocks, as they are concentrated in blocks mined by the responsible leader node, thereby reducing search complexity while maintaining network competitiveness.
Solution Approach 2:
The patent introduces leader nodes as intermediary entities that mediate between transaction submission and block mining. These leader nodes receive transactions, cluster context-related ones together, and mine them in dedicated blocks. This intermediary role ensures that transactions related to the same incident remain grouped in adjacent or identical blocks, reducing the overhead for nodes searching for similar transactions while still allowing broad network participation in validation.
2Reliability
If all nodes mine all transactions, then transaction validation is distributed, but overhead increases for traversing and searching blocks
Solution Approach 1:
The patent divides the mining and validation responsibilities among different node types. Leader nodes perform the computationally intensive task of clustering and mining blocks containing context-related transactions, while non-leader nodes focus on validation only. This segmentation reduces the overall computational overhead in the network, as nodes don't need to traverse and search all blocks for transactions they don't need to mine, while maintaining distributed validation for reliability.
Solution Approach 2:
The patent implements partial action by having non-leader nodes perform only validation rather than full mining operations. This reduces the energy consumption and computational overhead for these nodes, as they don't need to search through all blocks or perform complex clustering algorithms. The validation task is sufficient for their role, eliminating excessive computational effort while maintaining transaction security through distributed verification.
3Productivity
If context-related transactions are dispersed in different blocks, then mining distribution is achieved, but search operations become linear in complexity
Solution Approach 1:
The patent segments the mining process by assigning specific transaction clusters to specific leader nodes. Each leader node mines blocks containing transactions related to particular incidents or contexts, creating a structured distribution rather than random dispersion. This segmentation ensures that context-related transactions are grouped in adjacent or identical blocks, reducing search complexity from linear to more efficient operations, while still achieving mining distribution across multiple leader nodes.
Solution Approach 2:
The patent applies preliminary action by having leader nodes pre-cluster context-related transactions before mining them. This preliminary organization of transactions into coherent groups ensures that when blocks are mined, related transactions are already positioned together or in adjacent blocks. This pre-processing step eliminates the need for post-mining search operations to traverse the entire blockchain, reducing search complexity while maintaining distributed mining productivity.
Data Source
AI summary
A method and a system for optimizing blockchain complexity can be configured for eliminating the dispersion of context-related transactions. Embodiments can include monitoring node assigning a leadership role to be a leader node for an upcoming mining round. The leader node can cluster one or more transactions for an incident and begin mining one or more blocks. A non-leader node can check if one or more transactions may relate to the incident. Once no related incidents are found, the mining may be stopped or other suitable actions can be taken.