From 349eaae725c2f548cc714a6337ccea92eeb62015 Mon Sep 17 00:00:00 2001
From: contractless <00purple@gmail.com>
Date: Wed, 23 Oct 2024 20:28:22 +0000
Subject: [PATCH] Update Proof of Time

---
 Proof-of-Time.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Proof-of-Time.md b/Proof-of-Time.md
index 7a3b7fc..86c2db0 100644
--- a/Proof-of-Time.md
+++ b/Proof-of-Time.md
@@ -27,9 +27,9 @@ RandomX is a PoW concept that was created by Monero. It is specifically designed
 
 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.
+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.
 
-In contrast, RandomX is deliberately designed to take advantage of the sequential processing capabilities of CPUs. The algorithm dynamically generates random sequences of instructions and requires large amounts of memory, limiting the degree of parallelism that GPUs can achieve. GPUs, which excel at performing many simple tasks in parallel, struggle with RandomX’s sequential and memory-intensive workload.
+In contrast, RandomX is deliberately designed to take advantage of the sequential processing capabilities of CPUs. The algorithm dynamically generates random sequences of instructions and requires large amounts of memory, limiting the degree of parallelism that GPUs can achieve. GPUs, which excel at performing many simple tasks in parallel, struggle with RandomX's sequential and memory-intensive workload.
 
 RandomX has an inverse effect compared to traditional PoW algorithms. While traditional PoW leads to mining centralization around GPUs and ASIC hardware, RandomX shifts the focus to CPUs and memory, making CPU mining more efficient. However, like other PoW algorithms, it still favors one type of hardware—CPUs—over GPUs and ASICs. To date, no PoW algorithm has been able to balance mining equally across all hardware types, as each algorithm inevitably favors either CPUs or specialized hardware like GPUs and ASICs.