mint.rs 9.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316
  1. use std::collections::{HashMap, HashSet};
  2. use cashu::dhke::sign_message;
  3. use cashu::dhke::verify_message;
  4. pub use cashu::error::mint::Error;
  5. use cashu::nuts::nut00::BlindedMessage;
  6. use cashu::nuts::nut00::BlindedSignature;
  7. use cashu::nuts::nut00::Proof;
  8. use cashu::nuts::nut02::mint::KeySet;
  9. use cashu::nuts::nut02::Id;
  10. use cashu::nuts::nut06::SplitRequest;
  11. use cashu::nuts::nut06::SplitResponse;
  12. use cashu::nuts::nut07::CheckSpendableRequest;
  13. use cashu::nuts::nut07::CheckSpendableResponse;
  14. use cashu::nuts::nut08::MeltRequest;
  15. use cashu::nuts::nut08::MeltResponse;
  16. use cashu::nuts::*;
  17. use cashu::secret::Secret;
  18. use cashu::Amount;
  19. use tracing::debug;
  20. pub struct Mint {
  21. // pub pubkey: PublicKey,
  22. pub active_keyset: nut02::mint::KeySet,
  23. pub inactive_keysets: HashMap<Id, nut02::mint::KeySet>,
  24. pub spent_secrets: HashSet<Secret>,
  25. pub pending_secrets: HashSet<Secret>,
  26. pub fee_reserve: FeeReserve,
  27. }
  28. impl Mint {
  29. pub fn new(
  30. secret: &str,
  31. derivation_path: &str,
  32. inactive_keysets: HashMap<Id, nut02::mint::KeySet>,
  33. spent_secrets: HashSet<Secret>,
  34. max_order: u8,
  35. min_fee_reserve: Amount,
  36. percent_fee_reserve: f32,
  37. ) -> Self {
  38. Self {
  39. active_keyset: nut02::mint::KeySet::generate(secret, derivation_path, max_order),
  40. inactive_keysets,
  41. spent_secrets,
  42. pending_secrets: HashSet::new(),
  43. fee_reserve: FeeReserve {
  44. min_fee_reserve,
  45. percent_fee_reserve,
  46. },
  47. }
  48. }
  49. /// Retrieve the public keys of the active keyset for distribution to
  50. /// wallet clients
  51. pub fn active_keyset_pubkeys(&self) -> nut01::Response {
  52. nut01::Response {
  53. keys: nut02::KeySet::from(self.active_keyset.clone()).keys,
  54. }
  55. }
  56. /// Return a list of all supported keysets
  57. pub fn keysets(&self) -> nut02::Response {
  58. let mut keysets: HashSet<_> = self.inactive_keysets.keys().cloned().collect();
  59. keysets.insert(self.active_keyset.id);
  60. nut02::Response { keysets }
  61. }
  62. pub fn active_keyset(&self) -> nut02::mint::KeySet {
  63. self.active_keyset.clone()
  64. }
  65. pub fn keyset(&self, id: &Id) -> Option<nut02::KeySet> {
  66. if self.active_keyset.id.eq(id) {
  67. return Some(self.active_keyset.clone().into());
  68. }
  69. self.inactive_keysets.get(id).map(|k| k.clone().into())
  70. }
  71. /// Add current keyset to inactive keysets
  72. /// Generate new keyset
  73. pub fn rotate_keyset(
  74. &mut self,
  75. secret: impl Into<String>,
  76. derivation_path: impl Into<String>,
  77. max_order: u8,
  78. ) {
  79. // Add current set to inactive keysets
  80. self.inactive_keysets
  81. .insert(self.active_keyset.id, self.active_keyset.clone());
  82. self.active_keyset = KeySet::generate(secret, derivation_path, max_order);
  83. }
  84. pub fn process_mint_request(
  85. &mut self,
  86. mint_request: nut04::MintRequest,
  87. ) -> Result<nut04::PostMintResponse, Error> {
  88. let mut blind_signatures = Vec::with_capacity(mint_request.outputs.len());
  89. for blinded_message in mint_request.outputs {
  90. blind_signatures.push(self.blind_sign(&blinded_message)?);
  91. }
  92. Ok(nut04::PostMintResponse {
  93. promises: blind_signatures,
  94. })
  95. }
  96. fn blind_sign(&self, blinded_message: &BlindedMessage) -> Result<BlindedSignature, Error> {
  97. let BlindedMessage { amount, b } = blinded_message;
  98. let Some(key_pair) = self.active_keyset.keys.0.get(amount) else {
  99. // No key for amount
  100. return Err(Error::AmountKey);
  101. };
  102. let c = sign_message(key_pair.secret_key.clone().into(), b.clone().into())?;
  103. Ok(BlindedSignature {
  104. amount: *amount,
  105. c: c.into(),
  106. id: self.active_keyset.id,
  107. })
  108. }
  109. pub fn process_split_request(
  110. &mut self,
  111. split_request: SplitRequest,
  112. ) -> Result<SplitResponse, Error> {
  113. let proofs_total = split_request.proofs_amount();
  114. let output_total = split_request.output_amount();
  115. if proofs_total != output_total {
  116. return Err(Error::Amount);
  117. }
  118. let proof_count = split_request.proofs.len();
  119. let secrets: HashSet<Secret> = split_request
  120. .proofs
  121. .iter()
  122. .map(|p| p.secret.clone())
  123. .collect();
  124. // Check that there are no duplicate proofs in request
  125. if secrets.len().ne(&proof_count) {
  126. return Err(Error::DuplicateProofs);
  127. }
  128. for proof in &split_request.proofs {
  129. self.verify_proof(proof)?
  130. }
  131. for secret in secrets {
  132. self.spent_secrets.insert(secret);
  133. }
  134. match &split_request.amount {
  135. None => {
  136. let promises: Vec<BlindedSignature> = split_request
  137. .outputs
  138. .iter()
  139. .map(|b| self.blind_sign(b).unwrap())
  140. .collect();
  141. Ok(SplitResponse::new(promises))
  142. }
  143. Some(amount) => {
  144. let outs_fst = (proofs_total.to_owned() - amount.to_owned()).split();
  145. // Blinded change messages
  146. let b_fst = split_request.outputs[0..outs_fst.len()].to_vec();
  147. let b_snd = split_request.outputs[outs_fst.len()..].to_vec();
  148. let fst: Vec<BlindedSignature> =
  149. b_fst.iter().map(|b| self.blind_sign(b).unwrap()).collect();
  150. let snd: Vec<BlindedSignature> =
  151. b_snd.iter().map(|b| self.blind_sign(b).unwrap()).collect();
  152. let split_response = SplitResponse::new_from_amount(fst, snd);
  153. if split_response.target_amount() != split_request.amount {
  154. return Err(Error::CustomError("Output order".to_string()));
  155. }
  156. Ok(split_response)
  157. }
  158. }
  159. }
  160. fn verify_proof(&self, proof: &Proof) -> Result<(), Error> {
  161. if self.spent_secrets.contains(&proof.secret) {
  162. return Err(Error::TokenSpent);
  163. }
  164. let keyset = proof.id.as_ref().map_or_else(
  165. || &self.active_keyset,
  166. |id| {
  167. if let Some(keyset) = self.inactive_keysets.get(id) {
  168. keyset
  169. } else {
  170. &self.active_keyset
  171. }
  172. },
  173. );
  174. let Some(keypair) = keyset.keys.0.get(&proof.amount) else {
  175. return Err(Error::AmountKey);
  176. };
  177. verify_message(
  178. keypair.secret_key.clone().into(),
  179. proof.c.clone().into(),
  180. &proof.secret,
  181. )?;
  182. Ok(())
  183. }
  184. pub fn check_spendable(
  185. &self,
  186. check_spendable: &CheckSpendableRequest,
  187. ) -> Result<CheckSpendableResponse, Error> {
  188. let mut spendable = Vec::with_capacity(check_spendable.proofs.len());
  189. let mut pending = Vec::with_capacity(check_spendable.proofs.len());
  190. for proof in &check_spendable.proofs {
  191. spendable.push(!self.spent_secrets.contains(&proof.secret));
  192. pending.push(self.pending_secrets.contains(&proof.secret));
  193. }
  194. Ok(CheckSpendableResponse { spendable, pending })
  195. }
  196. pub fn verify_melt_request(&mut self, melt_request: &MeltRequest) -> Result<(), Error> {
  197. let proofs_total = melt_request.proofs_amount();
  198. let percent_fee_reserve = Amount::from_sat(
  199. (proofs_total.to_sat() as f32 * self.fee_reserve.percent_fee_reserve) as u64,
  200. );
  201. let fee_reserve = if percent_fee_reserve > self.fee_reserve.min_fee_reserve {
  202. percent_fee_reserve
  203. } else {
  204. self.fee_reserve.min_fee_reserve
  205. };
  206. let required_total = melt_request
  207. .invoice_amount()
  208. .map_err(|_| Error::InvoiceAmountUndefined)?
  209. + fee_reserve;
  210. if proofs_total < required_total {
  211. debug!(
  212. "Insufficient Proofs: Got: {}, Required: {}",
  213. proofs_total.to_sat().to_string(),
  214. required_total.to_sat().to_string()
  215. );
  216. return Err(Error::Amount);
  217. }
  218. let secrets: HashSet<&Secret> = melt_request.proofs.iter().map(|p| &p.secret).collect();
  219. // Ensure proofs are unique and not being double spent
  220. if melt_request.proofs.len().ne(&secrets.len()) {
  221. return Err(Error::DuplicateProofs);
  222. }
  223. for proof in &melt_request.proofs {
  224. self.verify_proof(proof)?
  225. }
  226. Ok(())
  227. }
  228. pub fn process_melt_request(
  229. &mut self,
  230. melt_request: &MeltRequest,
  231. preimage: &str,
  232. total_spent: Amount,
  233. ) -> Result<MeltResponse, Error> {
  234. self.verify_melt_request(melt_request)?;
  235. let secrets = Vec::with_capacity(melt_request.proofs.len());
  236. for secret in secrets {
  237. self.spent_secrets.insert(secret);
  238. }
  239. let change_target = melt_request.proofs_amount() - total_spent;
  240. let amounts = change_target.split();
  241. let mut change = Vec::with_capacity(amounts.len());
  242. if let Some(outputs) = &melt_request.outputs {
  243. for (i, amount) in amounts.iter().enumerate() {
  244. let mut message = outputs[i].clone();
  245. message.amount = *amount;
  246. let signature = self.blind_sign(&message)?;
  247. change.push(signature)
  248. }
  249. }
  250. Ok(MeltResponse {
  251. paid: true,
  252. preimage: Some(preimage.to_string()),
  253. change: Some(change),
  254. })
  255. }
  256. }
  257. pub struct FeeReserve {
  258. pub min_fee_reserve: Amount,
  259. pub percent_fee_reserve: f32,
  260. }