Compressible Blockchain Using Merkle Roots for Private Validation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing blockchain systems lack efficient methods for processing private transactions and ensuring secure, tamper-proof storage and validation of operations, particularly in decentralized networks where parties do not fully trust one another.
Innovation Solution
Implementing a compressible blockchain network that utilizes a decentralized database with smart contracts and consensus protocols, enabling secure and efficient processing of operations through Merkle roots and hashing to generate account disposition blocks, ensuring data integrity and trust among untrusted parties.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If traditional blockchain systems store all transaction operations, then complete transaction history is maintained, but data storage size becomes excessively large and processing efficiency decreases
Solution Approach 1:
The patent extracts only the essential state information (account dispositions) from the full transaction history and stores only these compressed representations in the blockchain. The detailed transaction operations are retained locally by participants for processing but not stored in the shared blockchain, thereby reducing storage requirements while maintaining processing efficiency.
Solution Approach 2:
The patent changes the representation parameter from storing individual transaction operations to storing aggregated account disposition states. By transforming the data representation from granular transaction-level details to summarized state-level information, the system achieves compact storage while preserving the necessary information for valid transaction processing.
2Reliability
If decentralized blockchains operate without full trust among parties, then network autonomy is maintained, but secure validation of private transactions becomes difficult
Solution Approach 1:
The patent introduces Merkle roots as an intermediary data structure that enables efficient verification of transaction inclusions. The Merkle root serves as a cryptographic summary that allows nodes to validate transactions without requiring full trust or complex consensus mechanisms, simplifying the verification process while maintaining security in decentralized environments.
3Productivity
If blockchain blocks store detailed operation data, then transaction completeness is ensured, but block processing time increases and throughput decreases
Solution Approach 1:
The patent extracts and stores only the essential account disposition information in each block rather than storing complete transaction operations. This extraction of critical state data enables faster block processing and higher throughput while participants maintain local copies of full transaction histories for completeness.
Solution Approach 2:
The patent segments the storage function by separating detailed transaction data (stored locally by participants) from summarized state data (stored in the shared blockchain). This segmentation allows the blockchain to process blocks quickly with minimal data while participants retain the ability to process complete transactions locally.
Data Source
AI summary
A node in a blockchain network may invoke a process comprising receiving one or more operations for inclusion in a block, receiving a previous Merkle root created from previously determined account dispositions from a previous block, resolving the one or more operations based on the previous account dispositions to determine one or more current account dispositions, creating a current Merkle root for the one or more current account dispositions, and hashing current data for the current block, the data comprising the current Merkel root and the previous Merkle root to generate an account disposition block.