-
Notifications
You must be signed in to change notification settings - Fork 0
/
impossibility.tex
44 lines (39 loc) · 2.05 KB
/
impossibility.tex
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
\section{Impossibility}\label{sec:impossibility}
We saw that in the synchronous setting and in the partially synchronous setting after GST,
protocols can be timely.
Conversely, in the following theorem, we show that timeliness before GST in partially
synchronous networks is unachievable.
\begin{theorem}[Timeliness is Impossible in Partial Synchrony]
In partial synchrony, a
safe and live$(u)$
distributed temporal ledger protocol cannot be timely before GST.
\end{theorem}
\begin{proof}
Suppose, towards a contradiction, there is a safe, live$(u)$, and timely$(v)$ distributed temporal ledger protocol
with $n$ parties.
Consider the following two worlds:
\noindent
\underline{World A}.
There are $n-1$ honest parties and one adversarial party. The adversary remains silent and
does not disrupt the synchrony of the network ($\gst = 0$).
The adversary chooses any round $r$ and introduces a high entropy transaction $\tx$ to the honest parties. We are in
synchrony, hence, because of liveness, $\tx$ appears in the ledgers of all honest parties
by round $r + u$. The transaction is recorded with round $r^* \leq r + u$ because of
timeliness.
\noindent
\underline{World B}.
All parties are honest. We are under partial synchrony, and the adversary partitions the network such that
one honest party $P$ is isolated from the other $n-1$ honest parties.
The adversary sets \gst to $r + u + v + 1$.
Before \gst, at round $r$, the transaction $\tx$ is introduced to the $n-1$ connected
honest parties. In the view of these parties,
World A and World B are identical up to now. Hence, like in World A,
they report $\tx$ in their ledgers by round $r + u$, with recorded round $r^* \leq r + u$.
At $r_2 \geq \gst$, due to liveness, $\tx$ will be included in $P$'s ledger for the first time,
with recorded round $r^*$ due to safety.
Hence, $(r^*, \tx) \in \Ledger[][P][r_2][{|\Ledger[][P][\gst - 1]|}{:}]$.
From timeliness, we
get $r^* > \gst - v - 1$. Therefore, $r^* > r + u$.
This is a contradiction, since $r^* \leq r + u$.
\Qed
\end{proof}