Blockchain Transaction Storage Segmentation for Node Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current blockchain systems require all computing nodes to store all transactions, leading to inefficient use of storage space and increased data access times, as each node maintains a full copy of the blockchain, which can result in slower performance and higher resource usage.
Innovation Solution
A method where each computing node generates and communicates a new block with transaction storage data specifying which nodes are to keep certain transactions, allowing nodes to selectively remove and store only the transactions they are assigned, thereby optimizing storage usage and improving data access times by grouping related transactions together.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all computing nodes store all transactions in the blockchain, then data redundancy and integrity are maintained, but storage space requirements and data access times increase
Solution Approach 1:
The patent segments the blockchain data by separating transaction data from block structure data. Each node stores complete block structures (headers, hashes, timestamps) but only stores a subset of transactions assigned to it through the transaction storage data structure, which maps transactions to specific nodes using hashing algorithms.
Solution Approach 2:
The patent implements local quality by allowing each computing node to have different transaction storage characteristics based on its assigned transactions. Nodes store transactions locally that are relevant to their function, determined by the transaction storage data structure, rather than uniformly storing all transactions across all nodes.
2Reliability
If all computing nodes store all transactions, then complete data availability is ensured, but data access efficiency decreases
Solution Approach 1:
The patent segments transaction storage across the network by using the transaction storage data structure to divide transactions into subsets assigned to different nodes. This segmentation enables faster local access to relevant transactions while maintaining network-wide availability through the distributed structure.
Solution Approach 2:
The transaction storage data structure acts as an intermediary that maps transactions to specific computing nodes. This intermediary layer enables efficient routing and retrieval of transactions by determining which node holds the required transaction data, reducing access time compared to searching all nodes.
3Reliability
If each node maintains a full copy of the blockchain, then data redundancy is maximized, but resource usage and performance increase
Solution Approach 1:
The patent segments the blockchain into structural components (block headers, hashes, timestamps) that all nodes store, and transactional components that are divided and assigned to specific nodes. This segmentation reduces the data burden on each node while maintaining sufficient redundancy through the distributed assignment of transactions.
Solution Approach 2:
The patent implements partial action by having each node store only the transactions assigned to it through the transaction storage data structure, rather than storing all transactions. This partial storage approach reduces resource consumption while maintaining system functionality through the collective storage capacity of all nodes.
Data Source
AI summary
Creation of a new block for a blockchain can be initiated. The new block can include a plurality of transactions. The blockchain can include a plurality of existing blocks. Transaction storage data can be generated for the new block. The transaction storage data can indicate the plurality of transactions and specify, for each of the plurality of transactions, which of a plurality of computing nodes are to keep the transaction in the new block. The generated transaction storage data can be added to the new block. The new block can be communicated to the plurality of computing nodes.