mirror of
https://github.com/lightningdevkit/rust-lightning.git
synced 2025-02-25 07:17:40 +01:00
Merge pull request #2203 from wpaulino/retry-untractable-packages
Retry untractable packages
This commit is contained in:
commit
8d50c919cf
8 changed files with 248 additions and 129 deletions
|
@ -489,7 +489,7 @@ impl<ChannelSigner: WriteableEcdsaChannelSigner> OnchainTxHandler<ChannelSigner>
|
|||
///
|
||||
/// Panics if there are signing errors, because signing operations in reaction to on-chain
|
||||
/// events are not expected to fail, and if they do, we may lose funds.
|
||||
fn generate_claim<F: Deref, L: Deref>(&mut self, cur_height: u32, cached_request: &PackageTemplate, fee_estimator: &LowerBoundedFeeEstimator<F>, logger: &L) -> Option<(Option<u32>, u64, OnchainClaim)>
|
||||
fn generate_claim<F: Deref, L: Deref>(&mut self, cur_height: u32, cached_request: &PackageTemplate, fee_estimator: &LowerBoundedFeeEstimator<F>, logger: &L) -> Option<(u32, u64, OnchainClaim)>
|
||||
where F::Target: FeeEstimator,
|
||||
L::Target: Logger,
|
||||
{
|
||||
|
@ -533,7 +533,7 @@ impl<ChannelSigner: WriteableEcdsaChannelSigner> OnchainTxHandler<ChannelSigner>
|
|||
|
||||
// Compute new height timer to decide when we need to regenerate a new bumped version of the claim tx (if we
|
||||
// didn't receive confirmation of it before, or not enough reorg-safe depth on top of it).
|
||||
let new_timer = Some(cached_request.get_height_timer(cur_height));
|
||||
let new_timer = cached_request.get_height_timer(cur_height);
|
||||
if cached_request.is_malleable() {
|
||||
#[cfg(anchors)]
|
||||
{ // Attributes are not allowed on if expressions on our current MSRV of 1.41.
|
||||
|
@ -565,7 +565,7 @@ impl<ChannelSigner: WriteableEcdsaChannelSigner> OnchainTxHandler<ChannelSigner>
|
|||
let transaction = cached_request.finalize_malleable_package(
|
||||
cur_height, self, output_value, self.destination_script.clone(), logger
|
||||
).unwrap();
|
||||
log_trace!(logger, "...with timer {} and feerate {}", new_timer.unwrap(), new_feerate);
|
||||
log_trace!(logger, "...with timer {} and feerate {}", new_timer, new_feerate);
|
||||
assert!(predicted_weight >= transaction.weight());
|
||||
return Some((new_timer, new_feerate, OnchainClaim::Tx(transaction)));
|
||||
}
|
||||
|
@ -583,7 +583,7 @@ impl<ChannelSigner: WriteableEcdsaChannelSigner> OnchainTxHandler<ChannelSigner>
|
|||
None => return None,
|
||||
};
|
||||
if !cached_request.requires_external_funding() {
|
||||
return Some((None, 0, OnchainClaim::Tx(tx)));
|
||||
return Some((new_timer, 0, OnchainClaim::Tx(tx)));
|
||||
}
|
||||
#[cfg(anchors)]
|
||||
return inputs.find_map(|input| match input {
|
||||
|
@ -616,7 +616,7 @@ impl<ChannelSigner: WriteableEcdsaChannelSigner> OnchainTxHandler<ChannelSigner>
|
|||
// attempt to broadcast the transaction with its current fee rate and hope
|
||||
// it confirms. This is essentially the same behavior as a commitment
|
||||
// transaction without anchor outputs.
|
||||
None => Some((None, 0, OnchainClaim::Tx(tx.clone()))),
|
||||
None => Some((new_timer, 0, OnchainClaim::Tx(tx.clone()))),
|
||||
}
|
||||
},
|
||||
_ => {
|
||||
|
@ -885,12 +885,10 @@ impl<ChannelSigner: WriteableEcdsaChannelSigner> OnchainTxHandler<ChannelSigner>
|
|||
|
||||
// Check if any pending claim request must be rescheduled
|
||||
for (package_id, request) in self.pending_claim_requests.iter() {
|
||||
if let Some(h) = request.timer() {
|
||||
if cur_height >= h {
|
||||
if cur_height >= request.timer() {
|
||||
bump_candidates.insert(*package_id, request.clone());
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// Build, bump and rebroadcast tx accordingly
|
||||
log_trace!(logger, "Bumping {} candidates", bump_candidates.len());
|
||||
|
|
|
@ -538,7 +538,7 @@ pub struct PackageTemplate {
|
|||
feerate_previous: u64,
|
||||
// Cache of next height at which fee-bumping and rebroadcast will be attempted. In
|
||||
// the future, we might abstract it to an observed mempool fluctuation.
|
||||
height_timer: Option<u32>,
|
||||
height_timer: u32,
|
||||
// Confirmation height of the claimed outputs set transaction. In case of reorg reaching
|
||||
// it, we wipe out and forget the package.
|
||||
height_original: u32,
|
||||
|
@ -557,13 +557,10 @@ impl PackageTemplate {
|
|||
pub(crate) fn set_feerate(&mut self, new_feerate: u64) {
|
||||
self.feerate_previous = new_feerate;
|
||||
}
|
||||
pub(crate) fn timer(&self) -> Option<u32> {
|
||||
if let Some(ref timer) = self.height_timer {
|
||||
return Some(*timer);
|
||||
pub(crate) fn timer(&self) -> u32 {
|
||||
self.height_timer
|
||||
}
|
||||
None
|
||||
}
|
||||
pub(crate) fn set_timer(&mut self, new_timer: Option<u32>) {
|
||||
pub(crate) fn set_timer(&mut self, new_timer: u32) {
|
||||
self.height_timer = new_timer;
|
||||
}
|
||||
pub(crate) fn outpoints(&self) -> Vec<&BitcoinOutPoint> {
|
||||
|
@ -837,7 +834,7 @@ impl PackageTemplate {
|
|||
soonest_conf_deadline,
|
||||
aggregable,
|
||||
feerate_previous: 0,
|
||||
height_timer: None,
|
||||
height_timer: height_original,
|
||||
height_original,
|
||||
}
|
||||
}
|
||||
|
@ -854,7 +851,7 @@ impl Writeable for PackageTemplate {
|
|||
(0, self.soonest_conf_deadline, required),
|
||||
(2, self.feerate_previous, required),
|
||||
(4, self.height_original, required),
|
||||
(6, self.height_timer, option)
|
||||
(6, self.height_timer, required)
|
||||
});
|
||||
Ok(())
|
||||
}
|
||||
|
@ -893,13 +890,16 @@ impl Readable for PackageTemplate {
|
|||
(4, height_original, required),
|
||||
(6, height_timer, option),
|
||||
});
|
||||
if height_timer.is_none() {
|
||||
height_timer = Some(height_original);
|
||||
}
|
||||
Ok(PackageTemplate {
|
||||
inputs,
|
||||
malleability,
|
||||
soonest_conf_deadline,
|
||||
aggregable,
|
||||
feerate_previous,
|
||||
height_timer,
|
||||
height_timer: height_timer.unwrap(),
|
||||
height_original,
|
||||
})
|
||||
}
|
||||
|
@ -1177,12 +1177,9 @@ mod tests {
|
|||
let revk_outp = dumb_revk_output!(secp_ctx);
|
||||
|
||||
let mut package = PackageTemplate::build_package(txid, 0, revk_outp, 1000, true, 100);
|
||||
let timer_none = package.timer();
|
||||
assert!(timer_none.is_none());
|
||||
package.set_timer(Some(100));
|
||||
if let Some(timer_some) = package.timer() {
|
||||
assert_eq!(timer_some, 100);
|
||||
} else { panic!() }
|
||||
assert_eq!(package.timer(), 100);
|
||||
package.set_timer(101);
|
||||
assert_eq!(package.timer(), 101);
|
||||
}
|
||||
|
||||
#[test]
|
||||
|
|
|
@ -137,6 +137,20 @@ pub enum ConnectStyle {
|
|||
}
|
||||
|
||||
impl ConnectStyle {
|
||||
pub fn skips_blocks(&self) -> bool {
|
||||
match self {
|
||||
ConnectStyle::BestBlockFirst => false,
|
||||
ConnectStyle::BestBlockFirstSkippingBlocks => true,
|
||||
ConnectStyle::BestBlockFirstReorgsOnlyTip => true,
|
||||
ConnectStyle::TransactionsFirst => false,
|
||||
ConnectStyle::TransactionsFirstSkippingBlocks => true,
|
||||
ConnectStyle::TransactionsDuplicativelyFirstSkippingBlocks => true,
|
||||
ConnectStyle::HighlyRedundantTransactionsFirstSkippingBlocks => true,
|
||||
ConnectStyle::TransactionsFirstReorgsOnlyTip => true,
|
||||
ConnectStyle::FullBlockViaListen => false,
|
||||
}
|
||||
}
|
||||
|
||||
fn random_style() -> ConnectStyle {
|
||||
#[cfg(feature = "std")] {
|
||||
use core::hash::{BuildHasher, Hasher};
|
||||
|
@ -164,12 +178,7 @@ impl ConnectStyle {
|
|||
}
|
||||
|
||||
pub fn connect_blocks<'a, 'b, 'c, 'd>(node: &'a Node<'b, 'c, 'd>, depth: u32) -> BlockHash {
|
||||
let skip_intermediaries = match *node.connect_style.borrow() {
|
||||
ConnectStyle::BestBlockFirstSkippingBlocks|ConnectStyle::TransactionsFirstSkippingBlocks|
|
||||
ConnectStyle::TransactionsDuplicativelyFirstSkippingBlocks|ConnectStyle::HighlyRedundantTransactionsFirstSkippingBlocks|
|
||||
ConnectStyle::BestBlockFirstReorgsOnlyTip|ConnectStyle::TransactionsFirstReorgsOnlyTip => true,
|
||||
_ => false,
|
||||
};
|
||||
let skip_intermediaries = node.connect_style.borrow().skips_blocks();
|
||||
|
||||
let height = node.best_block_info().1 + 1;
|
||||
let mut block = Block {
|
||||
|
@ -2535,6 +2544,8 @@ pub enum HTLCType { NONE, TIMEOUT, SUCCESS }
|
|||
/// also fail.
|
||||
pub fn test_txn_broadcast<'a, 'b, 'c>(node: &Node<'a, 'b, 'c>, chan: &(msgs::ChannelUpdate, msgs::ChannelUpdate, [u8; 32], Transaction), commitment_tx: Option<Transaction>, has_htlc_tx: HTLCType) -> Vec<Transaction> {
|
||||
let mut node_txn = node.tx_broadcaster.txn_broadcasted.lock().unwrap();
|
||||
let mut txn_seen = HashSet::new();
|
||||
node_txn.retain(|tx| txn_seen.insert(tx.txid()));
|
||||
assert!(node_txn.len() >= if commitment_tx.is_some() { 0 } else { 1 } + if has_htlc_tx == HTLCType::NONE { 0 } else { 1 });
|
||||
|
||||
let mut res = Vec::with_capacity(2);
|
||||
|
@ -2598,15 +2609,15 @@ pub fn test_revoked_htlc_claim_txn_broadcast<'a, 'b, 'c>(node: &Node<'a, 'b, 'c>
|
|||
|
||||
pub fn check_preimage_claim<'a, 'b, 'c>(node: &Node<'a, 'b, 'c>, prev_txn: &Vec<Transaction>) -> Vec<Transaction> {
|
||||
let mut node_txn = node.tx_broadcaster.txn_broadcasted.lock().unwrap();
|
||||
let mut txn_seen = HashSet::new();
|
||||
node_txn.retain(|tx| txn_seen.insert(tx.txid()));
|
||||
|
||||
assert!(node_txn.len() >= 1);
|
||||
assert_eq!(node_txn[0].input.len(), 1);
|
||||
let mut found_prev = false;
|
||||
|
||||
for tx in prev_txn {
|
||||
if node_txn[0].input[0].previous_output.txid == tx.txid() {
|
||||
check_spends!(node_txn[0], tx);
|
||||
let mut iter = node_txn[0].input[0].witness.iter();
|
||||
for prev_tx in prev_txn {
|
||||
for tx in &*node_txn {
|
||||
if tx.input[0].previous_output.txid == prev_tx.txid() {
|
||||
check_spends!(tx, prev_tx);
|
||||
let mut iter = tx.input[0].witness.iter();
|
||||
iter.next().expect("expected 3 witness items");
|
||||
iter.next().expect("expected 3 witness items");
|
||||
assert!(iter.next().expect("expected 3 witness items").len() > 106); // must spend an htlc output
|
||||
|
@ -2616,6 +2627,7 @@ pub fn check_preimage_claim<'a, 'b, 'c>(node: &Node<'a, 'b, 'c>, prev_txn: &Vec<
|
|||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
assert!(found_prev);
|
||||
|
||||
let mut res = Vec::new();
|
||||
|
|
|
@ -2390,8 +2390,8 @@ fn channel_monitor_network_test() {
|
|||
}
|
||||
|
||||
#[test]
|
||||
fn test_justice_tx() {
|
||||
// Test justice txn built on revoked HTLC-Success tx, against both sides
|
||||
fn test_justice_tx_htlc_timeout() {
|
||||
// Test justice txn built on revoked HTLC-Timeout tx, against both sides
|
||||
let mut alice_config = UserConfig::default();
|
||||
alice_config.channel_handshake_config.announced_channel = true;
|
||||
alice_config.channel_handshake_limits.force_announced_channel_preference = false;
|
||||
|
@ -2407,7 +2407,6 @@ fn test_justice_tx() {
|
|||
let node_cfgs = create_node_cfgs(2, &chanmon_cfgs);
|
||||
let node_chanmgrs = create_node_chanmgrs(2, &node_cfgs, &user_cfgs);
|
||||
let mut nodes = create_network(2, &node_cfgs, &node_chanmgrs);
|
||||
*nodes[0].connect_style.borrow_mut() = ConnectStyle::FullBlockViaListen;
|
||||
// Create some new channels:
|
||||
let chan_5 = create_announced_chan_between_nodes(&nodes, 0, 1);
|
||||
|
||||
|
@ -2431,7 +2430,6 @@ fn test_justice_tx() {
|
|||
let mut node_txn = nodes[1].tx_broadcaster.txn_broadcasted.lock().unwrap();
|
||||
assert_eq!(node_txn.len(), 1); // ChannelMonitor: penalty tx
|
||||
assert_eq!(node_txn[0].input.len(), 2); // We should claim the revoked output and the HTLC output
|
||||
|
||||
check_spends!(node_txn[0], revoked_local_txn[0]);
|
||||
node_txn.swap_remove(0);
|
||||
}
|
||||
|
@ -2450,17 +2448,30 @@ fn test_justice_tx() {
|
|||
test_revoked_htlc_claim_txn_broadcast(&nodes[1], node_txn[1].clone(), revoked_local_txn[0].clone());
|
||||
}
|
||||
get_announce_close_broadcast_events(&nodes, 0, 1);
|
||||
|
||||
assert_eq!(nodes[0].node.list_channels().len(), 0);
|
||||
assert_eq!(nodes[1].node.list_channels().len(), 0);
|
||||
}
|
||||
|
||||
// We test justice_tx build by A on B's revoked HTLC-Success tx
|
||||
#[test]
|
||||
fn test_justice_tx_htlc_success() {
|
||||
// Test justice txn built on revoked HTLC-Success tx, against both sides
|
||||
let mut alice_config = UserConfig::default();
|
||||
alice_config.channel_handshake_config.announced_channel = true;
|
||||
alice_config.channel_handshake_limits.force_announced_channel_preference = false;
|
||||
alice_config.channel_handshake_config.our_to_self_delay = 6 * 24 * 5;
|
||||
let mut bob_config = UserConfig::default();
|
||||
bob_config.channel_handshake_config.announced_channel = true;
|
||||
bob_config.channel_handshake_limits.force_announced_channel_preference = false;
|
||||
bob_config.channel_handshake_config.our_to_self_delay = 6 * 24 * 3;
|
||||
let user_cfgs = [Some(alice_config), Some(bob_config)];
|
||||
let mut chanmon_cfgs = create_chanmon_cfgs(2);
|
||||
chanmon_cfgs[0].keys_manager.disable_revocation_policy_check = true;
|
||||
chanmon_cfgs[1].keys_manager.disable_revocation_policy_check = true;
|
||||
let node_cfgs = create_node_cfgs(2, &chanmon_cfgs);
|
||||
let node_chanmgrs = create_node_chanmgrs(2, &node_cfgs, &user_cfgs);
|
||||
let mut nodes = create_network(2, &node_cfgs, &node_chanmgrs);
|
||||
// Create some new channels:
|
||||
let chan_6 = create_announced_chan_between_nodes(&nodes, 0, 1);
|
||||
{
|
||||
let mut node_txn = nodes[1].tx_broadcaster.txn_broadcasted.lock().unwrap();
|
||||
node_txn.clear();
|
||||
}
|
||||
|
||||
// A pending HTLC which will be revoked:
|
||||
let payment_preimage_4 = route_payment(&nodes[0], &vec!(&nodes[1])[..], 3000000).0;
|
||||
|
@ -2638,8 +2649,7 @@ fn claim_htlc_outputs_single_tx() {
|
|||
connect_blocks(&nodes[1], ANTI_REORG_DELAY - 1);
|
||||
assert!(nodes[1].node.get_and_clear_pending_events().is_empty());
|
||||
|
||||
let node_txn = nodes[1].tx_broadcaster.txn_broadcasted.lock().unwrap().split_off(0);
|
||||
assert_eq!(node_txn.len(), 7);
|
||||
let mut node_txn = nodes[1].tx_broadcaster.txn_broadcast();
|
||||
|
||||
// Check the pair local commitment and HTLC-timeout broadcast due to HTLC expiration
|
||||
assert_eq!(node_txn[0].input.len(), 1);
|
||||
|
@ -2649,19 +2659,22 @@ fn claim_htlc_outputs_single_tx() {
|
|||
assert_eq!(witness_script.len(), OFFERED_HTLC_SCRIPT_WEIGHT); //Spending an offered htlc output
|
||||
check_spends!(node_txn[1], node_txn[0]);
|
||||
|
||||
// Justice transactions are indices 2-3-4
|
||||
assert_eq!(node_txn[2].input.len(), 1);
|
||||
assert_eq!(node_txn[3].input.len(), 1);
|
||||
assert_eq!(node_txn[4].input.len(), 1);
|
||||
// Filter out any non justice transactions.
|
||||
node_txn.retain(|tx| tx.input[0].previous_output.txid == revoked_local_txn[0].txid());
|
||||
assert!(node_txn.len() > 3);
|
||||
|
||||
assert_eq!(node_txn[0].input.len(), 1);
|
||||
assert_eq!(node_txn[1].input.len(), 1);
|
||||
assert_eq!(node_txn[2].input.len(), 1);
|
||||
|
||||
check_spends!(node_txn[0], revoked_local_txn[0]);
|
||||
check_spends!(node_txn[1], revoked_local_txn[0]);
|
||||
check_spends!(node_txn[2], revoked_local_txn[0]);
|
||||
check_spends!(node_txn[3], revoked_local_txn[0]);
|
||||
check_spends!(node_txn[4], revoked_local_txn[0]);
|
||||
|
||||
let mut witness_lens = BTreeSet::new();
|
||||
witness_lens.insert(node_txn[0].input[0].witness.last().unwrap().len());
|
||||
witness_lens.insert(node_txn[1].input[0].witness.last().unwrap().len());
|
||||
witness_lens.insert(node_txn[2].input[0].witness.last().unwrap().len());
|
||||
witness_lens.insert(node_txn[3].input[0].witness.last().unwrap().len());
|
||||
witness_lens.insert(node_txn[4].input[0].witness.last().unwrap().len());
|
||||
assert_eq!(witness_lens.len(), 3);
|
||||
assert_eq!(*witness_lens.iter().skip(0).next().unwrap(), 77); // revoked to_local
|
||||
assert_eq!(*witness_lens.iter().skip(1).next().unwrap(), OFFERED_HTLC_SCRIPT_WEIGHT); // revoked offered HTLC
|
||||
|
@ -2669,9 +2682,9 @@ fn claim_htlc_outputs_single_tx() {
|
|||
|
||||
// Finally, mine the penalty transactions and check that we get an HTLC failure after
|
||||
// ANTI_REORG_DELAY confirmations.
|
||||
mine_transaction(&nodes[1], &node_txn[0]);
|
||||
mine_transaction(&nodes[1], &node_txn[1]);
|
||||
mine_transaction(&nodes[1], &node_txn[2]);
|
||||
mine_transaction(&nodes[1], &node_txn[3]);
|
||||
mine_transaction(&nodes[1], &node_txn[4]);
|
||||
connect_blocks(&nodes[1], ANTI_REORG_DELAY - 1);
|
||||
expect_payment_failed!(nodes[1], payment_hash_2, false);
|
||||
}
|
||||
|
@ -2970,25 +2983,20 @@ fn do_test_htlc_on_chain_timeout(connect_style: ConnectStyle) {
|
|||
|
||||
// Broadcast timeout transaction by B on received output from C's commitment tx on B's chain
|
||||
// Verify that B's ChannelManager is able to detect that HTLC is timeout by its own tx and react backward in consequence
|
||||
connect_blocks(&nodes[1], 200 - nodes[2].best_block_info().1);
|
||||
mine_transaction(&nodes[1], &commitment_tx[0]);
|
||||
check_closed_event!(nodes[1], 1, ClosureReason::CommitmentTxConfirmed);
|
||||
let timeout_tx;
|
||||
{
|
||||
let mut node_txn = nodes[1].tx_broadcaster.txn_broadcasted.lock().unwrap();
|
||||
assert_eq!(node_txn.len(), 3); // 2 (local commitment tx + HTLC-timeout), 1 timeout tx
|
||||
|
||||
check_spends!(node_txn[2], commitment_tx[0]);
|
||||
assert_eq!(node_txn[2].clone().input[0].witness.last().unwrap().len(), ACCEPTED_HTLC_SCRIPT_WEIGHT);
|
||||
|
||||
check_spends!(node_txn[0], chan_2.3);
|
||||
check_spends!(node_txn[1], node_txn[0]);
|
||||
assert_eq!(node_txn[0].clone().input[0].witness.last().unwrap().len(), 71);
|
||||
assert_eq!(node_txn[1].clone().input[0].witness.last().unwrap().len(), OFFERED_HTLC_SCRIPT_WEIGHT);
|
||||
|
||||
timeout_tx = node_txn[2].clone();
|
||||
node_txn.clear();
|
||||
check_closed_event(&nodes[1], 1, ClosureReason::CommitmentTxConfirmed, false);
|
||||
connect_blocks(&nodes[1], 200 - nodes[2].best_block_info().1);
|
||||
let timeout_tx = {
|
||||
let mut txn = nodes[1].tx_broadcaster.txn_broadcast();
|
||||
if nodes[1].connect_style.borrow().skips_blocks() {
|
||||
assert_eq!(txn.len(), 1);
|
||||
} else {
|
||||
assert_eq!(txn.len(), 2); // Extra rebroadcast of timeout transaction
|
||||
}
|
||||
check_spends!(txn[0], commitment_tx[0]);
|
||||
assert_eq!(txn[0].clone().input[0].witness.last().unwrap().len(), ACCEPTED_HTLC_SCRIPT_WEIGHT);
|
||||
txn.remove(0)
|
||||
};
|
||||
|
||||
mine_transaction(&nodes[1], &timeout_tx);
|
||||
check_added_monitors!(nodes[1], 1);
|
||||
|
@ -7312,17 +7320,21 @@ fn test_bump_penalty_txn_on_revoked_htlcs() {
|
|||
check_closed_event!(nodes[1], 1, ClosureReason::CommitmentTxConfirmed);
|
||||
connect_blocks(&nodes[1], 49); // Confirm blocks until the HTLC expires (note CLTV was explicitly 50 above)
|
||||
|
||||
let revoked_htlc_txn = nodes[1].tx_broadcaster.txn_broadcasted.lock().unwrap().split_off(0);
|
||||
assert_eq!(revoked_htlc_txn.len(), 2);
|
||||
let revoked_htlc_txn = {
|
||||
let txn = nodes[1].tx_broadcaster.unique_txn_broadcast();
|
||||
assert_eq!(txn.len(), 2);
|
||||
|
||||
assert_eq!(revoked_htlc_txn[0].input[0].witness.last().unwrap().len(), ACCEPTED_HTLC_SCRIPT_WEIGHT);
|
||||
assert_eq!(revoked_htlc_txn[0].input.len(), 1);
|
||||
check_spends!(revoked_htlc_txn[0], revoked_local_txn[0]);
|
||||
assert_eq!(txn[0].input[0].witness.last().unwrap().len(), ACCEPTED_HTLC_SCRIPT_WEIGHT);
|
||||
assert_eq!(txn[0].input.len(), 1);
|
||||
check_spends!(txn[0], revoked_local_txn[0]);
|
||||
|
||||
assert_eq!(revoked_htlc_txn[1].input.len(), 1);
|
||||
assert_eq!(revoked_htlc_txn[1].input[0].witness.last().unwrap().len(), OFFERED_HTLC_SCRIPT_WEIGHT);
|
||||
assert_eq!(revoked_htlc_txn[1].output.len(), 1);
|
||||
check_spends!(revoked_htlc_txn[1], revoked_local_txn[0]);
|
||||
assert_eq!(txn[1].input.len(), 1);
|
||||
assert_eq!(txn[1].input[0].witness.last().unwrap().len(), OFFERED_HTLC_SCRIPT_WEIGHT);
|
||||
assert_eq!(txn[1].output.len(), 1);
|
||||
check_spends!(txn[1], revoked_local_txn[0]);
|
||||
|
||||
txn
|
||||
};
|
||||
|
||||
// Broadcast set of revoked txn on A
|
||||
let hash_128 = connect_blocks(&nodes[0], 40);
|
||||
|
@ -8494,11 +8506,11 @@ fn test_concurrent_monitor_claim() {
|
|||
watchtower_alice.chain_monitor.block_connected(&block, CHAN_CONFIRM_DEPTH + 1 + TEST_FINAL_CLTV + LATENCY_GRACE_PERIOD_BLOCKS);
|
||||
|
||||
// Watchtower Alice should have broadcast a commitment/HTLC-timeout
|
||||
{
|
||||
let mut txn = chanmon_cfgs[0].tx_broadcaster.txn_broadcasted.lock().unwrap();
|
||||
let alice_state = {
|
||||
let mut txn = chanmon_cfgs[0].tx_broadcaster.txn_broadcast();
|
||||
assert_eq!(txn.len(), 2);
|
||||
txn.clear();
|
||||
}
|
||||
txn.remove(0)
|
||||
};
|
||||
|
||||
// Copy ChainMonitor to simulate watchtower Bob and make it receive a commitment update first.
|
||||
let chain_source = test_utils::TestChainSource::new(Network::Testnet);
|
||||
|
@ -8549,19 +8561,21 @@ fn test_concurrent_monitor_claim() {
|
|||
// Watchtower Bob should have broadcast a commitment/HTLC-timeout
|
||||
let bob_state_y;
|
||||
{
|
||||
let mut txn = chanmon_cfgs[0].tx_broadcaster.txn_broadcasted.lock().unwrap();
|
||||
let mut txn = chanmon_cfgs[0].tx_broadcaster.txn_broadcast();
|
||||
assert_eq!(txn.len(), 2);
|
||||
bob_state_y = txn[0].clone();
|
||||
txn.clear();
|
||||
bob_state_y = txn.remove(0);
|
||||
};
|
||||
|
||||
// We confirm Bob's state Y on Alice, she should broadcast a HTLC-timeout
|
||||
let header = BlockHeader { version: 0x20000000, prev_blockhash: BlockHash::all_zeros(), merkle_root: TxMerkleNode::all_zeros(), time: 42, bits: 42, nonce: 42 };
|
||||
watchtower_alice.chain_monitor.block_connected(&Block { header, txdata: vec![bob_state_y.clone()] }, CHAN_CONFIRM_DEPTH + 2 + TEST_FINAL_CLTV + LATENCY_GRACE_PERIOD_BLOCKS);
|
||||
{
|
||||
let htlc_txn = chanmon_cfgs[0].tx_broadcaster.txn_broadcasted.lock().unwrap();
|
||||
assert_eq!(htlc_txn.len(), 1);
|
||||
let htlc_txn = chanmon_cfgs[0].tx_broadcaster.txn_broadcast();
|
||||
assert_eq!(htlc_txn.len(), 2);
|
||||
check_spends!(htlc_txn[0], bob_state_y);
|
||||
// Alice doesn't clean up the old HTLC claim since it hasn't seen a conflicting spend for
|
||||
// it. However, she should, because it now has an invalid parent.
|
||||
check_spends!(htlc_txn[1], alice_state);
|
||||
}
|
||||
}
|
||||
|
||||
|
|
File diff suppressed because one or more lines are too long
|
@ -406,9 +406,11 @@ fn do_retry_with_no_persist(confirm_before_reload: bool) {
|
|||
mine_transaction(&nodes[0], &bs_htlc_claim_txn[0]);
|
||||
expect_payment_sent!(nodes[0], payment_preimage_1);
|
||||
connect_blocks(&nodes[0], TEST_FINAL_CLTV*4 + 20);
|
||||
let as_htlc_timeout_txn = nodes[0].tx_broadcaster.txn_broadcasted.lock().unwrap().split_off(0);
|
||||
assert_eq!(as_htlc_timeout_txn.len(), 2);
|
||||
let (first_htlc_timeout_tx, second_htlc_timeout_tx) = (&as_htlc_timeout_txn[0], &as_htlc_timeout_txn[1]);
|
||||
let (first_htlc_timeout_tx, second_htlc_timeout_tx) = {
|
||||
let mut txn = nodes[0].tx_broadcaster.unique_txn_broadcast();
|
||||
assert_eq!(txn.len(), 2);
|
||||
(txn.remove(0), txn.remove(0))
|
||||
};
|
||||
check_spends!(first_htlc_timeout_tx, as_commitment_tx);
|
||||
check_spends!(second_htlc_timeout_tx, as_commitment_tx);
|
||||
if first_htlc_timeout_tx.input[0].previous_output == bs_htlc_claim_txn[0].input[0].previous_output {
|
||||
|
|
|
@ -9,7 +9,7 @@
|
|||
|
||||
//! Further functional tests which test blockchain reorganizations.
|
||||
|
||||
use crate::chain::channelmonitor::ANTI_REORG_DELAY;
|
||||
use crate::chain::channelmonitor::{ANTI_REORG_DELAY, LATENCY_GRACE_PERIOD_BLOCKS};
|
||||
use crate::chain::transaction::OutPoint;
|
||||
use crate::chain::Confirm;
|
||||
use crate::events::{Event, MessageSendEventsProvider, ClosureReason, HTLCDestination};
|
||||
|
@ -467,19 +467,21 @@ fn test_set_outpoints_partial_claiming() {
|
|||
}
|
||||
|
||||
// Connect blocks on node B
|
||||
connect_blocks(&nodes[1], 135);
|
||||
connect_blocks(&nodes[1], TEST_FINAL_CLTV + LATENCY_GRACE_PERIOD_BLOCKS + 1);
|
||||
check_closed_broadcast!(nodes[1], true);
|
||||
check_closed_event!(nodes[1], 1, ClosureReason::CommitmentTxConfirmed);
|
||||
check_added_monitors!(nodes[1], 1);
|
||||
// Verify node B broadcast 2 HTLC-timeout txn
|
||||
let partial_claim_tx = {
|
||||
let node_txn = nodes[1].tx_broadcaster.txn_broadcasted.lock().unwrap();
|
||||
let mut node_txn = nodes[1].tx_broadcaster.unique_txn_broadcast();
|
||||
assert_eq!(node_txn.len(), 3);
|
||||
check_spends!(node_txn[0], chan.3);
|
||||
check_spends!(node_txn[1], node_txn[0]);
|
||||
check_spends!(node_txn[2], node_txn[0]);
|
||||
assert_eq!(node_txn[1].input.len(), 1);
|
||||
assert_eq!(node_txn[2].input.len(), 1);
|
||||
node_txn[1].clone()
|
||||
assert_ne!(node_txn[1].input[0].previous_output, node_txn[2].input[0].previous_output);
|
||||
node_txn.remove(1)
|
||||
};
|
||||
|
||||
// Broadcast partial claim on node A, should regenerate a claiming tx with HTLC dropped
|
||||
|
|
|
@ -311,6 +311,17 @@ impl TestBroadcaster {
|
|||
pub fn new(blocks: Arc<Mutex<Vec<(Block, u32)>>>) -> TestBroadcaster {
|
||||
TestBroadcaster { txn_broadcasted: Mutex::new(Vec::new()), blocks }
|
||||
}
|
||||
|
||||
pub fn txn_broadcast(&self) -> Vec<Transaction> {
|
||||
self.txn_broadcasted.lock().unwrap().split_off(0)
|
||||
}
|
||||
|
||||
pub fn unique_txn_broadcast(&self) -> Vec<Transaction> {
|
||||
let mut txn = self.txn_broadcasted.lock().unwrap().split_off(0);
|
||||
let mut seen = HashSet::new();
|
||||
txn.retain(|tx| seen.insert(tx.txid()));
|
||||
txn
|
||||
}
|
||||
}
|
||||
|
||||
impl chaininterface::BroadcasterInterface for TestBroadcaster {
|
||||
|
|
Loading…
Add table
Reference in a new issue