We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 8f2fbcf commit f665226Copy full SHA for f665226
1 file changed
xx.md
@@ -65,14 +65,10 @@ Each proof adds a single new metadata field:
65
66
1. Generate a fresh random scalar `e` and compute `E = e·G`.
67
2. For each receiver key `P`, compute:
68
-
69
-```text
70
- a. Slot index `i` in `[data, ...pubkeys, ...refund]`
71
- b. `Zx = x(e·P)`.
72
- c. `rᵢ = H("Cashu_P2BK_v1" || Zx || keyset_id || i) mod n`.
73
- d. `P′ = P + rᵢ·G`.
74
-```
75
+ > a. Slot index `i` in `[data, ...pubkeys, ...refund]`
+ > b. `Zx = x(e·P)`.
+ > c. `rᵢ = H("Cashu_P2BK_v1" || Zx || keyset_id || i) mod n`.
+ > d. `P′ = P + rᵢ·G`.
76
3. Build the canonical P2PK secret with the blinded `P′` keys in their slots.
77
4. Interact with the mint normally; the mint never learns `P` or `rᵢ`.
78
5. Include `p2pk_e = E` in the final proof.
0 commit comments