Zero-Knowledge Proof Transaction Chain Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current blockchain systems lack a concise method to prove that two transactions are linked through a transaction chain without relying on a trusted third party, leading to inefficient storage and verification processes, especially for large transaction chains.
Innovation Solution
A computer-implemented method using Zero-Knowledge Proofs (ZKPs) to generate and verify proof data that demonstrates the linkage between transactions within a transaction chain, allowing for efficient proof of an ordered sequence of events with minimal data transfer and computational overhead.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional blockchain verification methods are used to prove transaction chain linkage, then verification reliability is maintained, but communication cost and data storage requirements increase significantly
Solution Approach 1:
The patent extracts only the essential verification information from the complete transaction chain by generating succinct zero-knowledge proofs. Instead of transmitting or storing entire transaction histories, the system extracts cryptographic proofs that contain only the necessary information to verify chain linkage, dramatically reducing communication overhead while maintaining verification reliability
Solution Approach 2:
The patent introduces zero-knowledge proofs as an intermediary mechanism between transaction verification and communication. These proofs act as mediators that enable verification of transaction chain linkage without requiring direct transmission or storage of the actual transaction data, thus reducing communication costs while preserving verification integrity
2Measurement precision
If complete transaction chains are stored for verification, then verification accuracy is improved, but device complexity and computational overhead increase
Solution Approach 1:
The patent creates simplified cryptographic copies of transaction verification information through zero-knowledge proofs. Instead of storing and processing complete transaction chains, the system generates proof copies that encapsulate the essential verification logic, enabling accurate verification with significantly reduced computational complexity
Solution Approach 2:
The patent transforms the verification problem from checking entire transaction histories to verifying cryptographic proof parameters. By changing the verification parameters from raw transaction data to succinct proof structures, the system maintains verification accuracy while dramatically reducing computational overhead and device complexity
3Productivity
If transaction chain proofs are made more concise, then communication efficiency is improved, but proof generation complexity increases
Solution Approach 1:
The patent performs proof generation as a preliminary action before communication occurs. By pre-computing zero-knowledge proofs and embedding them in transactions, the system enables concise and efficient communication without requiring complex real-time verification operations. The computational complexity is shifted to the proof generation phase, allowing for simple and efficient verification and communication afterward
Data Source
AI summary
A computer implemented method of providing proof of an ordered sequence of events, the method performed on a computing device and comprising: receiving a transaction; creating a further transaction to be sent to a further computing device; obtaining proof data associated with the further transaction that provides proof to the further computing device that the further transaction is linked to an initial transaction in a transaction chain comprising the transaction, wherein the initial transaction relates to an initial event in the ordered sequence of events, and the proof data comprises: (i) a proof; (ii) an identifier of the transaction; and (iii) a unique identifier of the initial transaction; and sending the further transaction and the proof data to the further computing device.