summaryrefslogtreecommitdiff
path: root/games
diff options
context:
space:
mode:
Diffstat (limited to 'games')
-rw-r--r--games/games.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/games/games.tex b/games/games.tex
index 4ec2d2f..12fb0a8 100644
--- a/games/games.tex
+++ b/games/games.tex
@@ -428,7 +428,7 @@ Let \oraSet{Fair} stand for access to the oracles
\item Let $C_0, \dots, C_n$ be the coins reachable via \algo{Link} from $C_0$.
We note the user obtains unlinkable change through refreshes, which merely extend this list.
\item Return 0 if either $U$ was corrupted or \ora{Share} was called with any of $C_0, \dots, C_n$.
- \item For each $C \in \{C_0, \dots, C_n\}$, do the following:
+ \item For each $C \in \{C_0, \dots, C_n\}$, we check if the exchange's database records value transfers not present in the user's wallet's database:
\begin{enumerate}[label*=\arabic*.]
\item Return 1 if $\V{deposited}[C]$ contains a contract not appearing in the wallet's database $\V{acceptedContracts}[U]$.
\item Return 1 if the total value $r_E$ of attempted refreshes in $\V{refreshed}[C]$ exceeds the total value $r_U$ of coins in $C_0, \dots, C_n$ directly reachable in one link from $C$. We note $r_E$ includes refreshes that failed due to dishonesty, but not refreshes that failed to authenticate as $C$.