Data Integrity Notarization in Content-Addressable P2P Storage

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing data storage systems lack effective mechanisms for ensuring data integrity and authentication, particularly in decentralized content-addressable peer-to-peer networks.

Innovation Solution

A data protocol providing notarization of data between nodes on a content-addressable peer-to-peer storage network, involving data signing, hashing, and peer signature validation, with a three-phase process of data block generation, signature request, and gossiping of block existence.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If data is stored in a decentralized peer-to-peer network without notarization, then storage accessibility and decentralization are improved, but data integrity and authentication are compromised

Engineering Contradiction:
ImprovedecentralizationVSAvoiddata integrity
Core Design Contradiction:
Adaptability or versatilityVSReliability

Solution Approach 1:

The system performs preliminary signing and hashing of data blocks before they are stored in the decentralized network. Each node signs data blocks with its private key and generates cryptographic hashes in advance, creating a chain of trust that validates data integrity before dissemination across the peer-to-peer network

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

Cryptographic hash functions and digital signatures act as intermediaries between the data and the decentralized storage nodes. These mathematical mechanisms mediate the verification process, allowing nodes to authenticate data without requiring trust in other nodes, thus enabling both decentralization and reliability

Inventive Principle:
Principle #24Intermediary (Mediator)

2Reliability

If multiple peer nodes validate each data block through signing and hashing, then data authentication is improved, but computational overhead and processing time increase

Engineering Contradiction:
Improvedata authenticationVSAvoidvalidation processing time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The validation process is segmented into distinct cryptographic operations: hashing the data block, signing the hash with private keys, and verifying signatures. This segmentation allows parallel processing across multiple nodes simultaneously, reducing overall validation time while maintaining security

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system uses cryptographic parameters (hash algorithms, signature lengths) that balance security requirements with computational efficiency. By optimizing these parameters, the system achieves strong authentication without excessive processing overhead

Inventive Principle:
Principle #35Parameter changes

3Reliability

If cryptographic signatures and hashing are applied to all data blocks, then data security is improved, but storage space requirements increase

Engineering Contradiction:
Improvedata securityVSAvoidstorage space
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

Instead of storing redundant copies of entire data blocks for verification, the system extracts only the essential cryptographic elements (hashes and signatures) that prove data integrity. These compact cryptographic proofs are stored alongside the original data, providing verification capability with minimal space overhead

Inventive Principle:
Principle #2Taking out (Extraction)

Data Source

PatentUS12238168B1Systems and methods for data integrity and authentication in a content-addressable peer-to-peer storage network
Publication Date: 2025.02.25 EDJX INC
  • US12238168B1 patent drawing
  • US12238168B1 patent drawing
  • US12238168B1 patent drawing

AI summary

The present invention is a data protocol providing notarization of a data between two or more nodes on a content-addressable peer-to-peer storage network. A node generates a new data block, which is witnessed by peer nodes to increase the integrity of the data. Each peer node responds to the node's signature request with an encoded digital signature of the data using a private key. The node appends the signature from each witness node to the data block and then generates a cryptographic hash of the entire data block, which is used as the identity of the block.