From bdc92f2c26e745e288e184736b22451a816a0894 Mon Sep 17 00:00:00 2001
From: SamiAlHassan <150172180+SamiAlHassan@users.noreply.github.com>
Date: Sun, 16 Feb 2025 13:42:20 +0000
Subject: [PATCH] patch figure links on proof-of-random-access.md
---
docs/incentive-mechanism/proof-of-random-access.md | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/docs/incentive-mechanism/proof-of-random-access.md b/docs/incentive-mechanism/proof-of-random-access.md
index 2fb4861..6ff2016 100644
--- a/docs/incentive-mechanism/proof-of-random-access.md
+++ b/docs/incentive-mechanism/proof-of-random-access.md
@@ -30,4 +30,4 @@ Precisely, the mining process has the following steps:
6. For each piece $$\overrightarrow{v}$$, compute the Blake2b hash of the tuple ($$\mathsf{miner\_id}$$, $$\mathsf{nonce}$$, $$\mathsf{context\_digest}$$, $$\mathsf{start\_position}$$, $$\mathsf{mine\_length}$$, $$\overrightarrow{v}$$).
7. If one of Blake2b hash output is smaller than a target value, the miner finds a legitimate PoRA solution.
-
Figure 1. Recall Position and Scratchpad Computation
+
Figure 1. Recall Position and Scratchpad Computation
