Blockchain Account Note Model Zero-Knowledge Proof Validation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing blockchain transaction validation methods under the account balance model face challenges in maintaining privacy and efficiency, particularly in ensuring that multiple transactions are correctly verified and recorded without revealing transaction amounts or random numbers, which can lead to invalid account balances if not all transactions are validated and recorded.
Innovation Solution
The implementation of non-interactive privacy-preserving verification methods using zero-knowledge proofs and commitment schemes, specifically under the account note model, where transactions are validated based on commitments and public-key encryption without revealing transaction amounts or random numbers, ensuring that the total value of notes equals the sum of transaction amounts and changes, and that the transaction amounts and random numbers match their encrypted forms.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If traditional account balance model is used for blockchain transactions, then transaction validation is straightforward, but privacy of transaction amounts and account balances is compromised
Solution Approach 1:
The patent introduces commitment schemes as an intermediary mechanism between the transaction amount and its representation on the blockchain. The commitment scheme allows the transaction amount to be hidden behind a cryptographic commitment that can be verified without revealing the actual amount. This mediator enables both privacy preservation and validation simplicity.
Solution Approach 2:
The patent transforms the transaction amount from a directly visible parameter to a hidden parameter represented by cryptographic commitments. By changing the parameter representation from plaintext to committed form, the system achieves privacy while maintaining verifiability through the commitment's mathematical properties.
2Loss of information
If zero-knowledge proofs are implemented for privacy, then transaction amount privacy is improved, but computational resources and validation time increase
Solution Approach 1:
The patent applies partial zero-knowledge proof mechanisms only where necessary for privacy preservation, rather than implementing full ZKP for all transaction aspects. The commitment scheme provides sufficient privacy for transaction amounts while requiring less computational overhead than complete ZKP implementations.
Solution Approach 2:
The patent extracts the privacy-preserving functionality into a separate commitment scheme layer, allowing the core transaction validation to proceed efficiently while only the privacy-critical components use cryptographic commitments. This separation reduces the overall computational burden.
3Reliability
If multiple transactions are validated sequentially to ensure correct balance updates, then account balance accuracy is maintained, but transaction processing speed decreases
Solution Approach 1:
The patent performs preliminary validation of transaction amounts against committed account balances before actual transaction execution. The commitment scheme allows the validator to check that the transaction amount does not exceed the available balance without sequentially processing each transaction, enabling parallel validation while maintaining accuracy.
Solution Approach 2:
The patent maintains continuous validation capability by using commitment schemes that allow balance verification to occur concurrently with transaction processing. The cryptographic commitments enable ongoing validation without interrupting the transaction flow, maintaining both accuracy and speed.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Implementations of the present disclosure include receiving, from a first account, a digitally signed copy of a plurality of notes, a commitment of a transaction amount of a transaction between the first account and a second account paid by at least a portion of the plurality of notes, a commitment of a change from deducting the transaction amount from a total value of the plurality of notes, and a zero-knowledge proof generated based on one or more selected random numbers. The first account determines that the total value of the plurality of notes equals the sum of the transaction amount and the change, validates the transaction, and updates the first account and the second account based on the plurality of notes, the transaction amount, and the change.