@@ -24,6 +24,7 @@ use crate::ln::chan_utils::{
24
24
} ;
25
25
use crate :: events:: Event ;
26
26
use crate :: prelude:: HashMap ;
27
+ use crate :: sync:: Mutex ;
27
28
use crate :: util:: logger:: Logger ;
28
29
29
30
use bitcoin:: { OutPoint , PackedLockTime , Sequence , Script , Transaction , Txid , TxIn , TxOut , Witness } ;
@@ -299,7 +300,8 @@ pub struct CoinSelection {
299
300
300
301
/// An abstraction over a bitcoin wallet that can perform coin selection over a set of UTXOs and can
301
302
/// sign for them. The coin selection method aims to mimic Bitcoin Core's `fundrawtransaction` RPC,
302
- /// which most wallets should be able to satisfy.
303
+ /// which most wallets should be able to satisfy. Otherwise, consider implementing [`WalletSource`],
304
+ /// which can provide a default implementation of this trait when used with [`Wallet`].
303
305
pub trait CoinSelectionSource {
304
306
/// Performs coin selection of a set of UTXOs, with at least 1 confirmation each, that are
305
307
/// available to spend. Implementations are free to pick their coin selection algorithm of
@@ -336,6 +338,138 @@ pub trait CoinSelectionSource {
336
338
fn sign_tx ( & self , tx : & mut Transaction ) -> Result < ( ) , ( ) > ;
337
339
}
338
340
341
+ /// An alternative to [`CoinSelectionSource`] that can be implemented and used along [`Wallet`] to
342
+ /// provide a default implementation to [`CoinSelectionSource`].
343
+ pub trait WalletSource {
344
+ /// Returns all UTXOs, with at least 1 confirmation each, that are available to spend.
345
+ fn list_confirmed_utxos ( & self ) -> Result < Vec < Utxo > , ( ) > ;
346
+ /// Returns a script to use for change above dust resulting from a successful coin selection
347
+ /// attempt.
348
+ fn get_change_script ( & self ) -> Result < Script , ( ) > ;
349
+ /// Signs and provides the full witness for all inputs within the transaction known to the
350
+ /// wallet (i.e., any provided via [`WalletSource::list_confirmed_utxos`]).
351
+ fn sign_tx ( & self , tx : & mut Transaction ) -> Result < ( ) , ( ) > ;
352
+ }
353
+
354
+ /// A wrapper over [`WalletSource`] that implements [`CoinSelection`] by preferring UTXOs that would
355
+ /// avoid conflicting double spends. If not enough UTXOs are available to do so, conflicting double
356
+ /// spends may happen.
357
+ pub struct Wallet < W : Deref > where W :: Target : WalletSource {
358
+ source : W ,
359
+ // TODO: Do we care about cleaning this up once the UTXOs have a confirmed spend? We can do so
360
+ // by checking whether any UTXOs that exist in the map are no longer returned in
361
+ // `list_confirmed_utxos`.
362
+ locked_utxos : Mutex < HashMap < OutPoint , ClaimId > > ,
363
+ }
364
+
365
+ impl < W : Deref > Wallet < W > where W :: Target : WalletSource {
366
+ /// Returns a new instance backed by the given [`WalletSource`] that serves as an implementation
367
+ /// of [`CoinSelectionSource`].
368
+ pub fn new ( source : W ) -> Self {
369
+ Self { source, locked_utxos : Mutex :: new ( HashMap :: new ( ) ) }
370
+ }
371
+
372
+ /// Performs coin selection on the set of UTXOs obtained from
373
+ /// [`WalletSource::list_confirmed_utxos`]. Its algorithm can be described as "smallest
374
+ /// above-dust-after-spend first", with a slight twist: we may skip UTXOs that are above dust at
375
+ /// the target feerate after having spent them in a separate claim transaction if
376
+ /// `force_conflicting_utxo_spend` is unset to avoid producing conflicting transactions.
377
+ fn select_confirmed_utxos_internal (
378
+ & self , claim_id : ClaimId , force_conflicting_utxo_spend : bool ,
379
+ target_feerate_sat_per_1000_weight : u32 , preexisting_tx_weight : u64 , target_amount : u64 ,
380
+ ) -> Result < CoinSelection , ( ) > {
381
+ let utxos = self . source . list_confirmed_utxos ( ) ?;
382
+ let mut locked_utxos = self . locked_utxos . lock ( ) . unwrap ( ) ;
383
+ let mut eligible_utxos = utxos. into_iter ( ) . filter_map ( |utxo| {
384
+ if let Some ( utxo_claim_id) = locked_utxos. get ( & utxo. outpoint ) {
385
+ if * utxo_claim_id != claim_id && !force_conflicting_utxo_spend {
386
+ return None ;
387
+ }
388
+ }
389
+ let fee_to_spend_utxo = target_feerate_sat_per_1000_weight as u64 *
390
+ ( ( 41 * WITNESS_SCALE_FACTOR ) as u64 + utxo. witness_weight ) ;
391
+ let utxo_value_after_fee = utxo. output . value . saturating_sub ( fee_to_spend_utxo) ;
392
+ if utxo_value_after_fee > 0 {
393
+ Some ( ( utxo, fee_to_spend_utxo) )
394
+ } else {
395
+ None
396
+ }
397
+ } ) . collect :: < Vec < _ > > ( ) ;
398
+ eligible_utxos. sort_unstable_by_key ( |( utxo, _) | utxo. output . value ) ;
399
+
400
+ let mut selected_amount = 0 ;
401
+ let mut total_fees = preexisting_tx_weight * target_feerate_sat_per_1000_weight as u64 ;
402
+ let selected_utxos = eligible_utxos. into_iter ( ) . scan (
403
+ ( & mut selected_amount, & mut total_fees) , |( selected_amount, total_fees) , ( utxo, fee_to_spend_utxo) | {
404
+ let need_more_inputs = * * selected_amount < target_amount + * * total_fees;
405
+ if need_more_inputs {
406
+ * * selected_amount += utxo. output . value ;
407
+ * * total_fees += fee_to_spend_utxo;
408
+ Some ( utxo)
409
+ } else {
410
+ None
411
+ }
412
+ }
413
+ ) . collect :: < Vec < _ > > ( ) ;
414
+ let need_more_inputs = selected_amount < target_amount + total_fees;
415
+ if need_more_inputs {
416
+ return Err ( ( ) ) ;
417
+ }
418
+ for utxo in & selected_utxos {
419
+ locked_utxos. insert ( utxo. outpoint , claim_id) ;
420
+ }
421
+ core:: mem:: drop ( locked_utxos) ;
422
+
423
+ let remaining_amount = selected_amount - target_amount - total_fees;
424
+ let change_script = self . source . get_change_script ( ) ?;
425
+ let change_output_fee = target_feerate_sat_per_1000_weight as u64
426
+ * ( 8 + change_script. consensus_encode ( & mut sink ( ) ) . unwrap ( ) as u64 ) ;
427
+ let change_output_amount = remaining_amount. saturating_sub ( change_output_fee) ;
428
+ let change_output = if change_output_amount < change_script. dust_value ( ) . to_sat ( ) {
429
+ None
430
+ } else {
431
+ Some ( TxOut { script_pubkey : change_script, value : change_output_amount } )
432
+ } ;
433
+
434
+ Ok ( CoinSelection {
435
+ confirmed_utxos : selected_utxos,
436
+ change_output,
437
+ } )
438
+ }
439
+ }
440
+
441
+ impl < W : Deref > CoinSelectionSource for Wallet < W > where W :: Target : WalletSource {
442
+ fn select_confirmed_utxos (
443
+ & self , claim_id : ClaimId , must_spend : & [ Input ] , must_pay_to : & [ TxOut ] ,
444
+ target_feerate_sat_per_1000_weight : u32 ,
445
+ ) -> Result < CoinSelection , ( ) > {
446
+ // TODO: Use fee estimation utils when we upgrade to bitcoin v0.30.0.
447
+ let base_tx_weight = 4 /* version */ + 1 /* input count */ + 1 /* output count */ + 4 /* locktime */ ;
448
+ let total_input_weight = must_spend. len ( ) *
449
+ ( 32 /* txid */ + 4 /* vout */ + 4 /* sequence */ + 1 /* script sig */ ) ;
450
+ let total_output_weight: usize = must_pay_to. iter ( ) . map ( |output|
451
+ 8 /* value */ + 1 /* script len */ + output. script_pubkey . len ( )
452
+ ) . sum ( ) ;
453
+ let total_non_witness_weight = base_tx_weight + total_input_weight + total_output_weight;
454
+ let total_witness_weight: u64 = must_spend. iter ( ) . map ( |input| input. witness_weight ) . sum ( ) ;
455
+
456
+ let preexisting_tx_weight = 2 /* segwit marker & flag */ + total_witness_weight +
457
+ ( total_non_witness_weight * WITNESS_SCALE_FACTOR ) as u64 ;
458
+ let target_amount = must_pay_to. iter ( ) . map ( |output| output. value ) . sum ( ) ;
459
+ let do_coin_selection = |force_conflicting_utxo_spend : bool | {
460
+ self . select_confirmed_utxos_internal (
461
+ claim_id, force_conflicting_utxo_spend, target_feerate_sat_per_1000_weight,
462
+ preexisting_tx_weight, target_amount,
463
+ )
464
+ } ;
465
+ do_coin_selection ( false ) . or_else ( |_| do_coin_selection ( true ) )
466
+ }
467
+
468
+ fn sign_tx ( & self , tx : & mut Transaction ) -> Result < ( ) , ( ) > {
469
+ self . source . sign_tx ( tx)
470
+ }
471
+ }
472
+
339
473
/// A handler for [`Event::BumpTransaction`] events that sources confirmed UTXOs from a
340
474
/// [`CoinSelectionSource`] to fee bump transactions via Child-Pays-For-Parent (CPFP) or
341
475
/// Replace-By-Fee (RBF).
0 commit comments