Ethereum: When we can agree on mempool sorting order, we can just confirm first n-transactions that are at least 10 mins old. What’s missing?

Path to unification of MemPool sorting order in Ethereum

In recent years, there has been an urgent need for a uniform sorting order in Ethereum mempools. For those who don’t know, the mempool is a critical component of the Ethereum network responsible for effectively managing incoming transactions and verifying their legitimacy.

Currently, different developers offer different sorting orders to optimize performance and reduce latency. However, these proposals often lack an important aspect: an agreement on which transactions should be prioritized when sorting mempools. In this article, we will consider why the current approach is imperfect and what is missing to achieve a single sorting order.

The problem with current approaches

One of the main problems of existing sorting orders is their lack of clarity and consistency between the implementations of different developers. For example:

• Sorting order offers: Different offers offer different sorting orders, for example, “earliest first”, “latest first” or even a special algorithm that combines several factors.

• Priority Agreement: developers can agree on some priority rules, but not others, which leads to inconsistencies and potential conflicts when sorting the memory pool.

Proposed solution: sorting by the first N transactions (80%)

To solve these problems, we offer an alternative approach:

• Sorting order: sorting of mempool transactions by the first n transactions (or 80% of transactions) that are at least 10 minutes long.

• Confirmation

  

  : After sorting, confirm and send the block header to all parties involved.

Advantages of this approach

Using this unified approach, we can achieve a number of advantages:

• Increased performance: sorting by the first n-transactions reduces latency and minimizes conflicts between implementations from different developers.

• Increased Consistency: Due to a uniform sort order, developers are more likely to agree on priority rules, which reduces the number of conflicts and ensures consistency between different memory pool implementations.

• Increased security: By prioritizing transactions that last at least 10 minutes, we can reduce the likelihood that attackers will try to exploit weak sorting orders.

Next Steps

To move to a single sort order in Ethereum mempools, we recommend:

• Collaborative Development: Encourage developers from different teams and communities to contribute to the discussion and development of a common, common sorting order.

• Implementation Guidelines: Establish clear guidelines for implementing the proposed sorting order, including any necessary changes or adjustments to existing codebases.

By working together and using this unified approach, we will be able to create a more efficient, secure and scalable Ethereum network that will benefit all parties involved.

Ethereum Where More Namely Exploit