Blockchain Sync Caching with Per-Block Hints for Faster Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current blockchain systems inefficiently manage data caching during block verification due to the assumption that future data access is unknown, leading to delays when verifying existing blocks, as LRU caching mechanisms fail to account for known data requirements.
Innovation Solution
Implementing a caching system that utilizes per-block hints to preload necessary data into RAM for efficient verification, where provider computers generate sets of keys to process blocks, reducing disk data load times.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If LRU caching mechanism is used to manage data in RAM, then the system can handle unknown future data access, but verification of existing blocks becomes inefficient due to unnecessary data loading delays
Solution Approach 1:
The patent applies preliminary action by pre-loading data into RAM based on hint headers that indicate which data will be needed for future block verifications. Instead of waiting for verification requests and then loading data (which causes delays), the system proactively loads identified necessary data into memory before it is actually needed, eliminating verification delays while maintaining efficient memory management.
2Quantity of substance
If LRU caching mechanism removes oldest data values from RAM, then memory space is freed for new data, but verification processes experience delays when needed data is not in memory
Solution Approach 1:
The system performs preliminary action by using hint headers to identify and pre-load necessary data into RAM before verification processes begin. This ensures that when verification is needed, the data is already in memory, eliminating loading delays while maintaining efficient memory capacity management through selective pre-loading rather than blanket LRU eviction.
Solution Approach 2:
The system applies self-service by having the verification process itself generate the hint headers that identify which data needs to be loaded. The verification process autonomously determines its own data requirements and triggers the pre-loading of exactly those data elements, eliminating the need for external memory management decisions about what to keep or evict.
3Ease of operation
If data is loaded from disk during block verification, then verification can proceed with available data, but the process experiences significant delays due to disk access times
Solution Approach 1:
The patent eliminates disk access delays during verification by performing preliminary action - loading all necessary data into RAM before verification begins. Hint headers identify the exact data needed, and this data is pre-loaded into memory in advance, so when verification starts, all required data is immediately accessible in fast memory rather than requiring slow disk accesses during the critical verification window.
Data Source
AI summary
An embodiment includes a node receiving one or more blocks of a blockchain. The node comprising a data storage can store, in the data storage, a plurality of sets of keys and data values associated with keys of the plurality of sets of keys, the data values being data associated with the blockchain. The node can perform a validation process for the one or more blocks. The validation process includes for each of the one or more blocks a) identifying a set of keys associated with the block, b) retrieving data values associated the identified keys from the data storage, c) storing the retrieved data values into volatile memory, and d) validating the block using the data values in the volatile memory. The node can then complete the validation of the one or more blocks.