pezkuwichain/consensus
1
0
Fork 0
mirror of https://github.com/pezkuwichain/consensus.git synced 2026-06-14 16:51:06 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix typo: evrey -> every

Browse Source
This commit is contained in:
Leo Arias
2019-09-11 10:44:36 -06:00
committed by GitHub
parent 566c268d35
commit 2705ef32b3
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
pdf/grandpa.tex
+1 -1
View File
@@ -717,7 +717,7 @@ Since $V'_{r,v}$ contains votes from $4f+1$ voters, there are votes from at leas
\end{proof} \end{proof}
Our network assumption and a simple induction shows that we do not deadlock. Our network assumption and a simple induction shows that we do not deadlock.
\begin{corollary} All honest voters eventually prevote and precommit in evrey round and all honest participants reach every round.\end{corollary} \begin{corollary} All honest voters eventually prevote and precommit in every round and all honest participants reach every round.\end{corollary}
\begin{lemma} \label{lem:possibly-final-implies-permanent-lock} \begin{lemma} \label{lem:possibly-final-implies-permanent-lock}
If there are enough precommits to finalise a block $B$ in round $r$, then all honest voters who prevote in future rounds will be locked to $B$ or its descendants when they do. At the end of the next round $r' > r$ with $s_{r'}=1$, all participants will have finalised $B$. If there are enough precommits to finalise a block $B$ in round $r$, then all honest voters who prevote in future rounds will be locked to $B$ or its descendants when they do. At the end of the next round $r' > r$ with $s_{r'}=1$, all participants will have finalised $B$.