Reserve Contract Batching with Pedersen Commitments and cc-SNARKs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing zero-knowledge proof algorithms used in finance for verifying reserves consume significant time, prolonging the generation of transactions.
Innovation Solution
A method utilizing Pedersen commitment and cc-SNARK to generate a single transaction for multiple contract requests by obtaining mid-large and large commit values, and using a zero-knowledge proof algorithm to verify the integrity of multiple reserves.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If zero-knowledge proof algorithm is used to verify reserve integrity, then verification reliability is improved, but transaction generation time is significantly prolonged
Solution Approach 1:
The patent segments the verification process by dividing multiple individual reserve verifications into a single batch verification. Instead of verifying each reserve separately using zero-knowledge proofs, the system aggregates multiple reserves into one collective verification operation, maintaining verification reliability while dramatically reducing the time required for transaction generation.
Solution Approach 2:
The patent merges multiple individual contract requests and reserve verifications into a single transaction. By combining multiple verification operations into one unified process, the system achieves both reliability through comprehensive verification and efficiency by eliminating redundant computational overhead associated with separate verification operations.
2Productivity
If multiple individual transactions are generated for multiple contract requests, then each transaction can be processed independently, but overall processing time increases
Solution Approach 1:
The patent combines multiple individual contract requests into a single transaction that processes all requests simultaneously. This merging approach maintains the independence and integrity of each contract request while eliminating the sequential processing overhead, thereby improving overall productivity and reducing total processing time.
Solution Approach 2:
The patent enables continuous processing by allowing multiple contract requests to be handled in an uninterrupted batch operation. Instead of pausing between individual transactions, the system maintains continuous useful action by processing all requests in one unified transaction flow, maximizing productivity without sacrificing processing completeness.
Data Source
AI summary
The present invention relates to a reserve contract method for generating single transaction in response to a plurality of contract requests. The reserve contract method, performed by at least one processor, includes receiving a plurality of contract requests for a plurality of reserves; obtaining a mid-large commit value based on the plurality of reserves and a plurality of random values using a verify key; generating a hash value based on the mid-large commit value; generating a large reserve value from the plurality of reserves based on the hash value; generating a large random value based on the plurality of random values based on the hash value; obtaining an proof value using the mid-large commit value, the large reserve value, and the large random value using a zero-knowledge proof algorithm; and transmitting the proof value as a transaction. The mid-large commit value has a Pedersen commitment format.