Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Jurnal Algoritma

Evaluasi Performa Proof of Work dan Proof of Stake melalui Uji Stres Beban Tinggi Blockchain Yulianti, Indira; Ardiansyah, Rizka; Yazdi Pusadan, Mohammad; Amriana; Lamasitudju, Chairunnisa
Jurnal Algoritma Vol 22 No 2 (2025): Jurnal Algoritma
Publisher : Institut Teknologi Garut

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33364/algoritma/v.22-2.2500

Abstract

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.
Implementation of Long Short-Term Memory Algorithms on Cryptocurrency Price Prediction with High Accuracy on Volatile Assets Nursiana Zasqia, Andi Nirina; Laila, Rahmah; Trezandy Lapatta, Nouval; Yazdi Pusadan, Mohammad; Santi, Dessy; Wirdayanti
Jurnal Algoritma Vol 22 No 2 (2025): Jurnal Algoritma
Publisher : Institut Teknologi Garut

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33364/algoritma/v.22-2.2422

Abstract

Cryptocurrencies have emerged as one of the most popular digital assets, characterized by high volatility, which presents a significant challenge in forecasting their price movements accurately. This study aims to implement the Long Short-Term Memory (LSTM) algorithm to predict the prices of selected cryptocurrencies, including Bitcoin (BTC), Binance Coin (BNB), Ethereum (ETH), Dogecoin (DOGE), Solana (SOL), and Shiba Inu (SHIB). The LSTM model is trained using the Adam optimizer and employs early stopping to mitigate overfitting. Model performance is evaluated using Mean Absolute Error (MAE), Mean Squared Error (MSE), Root Mean Squared Error (RMSE), and the coefficient of determination (R²). The results indicate that the LSTM model achieves strong predictive accuracy for relatively low-volatility assets such as Dogecoin and Solana, with R² scores of 0.9795 and 0.9523, respectively. In contrast, its performance declines when applied to highly volatile assets like Bitcoin and Binance Coin. The findings also suggest that LSTM performs best in short-to-medium-term forecasts (7 to 30 days), but shows limitations in long-term predictions. This study contributes to the field by demonstrating the applicability of LSTM in financial forecasting and highlighting its strengths and constraints across different volatility profiles. Practically, the findings can assist traders and financial analysts in making data-driven decisions by applying LSTM models for more reliable short-term predictions, while emphasizing the need to integrate external market factors to enhance long-term forecast accuracy.