Recursive Endorsements for Faster Decentralized Database Validation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Centralized databases face issues such as single points of failure, network dependency, limited data access, and difficulty in data retrieval due to lack of redundancy, necessitating improved endorsement validation methods.
Innovation Solution
Implementing recursive endorsements in a decentralized database system where a subset of trusted peers verify and sign endorsements, reducing the number of signatures to be verified, and validating the endorsement policy based on these trusted peers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a centralized database is used to maintain data at a single location, then data redundancy is minimized and control is simplified, but the system becomes highly dependent on network connectivity and has a single point of failure
Solution Approach 1:
The patent divides the centralized database into multiple distributed database nodes across different locations. Each node maintains copies of the data, eliminating the single point of failure while distributing the system's functionality across multiple independent units that can operate autonomously.
Solution Approach 2:
The patent enables local access to data at distributed nodes without requiring network connectivity to the central database. Each node has the capability to process and access data locally, reducing dependency on network infrastructure while maintaining data availability.
2Measurement precision
If all signatures from the set of endorsers are verified to validate the endorsement policy, then validation accuracy is maximized, but validation effort and processing time increase significantly
Solution Approach 1:
The patent extracts a subset of trusted peer signatures from the complete set of endorser signatures. Instead of verifying all signatures, the system identifies and verifies only the critical subset from trusted peers, maintaining validation accuracy while significantly reducing processing time and computational effort.
Solution Approach 2:
The patent applies partial verification by checking only the necessary portion of signatures (trusted peers) rather than the complete set. This partial action is sufficient to validate the endorsement policy while avoiding the excessive computational burden of verifying every single signature.
3Reliability
If a decentralized database system is implemented to eliminate single points of failure, then system reliability improves, but the number of endorsements and signatures to verify increases
Solution Approach 1:
The patent extracts and identifies a specific subset of trusted peers from the larger distributed network. By focusing validation efforts on this curated subset rather than all nodes in the decentralized system, the patent reduces the complexity of endorsement validation while preserving the fault tolerance benefits of decentralization.
Solution Approach 2:
The patent performs preliminary identification of trusted peers before the endorsement validation process. This advance preparation creates a pre-defined subset of validators, simplifying the subsequent verification process and reducing computational complexity while maintaining the reliability advantages of the decentralized architecture.
Data Source
AI summary
Recursive endorsements in a decentralized database minimize validation effort for a smart contract because there are fewer signatures to verify. Collected endorsements required by an endorsement policy are verified and signed by a set of trusted peers representing different organizations, the set of trusted peers being fewer than the number of endorsing peers. Prior to validation, the target transaction is submitted with all required endorsements and the signatures of the set of trusted peers. Validation is performed by verifying only the signatures of the set of trusted peers.