mirror of
https://github.com/ElementsProject/elements.git
synced 2026-08-17 13:07:54 +02:00
Merge f7144b24be into merged_master (Bitcoin PR bitcoin/bitcoin#31279)
This commit is contained in:
commit
e293bb0f64
16 changed files with 213 additions and 155 deletions
|
|
@ -90,19 +90,22 @@ static inline CTransactionRef make_tx(const std::vector<COutPoint>& inputs, int3
|
|||
return MakeTransactionRef(mtx);
|
||||
}
|
||||
|
||||
static constexpr auto NUM_EPHEMERAL_TX_OUTPUTS = 3;
|
||||
static constexpr auto EPHEMERAL_DUST_INDEX = NUM_EPHEMERAL_TX_OUTPUTS - 1;
|
||||
|
||||
// Same as make_tx but adds 2 normal outputs and 0-value dust to end of vout
|
||||
static inline CTransactionRef make_ephemeral_tx(const std::vector<COutPoint>& inputs, int32_t version)
|
||||
{
|
||||
CMutableTransaction mtx = CMutableTransaction{};
|
||||
mtx.version = version;
|
||||
mtx.vin.resize(inputs.size());
|
||||
mtx.vout.resize(3);
|
||||
for (size_t i{0}; i < inputs.size(); ++i) {
|
||||
mtx.vin[i].prevout = inputs[i];
|
||||
}
|
||||
for (auto i{0}; i < 3; ++i) {
|
||||
mtx.vout.resize(NUM_EPHEMERAL_TX_OUTPUTS);
|
||||
for (auto i{0}; i < NUM_EPHEMERAL_TX_OUTPUTS; ++i) {
|
||||
mtx.vout[i].scriptPubKey = CScript() << OP_TRUE;
|
||||
mtx.vout[i].nValue = (i == 2) ? 0 : 10000;
|
||||
mtx.vout[i].nValue = (i == EPHEMERAL_DUST_INDEX) ? 0 : 10000;
|
||||
}
|
||||
return MakeTransactionRef(mtx);
|
||||
}
|
||||
|
|
@ -114,99 +117,159 @@ BOOST_FIXTURE_TEST_CASE(ephemeral_tests, RegTestingSetup)
|
|||
TestMemPoolEntryHelper entry;
|
||||
CTxMemPool::setEntries empty_ancestors;
|
||||
|
||||
CFeeRate minrelay(1000);
|
||||
TxValidationState child_state;
|
||||
Txid child_txid;
|
||||
|
||||
// Arbitrary non-0 feerate for these tests
|
||||
CFeeRate dustrelay(DUST_RELAY_TX_FEE);
|
||||
|
||||
// Basic transaction with dust
|
||||
auto grandparent_tx_1 = make_ephemeral_tx(random_outpoints(1), /*version=*/2);
|
||||
const auto dust_txid = grandparent_tx_1->GetHash();
|
||||
|
||||
uint32_t dust_index = 2;
|
||||
|
||||
// Child transaction spending dust
|
||||
auto dust_spend = make_tx({COutPoint{dust_txid, dust_index}}, /*version=*/2);
|
||||
auto dust_spend = make_tx({COutPoint{dust_txid, EPHEMERAL_DUST_INDEX}}, /*version=*/2);
|
||||
|
||||
// We first start with nothing "in the mempool", using package checks
|
||||
|
||||
// Trivial single transaction with no dust
|
||||
BOOST_CHECK(!CheckEphemeralSpends({dust_spend}, minrelay, pool).has_value());
|
||||
BOOST_CHECK(CheckEphemeralSpends({dust_spend}, dustrelay, pool, child_state, child_txid));
|
||||
BOOST_CHECK(child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, Txid());
|
||||
|
||||
// Now with dust, ok because the tx has no dusty parents
|
||||
BOOST_CHECK(!CheckEphemeralSpends({grandparent_tx_1}, minrelay, pool).has_value());
|
||||
BOOST_CHECK(CheckEphemeralSpends({grandparent_tx_1}, dustrelay, pool, child_state, child_txid));
|
||||
BOOST_CHECK(child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, Txid());
|
||||
|
||||
// Dust checks pass
|
||||
BOOST_CHECK(!CheckEphemeralSpends({grandparent_tx_1, dust_spend}, CFeeRate(0), pool).has_value());
|
||||
BOOST_CHECK(!CheckEphemeralSpends({grandparent_tx_1, dust_spend}, minrelay, pool).has_value());
|
||||
BOOST_CHECK(CheckEphemeralSpends({grandparent_tx_1, dust_spend}, CFeeRate(0), pool, child_state, child_txid));
|
||||
BOOST_CHECK(child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, Txid());
|
||||
BOOST_CHECK(CheckEphemeralSpends({grandparent_tx_1, dust_spend}, dustrelay, pool, child_state, child_txid));
|
||||
BOOST_CHECK(child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, Txid());
|
||||
|
||||
auto dust_non_spend = make_tx({COutPoint{dust_txid, dust_index - 1}}, /*version=*/2);
|
||||
auto dust_non_spend = make_tx({COutPoint{dust_txid, EPHEMERAL_DUST_INDEX - 1}}, /*version=*/2);
|
||||
|
||||
// Child spending non-dust only from parent should be disallowed even if dust otherwise spent
|
||||
BOOST_CHECK(CheckEphemeralSpends({grandparent_tx_1, dust_non_spend, dust_spend}, minrelay, pool).has_value());
|
||||
BOOST_CHECK(CheckEphemeralSpends({grandparent_tx_1, dust_spend, dust_non_spend}, minrelay, pool).has_value());
|
||||
BOOST_CHECK(CheckEphemeralSpends({grandparent_tx_1, dust_non_spend}, minrelay, pool).has_value());
|
||||
const auto dust_non_spend_txid{dust_non_spend->GetHash()};
|
||||
BOOST_CHECK(!CheckEphemeralSpends({grandparent_tx_1, dust_non_spend, dust_spend}, dustrelay, pool, child_state, child_txid));
|
||||
BOOST_CHECK(!child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, dust_non_spend_txid);
|
||||
child_state = TxValidationState();
|
||||
child_txid = Txid();
|
||||
|
||||
BOOST_CHECK(!CheckEphemeralSpends({grandparent_tx_1, dust_spend, dust_non_spend}, dustrelay, pool, child_state, child_txid));
|
||||
BOOST_CHECK(!child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, dust_non_spend_txid);
|
||||
child_state = TxValidationState();
|
||||
child_txid = Txid();
|
||||
|
||||
BOOST_CHECK(!CheckEphemeralSpends({grandparent_tx_1, dust_non_spend}, dustrelay, pool, child_state, child_txid));
|
||||
BOOST_CHECK(!child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, dust_non_spend_txid);
|
||||
child_state = TxValidationState();
|
||||
child_txid = Txid();
|
||||
|
||||
auto grandparent_tx_2 = make_ephemeral_tx(random_outpoints(1), /*version=*/2);
|
||||
const auto dust_txid_2 = grandparent_tx_2->GetHash();
|
||||
|
||||
// Spend dust from one but not another is ok, as long as second grandparent has no child
|
||||
BOOST_CHECK(!CheckEphemeralSpends({grandparent_tx_1, grandparent_tx_2, dust_spend}, minrelay, pool).has_value());
|
||||
BOOST_CHECK(CheckEphemeralSpends({grandparent_tx_1, grandparent_tx_2, dust_spend}, dustrelay, pool, child_state, child_txid));
|
||||
BOOST_CHECK(child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, Txid());
|
||||
|
||||
auto dust_non_spend_both_parents = make_tx({COutPoint{dust_txid, dust_index}, COutPoint{dust_txid_2, dust_index - 1}}, /*version=*/2);
|
||||
auto dust_non_spend_both_parents = make_tx({COutPoint{dust_txid, EPHEMERAL_DUST_INDEX}, COutPoint{dust_txid_2, EPHEMERAL_DUST_INDEX - 1}}, /*version=*/2);
|
||||
// But if we spend from the parent, it must spend dust
|
||||
BOOST_CHECK(CheckEphemeralSpends({grandparent_tx_1, grandparent_tx_2, dust_non_spend_both_parents}, minrelay, pool).has_value());
|
||||
BOOST_CHECK(!CheckEphemeralSpends({grandparent_tx_1, grandparent_tx_2, dust_non_spend_both_parents}, dustrelay, pool, child_state, child_txid));
|
||||
BOOST_CHECK(!child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, dust_non_spend_both_parents->GetHash());
|
||||
child_state = TxValidationState();
|
||||
child_txid = Txid();
|
||||
|
||||
auto dust_spend_both_parents = make_tx({COutPoint{dust_txid, dust_index}, COutPoint{dust_txid_2, dust_index}}, /*version=*/2);
|
||||
BOOST_CHECK(!CheckEphemeralSpends({grandparent_tx_1, grandparent_tx_2, dust_spend_both_parents}, minrelay, pool).has_value());
|
||||
auto dust_spend_both_parents = make_tx({COutPoint{dust_txid, EPHEMERAL_DUST_INDEX}, COutPoint{dust_txid_2, EPHEMERAL_DUST_INDEX}}, /*version=*/2);
|
||||
BOOST_CHECK(CheckEphemeralSpends({grandparent_tx_1, grandparent_tx_2, dust_spend_both_parents}, dustrelay, pool, child_state, child_txid));
|
||||
BOOST_CHECK(child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, Txid());
|
||||
|
||||
// Spending other outputs is also correct, as long as the dusty one is spent
|
||||
const std::vector<COutPoint> all_outpoints{COutPoint(dust_txid, 0), COutPoint(dust_txid, 1), COutPoint(dust_txid, 2),
|
||||
COutPoint(dust_txid_2, 0), COutPoint(dust_txid_2, 1), COutPoint(dust_txid_2, 2)};
|
||||
auto dust_spend_all_outpoints = make_tx(all_outpoints, /*version=*/2);
|
||||
BOOST_CHECK(!CheckEphemeralSpends({grandparent_tx_1, grandparent_tx_2, dust_spend_all_outpoints}, minrelay, pool).has_value());
|
||||
BOOST_CHECK(CheckEphemeralSpends({grandparent_tx_1, grandparent_tx_2, dust_spend_all_outpoints}, dustrelay, pool, child_state, child_txid));
|
||||
BOOST_CHECK(child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, Txid());
|
||||
|
||||
// 2 grandparents with dust <- 1 dust-spending parent with dust <- child with no dust
|
||||
auto parent_with_dust = make_ephemeral_tx({COutPoint{dust_txid, dust_index}, COutPoint{dust_txid_2, dust_index}}, /*version=*/2);
|
||||
auto parent_with_dust = make_ephemeral_tx({COutPoint{dust_txid, EPHEMERAL_DUST_INDEX}, COutPoint{dust_txid_2, EPHEMERAL_DUST_INDEX}}, /*version=*/2);
|
||||
// Ok for parent to have dust
|
||||
BOOST_CHECK(!CheckEphemeralSpends({grandparent_tx_1, grandparent_tx_2, parent_with_dust}, minrelay, pool).has_value());
|
||||
auto child_no_dust = make_tx({COutPoint{parent_with_dust->GetHash(), dust_index}}, /*version=*/2);
|
||||
BOOST_CHECK(!CheckEphemeralSpends({grandparent_tx_1, grandparent_tx_2, parent_with_dust, child_no_dust}, minrelay, pool).has_value());
|
||||
BOOST_CHECK(CheckEphemeralSpends({grandparent_tx_1, grandparent_tx_2, parent_with_dust}, dustrelay, pool, child_state, child_txid));
|
||||
BOOST_CHECK(child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, Txid());
|
||||
auto child_no_dust = make_tx({COutPoint{parent_with_dust->GetHash(), EPHEMERAL_DUST_INDEX}}, /*version=*/2);
|
||||
BOOST_CHECK(CheckEphemeralSpends({grandparent_tx_1, grandparent_tx_2, parent_with_dust, child_no_dust}, dustrelay, pool, child_state, child_txid));
|
||||
BOOST_CHECK(child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, Txid());
|
||||
|
||||
// 2 grandparents with dust <- 1 dust-spending parent with dust <- child with dust
|
||||
auto child_with_dust = make_ephemeral_tx({COutPoint{parent_with_dust->GetHash(), dust_index}}, /*version=*/2);
|
||||
BOOST_CHECK(!CheckEphemeralSpends({grandparent_tx_1, grandparent_tx_2, parent_with_dust, child_with_dust}, minrelay, pool).has_value());
|
||||
auto child_with_dust = make_ephemeral_tx({COutPoint{parent_with_dust->GetHash(), EPHEMERAL_DUST_INDEX}}, /*version=*/2);
|
||||
BOOST_CHECK(CheckEphemeralSpends({grandparent_tx_1, grandparent_tx_2, parent_with_dust, child_with_dust}, dustrelay, pool, child_state, child_txid));
|
||||
BOOST_CHECK(child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, Txid());
|
||||
|
||||
// Tests with parents in mempool
|
||||
|
||||
// Nothing in mempool, this should pass for any transaction
|
||||
BOOST_CHECK(!CheckEphemeralSpends({grandparent_tx_1}, minrelay, pool).has_value());
|
||||
BOOST_CHECK(CheckEphemeralSpends({grandparent_tx_1}, dustrelay, pool, child_state, child_txid));
|
||||
BOOST_CHECK(child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, Txid());
|
||||
|
||||
// Add first grandparent to mempool and fetch entry
|
||||
AddToMempool(pool, entry.FromTx(grandparent_tx_1));
|
||||
|
||||
// Ignores ancestors that aren't direct parents
|
||||
BOOST_CHECK(!CheckEphemeralSpends({child_no_dust}, minrelay, pool).has_value());
|
||||
BOOST_CHECK(CheckEphemeralSpends({child_no_dust}, dustrelay, pool, child_state, child_txid));
|
||||
BOOST_CHECK(child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, Txid());
|
||||
|
||||
// Valid spend of dust with grandparent in mempool
|
||||
BOOST_CHECK(!CheckEphemeralSpends({parent_with_dust}, minrelay, pool).has_value());
|
||||
BOOST_CHECK(CheckEphemeralSpends({parent_with_dust}, dustrelay, pool, child_state, child_txid));
|
||||
BOOST_CHECK(child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, Txid());
|
||||
|
||||
// Second grandparent in same package
|
||||
BOOST_CHECK(!CheckEphemeralSpends({parent_with_dust, grandparent_tx_2}, minrelay, pool).has_value());
|
||||
BOOST_CHECK(CheckEphemeralSpends({parent_with_dust, grandparent_tx_2}, dustrelay, pool, child_state, child_txid));
|
||||
BOOST_CHECK(child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, Txid());
|
||||
|
||||
// Order in package doesn't matter
|
||||
BOOST_CHECK(!CheckEphemeralSpends({grandparent_tx_2, parent_with_dust}, minrelay, pool).has_value());
|
||||
BOOST_CHECK(CheckEphemeralSpends({grandparent_tx_2, parent_with_dust}, dustrelay, pool, child_state, child_txid));
|
||||
BOOST_CHECK(child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, Txid());
|
||||
|
||||
// Add second grandparent to mempool
|
||||
AddToMempool(pool, entry.FromTx(grandparent_tx_2));
|
||||
|
||||
// Only spends single dust out of two direct parents
|
||||
BOOST_CHECK(CheckEphemeralSpends({dust_non_spend_both_parents}, minrelay, pool).has_value());
|
||||
BOOST_CHECK(!CheckEphemeralSpends({dust_non_spend_both_parents}, dustrelay, pool, child_state, child_txid));
|
||||
BOOST_CHECK(!child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, dust_non_spend_both_parents->GetHash());
|
||||
child_state = TxValidationState();
|
||||
child_txid = Txid();
|
||||
|
||||
// Spends both parents' dust
|
||||
BOOST_CHECK(!CheckEphemeralSpends({parent_with_dust}, minrelay, pool).has_value());
|
||||
BOOST_CHECK(CheckEphemeralSpends({parent_with_dust}, dustrelay, pool, child_state, child_txid));
|
||||
BOOST_CHECK(child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, Txid());
|
||||
|
||||
// Now add dusty parent to mempool
|
||||
AddToMempool(pool, entry.FromTx(parent_with_dust));
|
||||
|
||||
// Passes dust checks even with non-parent ancestors
|
||||
BOOST_CHECK(!CheckEphemeralSpends({child_no_dust}, minrelay, pool).has_value());
|
||||
BOOST_CHECK(CheckEphemeralSpends({child_no_dust}, dustrelay, pool, child_state, child_txid));
|
||||
BOOST_CHECK(child_state.IsValid());
|
||||
BOOST_CHECK_EQUAL(child_txid, Txid());
|
||||
}
|
||||
|
||||
BOOST_FIXTURE_TEST_CASE(version3_tests, RegTestingSetup)
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue