Blockchain event ordering algorithm based on high-dimensional multi-objective differential evolution

Abstract Since the birth of Bitcoin, blockchain technology has been widely used in many fields, such as finance, supply chain management, smart contracts, etc.and has been highly valued for its decentralized and tamper-proof characteristics. With the expansion of application scenarios, blockchain faces inefficient data processing challenges, particularly in event sequencing and processing. Developing efficient event sequencing algorithms is a research priority to enhance the performance of blockchain systems. This study addresses the efficiency problem in blockchain event sequencing by introducing a high-dimensional multi-objective differential evolution strategy to improve blockchain technology’s performance in various fields. This paper uses the NSGA-III-WA algorithm to efficiently sort blockchain events by combining differential evolution strategies. Compared to the traditional sorting algorithm, this algorithm reduces latency by 30% and improves memory usage by about 20% when dealing with events of the same size, ensuring sorting accuracy. By optimizing the weight vector adjustment strategy, the convergence speed and distribution uniformity of the algorithm and the solution can be optimized. In this paper, the algorithm can effectively improve the efficiency and performance of blockchain event processing, which is critical in optimizing blockchain systems.