Streaming Block Templates With Cross-Referenced Transaction IDs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The propagation of blocks in blockchain networks is delayed due to increasing block sizes, leading to temporary forks and orphan blocks, which wastes mining efforts and increases bandwidth consumption.
Innovation Solution
Implementing a method to compress transaction identifiers using a compressed identifier structure that includes a prefix and a truncated portion, allowing for efficient transmission and resolution of collisions, thereby reducing bandwidth requirements and improving propagation speed.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If full block data is propagated to all mining nodes, then all nodes can validate the block, but bandwidth consumption increases and propagation speed decreases
Solution Approach 1:
The patent extracts only the essential components needed for block validation (block header and transaction list information) rather than propagating the entire block data. This allows receiving miners to validate blocks by hashing the header and confirming the match, significantly reducing bandwidth consumption while maintaining validation reliability
Solution Approach 2:
The block data is segmented into critical validation components (header with hash value) and optional full data. The header contains the essential cryptographic proof for validation, while full transaction data can be retrieved on-demand, separating the validation function from the data retrieval function
2Quantity of substance
If block size increases to include more transactions, then transaction capacity improves, but propagation delay increases causing temporary forks and orphan blocks
Solution Approach 1:
The patent performs preliminary propagation of block header and transaction list information before the full block is ready. Mining nodes receive and can pre-validate the header hash in advance, so when the full block arrives, validation is already complete or near-complete, eliminating propagation delay from the critical path
Solution Approach 2:
The essential validation information (header hash) is extracted and propagated separately from the full block data. This allows the validation-critical path to proceed with minimal data, while the full block contents can be transferred in parallel without blocking validation
3Measurement precision
If full block data is sent to ensure complete validation, then validation accuracy is maintained, but transmission time increases
Solution Approach 1:
The patent extracts the cryptographic hash of the block header, which serves as a compact fingerprint for validation. Receiving miners can validate the block by hashing the received header and confirming it matches the provided hash value, achieving complete validation accuracy with minimal data transmission
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.