fix typo

frederik256 · Jan 9, 2014 · 3e5db88 · 3e5db88
1 parent ae5f2c9
commit 3e5db88
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/cuckoo.pdf b/cuckoo.pdf
diff --git a/cuckoo.tex b/cuckoo.tex
@@ -62,8 +62,8 @@ \section{The proof of work function}
 $G = (V_0 \cup V_1, E)$, where $V_0$ is the set of integers modulo $N_0=N/2+1$,
 $V_1$ is the set of integers modulo $N_1=N/2-1$, and $E$ has an edge between
 $\sha(h\;n) \bmod N_0$ in $V_0$ and $\sha(h\;n) \bmod N_1$ in $V_1$ for every
-nonce $0 \leq n < E$.  A proof for $G$ is a subset of $n$ nonces, such that
-their corresponding edges form a cycle.
+nonce $0 \leq n < E$. A proof for $G$ is a subset of $L$ nonces whose
+corresponding edges form an $L$-cycle in $G$.
 
 \section{Cycle formation}
 A set of stored keys gives rise to a {\em directed} cuckoo graph, where each