Dual Cryptographic Proofs for Shorter Large-Dataset Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing cryptographic proof systems for large datasets become impractical due to the linear growth of data required to verify data integrity, leading to inefficiencies in storing and verifying the immutability of data.
Innovation Solution
A dual cryptographic proof system combining linear and binary cryptographic linking, where each transaction is cryptographically linked to the previous transaction and includes the root hash value of an incremental hash tree, allowing for shorter proofs and efficient verification.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If linear cryptographic linking is used to ensure data immutability, then data integrity verification is achieved, but the amount of data required for cryptographic proofs grows linearly, becoming impractical for large datasets
Solution Approach 1:
The patent segments the cryptographic proof into two distinct components: linear cryptographic proof data from the transaction data file and binary cryptographic proof data from the incremental hash tree. This segmentation allows each component to serve a specific verification purpose, with the binary hash tree providing a compact summary that reduces overall proof size while maintaining integrity verification capability.
Solution Approach 2:
The patent introduces a binary tree structure (incremental hash tree) as an additional dimensional organization layer over the linear transaction data. This binary structure enables logarithmic-scale cryptographic proofs by creating hierarchical hash relationships, transforming the proof mechanism from purely linear to a two-dimensional structure combining linear linking with binary tree compression.
2Quantity of substance
If hash trees are used to generate efficient cryptographic proofs with smaller size, then proof data quantity is reduced, but insertion time grows at a logarithmic rate
Solution Approach 1:
The patent pre-computes and stores the incremental hash tree structure alongside the transaction data file during the data ingestion phase. By establishing this binary hash tree structure in advance, the system eliminates the need for complex real-time hash computations during verification, as the tree structure is already built and can be queried efficiently.
Solution Approach 2:
The incremental hash tree acts as an intermediary data structure that bridges the transaction data file and the verification process. Instead of directly verifying linear cryptographic links across all transactions, the hash tree provides a compressed intermediate representation that enables faster verification while maintaining the cryptographic guarantees of the original linear structure.
3Productivity
If a dual cryptographic proof system combining linear and binary linking is implemented, then proof size is reduced and verification efficiency is improved, but system complexity increases
Solution Approach 1:
The patent merges linear cryptographic linking and binary hash tree structures into a unified dual-proof system where both approaches complement each other. The linear linking provides chronological integrity verification while the binary hash tree provides compact proof representation, and together they create a more efficient overall verification system than either approach alone.
Data Source
AI summary
Disclosed herein are computer-implemented methods of, and computer systems for, constructing dual cryptographic proofs for transactions where transaction data is stored in a cryptographically-linked data file and in an incremental hash tree, where a dual cryptographic proof includes linear cryptographic proof data from the cryptographically-linked transaction file and binary cryptographic proof data from the incremental hash tree. The transaction may include one or more key-value pairs.