diff --git a/Proof-of-Time.md b/Proof-of-Time.md
index 9b4f771..f92252d 100644
--- a/Proof-of-Time.md
+++ b/Proof-of-Time.md
@@ -25,4 +25,6 @@ As difficulty levels in blockchain networks like Bitcoin increased, the computat
 
 RandomX is a PoW concept that was created by Monero. It is specifically designed to be CPU-friendly and resistant to the dominance of specialized mining hardware like GPUs and ASICs. RandomX was introduced to preserve decentralization by making mining feasible on consumer-grade CPUs while limiting the effectiveness of GPUs and ASICs. This approach contrasts with traditional PoW algorithms.
 
-RandomX is a memory-intensive and compute-intensive PoW algorithm that leverages features of general-purpose CPUs to perform mining tasks efficiently. The core idea behind RandomX is to design an algorithm that can fully utilize the strengths of modern CPUs, such as branch prediction, out-of-order execution, and memory access patterns. This it difficult to optimize these processes on GPUs and ASICs. It achieves this by relying on random code execution and memory-hard operations, which require large amounts of RAM and frequent memory access. This makes it prohibitively expensive and inefficient for specialized hardware to outperform CPUs in the mining process.
\ No newline at end of file
+RandomX is a memory-intensive and compute-intensive PoW algorithm that leverages features of general-purpose CPUs to perform mining tasks efficiently. The core idea behind RandomX is to design an algorithm that can fully utilize the strengths of modern CPUs, such as branch prediction, out-of-order execution, and memory access patterns. This it difficult to optimize these processes on GPUs and ASICs. It achieves this by relying on random code execution and memory-hard operations, which require large amounts of RAM and frequent memory access. This makes it prohibitively expensive and inefficient for specialized hardware to outperform CPUs in the mining process.
+
+The key difference between Monero’s RandomX and traditional PoW algorithms, like Bitcoin’s SHA-256 or Litecoin’s Scrypt, lies in the way these algorithms interact with hardware. In traditional PoW, the computational workload is focused on repetitive hashing operations, which can be parallelized easily, giving GPUs and ASICs a significant edge.
\ No newline at end of file