Blockchain Node Storage Optimization via Header Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Blockchain networks face storage inefficiencies as each node stores all blocks indefinitely, leading to insufficient storage space, especially in private networks where data becomes obsolete, with limited research on optimizing storage.
Innovation Solution
A method for a blockchain network that allows service nodes to automatically optimize storage by applying storage-optimizing operations based on conditions such as block numbers and time thresholds, involving the deletion of transaction information from blocks while maintaining header information to preserve relationships, and using a genesis block to define relationships between blocks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If each node stores all blocks indefinitely to guarantee data reliability, then data reliability is maintained, but storage space becomes insufficient
Solution Approach 1:
The patent segments the blockchain data into two distinct parts: block header information and transaction information. Nodes store only the block headers (which contain cryptographic hashes and essential metadata) while the detailed transaction information can be stored externally or deleted after verification. This segmentation allows nodes to maintain data reliability through header verification while significantly reducing local storage requirements.
Solution Approach 2:
The patent extracts the essential verification elements (block headers containing hashes, timestamps, and metadata) from the complete block data and retains only these extracted components in node storage. The full transaction details can be removed or stored externally, as the extracted headers are sufficient for verifying blockchain integrity and data reliability.
2Loss of information
If all blocks are stored permanently in private networks, then complete data history is preserved, but storage efficiency deteriorates
Solution Approach 1:
The patent applies preliminary verification actions where block headers are verified and validated before full block storage is required. By pre-verifying the blockchain structure through header validation and cryptographic checks, the system ensures data history completeness can be maintained even if full block data is later deleted or stored externally, thus improving storage efficiency.
Solution Approach 2:
The patent enables discarding of redundant full block data while recovering essential verification information through the retained block headers. When needed, the essential data can be recovered or re-verified through the preserved headers and their cryptographic relationships, maintaining data history completeness without permanently storing all original data.
3Volume of stationary object
If transaction information is deleted from blocks to reduce storage, then storage space is optimized, but data integrity verification becomes difficult
Solution Approach 1:
The patent creates cryptographic copies (hashes) of the transaction information that are embedded in the block headers. Instead of storing the original transaction data, the system stores verified cryptographic representations that serve as immutable proofs of the original data's existence and integrity. These cryptographic copies allow verification of data integrity without requiring storage of the original transaction information.
Solution Approach 2:
The patent replaces the mechanical storage and comparison of original transaction data with a cryptographic verification system. Instead of physically storing and comparing transaction records, the system uses hash functions and cryptographic proofs to verify data integrity, substituting physical data retention with mathematical verification mechanisms that require minimal storage space.
Data Source
AI summary
A method for providing a blockchain network capable of optimizing storage used by service nodes in the blockchain network is provided. The method includes steps of: (a) a specific service node among the service nodes, wherein the specific service node is configured to optimize its storage if one of optimization conditions is satisfied, generating blocks while synchronizing with other service nodes; and (b) the specific service node (b1) determining whether one of the optimization conditions is satisfied, by referring to one of (i) (i-1) a latest-block number of a latest block among the blocks and (i-2) a predetermined threshold number, and (ii) a predetermined threshold time and (b2) if one of the optimization conditions is satisfied, applying storage-optimizing operation to information on transactions in target blocks which are part of the blocks not optimized, wherein the target blocks are determined by referring to one of (i) and (ii).