Skip Graph DHT Blockchain for Scalable Consensus
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current blockchain systems face scalability issues in communication and storage, lack fairness in consensus participation, and struggle with efficient fork resolution, leading to inefficiencies and potential centralization.
Innovation Solution
A blockchain architecture based on a Skip Graph distributed hash table that allows for efficient communication and storage by replicating blocks and transactions among peers, enabling on-demand access and ensuring uniform participation in consensus, with a deterministic fork resolution mechanism.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If blockchain systems use epidemic message dissemination to retrieve peer knowledge, then all peers can access blocks and transactions, but communication complexity increases to O(n)
Solution Approach 1:
The patent introduces a Distributed Hash Table (DHT) as an intermediary structure to replace direct peer-to-peer epidemic dissemination. The DHT acts as a mediator that organizes peer knowledge in a structured manner, allowing O(log n) lookup complexity instead of O(n) broadcasting, while maintaining reliable access to blocks and transactions across the network.
Solution Approach 2:
The patent segments the peer knowledge space into discrete key-value pairs stored in the DHT, where each peer's knowledge about blocks and transactions is segmented into specific entries. This segmentation allows efficient targeted retrieval rather than requiring all peers to broadcast all knowledge, reducing communication complexity from O(n) to O(log n).
2Reliability
If all peers store complete blockchain data, then data availability is high, but storage complexity increases to O(b)
Solution Approach 1:
The DHT serves as an intermediary storage layer that distributes blockchain data across the network in a structured manner. Instead of requiring all peers to store complete blockchain data, the DHT mediates data distribution so that each peer stores only relevant portions, reducing individual storage complexity from O(b) to O(b/n) while maintaining overall data availability through the distributed structure.
Solution Approach 2:
The patent applies local quality by allowing different peers to store different portions of the blockchain data based on their local needs and capabilities. The DHT enables each peer to have a customized local copy of only the blocks and transactions relevant to their operations, rather than requiring uniform complete storage across all peers, thus reducing overall storage complexity while maintaining availability.
3Ease of manufacture
If blockchain systems use unstructured overlays, then implementation is simple, but lookup efficiency for peers and content is poor
Solution Approach 1:
The DHT introduces a structured overlay as an intermediary between simple peer-to-peer connections and efficient lookup operations. While the DHT structure adds some implementation complexity compared to unstructured overlays, it provides deterministic and efficient lookup mechanisms for finding peers and content, improving productivity from O(n) to O(log n) while maintaining reasonable implementation feasibility.
Data Source
AI summary
A blockchain architecture operating over a skip graph-based P2P overlay to improve a communication and storage efficiency, a convergence to centralization, and consistency problems of existing blockchain solutions is provided. The blockchain architecture provides addressable peers, blocks, and transactions within a network; making the addressable peers, the blocks and transactions efficiently accessible in an on-demand manner by peers using a skip graph lookup operation where no peer is required to store an entire blockchain, and stores a replicated subset of the blocks and transactions and answers queries of other peer on the blocks and transactions. The blockchain architecture discloses a fair blockchain with a uniform chance for participating peers to be involved in a consensus protocol regardless of an influence of the participating peers in a system with an improved consistency governing a deterministic fork-resolving policy.