diff options
| author | Florian Dold <florian.dold@gmail.com> | 2018-08-06 23:32:14 +0200 |
|---|---|---|
| committer | Florian Dold <florian.dold@gmail.com> | 2018-08-06 23:32:14 +0200 |
| commit | e39122ac7e0506282d45295ca7adbac863235d4e (patch) | |
| tree | 6678abc1bd3e174a1cca2803dbcb37a2806c16f3 /consensus | |
| parent | c9a037ef3da225bdf4b2fd8be18a139d5c51da94 (diff) | |
| download | dold-thesis-phd-e39122ac7e0506282d45295ca7adbac863235d4e.tar.gz dold-thesis-phd-e39122ac7e0506282d45295ca7adbac863235d4e.tar.bz2 dold-thesis-phd-e39122ac7e0506282d45295ca7adbac863235d4e.zip | |
misc
Diffstat (limited to 'consensus')
| -rw-r--r-- | consensus/chap.tex | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/consensus/chap.tex b/consensus/chap.tex index a41affb..e2b5478 100644 --- a/consensus/chap.tex +++ b/consensus/chap.tex @@ -677,7 +677,8 @@ of elements shared by all correct peers where $n - \ell_i \le k$. Note that neither $S^{(1)}_i = S^{(1)}_j$ nor $\ell_i = \ell_j$ necessarily hold even for correct peers $P_i$ and $P_j$. Our LBA protocol proceeds in three steps: -\begin{enumerate}[(i)] +%\begin{enumerate}[(i)] +\begin{enumerate}[label=(\roman*)] \item All peers reconcile their initial set with each other, using pairwise bounded set reconciliation using a lower bound of ${\cal L} = 0$. @@ -724,7 +725,7 @@ The exact set agreement is implemented by executing a variant of ByzConsensus which instead of sending values reconciles sets. The Gradecast is adapted as follows: - \begin{enumerate}[(i)] +\begin{enumerate}[label=(\roman*)] \item LEAD: If $i=L$, reconcile the input set $V_L$ with $\mathcal{P}$. \item ECHO: Reconcile the set received in LEAD with $\mathcal{P}$. \item CONFIRM: Let ${\cal U}_E$ be the union |