Distributed Memory Pool Network for Blockchain Transaction Throughput

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current blockchain systems face limitations in transaction throughput, with approximately 3 new unconfirmed transactions per second, which is insufficient for handling high-volume electronic payments, such as those exceeding 50,000 transactions per second.

Innovation Solution

The implementation of a distributed memory pool (DMP) network using mempool nodes that form a distributed hash table (DHT) to facilitate fast propagation and retrieval of blockchain transactions, enabling improved storage and retrieval efficiency.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If a traditional centralized memory pool is used in blockchain networks, then transaction validation can be performed, but the transaction throughput is limited to approximately 3 transactions per second

Engineering Contradiction:
Improvetransaction throughputVSAvoidtransaction confirmation time
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

The patent divides the centralized memory pool into multiple distributed memory pools across different nodes in the network. Each node maintains its own memory pool, and transactions are propagated through the distributed network rather than through a single centralized pool. This segmentation enables parallel processing of transactions across multiple nodes, dramatically increasing throughput from 3 transactions per second to potentially thousands of transactions per second across the distributed network.

Inventive Principle:
Principle #1Segmentation

2Speed

If transaction propagation speed is increased in the distributed memory pool, then faster transaction confirmation is achieved, but the network becomes more vulnerable to routing attacks

Engineering Contradiction:
Improvetransaction propagation speedVSAvoidnetwork security against routing attacks
Core Design Contradiction:
SpeedVSReliability

Solution Approach 1:

The patent introduces a cryptographic proof-of-work mechanism as an intermediary layer between transaction propagation and confirmation. Before a transaction can be confirmed, it must be included in a block that satisfies the proof-of-work requirement. This intermediary mechanism ensures that even if transactions propagate quickly through the network, malicious routing attempts cannot compromise the integrity of the confirmed transactions, as the proof-of-work provides a secure verification layer.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Quantity of substance

If more nodes are added to the distributed memory pool to increase capacity, then storage capacity increases, but the complexity of maintaining consistency across all nodes increases

Engineering Contradiction:
Improvestorage capacityVSAvoidconsistency maintenance complexity
Core Design Contradiction:
Quantity of substanceVSDevice complexity

Solution Approach 1:

The patent implements a feedback mechanism through the blockchain protocol where each node continuously receives and validates blocks from other nodes. The proof-of-work consensus protocol provides feedback to ensure that all nodes converge to the same state. When new blocks are added to the chain, all nodes verify the proof-of-work and update their memory pools accordingly. This feedback loop automatically maintains consistency across the distributed network without requiring complex manual coordination, allowing the network to scale to thousands of nodes.

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS20250133138A1Methods and systems for a consistent distributed memory pool in a blockchain network
Publication Date: 2025.04.24 NCHAIN LICENSING AG
  • US20250133138A1 patent drawing
  • US20250133138A1 patent drawing
  • US20250133138A1 patent drawing

AI summary

A computer-implemented method is disclosed that includes: receiving, at a mempool node of distributed mempool network (DMP) implementing a distributed hash table (DHT), a request to update routing information of the mempool node; initializing a set of random walks within a key space of the DHT; generating a first record in an first table based at least in part on a first identification information stored in a second of a long-distance table type; generating a second record in a third table of the long-distance table type by at least performing a first random walk of the set of random walks, the second record containing a second identification information and an address associated with the second identification information; generating a third record in a fourth table of a short-distance table type by at least obtaining records from a table maintained by a second mempool node of the DMP network.