gnunet-svn
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[taler-docs] branch master updated: fix typos


From: gnunet
Subject: [taler-docs] branch master updated: fix typos
Date: Mon, 29 Nov 2021 17:57:10 +0100

This is an automated email from the git hooks/post-receive script.

grothoff pushed a commit to branch master
in repository docs.

The following commit(s) were added to refs/heads/master by this push:
     new 216e333  fix typos
216e333 is described below

commit 216e333ea07a8b9c292d16ff35d54dbcf8331ffa
Author: Christian Grothoff <grothoff@gnunet.org>
AuthorDate: Mon Nov 29 17:57:07 2021 +0100

    fix typos
---
 design-documents/011-auditor-db-sync.rst             |  2 +-
 design-documents/012-fee-schedule-metrics.rst        |  2 +-
 design-documents/016-backoffice-order-management.rst |  2 +-
 design-documents/018-contract-json.rst               |  2 +-
 design-documents/024-age-restriction.rst             | 10 +++++-----
 5 files changed, 9 insertions(+), 9 deletions(-)

diff --git a/design-documents/011-auditor-db-sync.rst 
b/design-documents/011-auditor-db-sync.rst
index fb2e3be..f8229b6 100644
--- a/design-documents/011-auditor-db-sync.rst
+++ b/design-documents/011-auditor-db-sync.rst
@@ -62,7 +62,7 @@ Proposed Solution
 =================
 
 * Use "common" incremental database replication (whichever is
-  approproate for the exchange database setup, synchronous
+  appropriate for the exchange database setup, synchronous
   or asynchronous) to make a 1:1 copy of the exchange database
   at the auditor.  This should work for any full-featured
   modern database. This "ingress" copy cannot be trusted, as constraint
diff --git a/design-documents/012-fee-schedule-metrics.rst 
b/design-documents/012-fee-schedule-metrics.rst
index 8eb36da..01fd484 100644
--- a/design-documents/012-fee-schedule-metrics.rst
+++ b/design-documents/012-fee-schedule-metrics.rst
@@ -466,7 +466,7 @@ Note that for a typical transaction, the number of coins is 
logarithmic to the
 amount. So with the above fee structure, paying amounts around 10 EUR would on
 average involve about 6 coins with 1/3rd fees at 0.005, 1/3rd fees at 0.01 and
 1/3rd fees at 0.015, resulting in an expected total transaction cost in
-**deposit** fees of 0.03 EUR.  In constrast, paying 0.50 cents would require
+**deposit** fees of 0.03 EUR.  In contrast, paying 0.50 cents would require
 on average 4 coins cost less than 0.02 EUR in **deposit** fees.  As a result
 of this fee structure, microtransactions with Taler have a higher fee in terms
 of percentage, while larger transactions are still highly competitive.
diff --git a/design-documents/016-backoffice-order-management.rst 
b/design-documents/016-backoffice-order-management.rst
index ff8fb64..deaf717 100644
--- a/design-documents/016-backoffice-order-management.rst
+++ b/design-documents/016-backoffice-order-management.rst
@@ -88,7 +88,7 @@ This section has two parts:
 The first part will add/remove product from the current stock.
 
 * ``name``: search box to select product by description field. if not found it
-  will be a 'create new' option leading to the create product without loosing
+  will be a 'create new' option leading to the create product without losing
   context
 
 * ``quantity``: mandatory
diff --git a/design-documents/018-contract-json.rst 
b/design-documents/018-contract-json.rst
index d50f28c..3c9258a 100644
--- a/design-documents/018-contract-json.rst
+++ b/design-documents/018-contract-json.rst
@@ -149,7 +149,7 @@ SHA512.
 Test vector
 -----------
 
-The follwing input contains top-level and nested forgettable
+The following input contains top-level and nested forgettable
 fields, as well as booleans, integers, strings and objects
 as well as non-forgettable fields.  It is thus suitable as
 a minimal interoperability test:
diff --git a/design-documents/024-age-restriction.rst 
b/design-documents/024-age-restriction.rst
index 7109a67..7c6c251 100644
--- a/design-documents/024-age-restriction.rst
+++ b/design-documents/024-age-restriction.rst
@@ -155,10 +155,10 @@ Age Groups
 ~~~~~~~~~~
 
 Age groups are represented as a finite list of positive, increasing integers
-that mark the beginning of the *next* age group.  The value 0 is ommited but
+that mark the beginning of the *next* age group.  The value 0 is omitted but
 implicitly marks the beginning of the *zeroth* age group and the first number
 in the list marks the beginning of the *first* age group.  Age groups are
-encoded as a colon separated string of integer values.  They are refered to by
+encoded as a colon separated string of integer values.  They are referred to by
 their *slot*, i.e.  "age group 3" is the age group that starts with the 3.
 integer in the list.
 
@@ -180,7 +180,7 @@ in ``ExchangeKeysResponse.age_restricted_denoms``.
 .. ts:def:: AgeGroups
 
    // Representation of the age groups as colon separated edges: Increasing
-   // from left to right, the values mark the begining of an age group up
+   // from left to right, the values mark the beginning of an age group up
    // to, but not including the next value.  The initial age group starts at
    // 0 and is not listed.  Example: "8:10:12:14:16:18:21".
    type AgeGroups = string;
@@ -467,12 +467,12 @@ The object ``CoinPaySig`` used within a ``PayRequest`` 
during a POST to
    ...
 
    // If a minimum age was required by the order and the wallet had coins that
-   // are at least commited to the corresponding age group, this is the
+   // are at least committed to the corresponding age group, this is the
    // signature of the minimum age as a string, using the private key to the
    // corresponding age group.
    minimum_age_sig?: EddsaSignature;
 
-   // If a minium age was required by the order, this is age commitment bound
+   // If a minimum age was required by the order, this is age commitment bound
    // to the coin, i.e. the complete vector of EdDSA public keys, one for each
    // age group (as defined by the exchange).
    age_commitment?: EddsaPublicKey[];

-- 
To stop receiving notification emails like this one, please contact
gnunet@gnunet.org.



reply via email to

[Prev in Thread] Current Thread [Next in Thread]