Blockchain Node Synchronization via Primary Source Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current blockchain networks face challenges in efficiently publishing data records due to the need for consensus-based algorithms, which can lead to delays and forking issues, especially when multiple nodes attempt to create blocks simultaneously.
Innovation Solution
A method where a member node acts as a primary or sole source for blocks, transmitting synchronization data at intervals to avoid simultaneous block creation by other nodes, thereby eliminating the need for consensus-based algorithms and reducing the risk of forking.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If consensus-based algorithms are used for publishing data records, then data integrity and security are improved, but publication time and network latency increase significantly
Solution Approach 1:
The system segments the publishing process by allowing individual nodes to independently publish blocks without requiring consensus from other nodes. Each node acts as an independent publisher that can add blocks to the blockchain immediately, dividing the traditional centralized consensus process into distributed independent actions.
Solution Approach 2:
Nodes perform preliminary verification of blocks before publishing them. The system validates block structure, cryptographic signatures, and transaction integrity in advance of publication, eliminating the need for post-publication consensus verification and reducing overall publication time.
2Productivity
If multiple nodes create blocks simultaneously, then network parallelism and throughput are improved, but forking issues and chain instability increase
Solution Approach 1:
The system dynamically adapts to simultaneous block creation by allowing multiple valid chains to exist temporarily. Nodes can switch between chains based on the longest chain rule or earliest timestamp, creating a dynamic system that resolves forks automatically without requiring preventive consensus mechanisms.
Solution Approach 2:
The patent introduces a probabilistic resolution mechanism where the network naturally selects which chain becomes the canonical chain through random factors such as mining speed variations and network propagation delays. This intermediary probabilistic process resolves forks without requiring active consensus intervention.
3Reliability
If proof of work requirements are implemented, then security against malicious actors is improved, but energy consumption and computational resources increase
Solution Approach 1:
The system uses inexpensive, easily verifiable cryptographic proofs instead of energy-intensive proof of work. Nodes can generate and verify block proofs with minimal computational resources, replacing the expensive, long-running PoW process with cheap, instantaneous cryptographic validation that maintains security without high energy consumption.
4Reliability
If blockchain distribution across multiple nodes is implemented, then immutability and security are improved, but synchronization complexity and network overhead increase
Solution Approach 1:
Each node independently maintains and validates its own copy of the blockchain without requiring active synchronization coordination with other nodes. Nodes self-service their own verification processes, automatically detecting and rejecting invalid blocks while accepting valid blocks from any source, eliminating complex centralized synchronization protocols.
Data Source
Figure 1~2
Figure 3
Figure 4
AI summary
A method for synchronizing data within a distributed ledger network comprising a plurality of member nodes connected via a data communications system. The method comprises, at a first member node, storing first storage data representing blocks of a first blockchain and second storage data representing blocks of at least a second blockchain. The first blockchain is extended in response to at least one block being created at the first member node and data representing the at least one block is added to the first storage data. Outbound synchronization data comprising data representative of the at least one block is transmitted to at least one other member node of the distributed ledger network. Inbound synchronization data comprising data representative of one or more blocks of the second blockchain is received from a second member node and stored at the first member node.