summaryrefslogtreecommitdiff log msg author committer range
path: root/doc/system
diff options
 context: 12345678910152025303540 space: includeignore mode: unifiedssdiffstat only
 diff --git a/doc/system/taler/design.tex b/doc/system/taler/design.texindex 0d248407..d78acac1 100644--- a/doc/system/taler/design.tex+++ b/doc/system/taler/design.tex@@ -149,7 +149,7 @@ customers that lost their reserve private key to eventually recover their funds. If a wire transfer to the exchange does not include a valid reserve public key, the exchange transfers the money back to the sender. -Figure~\ref{fig:reserve:state} illustrates the state machine for a reserve.+Figure~\ref{fig:reserve:states} illustrates the state machine for a reserve. Long-terms states are shown in boxes, while actions are in circles. The final state is in a double-circle. A reserve is first {\em filled} by a wire transfer. The amount in it is reduced by withdraw operations. If the balancediff --git a/doc/system/taler/implementation.tex b/doc/system/taler/implementation.texindex f386228f..41202d06 100644--- a/doc/system/taler/implementation.tex+++ b/doc/system/taler/implementation.tex@@ -1849,8 +1849,7 @@ This includes both how many coins are used per transaction on average, as well as how often refresh operations are run. We ran a simple simulation to determine rather conservative upper bounds for-the parameters that characterize the average transaction. The source code for-the simulation can be found in Appendix \ref{appendix:coinsim}.+the parameters that characterize the average transaction. In the simulation, thirteen denominations of values $2^0,\dots,2^{12}$ are available. Customers repeatedly select a random value to be spent between $4$ and $5000$.