Block Template Cross-References for Faster Blockchain Propagation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In proof-of-work blockchain systems, the increasing size of blocks leads to delays in block propagation, exacerbating issues like temporary forks and orphan blocks, which are costly to miners and the system, and existing methods to reduce bandwidth and improve propagation speed are inadequate.
Innovation Solution
Implementing a method for compressing transaction identifiers using a compressed identifier structure that includes a prefix and truncated portion, and utilizing an append-only list to efficiently share block template information among mining nodes, reducing the need for full block data transmission.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If full block data is transmitted to propagate blocks, then all mining nodes receive complete block information, but bandwidth consumption increases and propagation speed decreases
Solution Approach 1:
The patent extracts only the essential block header information (hash, version, previous block hash, Merkle root, timestamp, difficulty target, and nonce) from the complete block data for propagation. This allows receiving nodes to validate the block's integrity and correctness without transmitting the entire block, thereby significantly reducing bandwidth consumption while maintaining propagation reliability.
Solution Approach 2:
The patent segments block propagation into two phases: first propagating only the block header (containing validation-critical information), and second propagating the full block data only to nodes that request it. This segmentation enables fast initial propagation while providing complete data on demand, resolving the contradiction between speed and completeness.
2Reliability
If full block data is transmitted, then receiving nodes can validate blocks independently, but network bandwidth consumption increases
Solution Approach 1:
The patent extracts the critical validation elements (block header containing hash, Merkle root, previous block hash, and nonce) and transmits only these to enabling receiving nodes to perform independent validation. The full block data is transmitted separately only when requested, minimizing bandwidth consumption while preserving validation capability.
Solution Approach 2:
The patent introduces an on-demand request mechanism as an intermediary: receiving nodes that need full block data send requests to the transmitting node, which then provides the complete block. This mediator approach allows validation to proceed with minimal data while providing full data only when necessary, reducing overall bandwidth consumption.
3Loss of energy
If compressed transaction identifiers are used, then bandwidth consumption is reduced, but implementation complexity increases
Solution Approach 1:
The patent extracts only the block header information for propagation, eliminating the need for complex compression algorithms entirely. By transmitting only the essential validation data (hash, version, previous block hash, Merkle root, timestamp, difficulty target, nonce) and deferring full block transmission until requested, the system achieves bandwidth reduction without introducing compression complexity.
Data Source
AI summary
Methods and devices for compressing transaction identifiers by a first mining node in a blockchain network. The method may include building a first candidate block containing a first ordered list of transaction identifiers; receiving, from a second mining node, data defining a second ordered list of transaction identifiers in a second candidate block being mined by the second mining node; determining that at least one of the transaction identifiers in the first ordered list is also in the second ordered list; generating an append message containing data defining the first ordered list of transaction identifiers, wherein the data specifies said at least one transaction identifier in the first ordered list of transaction identifiers by including an index position of said at least one transaction identifier in the second ordered list of transaction identifiers; and transmitting the append message to the second mining node.