Cache commitment point on ExternalHTLCClaim to drop a signer call
[rust-lightning] / lightning / src / chain / onchaintx.rs
1 // This file is Copyright its original authors, visible in version control
2 // history.
3 //
4 // This file is licensed under the Apache License, Version 2.0 <LICENSE-APACHE
5 // or http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
6 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your option.
7 // You may not use this file except in accordance with one or both of these
8 // licenses.
9
10 //! The logic to build claims and bump in-flight transactions until confirmations.
11 //!
12 //! OnchainTxHandler objects are fully-part of ChannelMonitor and encapsulates all
13 //! building, tracking, bumping and notifications functions.
14
15 use bitcoin::blockdata::locktime::absolute::LockTime;
16 use bitcoin::blockdata::transaction::Transaction;
17 use bitcoin::blockdata::transaction::OutPoint as BitcoinOutPoint;
18 use bitcoin::blockdata::script::{Script, ScriptBuf};
19 use bitcoin::hashes::{Hash, HashEngine};
20 use bitcoin::hashes::sha256::Hash as Sha256;
21 use bitcoin::hash_types::{Txid, BlockHash};
22 use bitcoin::secp256k1::PublicKey;
23 use bitcoin::secp256k1::{Secp256k1, ecdsa::Signature};
24 use bitcoin::secp256k1;
25
26 use crate::chain::chaininterface::compute_feerate_sat_per_1000_weight;
27 use crate::sign::{ChannelDerivationParameters, HTLCDescriptor, ChannelSigner, EntropySource, SignerProvider, ecdsa::EcdsaChannelSigner};
28 use crate::ln::msgs::DecodeError;
29 use crate::ln::types::PaymentPreimage;
30 use crate::ln::chan_utils::{self, ChannelTransactionParameters, HTLCOutputInCommitment, HolderCommitmentTransaction};
31 use crate::chain::ClaimId;
32 use crate::chain::chaininterface::{ConfirmationTarget, FeeEstimator, BroadcasterInterface, LowerBoundedFeeEstimator};
33 use crate::chain::channelmonitor::{ANTI_REORG_DELAY, CLTV_SHARED_CLAIM_BUFFER};
34 use crate::chain::package::{PackageSolvingData, PackageTemplate};
35 use crate::chain::transaction::MaybeSignedTransaction;
36 use crate::util::logger::Logger;
37 use crate::util::ser::{Readable, ReadableArgs, MaybeReadable, UpgradableRequired, Writer, Writeable};
38
39 use crate::io;
40 use crate::prelude::*;
41 use alloc::collections::BTreeMap;
42 use core::cmp;
43 use core::ops::Deref;
44 use core::mem::replace;
45 use core::mem::swap;
46 use crate::ln::features::ChannelTypeFeatures;
47
48 const MAX_ALLOC_SIZE: usize = 64*1024;
49
50 /// An entry for an [`OnchainEvent`], stating the block height when the event was observed and the
51 /// transaction causing it.
52 ///
53 /// Used to determine when the on-chain event can be considered safe from a chain reorganization.
54 #[derive(Clone, PartialEq, Eq)]
55 struct OnchainEventEntry {
56         txid: Txid,
57         height: u32,
58         block_hash: Option<BlockHash>, // Added as optional, will be filled in for any entry generated on 0.0.113 or after
59         event: OnchainEvent,
60 }
61
62 impl OnchainEventEntry {
63         fn confirmation_threshold(&self) -> u32 {
64                 self.height + ANTI_REORG_DELAY - 1
65         }
66
67         fn has_reached_confirmation_threshold(&self, height: u32) -> bool {
68                 height >= self.confirmation_threshold()
69         }
70 }
71
72 /// Events for claims the [`OnchainTxHandler`] has generated. Once the events are considered safe
73 /// from a chain reorg, the [`OnchainTxHandler`] will act accordingly.
74 #[derive(Clone, PartialEq, Eq)]
75 enum OnchainEvent {
76         /// A pending request has been claimed by a transaction spending the exact same set of outpoints
77         /// as the request. This claim can either be ours or from the counterparty. Once the claiming
78         /// transaction has met [`ANTI_REORG_DELAY`] confirmations, we consider it final and remove the
79         /// pending request.
80         Claim {
81                 claim_id: ClaimId,
82         },
83         /// The counterparty has claimed an outpoint from one of our pending requests through a
84         /// different transaction than ours. If our transaction was attempting to claim multiple
85         /// outputs, we need to drop the outpoint claimed by the counterparty and regenerate a new claim
86         /// transaction for ourselves. We keep tracking, separately, the outpoint claimed by the
87         /// counterparty up to [`ANTI_REORG_DELAY`] confirmations to ensure we attempt to re-claim it
88         /// if the counterparty's claim is reorged from the chain.
89         ContentiousOutpoint {
90                 package: PackageTemplate,
91         }
92 }
93
94 impl Writeable for OnchainEventEntry {
95         fn write<W: Writer>(&self, writer: &mut W) -> Result<(), io::Error> {
96                 write_tlv_fields!(writer, {
97                         (0, self.txid, required),
98                         (1, self.block_hash, option),
99                         (2, self.height, required),
100                         (4, self.event, required),
101                 });
102                 Ok(())
103         }
104 }
105
106 impl MaybeReadable for OnchainEventEntry {
107         fn read<R: io::Read>(reader: &mut R) -> Result<Option<Self>, DecodeError> {
108                 let mut txid = Txid::all_zeros();
109                 let mut height = 0;
110                 let mut block_hash = None;
111                 let mut event = UpgradableRequired(None);
112                 read_tlv_fields!(reader, {
113                         (0, txid, required),
114                         (1, block_hash, option),
115                         (2, height, required),
116                         (4, event, upgradable_required),
117                 });
118                 Ok(Some(Self { txid, height, block_hash, event: _init_tlv_based_struct_field!(event, upgradable_required) }))
119         }
120 }
121
122 impl_writeable_tlv_based_enum_upgradable!(OnchainEvent,
123         (0, Claim) => {
124                 (0, claim_id, required),
125         },
126         (1, ContentiousOutpoint) => {
127                 (0, package, required),
128         },
129 );
130
131 impl Readable for Option<Vec<Option<(usize, Signature)>>> {
132         fn read<R: io::Read>(reader: &mut R) -> Result<Self, DecodeError> {
133                 match Readable::read(reader)? {
134                         0u8 => Ok(None),
135                         1u8 => {
136                                 let vlen: u64 = Readable::read(reader)?;
137                                 let mut ret = Vec::with_capacity(cmp::min(vlen as usize, MAX_ALLOC_SIZE / ::core::mem::size_of::<Option<(usize, Signature)>>()));
138                                 for _ in 0..vlen {
139                                         ret.push(match Readable::read(reader)? {
140                                                 0u8 => None,
141                                                 1u8 => Some((<u64 as Readable>::read(reader)? as usize, Readable::read(reader)?)),
142                                                 _ => return Err(DecodeError::InvalidValue)
143                                         });
144                                 }
145                                 Ok(Some(ret))
146                         },
147                         _ => Err(DecodeError::InvalidValue),
148                 }
149         }
150 }
151
152 impl Writeable for Option<Vec<Option<(usize, Signature)>>> {
153         fn write<W: Writer>(&self, writer: &mut W) -> Result<(), io::Error> {
154                 match self {
155                         &Some(ref vec) => {
156                                 1u8.write(writer)?;
157                                 (vec.len() as u64).write(writer)?;
158                                 for opt in vec.iter() {
159                                         match opt {
160                                                 &Some((ref idx, ref sig)) => {
161                                                         1u8.write(writer)?;
162                                                         (*idx as u64).write(writer)?;
163                                                         sig.write(writer)?;
164                                                 },
165                                                 &None => 0u8.write(writer)?,
166                                         }
167                                 }
168                         },
169                         &None => 0u8.write(writer)?,
170                 }
171                 Ok(())
172         }
173 }
174
175 /// The claim commonly referred to as the pre-signed second-stage HTLC transaction.
176 #[derive(Clone, PartialEq, Eq)]
177 pub(crate) struct ExternalHTLCClaim {
178         pub(crate) commitment_txid: Txid,
179         pub(crate) per_commitment_number: u64,
180         pub(crate) htlc: HTLCOutputInCommitment,
181         pub(crate) preimage: Option<PaymentPreimage>,
182         pub(crate) counterparty_sig: Signature,
183         pub(crate) per_commitment_point: PublicKey,
184 }
185
186 // Represents the different types of claims for which events are yielded externally to satisfy said
187 // claims.
188 #[derive(Clone, PartialEq, Eq)]
189 pub(crate) enum ClaimEvent {
190         /// Event yielded to signal that the commitment transaction fee must be bumped to claim any
191         /// encumbered funds and proceed to HTLC resolution, if any HTLCs exist.
192         BumpCommitment {
193                 package_target_feerate_sat_per_1000_weight: u32,
194                 commitment_tx: Transaction,
195                 anchor_output_idx: u32,
196         },
197         /// Event yielded to signal that the commitment transaction has confirmed and its HTLCs must be
198         /// resolved by broadcasting a transaction with sufficient fee to claim them.
199         BumpHTLC {
200                 target_feerate_sat_per_1000_weight: u32,
201                 htlcs: Vec<ExternalHTLCClaim>,
202                 tx_lock_time: LockTime,
203         },
204 }
205
206 /// Represents the different ways an output can be claimed (i.e., spent to an address under our
207 /// control) onchain.
208 pub(crate) enum OnchainClaim {
209         /// A finalized transaction pending confirmation spending the output to claim.
210         Tx(MaybeSignedTransaction),
211         /// An event yielded externally to signal additional inputs must be added to a transaction
212         /// pending confirmation spending the output to claim.
213         Event(ClaimEvent),
214 }
215
216 /// Represents the different feerate strategies a pending request can use when generating a claim.
217 pub(crate) enum FeerateStrategy {
218         /// We must reuse the most recently used feerate, if any.
219         RetryPrevious,
220         /// We must pick the highest between the most recently used and the current feerate estimate.
221         HighestOfPreviousOrNew,
222         /// We must force a bump of the most recently used feerate, either by using the current feerate
223         /// estimate if it's higher, or manually bumping.
224         ForceBump,
225 }
226
227 /// OnchainTxHandler receives claiming requests, aggregates them if it's sound, broadcast and
228 /// do RBF bumping if possible.
229 #[derive(Clone)]
230 pub struct OnchainTxHandler<ChannelSigner: EcdsaChannelSigner> {
231         channel_value_satoshis: u64,
232         channel_keys_id: [u8; 32],
233         destination_script: ScriptBuf,
234         holder_commitment: HolderCommitmentTransaction,
235         prev_holder_commitment: Option<HolderCommitmentTransaction>,
236
237         pub(super) signer: ChannelSigner,
238         pub(crate) channel_transaction_parameters: ChannelTransactionParameters,
239
240         // Used to track claiming requests. If claim tx doesn't confirm before height timer expiration we need to bump
241         // it (RBF or CPFP). If an input has been part of an aggregate tx at first claim try, we need to keep it within
242         // another bumped aggregate tx to comply with RBF rules. We may have multiple claiming txn in the flight for the
243         // same set of outpoints. One of the outpoints may be spent by a transaction not issued by us. That's why at
244         // block connection we scan all inputs and if any of them is among a set of a claiming request we test for set
245         // equality between spending transaction and claim request. If true, it means transaction was one our claiming one
246         // after a security delay of 6 blocks we remove pending claim request. If false, it means transaction wasn't and
247         // we need to regenerate new claim request with reduced set of still-claimable outpoints.
248         // Key is identifier of the pending claim request, i.e the txid of the initial claiming transaction generated by
249         // us and is immutable until all outpoint of the claimable set are post-anti-reorg-delay solved.
250         // Entry is cache of elements need to generate a bumped claiming transaction (see ClaimTxBumpMaterial)
251         #[cfg(test)] // Used in functional_test to verify sanitization
252         pub(crate) pending_claim_requests: HashMap<ClaimId, PackageTemplate>,
253         #[cfg(not(test))]
254         pending_claim_requests: HashMap<ClaimId, PackageTemplate>,
255
256         // Used to track external events that need to be forwarded to the `ChainMonitor`. This `Vec`
257         // essentially acts as an insertion-ordered `HashMap` â€“ there should only ever be one occurrence
258         // of a `ClaimId`, which tracks its latest `ClaimEvent`, i.e., if a pending claim exists, and
259         // a new block has been connected, resulting in a new claim, the previous will be replaced with
260         // the new.
261         //
262         // These external events may be generated in the following cases:
263         //      - A channel has been force closed by broadcasting the holder's latest commitment transaction
264         //      - A block being connected/disconnected
265         //      - Learning the preimage for an HTLC we can claim onchain
266         pending_claim_events: Vec<(ClaimId, ClaimEvent)>,
267
268         // Used to link outpoints claimed in a connected block to a pending claim request. The keys
269         // represent the outpoints that our `ChannelMonitor` has detected we have keys/scripts to
270         // claim. The values track the pending claim request identifier and the initial confirmation
271         // block height, and are immutable until the outpoint has enough confirmations to meet our
272         // [`ANTI_REORG_DELAY`]. The initial confirmation block height is used to remove the entry if
273         // the block gets disconnected.
274         #[cfg(test)] // Used in functional_test to verify sanitization
275         pub claimable_outpoints: HashMap<BitcoinOutPoint, (ClaimId, u32)>,
276         #[cfg(not(test))]
277         claimable_outpoints: HashMap<BitcoinOutPoint, (ClaimId, u32)>,
278
279         locktimed_packages: BTreeMap<u32, Vec<PackageTemplate>>,
280
281         onchain_events_awaiting_threshold_conf: Vec<OnchainEventEntry>,
282
283         pub(super) secp_ctx: Secp256k1<secp256k1::All>,
284 }
285
286 impl<ChannelSigner: EcdsaChannelSigner> PartialEq for OnchainTxHandler<ChannelSigner> {
287         fn eq(&self, other: &Self) -> bool {
288                 // `signer`, `secp_ctx`, and `pending_claim_events` are excluded on purpose.
289                 self.channel_value_satoshis == other.channel_value_satoshis &&
290                         self.channel_keys_id == other.channel_keys_id &&
291                         self.destination_script == other.destination_script &&
292                         self.holder_commitment == other.holder_commitment &&
293                         self.prev_holder_commitment == other.prev_holder_commitment &&
294                         self.channel_transaction_parameters == other.channel_transaction_parameters &&
295                         self.pending_claim_requests == other.pending_claim_requests &&
296                         self.claimable_outpoints == other.claimable_outpoints &&
297                         self.locktimed_packages == other.locktimed_packages &&
298                         self.onchain_events_awaiting_threshold_conf == other.onchain_events_awaiting_threshold_conf
299         }
300 }
301
302 const SERIALIZATION_VERSION: u8 = 1;
303 const MIN_SERIALIZATION_VERSION: u8 = 1;
304
305 impl<ChannelSigner: EcdsaChannelSigner> OnchainTxHandler<ChannelSigner> {
306         pub(crate) fn write<W: Writer>(&self, writer: &mut W) -> Result<(), io::Error> {
307                 write_ver_prefix!(writer, SERIALIZATION_VERSION, MIN_SERIALIZATION_VERSION);
308
309                 self.destination_script.write(writer)?;
310                 self.holder_commitment.write(writer)?;
311                 None::<Option<Vec<Option<(usize, Signature)>>>>.write(writer)?; // holder_htlc_sigs
312                 self.prev_holder_commitment.write(writer)?;
313                 None::<Option<Vec<Option<(usize, Signature)>>>>.write(writer)?; // prev_holder_htlc_sigs
314
315                 self.channel_transaction_parameters.write(writer)?;
316
317                 // Write a zero-length signer. The data is no longer deserialized as of version 0.0.113 and
318                 // downgrades before version 0.0.113 are no longer supported as of version 0.0.119.
319                 0u32.write(writer)?;
320
321                 writer.write_all(&(self.pending_claim_requests.len() as u64).to_be_bytes())?;
322                 for (ref ancestor_claim_txid, request) in self.pending_claim_requests.iter() {
323                         ancestor_claim_txid.write(writer)?;
324                         request.write(writer)?;
325                 }
326
327                 writer.write_all(&(self.claimable_outpoints.len() as u64).to_be_bytes())?;
328                 for (ref outp, ref claim_and_height) in self.claimable_outpoints.iter() {
329                         outp.write(writer)?;
330                         claim_and_height.0.write(writer)?;
331                         claim_and_height.1.write(writer)?;
332                 }
333
334                 writer.write_all(&(self.locktimed_packages.len() as u64).to_be_bytes())?;
335                 for (ref locktime, ref packages) in self.locktimed_packages.iter() {
336                         locktime.write(writer)?;
337                         writer.write_all(&(packages.len() as u64).to_be_bytes())?;
338                         for ref package in packages.iter() {
339                                 package.write(writer)?;
340                         }
341                 }
342
343                 writer.write_all(&(self.onchain_events_awaiting_threshold_conf.len() as u64).to_be_bytes())?;
344                 for ref entry in self.onchain_events_awaiting_threshold_conf.iter() {
345                         entry.write(writer)?;
346                 }
347
348                 write_tlv_fields!(writer, {});
349                 Ok(())
350         }
351 }
352
353 impl<'a, 'b, ES: EntropySource, SP: SignerProvider> ReadableArgs<(&'a ES, &'b SP, u64, [u8; 32])> for OnchainTxHandler<SP::EcdsaSigner> {
354         fn read<R: io::Read>(reader: &mut R, args: (&'a ES, &'b SP, u64, [u8; 32])) -> Result<Self, DecodeError> {
355                 let entropy_source = args.0;
356                 let signer_provider = args.1;
357                 let channel_value_satoshis = args.2;
358                 let channel_keys_id = args.3;
359
360                 let _ver = read_ver_prefix!(reader, SERIALIZATION_VERSION);
361
362                 let destination_script = Readable::read(reader)?;
363
364                 let holder_commitment = Readable::read(reader)?;
365                 let _holder_htlc_sigs: Option<Vec<Option<(usize, Signature)>>> = Readable::read(reader)?;
366                 let prev_holder_commitment = Readable::read(reader)?;
367                 let _prev_holder_htlc_sigs: Option<Vec<Option<(usize, Signature)>>> = Readable::read(reader)?;
368
369                 let channel_parameters = Readable::read(reader)?;
370
371                 // Read the serialized signer bytes, but don't deserialize them, as we'll obtain our signer
372                 // by re-deriving the private key material.
373                 let keys_len: u32 = Readable::read(reader)?;
374                 let mut bytes_read = 0;
375                 while bytes_read != keys_len as usize {
376                         // Read 1KB at a time to avoid accidentally allocating 4GB on corrupted channel keys
377                         let mut data = [0; 1024];
378                         let bytes_to_read = cmp::min(1024, keys_len as usize - bytes_read);
379                         let read_slice = &mut data[0..bytes_to_read];
380                         reader.read_exact(read_slice)?;
381                         bytes_read += bytes_to_read;
382                 }
383
384                 let mut signer = signer_provider.derive_channel_signer(channel_value_satoshis, channel_keys_id);
385                 signer.provide_channel_parameters(&channel_parameters);
386
387                 let pending_claim_requests_len: u64 = Readable::read(reader)?;
388                 let mut pending_claim_requests = hash_map_with_capacity(cmp::min(pending_claim_requests_len as usize, MAX_ALLOC_SIZE / 128));
389                 for _ in 0..pending_claim_requests_len {
390                         pending_claim_requests.insert(Readable::read(reader)?, Readable::read(reader)?);
391                 }
392
393                 let claimable_outpoints_len: u64 = Readable::read(reader)?;
394                 let mut claimable_outpoints = hash_map_with_capacity(cmp::min(pending_claim_requests_len as usize, MAX_ALLOC_SIZE / 128));
395                 for _ in 0..claimable_outpoints_len {
396                         let outpoint = Readable::read(reader)?;
397                         let ancestor_claim_txid = Readable::read(reader)?;
398                         let height = Readable::read(reader)?;
399                         claimable_outpoints.insert(outpoint, (ancestor_claim_txid, height));
400                 }
401
402                 let locktimed_packages_len: u64 = Readable::read(reader)?;
403                 let mut locktimed_packages = BTreeMap::new();
404                 for _ in 0..locktimed_packages_len {
405                         let locktime = Readable::read(reader)?;
406                         let packages_len: u64 = Readable::read(reader)?;
407                         let mut packages = Vec::with_capacity(cmp::min(packages_len as usize, MAX_ALLOC_SIZE / core::mem::size_of::<PackageTemplate>()));
408                         for _ in 0..packages_len {
409                                 packages.push(Readable::read(reader)?);
410                         }
411                         locktimed_packages.insert(locktime, packages);
412                 }
413
414                 let waiting_threshold_conf_len: u64 = Readable::read(reader)?;
415                 let mut onchain_events_awaiting_threshold_conf = Vec::with_capacity(cmp::min(waiting_threshold_conf_len as usize, MAX_ALLOC_SIZE / 128));
416                 for _ in 0..waiting_threshold_conf_len {
417                         if let Some(val) = MaybeReadable::read(reader)? {
418                                 onchain_events_awaiting_threshold_conf.push(val);
419                         }
420                 }
421
422                 read_tlv_fields!(reader, {});
423
424                 let mut secp_ctx = Secp256k1::new();
425                 secp_ctx.seeded_randomize(&entropy_source.get_secure_random_bytes());
426
427                 Ok(OnchainTxHandler {
428                         channel_value_satoshis,
429                         channel_keys_id,
430                         destination_script,
431                         holder_commitment,
432                         prev_holder_commitment,
433                         signer,
434                         channel_transaction_parameters: channel_parameters,
435                         claimable_outpoints,
436                         locktimed_packages,
437                         pending_claim_requests,
438                         onchain_events_awaiting_threshold_conf,
439                         pending_claim_events: Vec::new(),
440                         secp_ctx,
441                 })
442         }
443 }
444
445 impl<ChannelSigner: EcdsaChannelSigner> OnchainTxHandler<ChannelSigner> {
446         pub(crate) fn new(
447                 channel_value_satoshis: u64, channel_keys_id: [u8; 32], destination_script: ScriptBuf,
448                 signer: ChannelSigner, channel_parameters: ChannelTransactionParameters,
449                 holder_commitment: HolderCommitmentTransaction, secp_ctx: Secp256k1<secp256k1::All>
450         ) -> Self {
451                 OnchainTxHandler {
452                         channel_value_satoshis,
453                         channel_keys_id,
454                         destination_script,
455                         holder_commitment,
456                         prev_holder_commitment: None,
457                         signer,
458                         channel_transaction_parameters: channel_parameters,
459                         pending_claim_requests: new_hash_map(),
460                         claimable_outpoints: new_hash_map(),
461                         locktimed_packages: BTreeMap::new(),
462                         onchain_events_awaiting_threshold_conf: Vec::new(),
463                         pending_claim_events: Vec::new(),
464                         secp_ctx,
465                 }
466         }
467
468         pub(crate) fn get_prev_holder_commitment_to_self_value(&self) -> Option<u64> {
469                 self.prev_holder_commitment.as_ref().map(|commitment| commitment.to_broadcaster_value_sat())
470         }
471
472         pub(crate) fn get_cur_holder_commitment_to_self_value(&self) -> u64 {
473                 self.holder_commitment.to_broadcaster_value_sat()
474         }
475
476         pub(crate) fn get_and_clear_pending_claim_events(&mut self) -> Vec<(ClaimId, ClaimEvent)> {
477                 let mut events = Vec::new();
478                 swap(&mut events, &mut self.pending_claim_events);
479                 events
480         }
481
482         /// Triggers rebroadcasts/fee-bumps of pending claims from a force-closed channel. This is
483         /// crucial in preventing certain classes of pinning attacks, detecting substantial mempool
484         /// feerate changes between blocks, and ensuring reliability if broadcasting fails. We recommend
485         /// invoking this every 30 seconds, or lower if running in an environment with spotty
486         /// connections, like on mobile.
487         pub(super) fn rebroadcast_pending_claims<B: Deref, F: Deref, L: Logger>(
488                 &mut self, current_height: u32, feerate_strategy: FeerateStrategy, broadcaster: &B,
489                 fee_estimator: &LowerBoundedFeeEstimator<F>, logger: &L,
490         )
491         where
492                 B::Target: BroadcasterInterface,
493                 F::Target: FeeEstimator,
494         {
495                 let mut bump_requests = Vec::with_capacity(self.pending_claim_requests.len());
496                 for (claim_id, request) in self.pending_claim_requests.iter() {
497                         let inputs = request.outpoints();
498                         log_info!(logger, "Triggering rebroadcast/fee-bump for request with inputs {:?}", inputs);
499                         bump_requests.push((*claim_id, request.clone()));
500                 }
501                 for (claim_id, request) in bump_requests {
502                         self.generate_claim(current_height, &request, &feerate_strategy, fee_estimator, logger)
503                                 .map(|(_, new_feerate, claim)| {
504                                         let mut bumped_feerate = false;
505                                         if let Some(mut_request) = self.pending_claim_requests.get_mut(&claim_id) {
506                                                 bumped_feerate = request.previous_feerate() > new_feerate;
507                                                 mut_request.set_feerate(new_feerate);
508                                         }
509                                         match claim {
510                                                 OnchainClaim::Tx(tx) => {
511                                                         if tx.is_fully_signed() {
512                                                                 let log_start = if bumped_feerate { "Broadcasting RBF-bumped" } else { "Rebroadcasting" };
513                                                                 log_info!(logger, "{} onchain {}", log_start, log_tx!(tx.0));
514                                                                 broadcaster.broadcast_transactions(&[&tx.0]);
515                                                         } else {
516                                                                 log_info!(logger, "Waiting for signature of unsigned onchain transaction {}", tx.0.txid());
517                                                         }
518                                                 },
519                                                 OnchainClaim::Event(event) => {
520                                                         let log_start = if bumped_feerate { "Yielding fee-bumped" } else { "Replaying" };
521                                                         log_info!(logger, "{} onchain event to spend inputs {:?}", log_start,
522                                                                 request.outpoints());
523                                                         #[cfg(debug_assertions)] {
524                                                                 debug_assert!(request.requires_external_funding());
525                                                                 let num_existing = self.pending_claim_events.iter()
526                                                                         .filter(|entry| entry.0 == claim_id).count();
527                                                                 assert!(num_existing == 0 || num_existing == 1);
528                                                         }
529                                                         self.pending_claim_events.retain(|event| event.0 != claim_id);
530                                                         self.pending_claim_events.push((claim_id, event));
531                                                 }
532                                         }
533                                 });
534                 }
535         }
536
537         /// Lightning security model (i.e being able to redeem/timeout HTLC or penalize counterparty
538         /// onchain) lays on the assumption of claim transactions getting confirmed before timelock
539         /// expiration (CSV or CLTV following cases). In case of high-fee spikes, claim tx may get stuck
540         /// in the mempool, so you need to bump its feerate quickly using Replace-By-Fee or
541         /// Child-Pay-For-Parent.
542         ///
543         /// Panics if there are signing errors, because signing operations in reaction to on-chain
544         /// events are not expected to fail, and if they do, we may lose funds.
545         fn generate_claim<F: Deref, L: Logger>(
546                 &mut self, cur_height: u32, cached_request: &PackageTemplate, feerate_strategy: &FeerateStrategy,
547                 fee_estimator: &LowerBoundedFeeEstimator<F>, logger: &L,
548         ) -> Option<(u32, u64, OnchainClaim)>
549         where F::Target: FeeEstimator,
550         {
551                 let request_outpoints = cached_request.outpoints();
552                 if request_outpoints.is_empty() {
553                         // Don't prune pending claiming request yet, we may have to resurrect HTLCs. Untractable
554                         // packages cannot be aggregated and will never be split, so we cannot end up with an
555                         // empty claim.
556                         debug_assert!(cached_request.is_malleable());
557                         return None;
558                 }
559                 // If we've seen transaction inclusion in the chain for all outpoints in our request, we
560                 // don't need to continue generating more claims. We'll keep tracking the request to fully
561                 // remove it once it reaches the confirmation threshold, or to generate a new claim if the
562                 // transaction is reorged out.
563                 let mut all_inputs_have_confirmed_spend = true;
564                 for outpoint in request_outpoints.iter() {
565                         if let Some((request_claim_id, _)) = self.claimable_outpoints.get(*outpoint) {
566                                 // We check for outpoint spends within claims individually rather than as a set
567                                 // since requests can have outpoints split off.
568                                 if !self.onchain_events_awaiting_threshold_conf.iter()
569                                         .any(|event_entry| if let OnchainEvent::Claim { claim_id } = event_entry.event {
570                                                 *request_claim_id == claim_id
571                                         } else {
572                                                 // The onchain event is not a claim, keep seeking until we find one.
573                                                 false
574                                         })
575                                 {
576                                         // Either we had no `OnchainEvent::Claim`, or we did but none matched the
577                                         // outpoint's registered spend.
578                                         all_inputs_have_confirmed_spend = false;
579                                 }
580                         } else {
581                                 // The request's outpoint spend does not exist yet.
582                                 all_inputs_have_confirmed_spend = false;
583                         }
584                 }
585                 if all_inputs_have_confirmed_spend {
586                         return None;
587                 }
588
589                 // Compute new height timer to decide when we need to regenerate a new bumped version of the claim tx (if we
590                 // didn't receive confirmation of it before, or not enough reorg-safe depth on top of it).
591                 let new_timer = cached_request.get_height_timer(cur_height);
592                 if cached_request.is_malleable() {
593                         if cached_request.requires_external_funding() {
594                                 let target_feerate_sat_per_1000_weight = cached_request.compute_package_feerate(
595                                         fee_estimator, ConfirmationTarget::OnChainSweep, feerate_strategy,
596                                 );
597                                 if let Some(htlcs) = cached_request.construct_malleable_package_with_external_funding(self) {
598                                         return Some((
599                                                 new_timer,
600                                                 target_feerate_sat_per_1000_weight as u64,
601                                                 OnchainClaim::Event(ClaimEvent::BumpHTLC {
602                                                         target_feerate_sat_per_1000_weight,
603                                                         htlcs,
604                                                         tx_lock_time: LockTime::from_consensus(cached_request.package_locktime(cur_height)),
605                                                 }),
606                                         ));
607                                 } else {
608                                         return None;
609                                 }
610                         }
611
612                         let predicted_weight = cached_request.package_weight(&self.destination_script);
613                         if let Some((output_value, new_feerate)) = cached_request.compute_package_output(
614                                 predicted_weight, self.destination_script.dust_value().to_sat(),
615                                 feerate_strategy, fee_estimator, logger,
616                         ) {
617                                 assert!(new_feerate != 0);
618
619                                 let transaction = cached_request.maybe_finalize_malleable_package(
620                                         cur_height, self, output_value, self.destination_script.clone(), logger
621                                 ).unwrap();
622                                 assert!(predicted_weight >= transaction.0.weight().to_wu());
623                                 return Some((new_timer, new_feerate, OnchainClaim::Tx(transaction)));
624                         }
625                 } else {
626                         // Untractable packages cannot have their fees bumped through Replace-By-Fee. Some
627                         // packages may support fee bumping through Child-Pays-For-Parent, indicated by those
628                         // which require external funding.
629                         let mut inputs = cached_request.inputs();
630                         debug_assert_eq!(inputs.len(), 1);
631                         let tx = match cached_request.maybe_finalize_untractable_package(self, logger) {
632                                 Some(tx) => tx,
633                                 None => return None,
634                         };
635                         if !cached_request.requires_external_funding() {
636                                 return Some((new_timer, 0, OnchainClaim::Tx(tx)));
637                         }
638                         return inputs.find_map(|input| match input {
639                                 // Commitment inputs with anchors support are the only untractable inputs supported
640                                 // thus far that require external funding.
641                                 PackageSolvingData::HolderFundingOutput(output) => {
642                                         debug_assert_eq!(tx.0.txid(), self.holder_commitment.trust().txid(),
643                                                 "Holder commitment transaction mismatch");
644
645                                         let conf_target = ConfirmationTarget::OnChainSweep;
646                                         let package_target_feerate_sat_per_1000_weight = cached_request
647                                                 .compute_package_feerate(fee_estimator, conf_target, feerate_strategy);
648                                         if let Some(input_amount_sat) = output.funding_amount {
649                                                 let fee_sat = input_amount_sat - tx.0.output.iter().map(|output| output.value).sum::<u64>();
650                                                 let commitment_tx_feerate_sat_per_1000_weight =
651                                                         compute_feerate_sat_per_1000_weight(fee_sat, tx.0.weight().to_wu());
652                                                 if commitment_tx_feerate_sat_per_1000_weight >= package_target_feerate_sat_per_1000_weight {
653                                                         log_debug!(logger, "Pre-signed commitment {} already has feerate {} sat/kW above required {} sat/kW",
654                                                                 tx.0.txid(), commitment_tx_feerate_sat_per_1000_weight,
655                                                                 package_target_feerate_sat_per_1000_weight);
656                                                         return Some((new_timer, 0, OnchainClaim::Tx(tx.clone())));
657                                                 }
658                                         }
659
660                                         // We'll locate an anchor output we can spend within the commitment transaction.
661                                         let funding_pubkey = &self.channel_transaction_parameters.holder_pubkeys.funding_pubkey;
662                                         match chan_utils::get_anchor_output(&tx.0, funding_pubkey) {
663                                                 // An anchor output was found, so we should yield a funding event externally.
664                                                 Some((idx, _)) => {
665                                                         // TODO: Use a lower confirmation target when both our and the
666                                                         // counterparty's latest commitment don't have any HTLCs present.
667                                                         Some((
668                                                                 new_timer,
669                                                                 package_target_feerate_sat_per_1000_weight as u64,
670                                                                 OnchainClaim::Event(ClaimEvent::BumpCommitment {
671                                                                         package_target_feerate_sat_per_1000_weight,
672                                                                         commitment_tx: tx.0.clone(),
673                                                                         anchor_output_idx: idx,
674                                                                 }),
675                                                         ))
676                                                 },
677                                                 // An anchor output was not found. There's nothing we can do other than
678                                                 // attempt to broadcast the transaction with its current fee rate and hope
679                                                 // it confirms. This is essentially the same behavior as a commitment
680                                                 // transaction without anchor outputs.
681                                                 None => Some((new_timer, 0, OnchainClaim::Tx(tx.clone()))),
682                                         }
683                                 },
684                                 _ => {
685                                         debug_assert!(false, "Only HolderFundingOutput inputs should be untractable and require external funding");
686                                         None
687                                 },
688                         })
689                 }
690                 None
691         }
692
693         pub fn abandon_claim(&mut self, outpoint: &BitcoinOutPoint) {
694                 let claim_id = self.claimable_outpoints.get(outpoint).map(|(claim_id, _)| *claim_id)
695                         .or_else(|| {
696                                 self.pending_claim_requests.iter()
697                                         .find(|(_, claim)| claim.outpoints().iter().any(|claim_outpoint| *claim_outpoint == outpoint))
698                                         .map(|(claim_id, _)| *claim_id)
699                         });
700                 if let Some(claim_id) = claim_id {
701                         if let Some(claim) = self.pending_claim_requests.remove(&claim_id) {
702                                 for outpoint in claim.outpoints() {
703                                         self.claimable_outpoints.remove(outpoint);
704                                 }
705                         }
706                 } else {
707                         self.locktimed_packages.values_mut().for_each(|claims|
708                                 claims.retain(|claim| !claim.outpoints().iter().any(|claim_outpoint| *claim_outpoint == outpoint)));
709                 }
710         }
711
712         /// Upon channelmonitor.block_connected(..) or upon provision of a preimage on the forward link
713         /// for this channel, provide new relevant on-chain transactions and/or new claim requests.
714         /// Together with `update_claims_view_from_matched_txn` this used to be named
715         /// `block_connected`, but it is now also used for claiming an HTLC output if we receive a
716         /// preimage after force-close.
717         ///
718         /// `conf_height` represents the height at which the request was generated. This
719         /// does not need to equal the current blockchain tip height, which should be provided via
720         /// `cur_height`, however it must never be higher than `cur_height`.
721         pub(super) fn update_claims_view_from_requests<B: Deref, F: Deref, L: Logger>(
722                 &mut self, requests: Vec<PackageTemplate>, conf_height: u32, cur_height: u32,
723                 broadcaster: &B, fee_estimator: &LowerBoundedFeeEstimator<F>, logger: &L
724         ) where
725                 B::Target: BroadcasterInterface,
726                 F::Target: FeeEstimator,
727         {
728                 if !requests.is_empty() {
729                         log_debug!(logger, "Updating claims view at height {} with {} claim requests", cur_height, requests.len());
730                 }
731
732                 let mut preprocessed_requests = Vec::with_capacity(requests.len());
733                 let mut aggregated_request = None;
734
735                 // Try to aggregate outputs if their timelock expiration isn't imminent (package timelock
736                 // <= CLTV_SHARED_CLAIM_BUFFER) and they don't require an immediate nLockTime (aggregable).
737                 for req in requests {
738                         // Don't claim a outpoint twice that would be bad for privacy and may uselessly lock a CPFP input for a while
739                         if let Some(_) = self.claimable_outpoints.get(req.outpoints()[0]) {
740                                 log_info!(logger, "Ignoring second claim for outpoint {}:{}, already registered its claiming request", req.outpoints()[0].txid, req.outpoints()[0].vout);
741                         } else {
742                                 let timelocked_equivalent_package = self.locktimed_packages.iter().map(|v| v.1.iter()).flatten()
743                                         .find(|locked_package| locked_package.outpoints() == req.outpoints());
744                                 if let Some(package) = timelocked_equivalent_package {
745                                         log_info!(logger, "Ignoring second claim for outpoint {}:{}, we already have one which we're waiting on a timelock at {} for.",
746                                                 req.outpoints()[0].txid, req.outpoints()[0].vout, package.package_locktime(cur_height));
747                                         continue;
748                                 }
749
750                                 let package_locktime = req.package_locktime(cur_height);
751                                 if package_locktime > cur_height + 1 {
752                                         log_info!(logger, "Delaying claim of package until its timelock at {} (current height {}), the following outpoints are spent:", package_locktime, cur_height);
753                                         for outpoint in req.outpoints() {
754                                                 log_info!(logger, "  Outpoint {}", outpoint);
755                                         }
756                                         self.locktimed_packages.entry(package_locktime).or_insert(Vec::new()).push(req);
757                                         continue;
758                                 }
759
760                                 log_trace!(logger, "Test if outpoint can be aggregated with expiration {} against {}", req.timelock(), cur_height + CLTV_SHARED_CLAIM_BUFFER);
761                                 if req.timelock() <= cur_height + CLTV_SHARED_CLAIM_BUFFER || !req.aggregable() {
762                                         // Don't aggregate if outpoint package timelock is soon or marked as non-aggregable
763                                         preprocessed_requests.push(req);
764                                 } else if aggregated_request.is_none() {
765                                         aggregated_request = Some(req);
766                                 } else {
767                                         aggregated_request.as_mut().unwrap().merge_package(req);
768                                 }
769                         }
770                 }
771                 if let Some(req) = aggregated_request {
772                         preprocessed_requests.push(req);
773                 }
774
775                 // Claim everything up to and including `cur_height`
776                 let remaining_locked_packages = self.locktimed_packages.split_off(&(cur_height + 1));
777                 if !self.locktimed_packages.is_empty() {
778                         log_debug!(logger,
779                                 "Updating claims view at height {} with {} locked packages available for claim",
780                                 cur_height,
781                                 self.locktimed_packages.len());
782                 }
783                 for (pop_height, mut entry) in self.locktimed_packages.iter_mut() {
784                         log_trace!(logger, "Restoring delayed claim of package(s) at their timelock at {}.", pop_height);
785                         preprocessed_requests.append(&mut entry);
786                 }
787                 self.locktimed_packages = remaining_locked_packages;
788
789                 // Generate claim transactions and track them to bump if necessary at
790                 // height timer expiration (i.e in how many blocks we're going to take action).
791                 for mut req in preprocessed_requests {
792                         if let Some((new_timer, new_feerate, claim)) = self.generate_claim(
793                                 cur_height, &req, &FeerateStrategy::ForceBump, &*fee_estimator, &*logger,
794                         ) {
795                                 req.set_timer(new_timer);
796                                 req.set_feerate(new_feerate);
797                                 // Once a pending claim has an id assigned, it remains fixed until the claim is
798                                 // satisfied, regardless of whether the claim switches between different variants of
799                                 // `OnchainClaim`.
800                                 let claim_id = match claim {
801                                         OnchainClaim::Tx(tx) => {
802                                                 if tx.is_fully_signed() {
803                                                         log_info!(logger, "Broadcasting onchain {}", log_tx!(tx.0));
804                                                         broadcaster.broadcast_transactions(&[&tx.0]);
805                                                 } else {
806                                                         log_info!(logger, "Waiting for signature of unsigned onchain transaction {}", tx.0.txid());
807                                                 }
808                                                 ClaimId(tx.0.txid().to_byte_array())
809                                         },
810                                         OnchainClaim::Event(claim_event) => {
811                                                 log_info!(logger, "Yielding onchain event to spend inputs {:?}", req.outpoints());
812                                                 let claim_id = match claim_event {
813                                                         ClaimEvent::BumpCommitment { ref commitment_tx, .. } =>
814                                                                 // For commitment claims, we can just use their txid as it should
815                                                                 // already be unique.
816                                                                 ClaimId(commitment_tx.txid().to_byte_array()),
817                                                         ClaimEvent::BumpHTLC { ref htlcs, .. } => {
818                                                                 // For HTLC claims, commit to the entire set of HTLC outputs to
819                                                                 // claim, which will always be unique per request. Once a claim ID
820                                                                 // is generated, it is assigned and remains unchanged, even if the
821                                                                 // underlying set of HTLCs changes.
822                                                                 let mut engine = Sha256::engine();
823                                                                 for htlc in htlcs {
824                                                                         engine.input(&htlc.commitment_txid.to_byte_array());
825                                                                         engine.input(&htlc.htlc.transaction_output_index.unwrap().to_be_bytes());
826                                                                 }
827                                                                 ClaimId(Sha256::from_engine(engine).to_byte_array())
828                                                         },
829                                                 };
830                                                 debug_assert!(self.pending_claim_requests.get(&claim_id).is_none());
831                                                 debug_assert_eq!(self.pending_claim_events.iter().filter(|entry| entry.0 == claim_id).count(), 0);
832                                                 self.pending_claim_events.push((claim_id, claim_event));
833                                                 claim_id
834                                         },
835                                 };
836                                 // Because fuzzing can cause hash collisions, we can end up with conflicting claim
837                                 // ids here, so we only assert when not fuzzing.
838                                 debug_assert!(cfg!(fuzzing) || self.pending_claim_requests.get(&claim_id).is_none());
839                                 for k in req.outpoints() {
840                                         log_info!(logger, "Registering claiming request for {}:{}", k.txid, k.vout);
841                                         self.claimable_outpoints.insert(k.clone(), (claim_id, conf_height));
842                                 }
843                                 self.pending_claim_requests.insert(claim_id, req);
844                         }
845                 }
846         }
847
848         /// Upon channelmonitor.block_connected(..) or upon provision of a preimage on the forward link
849         /// for this channel, provide new relevant on-chain transactions and/or new claim requests.
850         /// Together with `update_claims_view_from_requests` this used to be named `block_connected`,
851         /// but it is now also used for claiming an HTLC output if we receive a preimage after force-close.
852         ///
853         /// `conf_height` represents the height at which the transactions in `txn_matched` were
854         /// confirmed. This does not need to equal the current blockchain tip height, which should be
855         /// provided via `cur_height`, however it must never be higher than `cur_height`.
856         pub(super) fn update_claims_view_from_matched_txn<B: Deref, F: Deref, L: Logger>(
857                 &mut self, txn_matched: &[&Transaction], conf_height: u32, conf_hash: BlockHash,
858                 cur_height: u32, broadcaster: &B, fee_estimator: &LowerBoundedFeeEstimator<F>, logger: &L
859         ) where
860                 B::Target: BroadcasterInterface,
861                 F::Target: FeeEstimator,
862         {
863                 let mut have_logged_intro = false;
864                 let mut maybe_log_intro = || {
865                         if !have_logged_intro {
866                                 log_debug!(logger, "Updating claims view at height {} with {} matched transactions in block {}", cur_height, txn_matched.len(), conf_height);
867                                 have_logged_intro = true;
868                         }
869                 };
870                 let mut bump_candidates = new_hash_map();
871                 if !txn_matched.is_empty() { maybe_log_intro(); }
872                 for tx in txn_matched {
873                         // Scan all input to verify is one of the outpoint spent is of interest for us
874                         let mut claimed_outputs_material = Vec::new();
875                         for inp in &tx.input {
876                                 if let Some((claim_id, _)) = self.claimable_outpoints.get(&inp.previous_output) {
877                                         // If outpoint has claim request pending on it...
878                                         if let Some(request) = self.pending_claim_requests.get_mut(claim_id) {
879                                                 //... we need to verify equality between transaction outpoints and claim request
880                                                 // outpoints to know if transaction is the original claim or a bumped one issued
881                                                 // by us.
882                                                 let mut are_sets_equal = true;
883                                                 let mut tx_inputs = tx.input.iter().map(|input| &input.previous_output).collect::<Vec<_>>();
884                                                 tx_inputs.sort_unstable();
885                                                 for request_input in request.outpoints() {
886                                                         if tx_inputs.binary_search(&request_input).is_err() {
887                                                                 are_sets_equal = false;
888                                                                 break;
889                                                         }
890                                                 }
891
892                                                 macro_rules! clean_claim_request_after_safety_delay {
893                                                         () => {
894                                                                 let entry = OnchainEventEntry {
895                                                                         txid: tx.txid(),
896                                                                         height: conf_height,
897                                                                         block_hash: Some(conf_hash),
898                                                                         event: OnchainEvent::Claim { claim_id: *claim_id }
899                                                                 };
900                                                                 if !self.onchain_events_awaiting_threshold_conf.contains(&entry) {
901                                                                         self.onchain_events_awaiting_threshold_conf.push(entry);
902                                                                 }
903                                                         }
904                                                 }
905
906                                                 // If this is our transaction (or our counterparty spent all the outputs
907                                                 // before we could anyway with same inputs order than us), wait for
908                                                 // ANTI_REORG_DELAY and clean the RBF tracking map.
909                                                 if are_sets_equal {
910                                                         clean_claim_request_after_safety_delay!();
911                                                 } else { // If false, generate new claim request with update outpoint set
912                                                         let mut at_least_one_drop = false;
913                                                         for input in tx.input.iter() {
914                                                                 if let Some(package) = request.split_package(&input.previous_output) {
915                                                                         claimed_outputs_material.push(package);
916                                                                         at_least_one_drop = true;
917                                                                 }
918                                                                 // If there are no outpoints left to claim in this request, drop it entirely after ANTI_REORG_DELAY.
919                                                                 if request.outpoints().is_empty() {
920                                                                         clean_claim_request_after_safety_delay!();
921                                                                 }
922                                                         }
923                                                         //TODO: recompute soonest_timelock to avoid wasting a bit on fees
924                                                         if at_least_one_drop {
925                                                                 bump_candidates.insert(*claim_id, request.clone());
926                                                                 // If we have any pending claim events for the request being updated
927                                                                 // that have yet to be consumed, we'll remove them since they will
928                                                                 // end up producing an invalid transaction by double spending
929                                                                 // input(s) that already have a confirmed spend. If such spend is
930                                                                 // reorged out of the chain, then we'll attempt to re-spend the
931                                                                 // inputs once we see it.
932                                                                 #[cfg(debug_assertions)] {
933                                                                         let existing = self.pending_claim_events.iter()
934                                                                                 .filter(|entry| entry.0 == *claim_id).count();
935                                                                         assert!(existing == 0 || existing == 1);
936                                                                 }
937                                                                 self.pending_claim_events.retain(|entry| entry.0 != *claim_id);
938                                                         }
939                                                 }
940                                                 break; //No need to iterate further, either tx is our or their
941                                         } else {
942                                                 panic!("Inconsistencies between pending_claim_requests map and claimable_outpoints map");
943                                         }
944                                 }
945                         }
946                         for package in claimed_outputs_material.drain(..) {
947                                 let entry = OnchainEventEntry {
948                                         txid: tx.txid(),
949                                         height: conf_height,
950                                         block_hash: Some(conf_hash),
951                                         event: OnchainEvent::ContentiousOutpoint { package },
952                                 };
953                                 if !self.onchain_events_awaiting_threshold_conf.contains(&entry) {
954                                         self.onchain_events_awaiting_threshold_conf.push(entry);
955                                 }
956                         }
957                 }
958
959                 // After security delay, either our claim tx got enough confs or outpoint is definetely out of reach
960                 let onchain_events_awaiting_threshold_conf =
961                         self.onchain_events_awaiting_threshold_conf.drain(..).collect::<Vec<_>>();
962                 for entry in onchain_events_awaiting_threshold_conf {
963                         if entry.has_reached_confirmation_threshold(cur_height) {
964                                 maybe_log_intro();
965                                 match entry.event {
966                                         OnchainEvent::Claim { claim_id } => {
967                                                 // We may remove a whole set of claim outpoints here, as these one may have
968                                                 // been aggregated in a single tx and claimed so atomically
969                                                 if let Some(request) = self.pending_claim_requests.remove(&claim_id) {
970                                                         for outpoint in request.outpoints() {
971                                                                 log_debug!(logger, "Removing claim tracking for {} due to maturation of claim package {}.",
972                                                                         outpoint, log_bytes!(claim_id.0));
973                                                                 self.claimable_outpoints.remove(outpoint);
974                                                         }
975                                                         #[cfg(debug_assertions)] {
976                                                                 let num_existing = self.pending_claim_events.iter()
977                                                                         .filter(|entry| entry.0 == claim_id).count();
978                                                                 assert!(num_existing == 0 || num_existing == 1);
979                                                         }
980                                                         self.pending_claim_events.retain(|(id, _)| *id != claim_id);
981                                                 }
982                                         },
983                                         OnchainEvent::ContentiousOutpoint { package } => {
984                                                 log_debug!(logger, "Removing claim tracking due to maturation of claim tx for outpoints:");
985                                                 log_debug!(logger, " {:?}", package.outpoints());
986                                                 self.claimable_outpoints.remove(package.outpoints()[0]);
987                                         }
988                                 }
989                         } else {
990                                 self.onchain_events_awaiting_threshold_conf.push(entry);
991                         }
992                 }
993
994                 // Check if any pending claim request must be rescheduled
995                 for (claim_id, request) in self.pending_claim_requests.iter() {
996                         if cur_height >= request.timer() {
997                                 bump_candidates.insert(*claim_id, request.clone());
998                         }
999                 }
1000
1001                 // Build, bump and rebroadcast tx accordingly
1002                 if !bump_candidates.is_empty() {
1003                         maybe_log_intro();
1004                         log_trace!(logger, "Bumping {} candidates", bump_candidates.len());
1005                 }
1006
1007                 for (claim_id, request) in bump_candidates.iter() {
1008                         if let Some((new_timer, new_feerate, bump_claim)) = self.generate_claim(
1009                                 cur_height, &request, &FeerateStrategy::ForceBump, &*fee_estimator, &*logger,
1010                         ) {
1011                                 match bump_claim {
1012                                         OnchainClaim::Tx(bump_tx) => {
1013                                                 if bump_tx.is_fully_signed() {
1014                                                         log_info!(logger, "Broadcasting RBF-bumped onchain {}", log_tx!(bump_tx.0));
1015                                                         broadcaster.broadcast_transactions(&[&bump_tx.0]);
1016                                                 } else {
1017                                                         log_info!(logger, "Waiting for signature of RBF-bumped unsigned onchain transaction {}",
1018                                                                 bump_tx.0.txid());
1019                                                 }
1020                                         },
1021                                         OnchainClaim::Event(claim_event) => {
1022                                                 log_info!(logger, "Yielding RBF-bumped onchain event to spend inputs {:?}", request.outpoints());
1023                                                 #[cfg(debug_assertions)] {
1024                                                         let num_existing = self.pending_claim_events.iter().
1025                                                                 filter(|entry| entry.0 == *claim_id).count();
1026                                                         assert!(num_existing == 0 || num_existing == 1);
1027                                                 }
1028                                                 self.pending_claim_events.retain(|event| event.0 != *claim_id);
1029                                                 self.pending_claim_events.push((*claim_id, claim_event));
1030                                         },
1031                                 }
1032                                 if let Some(request) = self.pending_claim_requests.get_mut(claim_id) {
1033                                         request.set_timer(new_timer);
1034                                         request.set_feerate(new_feerate);
1035                                 }
1036                         }
1037                 }
1038         }
1039
1040         pub(super) fn transaction_unconfirmed<B: Deref, F: Deref, L: Logger>(
1041                 &mut self,
1042                 txid: &Txid,
1043                 broadcaster: B,
1044                 fee_estimator: &LowerBoundedFeeEstimator<F>,
1045                 logger: &L,
1046         ) where
1047                 B::Target: BroadcasterInterface,
1048                 F::Target: FeeEstimator,
1049         {
1050                 let mut height = None;
1051                 for entry in self.onchain_events_awaiting_threshold_conf.iter() {
1052                         if entry.txid == *txid {
1053                                 height = Some(entry.height);
1054                                 break;
1055                         }
1056                 }
1057
1058                 if let Some(height) = height {
1059                         self.block_disconnected(height, broadcaster, fee_estimator, logger);
1060                 }
1061         }
1062
1063         pub(super) fn block_disconnected<B: Deref, F: Deref, L: Logger>(&mut self, height: u32, broadcaster: B, fee_estimator: &LowerBoundedFeeEstimator<F>, logger: &L)
1064                 where B::Target: BroadcasterInterface,
1065                         F::Target: FeeEstimator,
1066         {
1067                 let mut bump_candidates = new_hash_map();
1068                 let onchain_events_awaiting_threshold_conf =
1069                         self.onchain_events_awaiting_threshold_conf.drain(..).collect::<Vec<_>>();
1070                 for entry in onchain_events_awaiting_threshold_conf {
1071                         if entry.height >= height {
1072                                 //- our claim tx on a commitment tx output
1073                                 //- resurect outpoint back in its claimable set and regenerate tx
1074                                 match entry.event {
1075                                         OnchainEvent::ContentiousOutpoint { package } => {
1076                                                 if let Some(pending_claim) = self.claimable_outpoints.get(package.outpoints()[0]) {
1077                                                         if let Some(request) = self.pending_claim_requests.get_mut(&pending_claim.0) {
1078                                                                 request.merge_package(package);
1079                                                                 // Using a HashMap guarantee us than if we have multiple outpoints getting
1080                                                                 // resurrected only one bump claim tx is going to be broadcast
1081                                                                 bump_candidates.insert(pending_claim.clone(), request.clone());
1082                                                         }
1083                                                 }
1084                                         },
1085                                         _ => {},
1086                                 }
1087                         } else {
1088                                 self.onchain_events_awaiting_threshold_conf.push(entry);
1089                         }
1090                 }
1091                 for ((_claim_id, _), ref mut request) in bump_candidates.iter_mut() {
1092                         // `height` is the height being disconnected, so our `current_height` is 1 lower.
1093                         let current_height = height - 1;
1094                         if let Some((new_timer, new_feerate, bump_claim)) = self.generate_claim(
1095                                 current_height, &request, &FeerateStrategy::ForceBump, fee_estimator, logger
1096                         ) {
1097                                 request.set_timer(new_timer);
1098                                 request.set_feerate(new_feerate);
1099                                 match bump_claim {
1100                                         OnchainClaim::Tx(bump_tx) => {
1101                                                 if bump_tx.is_fully_signed() {
1102                                                         log_info!(logger, "Broadcasting onchain {}", log_tx!(bump_tx.0));
1103                                                         broadcaster.broadcast_transactions(&[&bump_tx.0]);
1104                                                 } else {
1105                                                         log_info!(logger, "Waiting for signature of unsigned onchain transaction {}", bump_tx.0.txid());
1106                                                 }
1107                                         },
1108                                         OnchainClaim::Event(claim_event) => {
1109                                                 log_info!(logger, "Yielding onchain event after reorg to spend inputs {:?}", request.outpoints());
1110                                                 #[cfg(debug_assertions)] {
1111                                                         let num_existing = self.pending_claim_events.iter()
1112                                                                 .filter(|entry| entry.0 == *_claim_id).count();
1113                                                         assert!(num_existing == 0 || num_existing == 1);
1114                                                 }
1115                                                 self.pending_claim_events.retain(|event| event.0 != *_claim_id);
1116                                                 self.pending_claim_events.push((*_claim_id, claim_event));
1117                                         },
1118                                 }
1119                         }
1120                 }
1121                 for (ancestor_claim_txid, request) in bump_candidates.drain() {
1122                         self.pending_claim_requests.insert(ancestor_claim_txid.0, request);
1123                 }
1124                 //TODO: if we implement cross-block aggregated claim transaction we need to refresh set of outpoints and regenerate tx but
1125                 // right now if one of the outpoint get disconnected, just erase whole pending claim request.
1126                 let mut remove_request = Vec::new();
1127                 self.claimable_outpoints.retain(|_, ref v|
1128                         if v.1 >= height {
1129                         remove_request.push(v.0.clone());
1130                         false
1131                         } else { true });
1132                 for req in remove_request {
1133                         self.pending_claim_requests.remove(&req);
1134                 }
1135         }
1136
1137         pub(crate) fn is_output_spend_pending(&self, outpoint: &BitcoinOutPoint) -> bool {
1138                 self.claimable_outpoints.get(outpoint).is_some()
1139         }
1140
1141         pub(crate) fn get_relevant_txids(&self) -> Vec<(Txid, u32, Option<BlockHash>)> {
1142                 let mut txids: Vec<(Txid, u32, Option<BlockHash>)> = self.onchain_events_awaiting_threshold_conf
1143                         .iter()
1144                         .map(|entry| (entry.txid, entry.height, entry.block_hash))
1145                         .collect();
1146                 txids.sort_unstable_by(|a, b| a.0.cmp(&b.0).then(b.1.cmp(&a.1)));
1147                 txids.dedup_by_key(|(txid, _, _)| *txid);
1148                 txids
1149         }
1150
1151         pub(crate) fn provide_latest_holder_tx(&mut self, tx: HolderCommitmentTransaction) {
1152                 self.prev_holder_commitment = Some(replace(&mut self.holder_commitment, tx));
1153         }
1154
1155         pub(crate) fn get_unsigned_holder_commitment_tx(&self) -> &Transaction {
1156                 &self.holder_commitment.trust().built_transaction().transaction
1157         }
1158
1159         pub(crate) fn get_maybe_signed_holder_tx(&mut self, funding_redeemscript: &Script) -> MaybeSignedTransaction {
1160                 let tx = self.signer.sign_holder_commitment(&self.holder_commitment, &self.secp_ctx)
1161                         .map(|sig| self.holder_commitment.add_holder_sig(funding_redeemscript, sig))
1162                         .unwrap_or_else(|_| self.get_unsigned_holder_commitment_tx().clone());
1163                 MaybeSignedTransaction(tx)
1164         }
1165
1166         #[cfg(any(test, feature="unsafe_revoked_tx_signing"))]
1167         pub(crate) fn get_fully_signed_copy_holder_tx(&mut self, funding_redeemscript: &Script) -> Transaction {
1168                 let sig = self.signer.unsafe_sign_holder_commitment(&self.holder_commitment, &self.secp_ctx).expect("sign holder commitment");
1169                 self.holder_commitment.add_holder_sig(funding_redeemscript, sig)
1170         }
1171
1172         pub(crate) fn get_maybe_signed_htlc_tx(&mut self, outp: &::bitcoin::OutPoint, preimage: &Option<PaymentPreimage>) -> Option<MaybeSignedTransaction> {
1173                 let get_signed_htlc_tx = |holder_commitment: &HolderCommitmentTransaction| {
1174                         let trusted_tx = holder_commitment.trust();
1175                         if trusted_tx.txid() != outp.txid {
1176                                 return None;
1177                         }
1178                         let (htlc_idx, htlc) = trusted_tx.htlcs().iter().enumerate()
1179                                 .find(|(_, htlc)| htlc.transaction_output_index.unwrap() == outp.vout)
1180                                 .unwrap();
1181                         let counterparty_htlc_sig = holder_commitment.counterparty_htlc_sigs[htlc_idx];
1182                         let mut htlc_tx = trusted_tx.build_unsigned_htlc_tx(
1183                                 &self.channel_transaction_parameters.as_holder_broadcastable(), htlc_idx, preimage,
1184                         );
1185
1186                         let htlc_descriptor = HTLCDescriptor {
1187                                 channel_derivation_parameters: ChannelDerivationParameters {
1188                                         value_satoshis: self.channel_value_satoshis,
1189                                         keys_id: self.channel_keys_id,
1190                                         transaction_parameters: self.channel_transaction_parameters.clone(),
1191                                 },
1192                                 commitment_txid: trusted_tx.txid(),
1193                                 per_commitment_number: trusted_tx.commitment_number(),
1194                                 per_commitment_point: trusted_tx.per_commitment_point(),
1195                                 feerate_per_kw: trusted_tx.feerate_per_kw(),
1196                                 htlc: htlc.clone(),
1197                                 preimage: preimage.clone(),
1198                                 counterparty_sig: counterparty_htlc_sig.clone(),
1199                         };
1200                         if let Ok(htlc_sig) = self.signer.sign_holder_htlc_transaction(&htlc_tx, 0, &htlc_descriptor, &self.secp_ctx) {
1201                                 htlc_tx.input[0].witness = trusted_tx.build_htlc_input_witness(
1202                                         htlc_idx, &counterparty_htlc_sig, &htlc_sig, preimage,
1203                                 );
1204                         }
1205                         Some(MaybeSignedTransaction(htlc_tx))
1206                 };
1207
1208                 // Check if the HTLC spends from the current holder commitment first, or the previous.
1209                 get_signed_htlc_tx(&self.holder_commitment)
1210                         .or_else(|| self.prev_holder_commitment.as_ref().and_then(|prev_holder_commitment| get_signed_htlc_tx(prev_holder_commitment)))
1211         }
1212
1213         pub(crate) fn generate_external_htlc_claim(
1214                 &self, outp: &::bitcoin::OutPoint, preimage: &Option<PaymentPreimage>
1215         ) -> Option<ExternalHTLCClaim> {
1216                 let find_htlc = |holder_commitment: &HolderCommitmentTransaction| -> Option<ExternalHTLCClaim> {
1217                         let trusted_tx = holder_commitment.trust();
1218                         if outp.txid != trusted_tx.txid() {
1219                                 return None;
1220                         }
1221                         trusted_tx.htlcs().iter().enumerate()
1222                                 .find(|(_, htlc)| if let Some(output_index) = htlc.transaction_output_index {
1223                                         output_index == outp.vout
1224                                 } else {
1225                                         false
1226                                 })
1227                                 .map(|(htlc_idx, htlc)| {
1228                                         let counterparty_htlc_sig = holder_commitment.counterparty_htlc_sigs[htlc_idx];
1229                                         ExternalHTLCClaim {
1230                                                 commitment_txid: trusted_tx.txid(),
1231                                                 per_commitment_number: trusted_tx.commitment_number(),
1232                                                 htlc: htlc.clone(),
1233                                                 preimage: *preimage,
1234                                                 counterparty_sig: counterparty_htlc_sig,
1235                                                 per_commitment_point: trusted_tx.per_commitment_point(),
1236                                         }
1237                                 })
1238                 };
1239                 // Check if the HTLC spends from the current holder commitment or the previous one otherwise.
1240                 find_htlc(&self.holder_commitment)
1241                         .or_else(|| self.prev_holder_commitment.as_ref().map(|c| find_htlc(c)).flatten())
1242         }
1243
1244         pub(crate) fn channel_type_features(&self) -> &ChannelTypeFeatures {
1245                 &self.channel_transaction_parameters.channel_type_features
1246         }
1247 }