Sparse Peer Node Transient Participation Blockchain
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 distributed peer nodes across different locations. Each peer maintains a copy of the ledger, eliminating the single point of failure while preserving centralized control through consensus mechanisms and orderers that coordinate transactions across the distributed network.
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 copies across different peer nodes. Each peer maintains a complete or partial copy of the ledger, enabling parallel transaction processing and improving throughput. The segmentation allows multiple transactions to be processed simultaneously across different nodes rather than sequentially through a single database.
Solution Approach 2:
The patent transitions from a single-dimensional centralized storage model to a multi-dimensional distributed network architecture. Data is replicated across multiple spatial dimensions (different peer nodes), enabling simultaneous access from multiple points and improving transaction speed through parallel processing while maintaining data consistency through consensus protocols.
3Loss of time
If a sparse peer with transient participation is implemented, then bootstrap time is reduced, but data replication complexity increases
Solution Approach 1:
The patent implements sparse peers that participate transiently in the network, replicating only a subset of data blocks rather than maintaining complete ledgers. This partial replication significantly reduces bootstrap time and resource requirements for joining peers, while the complexity is managed through standardized filter mechanisms that automatically determine which blocks to replicate based on peer characteristics and network state.
Data Source
AI summary
An example operation may include one or more of connecting, by a lead peer, to a blockchain network of an organization configured to store assets, receiving, by the lead peer, a block from an ordering server, that contains a plurality of chaincode transactions belonging to a plurality of peers of the blockchain, applying, by the lead peer, a filter to the block, determining, by the lead peer, a recipient peer of the block in response to the application of the filter, and receiving, by the lead peer, a notification of validation and commitment of the block to the blockchain by the recipient peer.