[taler-docs] branch master updated: [core] adjust TALER_WithdrawRequestPS

[gnunet]

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

oec pushed a commit to branch master
in repository docs.

The following commit(s) were added to refs/heads/master by this push:
     new a57d3fb0 [core] adjust TALER_WithdrawRequestPS
a57d3fb0 is described below

commit a57d3fb0771a60b9ee2055df467f9ca7ddf92530
Author: Özgür Kesim <oec-taler@kesim.org>
AuthorDate: Fri Jan 10 19:26:09 2025 +0100

    [core] adjust TALER_WithdrawRequestPS
---
 core/api-common.rst | 18 ++++++++++++------
 1 file changed, 12 insertions(+), 6 deletions(-)

diff --git a/core/api-common.rst b/core/api-common.rst
index aec267bd..32dba7d9 100644
--- a/core/api-common.rst
+++ b/core/api-common.rst
@@ -1203,18 +1203,24 @@ within the
      */
     struct GNUNET_CRYPTO_EccSignaturePurpose purpose;
     struct TALER_ReservePublicKeyP reserve_pub;
+    /**
+     * Total (over all coins) amount to withdraw, including fees.
+     */
+    struct TALER_Amount total_amount_with_fee;
     /**
      * This is the running SHA512-hash over all
-     * `struct TALER_BlindedCoinHash` values.
-     * If max_age_group is > 0, there will be N*κ many such values.
-     * The iteration MUST be then depth's first, i.e.
-     *         …,h[i][0],…,h[i][κ],h[i+1][0],…,h[i+1][κ],…
+     * `struct TALER_BlindedCoinHash` values of the coins.
+     * If max_age was set in the withdraw request,
+     * there will be n*κ many such values.
+     * The iteration MUST be first over all coins belonging to
+     * kappa=0, then all coins to kappa=1 etc.
+     * h[0][0]…h[0][n-1]h[1][0]…h[1][n-1] … h[κ-1][0]…h[κ-1][n-1]
      */
     struct GNUNET_HashCode h_planchets;
     /**
-     * If max_age_group is > 0, the mask MUST be non-zero, too
+     * If max_age is > 0, the mask MUST be non-zero, too
      */
-    uint8_t max_age_group;
+    uint8_t max_age;
     struct TALER_AgeMask mask;
   };
 

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