Blockchain Block Deduplication via Partition Reference

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Blockchain networks face significant network load and scalability issues due to the transmission of large amounts of data, particularly when new peers join or recover, as they need to receive all previous blocks, leading to bandwidth stress and performance bottlenecks.

Innovation Solution

Implementing a deduplication method that splits transaction blocks into partitions, compares them to a deduplication map, replaces duplicate partitions with references, and broadcasts the transformed block, allowing peers to reconstruct the original block, thereby reducing data transfer and network load.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If all previous blocks are transmitted to new or recovering peers, then complete ledger synchronization is achieved, but network bandwidth is overwhelmed and performance degrades

Engineering Contradiction:
Improveledger synchronizationVSAvoiddata transfer volume
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The block data is divided into multiple partitions, each with a unique identifier. This segmentation allows the system to selectively transmit only the necessary partitions rather than complete duplicate blocks, reducing overall data transfer volume while maintaining synchronization reliability.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The ordering service pre-processes blocks by identifying and partitioning data before transmission. By performing deduplication analysis in advance and preparing partition identifiers, the system eliminates redundant data transmission before peers receive the blocks, reducing network bandwidth consumption.

Inventive Principle:
Principle #10Preliminary action

2Reliability

If complete blocks are transmitted to ensure data integrity, then synchronization accuracy is maintained, but network latency increases and transaction speed decreases

Engineering Contradiction:
Improvesynchronization accuracyVSAvoidnetwork latency
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The system extracts and transmits only the essential partition identifiers and necessary block data rather than complete duplicate blocks. By removing redundant information from transmissions, the system maintains synchronization accuracy while reducing network latency and improving transaction speed.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

Partition identifiers serve as intermediaries that enable peers to verify and reconstruct complete blocks without receiving entire duplicate transmissions. The ordering service uses these identifiers as mediators to coordinate data distribution efficiently, reducing latency while maintaining integrity.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Loss of substance

If partition identifiers are stored and transmitted, then data redundancy is reduced, but additional processing overhead is introduced

Engineering Contradiction:
Improvedata redundancyVSAvoidprocessing overhead
Core Design Contradiction:
Loss of substanceVSDevice complexity

Solution Approach 1:

The ordering service automatically generates and manages partition identifiers without requiring complex external coordination. Each partition is self-identified with a unique marker, enabling automatic deduplication at peer nodes through simple comparison operations, reducing overall system complexity despite the added identifier management.

Inventive Principle:
Principle #25Self-service

Data Source

PatentUS11816069B2Data deduplication in blockchain platforms
Publication Date: 2023.11.14 INTERNATIONAL BUSINESS MACHINE CORPORATION
  • US11816069B2 patent drawing
  • US11816069B2 patent drawing
  • US11816069B2 patent drawing

AI summary

A method for deduplicating a distributed ledger, a blockchain, and a computer program product. One embodiment may comprise splitting a new block on a distributed ledger into a plurality of partitions, comparing the plurality of partitions to a deduplication (dedup) map, replacing a first partition of the plurality of partitions with a first reference to the dedup map to produce a transformed block, and communicating the transformed block via a network interface to one or more peers.