From 173ebbc2dc84921a3f5f4a5e7456e52f484f64a5 Mon Sep 17 00:00:00 2001
From: stevenflare <117661781+stevenflare@users.noreply.github.com>
Date: Mon, 8 Jan 2024 11:11:16 -0500
Subject: [PATCH] Adding redemption queue example (#310)

---
 docs/tech/fassets/minting.md | 24 ++++++++++++++++++++++++
 1 file changed, 24 insertions(+)

diff --git a/docs/tech/fassets/minting.md b/docs/tech/fassets/minting.md
index d40fead44..d291cb2e5 100644
--- a/docs/tech/fassets/minting.md
+++ b/docs/tech/fassets/minting.md
@@ -173,6 +173,30 @@ The redemption tickets are ordered in a queue that determines the next agent to
 In other words, the first redemption ticket created will be the first redemption ticket processed.
 The FIFO queue impartially ensures that all agents have the opportunity to fulfill the duties of their role.
 
+!!! example "Example: Redemption Queue"
+    The following example shows how the redemption queue works.
+
+    1. Bob mints 10 `$FXRP` with Agent 1.
+    2. Alice mints 20 `$FXRP` with Agent 2.
+    3. Charlie mints 5 `$FXRP` with Agent 1.
+
+        After Bob, Alice, and Charlie have minted their FAssets, the redemption queue according to the FIFO method is:
+
+         1. Agent 1 with 10 `$FXRP`.
+         2. Agent 2 with 20 `$FXRP`.
+         3. Agent 1 with 5 `$FXRP`.
+
+    4. Dana redeems 25 `$FXRP`.
+       To redeem 25 `$FXRP`:
+
+        1. Agent 1 pays 10 `$FXRP`.
+        2. Agent 2 pays 15 `$FXPR`.
+
+        Now, the redemption queue according to the FIFO method is:
+
+        1. Agent 2 with 5 `$FXRP`.
+        2. Agent 1 with 5 `$FXRP`.
+
 ## Lots
 
 Every minting and redemption must be made in a whole number of lots.