Blockchain Node Block Validation Using Graph Datastores
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing blockchain networks face challenges in managing large volumes of transactions, such as those encountered in credit card payment networks, which require solutions to enhance throughput and efficiency.
Innovation Solution
The implementation of a computer-implemented method for validating newly-solved blocks in a blockchain network, involving the reception of arrays containing transaction identifiers, building a graph datastore or array transaction databases, and verifying the topological ordering of transactions to ensure block validity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional blockchain validation methods are used, then transaction security and integrity are maintained, but validation speed and throughput decrease significantly when handling large volumes of transactions
Solution Approach 1:
The patent segments the blockchain validation process into distinct phases: receiving transaction arrays, building graph datastores or array databases, verifying topological ordering, and detecting double-spends. This segmentation allows each phase to be optimized independently, with graph datastructures enabling O(1) or O(log n) complexity operations for specific validation tasks, thereby improving overall throughput without sacrificing security
Solution Approach 2:
The patent performs preliminary actions by pre-building graph datastores and array databases from received transaction arrays before actual block validation occurs. This preprocessing organizes transaction data into efficient data structures that enable rapid verification of topological ordering and double-spend detection during the validation phase, significantly reducing validation time for high-throughput scenarios
2Reliability
If comprehensive transaction validation is performed to ensure block validity, then security and accuracy are improved, but computational complexity and processing overhead increase
Solution Approach 1:
The patent introduces graph datastores and array databases as intermediary data structures between raw transaction arrays and validation logic. These intermediaries pre-organize transaction data with explicit topological relationships, allowing validation algorithms to query pre-computed information rather than analyzing raw transactions from scratch, thus reducing computational complexity while maintaining validation accuracy
Solution Approach 2:
The patent replaces traditional linear transaction verification mechanics with graph-based datastructure operations. Instead of sequentially checking each transaction against all previous transactions, the system uses graph traversals and array index operations that provide O(1) or O(log n) complexity for topological ordering verification and double-spend detection, significantly reducing processing overhead
Data Source
Figure 1
Figure 2
Figure 3A~3B
AI summary
Methods, devices, and data structures for processing large volumes of transactions in blockchain nodes. One solution includes building a transaction graph database mapping all validated transactions as vertexes and connecting related transactions with edges. A process is described for annotating the graph database during block validation to determine if the list of transactions in the block is topologically ordered. Another solution includes building an array transaction database or data structure for each array received from another node, wherein the database includes a list of outputs consumed in the array's transactions as inputs that originate from other arrays, and a list of outputs generated by the array's transactions and not consumed by other transactions in the array. The array transaction databases may be used to quickly perform block validation.