Consensus mechanisms play a crucial role in determining the efficiency and scalability of blockchain systems. The two most commonly used algorithms are Proof of Work and Proof of Stake, each exhibiting distinct performance characteristics under high transaction loads. This study aims to evaluate and compare the performance of both consensus mechanisms through a simulation-based experimental approach. Testing was conducted using the Hardhat framework in a local environment under two primary scenarios: transaction scaling and burst transaction.Four evaluation metrics were employed: throughput, transaction latency, finality time, and mempool congestion. The results indicate that Proof of Stake consistently outperforms across all four metrics, demonstrating high throughput, stable latency and finality time, and controlled mempool congestion. In contrast, Proof of Work shows a significant decline in performance under heavy load due to its static and non-adaptive mining process.The Mann-Whitney U statistical test confirms that the performance differences are statistically significant across nearly all metrics. This research provides deeper insights into the strengths and limitations of each consensus mechanism under high-load conditions using Hardhat, and contributes to a broader understanding of blockchain scalability in real-world applications. The findings suggest that Proof of Stake is more suitable for large-scale blockchain implementations that demand high efficiency and speed.
Copyrights © 2025