Sparse Peer Node Bootstrap via Partial Ledger State
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Centralized databases face issues such as single points of failure, dependency on network connectivity, limited access, and slow transaction speeds, along with challenges in data redundancy and retrieval.
Innovation Solution
Implementing a sparse peer node with transient participation in a blockchain network, utilizing a processor to connect to a blockchain network, select data for replication, specify filters, receive blocks via gossip protocol, and construct a local ledger to bootstrap the sparse peer, allowing for decentralized and secure data storage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If a centralized database is used, then data management and control are simplified, but the system has a single point of failure and limited data availability
Solution Approach 1:
The patent divides the centralized database into multiple peer nodes distributed across different locations. Each peer maintains a copy of the ledger, eliminating the single point of failure while preserving centralized control through the ordering service that coordinates all peers.
2Quantity of substance
If a centralized database is used, then data redundancy is minimized, but data accessibility and transaction speed are limited
Solution Approach 1:
The patent segments the database into multiple distributed peers that can process transactions simultaneously. Each peer maintains redundant copies of the ledger, enabling parallel transaction processing while maintaining data consistency through the ordering service.
3Loss of time
If a sparse peer with transient participation is implemented, then bootstrap time is reduced, but data completeness may be compromised
Solution Approach 1:
The patent allows sparse peers to participate with only a subset of the complete ledger data. These peers perform partial actions (processing specific transaction types or time periods) while the system maintains overall completeness through other full peers that hold the complete ledger.
4Productivity
If data selection filters are applied, then data replication efficiency is improved, but system complexity increases
Solution Approach 1:
The patent applies data selection filters in advance during the data replication process. Peers pre-filter which transactions and data they need to replicate based on their specific requirements, reducing unnecessary data transmission and processing while maintaining system simplicity through standardized filter mechanisms.
Data Source
AI summary
An example operation may include one or more of connecting, by a sparse peer, to a blockchain network of a plurality of peers controlled by orderers, configuring the sparse peer to operate with a partial state of a chain to reduce a bootstrap time of the sparse peer, specifying, by the sparse peer, data selection filters based on the partial state of the chain, receiving, by the sparse peer, blocks that match the selection filters from the plurality of the peers via a gossip, storing, by the sparse peer, the blocks in a ledger of the sparse peer, determining, by the sparse peer, if the ledger of the sparse peer is up-to-date based on the partial state of the chain, and in response to the determination that the ledger of the sparse peer is up-to-date, bootstrapping the sparse peer.