Adaptive Multi-paradigm Metaheuristic Optimization for Blockchain Scalability: A Comparative Evaluation of Transaction Latency and Throughput

In the digital world, a blockchain is a shared record book that many computers keep together, ensuring that every transaction is secure and transparent without needing a central bank or authority to watch over it. Imagine a group of neighbors all writing down every time money changes hands in their village, each keeping an identical copy of the ledger. The challenge arises when the village grows too large; if too many people try to write in the ledger at once, the process slows down, and it takes longer for everyone to agree on what was written. This is the problem of scalability: as the number of transactions increases, the time it takes to confirm them grows, and the number of transactions the system can handle per second drops. For blockchain technology to be useful for everyday things like global payments or voting systems, it must be able to process thousands of transactions quickly without getting bogged down.

Researchers at the Federal University Dutse in Nigeria have tackled this bottleneck by developing a new method to help these digital systems run more smoothly. They focused on two specific measures of performance: how long a transaction takes to be confirmed, known as latency, and how many transactions the system can process in a single second, known as throughput. To solve the problem, they created a new computer program called Multi-paradigm Adaptive Metaheuristic Optimization, or MAMO. This program acts like a smart traffic controller for the blockchain. Unlike older methods that follow a fixed set of rules regardless of how busy the system is, MAMO constantly learns and adjusts its strategy. It combines several different problem-solving techniques, including methods that mimic how nature finds solutions and systems that use feedback to correct mistakes in real time. The goal was to see if this adaptable approach could keep the blockchain moving fast even when the workload becomes heavy.

To test their idea, the researchers built a detailed computer simulation of a blockchain network. They did not use a real-world network, but rather a virtual environment where they could control every variable with precision. They set up a head-to-head competition between their new MAMO system and an existing method called the Snake Optimization Algorithm, which is a more recent technique inspired by the hunting and mating behaviors of snakes. They ran the simulation under six different conditions, starting with just one transaction and scaling all the way up to one hundred thousand transactions. For each condition, they ran the test thirty times to ensure the results were consistent and not just a lucky fluke. They kept everything else exactly the same for both systems, changing only the method used to organize the transactions, so that any difference in speed could be blamed directly on the algorithm itself.

The results showed a clear advantage for the new adaptive system. When the workload was light, both systems performed reasonably well, but as the number of transactions increased, the older Snake method began to struggle. At the highest level of activity, with one hundred thousand transactions, the Snake system took an average of 1.048680 milliseconds to confirm a transaction. In contrast, the MAMO system managed the same task in just 0.939850 milliseconds. While this difference might seem small, in the world of high-speed computing, it represents a significant improvement in responsiveness. More importantly, the new system handled a much larger volume of work. At that same peak load, the MAMO system processed 327,509.84 transactions per second, whereas the Snake system could only manage 202,864.77. This means the new method was able to process roughly 61 percent more transactions in the same amount of time.

The researchers also looked at how stable the systems were. The older method showed much more variation in its performance; sometimes it was fast, and other times it was much slower, especially when the network was under heavy stress. The new MAMO system, however, remained steady and predictable across all thirty trials for every workload level. Statistical tests confirmed that the improvement in the number of transactions processed was not a coincidence but a reliable result that held true across all the different scenarios. While the new system showed a lower latency at the highest workload, statistical significance for latency improvements was found only at the lowest workload level (one transaction); the improvements at higher workloads, including the most extreme pressure, did not reach statistical significance after correction. The study suggests that by allowing the optimization process to adapt to the current state of the network, rather than sticking to a rigid plan, the system can maintain high performance even as demand surges.

This work does not claim to have solved every problem facing blockchain technology. The results come from a controlled computer simulation, and the researchers acknowledge that real-world networks involve many other factors, such as energy consumption and security, which were not part of this specific test. They also noted that while their method outperformed the Snake algorithm, there are other existing methods that could be compared in future studies. However, the findings provide strong evidence that a flexible, learning-based approach is superior to a static one when dealing with the complex and changing demands of a large-scale digital ledger. By proving that the system can learn and adjust in real time, the researchers have offered a promising path forward for making blockchain technology fast enough to support the next generation of digital applications.