Distributed Ledger Data Storage via Shortest-Path Verification

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In network systems of distributed ledger technology (DLT), the replication and storage of data over time lead to increased operational slowness and storage space consumption, while existing methods that delete old data result in loss of complete data for verification.

Innovation Solution

A data storage method involving a first node storing data and a second node determining a designated origin and destination signal to identify a shortest path data, allowing only the data of this path to be stored, thereby saving storage space while maintaining complete data for verification.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If data of all information units is replicated and stored on each node, then complete data availability for verification is ensured, but storage space consumption increases and nodes operate slowly

Engineering Contradiction:
Improvedata availability for verificationVSAvoidstorage space consumption
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The patent segments the stored data into two categories: information units that form the shortest path (verified data) and other information units (unverified data). Nodes only store and verify the shortest path data, dividing the storage burden into essential verification data and non-essential data that can be excluded.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent extracts and identifies the shortest path from origin information unit to destination information unit using breadth-first search algorithm. Only the information units comprising this shortest path are retained for storage and verification, while other information units are excluded from node storage.

Inventive Principle:
Principle #2Taking out (Extraction)

2Quantity of substance

If data of old information units is deleted to save storage space, then storage space is reduced, but complete data for verification is lost

Engineering Contradiction:
Improvestorage spaceVSAvoidloss of old data
Core Design Contradiction:
Quantity of substanceVSLoss of information

Solution Approach 1:

The patent performs preliminary identification of the shortest path using breadth-first search algorithm before deleting any data. By determining which information units constitute the shortest path in advance, the system ensures that verification-critical data is preserved while safely deleting other old information units.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent creates a copied representation of the essential verification data through the shortest path structure. Instead of storing all original information units, the system maintains a copied path through the data structure that preserves verification capability while reducing storage requirements.

Inventive Principle:
Principle #26Copying

3Reliability

If all information units are stored on each node, then verification completeness is maintained, but operational speed decreases

Engineering Contradiction:
Improveverification completenessVSAvoidnode operation speed
Core Design Contradiction:
ReliabilityVSSpeed

Solution Approach 1:

The patent segments the data storage requirement into only the shortest path information units needed for verification. By dividing the full dataset into essential verification path data and non-essential data, nodes process and verify only the necessary portion, significantly improving operational speed while maintaining verification completeness.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent applies partial action by storing only the minimum necessary data (shortest path information units) required for verification rather than all information units. This partial storage approach is sufficient for maintaining verification completeness while dramatically reducing processing overhead and improving node operation speed.

Inventive Principle:
Principle #16Partial or excessive action

Data Source

PatentUS12463877B2Data storage method and system
Publication Date: 2025.11.04 AIO TECH RESERVE PTE LTD
  • US12463877B2 patent drawing
  • US12463877B2 patent drawing
  • US12463877B2 patent drawing

AI summary

A data storage method and system, applied in a network system of distributed ledger technology. The method comprises: storing, by a first node, data of information units of the network system; determining, by a second node, a designated origin signal including an identifier of at least one origin information unit; obtaining, by the second node, data of the information units of the network system from the first node; determining, by the second node, a designated destination signal including an identifier of a destination information unit; determining, by the second node, a shortest path data from the origin information unit to the destination information unit according to the designated origin signal, the data of the information units of the network system, and the designated destination signal; and storing, by the second node, data of all information units included in the shortest path data.