CR fixes.

algorandfoundation · Dec 13, 2023 · 0ca052c · 0ca052c
1 parent d36ecd0
commit 0ca052c
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 3 deletions.
diff --git a/dev/ledger.md b/dev/ledger.md
@@ -553,7 +553,7 @@ Light block header contains the following components:
 
 - The block's _seed_, under msgpack key `0`.
 
-- The block's _hash_, under msgpack key `1`. This represents a cryptographic hash of the block header.
+- The block's _hash_, under msgpack key `1`.
 
 - The block's _genesis hash_, under msgpack key `gh`.
 

diff --git a/overview/latex/sections/DetailedConsensus.tex b/overview/latex/sections/DetailedConsensus.tex
@@ -74,9 +74,9 @@ \subsection{Timing Parameters}
 
 \item $\lambda_{0max}$: corresponds to the maximum amount of time the dynamic algorithm will allow for a small message (e.g. a vote) to propagate under ideal network conditions for period $0$, failing back to $\lambda$ in future periods if the calculated duration was not sufficient to make progress.
 
-\item $\Lambda$: intuitively corresponds to the time it takes a big message (e.g. a block) to propagate in good network conditions.
+\item $\Lambda$: intuitively corresponds to the time it takes a big message (e.g. a block) to propagate in reasonable network conditions.
 
-\item $\Lambda_0$: intuitively corresponds to the time it takes a big message (e.g. a block) to propagate in good network conditions for period $0$, failing back to $\Lambda$ in future periods if $\Lambda_0$ was not sufficient to propogate the block.
+\item $\Lambda_0$: intuitively corresponds to the time it takes a big message (e.g. a block) to propagate in good network conditions for period $0$, failing back to $\Lambda$ in future periods if $\Lambda_0$ was not sufficient to propagate the block.
 
 \item $\lambda_f$: the frequency at which the fast partition recovery steps are repeated.