Distributed Database State Proofs via Merkle Tree Signatures
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing distributed database systems face challenges in efficiently verifying the state of data across multiple devices in a network, as consensus methods struggle to accurately determine the state of a distributed database at any given time due to the complexity of verifying data consistency across separate instances.
Innovation Solution
The implementation of state proofs and ledger identifiers using a Merkle tree structure, where a state proof includes data, a timestamp, and a set of address books, with digital signatures from a predetermined number of compute devices verifying the validity of the data and the chronological order of address books, ensures data integrity and consistency across the distributed database.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple devices store separate instances of the distributed database to achieve decentralized storage, then data redundancy and availability are improved, but verifying data consistency and state across devices becomes more complex
Solution Approach 1:
The patent uses cryptographic hashes (copies) of the database state rather than storing and verifying actual data copies across devices. Each device maintains a hash of the Merkle root, allowing verification of data integrity without comparing entire data sets, thus reducing verification complexity while maintaining reliability
Solution Approach 2:
The Merkle tree structure acts as an intermediary between distributed devices. The Merkle root hash serves as a compact representation that mediates verification across all devices, allowing each device to independently verify the state without direct peer-to-peer data comparison, reducing the complexity of cross-device verification
2Reliability
If consensus methods are used to determine transaction order and database state, then data consistency is improved, but the process becomes slower and less efficient
Solution Approach 1:
The patent extracts only the essential verification information (Merkle root hash and digital signatures) from the complete consensus process. Instead of requiring full consensus verification of all transactions, devices can efficiently verify the final state by checking the Merkle root and associated signatures, significantly improving verification efficiency while maintaining consistency
Solution Approach 2:
The Merkle tree structure is built in advance as transactions are processed, with the Merkle root calculated and signed before distribution. This preliminary preparation allows receiving devices to efficiently verify state without performing complex real-time consensus calculations, improving productivity
3Reliability
If digital signatures from multiple compute devices are required to verify address books, then security and reliability are improved, but the verification process becomes more time-consuming
Solution Approach 1:
The patent requires signatures from a threshold number of devices (e.g., 2 out of 3) rather than all devices. This partial action approach maintains security by ensuring sufficient consensus while reducing verification time compared to requiring unanimous signatures from all compute devices
Data Source
AI summary
A method includes calculating, at a first time, an identifier for a distributed database by using a first address book of the distributed database. The method includes receiving a transaction to at least one of (1) add a compute device to the first set of compute devices, (2) remove a compute device from the first set of compute devices, or (3) modify a compute device from the first set of compute devices, to define a second set of compute devices. The method includes defining, at a second time, a second address book. The method includes receiving, a state proof associated with data of the distributed database after the second time. The method includes verifying the data of the distributed database by confirming that a predetermined number of compute devices from the first set of compute devices have digitally signed the second address book.