Cryptocurrency Account State Encoding for Scalable Validation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
As blockchains grow in size, validating new transactions becomes increasingly resource-intensive, particularly for account-based cryptocurrencies with large numbers of accounts, as existing solutions struggle to provide efficient proofs of membership and updates without significant resource allocation.
Innovation Solution
A new encoding scheme for the state of an account-based cryptocurrency using groups of unknown order, allowing for succinct encoding and proofs that do not grow with the number of accounts, with verification and updates involving group exponentiations, enabling fast and trustless setup.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional blockchain validation methods are used with large numbers of accounts, then validation completeness is maintained, but resource consumption increases significantly
Solution Approach 1:
The patent segments the blockchain state into discrete mathematical components (group elements) that can be independently verified. Instead of validating against the entire state, validators work with segmented proof elements that collectively represent the complete state, reducing computational overhead while maintaining validation completeness.
Solution Approach 2:
The patent introduces mathematical proofs (Schnorr proofs, group exponentiations) as intermediaries between the user's account state and the validator's verification process. These proofs act as compact representations that mediate the validation, allowing validators to verify account balances without directly accessing or processing the entire blockchain state.
2Speed
If all account states are stored in memory for fast access, then access speed is improved, but memory requirements increase significantly
Solution Approach 1:
The patent extracts only the essential verification information from the full account state and stores it in compact mathematical form (group elements of size 32-64 bytes). Instead of storing complete account records, the system extracts and stores only the cryptographic commitments needed for validation, dramatically reducing memory requirements while maintaining fast access through efficient mathematical operations.
Solution Approach 2:
The patent changes the representation parameters of account states from traditional database formats to cryptographic group elements. This parameter transformation converts large, complex data structures into compact mathematical objects that occupy minimal memory space but enable rapid verification through group exponentiation operations.
3Quantity of substance
If succinct encoding is used to reduce state size, then storage efficiency is improved, but verification complexity increases
Solution Approach 1:
The patent replaces traditional mechanical verification methods (iterating through account lists, database queries, complex conditional logic) with mathematical substitution based on group theory. Verification is achieved through elegant mathematical operations (exponentiations, multiplications) that are computationally simpler and more efficient than traditional computational approaches, despite the succinct encoding.
4Adaptability or versatility
If more nodes are added to the network for decentralization, then network distribution is improved, but total resource consumption increases
Solution Approach 1:
The patent enables partial validation where nodes can verify transactions using only the compact state snapshots and mathematical proofs provided, without requiring excessive computational resources. This allows more nodes to participate in validation with modest resource requirements, improving network distribution while keeping total resource consumption manageable through efficient cryptographic verification.
Data Source
AI summary
A method includes a validation computer receiving an authorization request message comprising a user state and a user proof from a user device. The user state comprises first and second user state elements. The user proof comprises first, second, and third user proof elements. The validation computer computes a first verification value by multiplying the first user proof element raised to the power of the second user state element, and the second user proof element raised to the power of the first user state element. The computer computes a second verification value by raising the second user proof element to the power of the second user state element. The computer compares the first verification value to a first accumulated state element of an accumulated state. The compares the second verification value to a second accumulated state element. The validation computer authorizes the authorization request message based on the comparison steps.