Linear Network Coding for Confidential Blockchain Data Storage

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current blockchain systems face challenges in ensuring data confidentiality, scalability, and energy efficiency, particularly for non-fungible token (NFT) storage, which is either centralized and costly or decentralized but inefficient, and lack transparency and security for confidential data access.

Innovation Solution

Implementing Linear Network Coding (LNC) to partition data into multiple packets stored across different nodes, using all-or-nothing transforms and cryptographic encoding to ensure confidentiality and reduce redundancy, while employing proof-of-stake Layer-2 blockchains for energy efficiency and scalable data access.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If data is stored on-chain in traditional blockchain systems, then data confidentiality and security are maintained, but storage costs increase and scalability decreases

Engineering Contradiction:
Improvedata confidentialityVSAvoidstorage requirements
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The patent segments confidential data into multiple separate packets and stores them across different nodes in the blockchain network. Each node holds only a portion of the data, making it impossible to reconstruct the original information without collecting all packets. This segmentation approach maintains data confidentiality while distributing storage requirements across the network, reducing the burden on individual nodes and improving overall scalability.

Inventive Principle:
Principle #1Segmentation

2Quantity of substance

If data is decentralized using IPFS, then storage costs are reduced, but data access efficiency and communication overhead increase

Engineering Contradiction:
Improvestorage requirementsVSAvoidcommunication overhead
Core Design Contradiction:
Quantity of substanceVSLoss of energy

Solution Approach 1:

The patent performs preliminary actions by pre-processing data into coded packets with embedded redundancy information before distribution. Each packet contains encoded data that can be reconstructed when a sufficient number of packets are collected. This preliminary encoding reduces communication overhead during data retrieval, as nodes can efficiently exchange and reconstruct data without requiring extensive communication protocols, thereby reducing energy loss while maintaining decentralized storage benefits.

Inventive Principle:
Principle #10Preliminary action

3Reliability

If traditional blockchain consensus mechanisms are used, then data integrity is ensured, but energy consumption increases

Engineering Contradiction:
Improvedata integrityVSAvoidenergy consumption
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent extracts the core data integrity verification function from the main blockchain consensus mechanism. By using segmented and coded data packets, the system allows nodes to verify data integrity through simpler cryptographic checks on individual packets rather than requiring full consensus validation of entire data sets. This extraction of the verification function reduces computational requirements and energy consumption while maintaining data integrity through distributed verification of packet authenticity.

Inventive Principle:
Principle #2Taking out (Extraction)

Data Source

PatentUS12513012B1Linear network coding for blockchains
Publication Date: 2025.12.30 TYBALT LLC
  • US12513012B1 patent drawing
  • US12513012B1 patent drawing
  • US12513012B1 patent drawing

AI summary

In a blockchain, transacting a record comprises performing linear network coding on the record or on a data file corresponding to the record, to produce a plurality of coded data parts; and storing at least one of the plurality of coded data parts on the blockchain or storing a proof of knowledge on the blockchain, the proof of knowledge derived from the coded data parts. Linear network coding coefficients might be derived from cryptographic hashes of the plurality of coded data parts. An all-or-nothing transform can use the cryptographic hashes to provide the proof of knowledge.