Apply Suggested changes

subspace · Mar 8, 2024 · 9dd5543 · 9dd5543
1 parent d4d4e47
commit 9dd5543
Show file tree

Hide file tree

Showing 7 changed files with 147 additions and 12 deletions.
diff --git a/docs/consensus/proof_of_archival_storage.md b/docs/consensus/proof_of_archival_storage.md
@@ -123,8 +123,6 @@ This extra data is added to the end of the [SCALE-encoded](https://docs.substrat
 <center>Figure 3: Piece Building Process corresponds to steps 5-12 of Archiving.</center>
 
 
-Figure 3: Piece Building Process corresponds to steps 5-12 of Archiving. --->
-
 ## Plotting
 
 ### Pre-plotting Initialization

diff --git a/docs/consensus/proof_of_space.md b/docs/consensus/proof_of_space.md
@@ -81,9 +81,9 @@ Computes the 7 PoS tables.
 
 The resulting `pos_tables` is a vector containing the 7 tables in order.
 
-![Steps 3.b and 3.c in Generate. Numbers and matching function $M$ are solely illustrative. Since the `entry.y` is sorted, Chia does this sequentially on portions of the table as their tables don’t fit in memory.  Notice that 235 and 380 appear in multiple matches, while some numbers don’t have a match.](/img/Proof_of_space_plotting.png)
+![Steps 4.ii-iv in generate function definition. Numbers and matching function $M$ are solely illustrative. Since the `entry.y` is sorted, Chia does this sequentially on portions of the table as their tables don’t fit in memory.  Notice that 235 and 380 appear in multiple matches, while some numbers don’t have a match.](/img/Proof_of_space_plotting.png)
 
-<center>Steps 3.b and 3.c in Generate. Numbers and matching function $M$ are solely illustrative. Since the `entry.y` is sorted, Chia does this sequentially on portions of the table as their tables don’t fit in memory.  Notice that 235 and 380 appear in multiple matches, while some numbers don’t have a match.</center>
+<center>Steps 4.ii-iv in generate function definition. Numbers and matching function $M$ are solely illustrative. Since the `entry.y` is sorted, Chia does this sequentially on portions of the table as their tables don’t fit in memory.  Notice that 235 and 380 appear in multiple matches, while some numbers don’t have a match.</center>
 
 
 ## Tables Computation
@@ -212,8 +212,6 @@ Instead of doing naive pair-wise comparison in $$O(N^2)$$ we first compute the t
 
 4. Return the list of all matching pairs.
 
-# Proving
-
 ## Find Quality
 
 Note: Not used in Dilithium, used only for testing the implementation against Chia.

diff --git a/docs/consensus/proof_of_time.md b/docs/consensus/proof_of_time.md
@@ -64,7 +64,10 @@ Takes a `seed` and number of iterations `pot_iterations` and repeatedly evaluate
     3. Set `input = output`. The `key` stays the same.
 5. Output `checkpoints`
 
-![PoT Evaluator time in iteration.png](/img/PoT_Evaluator_time_in_iter.png)
+<div align="center">
+    <img src="/img/Proof of Time light.svg#gh-light-mode-only" alt="Proof of Time light" />
+    <img src="/img/Proof of Time dark.svg#gh-dark-mode-only" alt="Proof of Time dark" />
+</div>
 
 
 ### output
@@ -297,7 +300,7 @@ Generate a random number `n` in the range `0..=(diff)` and if `n<sample_size` re
 
 
 <Collapsible title="Note">
-    We may want to accept the fork after this probabilistic verification passes, but eventually and asynchronously verify it fully. See discussion on time [here](https://forum.subspace.network/t/pot-verification-during-genesis-sync/1606). We don’t know if it’s [implementable](https://www.notion.so/Dilithium-PoT-Specification-4e17a6d5b03a4abea864ba2d0b97970e?pvs=21)
+    We may want to accept the fork after this probabilistic verification passes, but eventually and asynchronously verify it fully. See discussion on time [here](https://forum.subspace.network/t/pot-verification-during-genesis-sync/1606).
 </Collapsible>
 
 ### New Blocks

diff --git a/docs/decex/bundles_blocks.md b/docs/decex/bundles_blocks.md
@@ -54,7 +54,8 @@ Domain block follows the standard [Substrate block format](https://github.com/pa
     - *`number`*
     - *`state_root`*
     - *`extrinsics_root`*
-    <br />
+
+
     <Collapsible title="Note">
     Substrate header also contains a *`digest`* field, but it is usually unused for the domain block. It was used to feed some consensus chain data into the domain block before but will likely not be used going forward if it causes a challenge for fraud proofs.
     </Collapsible>

diff --git a/docs/decex/interfaces.md b/docs/decex/interfaces.md
@@ -28,9 +28,7 @@ last_update:
 - `StakeWithdrawalLockingPeriod`: The number of consensus chain blocks after a staking withdrawal has been submitted and cleared before it will be transferred back to owner balances. Currently, 14400 domain blocks *(Value TBD)*
 - `BlockTreePruningDepth`: The confirmation depth at which domain blocks are pruned from the `BlockTree`*, de-facto challenge period.* Currently, 14400 domain blocks.
 - `BundleLongevity`: How long the bundle is consider as not stale, defined in the number of consensus blocks. Currently, 5 consensus blocks.
-:::warning `MaxFraudProofSize`
-    The maximum size of a fraud proof, as enforced by the fraud proof storage metering scheme. This ensures that fraud proof size is not unbounded. The default is 1 MiB.
-:::
+
 <!-- - `MaxFraudProofSize`: The maximum size of a fraud proof, as enforced by the fraud proof storage metering scheme. This ensures that fraud proof size is not unbounded. The default is 1 MiB. -->
 - `DomainInstantiationDeposit`: The amount of funds to be locked up for the domain instance creator. The initial value is 100 SSC *(Value TBD)*
 - `MaxDomainNameLength`: The maximum domain name length limit for all domains. The default is 32 bytes.

diff --git a/static/img/Proof of Time dark.svg b/static/img/Proof of Time dark.svg
diff --git a/static/img/Proof of Time light.svg b/static/img/Proof of Time light.svg