Branch data Line data Source code
1 : : // Copyright (c) 2011-present The Bitcoin Core developers
2 : : // Distributed under the MIT software license, see the accompanying
3 : : // file COPYING or http://www.opensource.org/licenses/mit-license.php.
4 : :
5 : : #include <addresstype.h>
6 : : #include <coins.h>
7 : : #include <common/system.h>
8 : : #include <consensus/consensus.h>
9 : : #include <consensus/merkle.h>
10 : : #include <consensus/tx_verify.h>
11 : : #include <interfaces/mining.h>
12 : : #include <node/miner.h>
13 : : #include <policy/policy.h>
14 : : #include <test/util/random.h>
15 : : #include <test/util/transaction_utils.h>
16 : : #include <test/util/txmempool.h>
17 : : #include <txmempool.h>
18 : : #include <uint256.h>
19 : : #include <util/check.h>
20 : : #include <util/feefrac.h>
21 : : #include <util/strencodings.h>
22 : : #include <util/time.h>
23 : : #include <util/translation.h>
24 : : #include <validation.h>
25 : : #include <versionbits.h>
26 : : #include <pow.h>
27 : :
28 : : #include <test/util/common.h>
29 : : #include <test/util/setup_common.h>
30 : :
31 : : #include <memory>
32 : : #include <vector>
33 : :
34 : : #include <boost/test/unit_test.hpp>
35 : :
36 : : using namespace util::hex_literals;
37 : : using interfaces::BlockTemplate;
38 : : using interfaces::Mining;
39 : : using node::BlockAssembler;
40 : :
41 : : namespace miner_tests {
42 : 2 : struct MinerTestingSetup : public TestingSetup {
43 : : void TestPackageSelection(const CScript& scriptPubKey, const std::vector<CTransactionRef>& txFirst) EXCLUSIVE_LOCKS_REQUIRED(::cs_main);
44 : : void TestBasicMining(const CScript& scriptPubKey, const std::vector<CTransactionRef>& txFirst, int baseheight) EXCLUSIVE_LOCKS_REQUIRED(::cs_main);
45 : : void TestPrioritisedMining(const CScript& scriptPubKey, const std::vector<CTransactionRef>& txFirst) EXCLUSIVE_LOCKS_REQUIRED(::cs_main);
46 : 8 : bool TestSequenceLocks(const CTransaction& tx, CTxMemPool& tx_mempool) EXCLUSIVE_LOCKS_REQUIRED(::cs_main)
47 : : {
48 : 8 : CCoinsViewMemPool view_mempool{&m_node.chainman->ActiveChainstate().CoinsTip(), tx_mempool};
49 [ + - - + ]: 8 : CBlockIndex* tip{m_node.chainman->ActiveChain().Tip()};
50 [ + - ]: 8 : const std::optional<LockPoints> lock_points{CalculateLockPointsAtTip(tip, view_mempool, tx)};
51 [ + - + - : 16 : return lock_points.has_value() && CheckSequenceLocksAtTip(tip, *lock_points);
+ + ]
52 : 8 : }
53 : 11 : CTxMemPool& MakeMempool()
54 : : {
55 : : // Delete the previous mempool to ensure with valgrind that the old
56 : : // pointer is not accessed, when the new one should be accessed
57 : : // instead.
58 [ + - ]: 11 : m_node.mempool.reset();
59 [ + - ]: 11 : bilingual_str error;
60 [ + - ]: 11 : auto opts = MemPoolOptionsForTest(m_node);
61 : : // The "block size > limit" test creates a cluster of 1192590 vbytes,
62 : : // so set the cluster vbytes limit big enough so that the txgraph
63 : : // doesn't become oversized.
64 : 11 : opts.limits.cluster_size_vbytes = 1'200'000;
65 [ + - ]: 11 : m_node.mempool = std::make_unique<CTxMemPool>(opts, error);
66 [ - + ]: 11 : Assert(error.empty());
67 : 11 : return *m_node.mempool;
68 : 11 : }
69 : 4 : std::unique_ptr<Mining> MakeMining()
70 : : {
71 : 4 : return interfaces::MakeMining(m_node, /*wait_loaded=*/false);
72 : : }
73 : : };
74 : : } // namespace miner_tests
75 : :
76 : : BOOST_FIXTURE_TEST_SUITE(miner_tests, MinerTestingSetup)
77 : :
78 : : static CFeeRate blockMinFeeRate = CFeeRate(DEFAULT_BLOCK_MIN_TX_FEE);
79 : :
80 : : constexpr static struct {
81 : : unsigned int extranonce;
82 : : unsigned int nonce;
83 : : } BLOCKINFO[]{{0, 3552706918}, {500, 37506755}, {1000, 948987788}, {400, 524762339}, {800, 258510074}, {300, 102309278},
84 : : {1300, 54365202}, {600, 1107740426}, {1000, 203094491}, {900, 391178848}, {800, 381177271}, {600, 87188412},
85 : : {0, 66522866}, {800, 874942736}, {1000, 89200838}, {400, 312638088}, {400, 66263693}, {500, 924648304},
86 : : {400, 369913599}, {500, 47630099}, {500, 115045364}, {100, 277026602}, {1100, 809621409}, {700, 155345322},
87 : : {800, 943579953}, {400, 28200730}, {900, 77200495}, {0, 105935488}, {400, 698721821}, {500, 111098863},
88 : : {1300, 445389594}, {500, 621849894}, {1400, 56010046}, {1100, 370669776}, {1200, 380301940}, {1200, 110654905},
89 : : {400, 213771024}, {1500, 120014726}, {1200, 835019014}, {1500, 624817237}, {900, 1404297}, {400, 189414558},
90 : : {400, 293178348}, {1100, 15393789}, {600, 396764180}, {800, 1387046371}, {800, 199368303}, {700, 111496662},
91 : : {100, 129759616}, {200, 536577982}, {500, 125881300}, {500, 101053391}, {1200, 471590548}, {900, 86957729},
92 : : {1200, 179604104}, {600, 68658642}, {1000, 203295701}, {500, 139615361}, {900, 233693412}, {300, 153225163},
93 : : {0, 27616254}, {1200, 9856191}, {100, 220392722}, {200, 66257599}, {1100, 145489641}, {1300, 37859442},
94 : : {400, 5816075}, {1200, 215752117}, {1400, 32361482}, {1400, 6529223}, {500, 143332977}, {800, 878392},
95 : : {700, 159290408}, {400, 123197595}, {700, 43988693}, {300, 304224916}, {700, 214771621}, {1100, 274148273},
96 : : {400, 285632418}, {1100, 923451065}, {600, 12818092}, {1200, 736282054}, {1000, 246683167}, {600, 92950402},
97 : : {1400, 29223405}, {1000, 841327192}, {700, 174301283}, {1400, 214009854}, {1000, 6989517}, {1200, 278226956},
98 : : {700, 540219613}, {400, 93663104}, {1100, 152345635}, {1500, 464194499}, {1300, 333850111}, {600, 258311263},
99 : : {600, 90173162}, {1000, 33590797}, {1500, 332866027}, {100, 204704427}, {1000, 463153545}, {800, 303244785},
100 : : {600, 88096214}, {0, 137477892}, {1200, 195514506}, {300, 704114595}, {900, 292087369}, {1400, 758684870},
101 : : {1300, 163493028}, {1200, 53151293}};
102 : :
103 : 2 : static std::unique_ptr<CBlockIndex> CreateBlockIndex(int nHeight, CBlockIndex* active_chain_tip) EXCLUSIVE_LOCKS_REQUIRED(cs_main)
104 : : {
105 : 2 : auto index{std::make_unique<CBlockIndex>()};
106 : 2 : index->nHeight = nHeight;
107 : 2 : index->pprev = active_chain_tip;
108 : 2 : return index;
109 : : }
110 : :
111 : : // Test suite for ancestor feerate transaction selection.
112 : : // Implemented as an additional function, rather than a separate test case,
113 : : // to allow reusing the blockchain created in CreateNewBlock_validity.
114 : 1 : void MinerTestingSetup::TestPackageSelection(const CScript& scriptPubKey, const std::vector<CTransactionRef>& txFirst)
115 : : {
116 : 1 : CTxMemPool& tx_mempool{MakeMempool()};
117 : 1 : auto mining{MakeMining()};
118 [ + - ]: 1 : BlockAssembler::Options options;
119 : 1 : options.coinbase_output_script = scriptPubKey;
120 : 1 : options.include_dummy_extranonce = true;
121 : :
122 [ + - ]: 1 : LOCK(tx_mempool.cs);
123 [ + - + - : 2 : BOOST_CHECK(tx_mempool.size() == 0);
+ - + - ]
124 : :
125 : : // Block template should only have a coinbase when there's nothing in the mempool
126 [ + - ]: 1 : std::unique_ptr<BlockTemplate> block_template = mining->createNewBlock(options, /*cooldown=*/false);
127 [ + - + - : 2 : BOOST_REQUIRE(block_template);
+ - ]
128 [ + - ]: 1 : CBlock block{block_template->getBlock()};
129 [ + - - + : 1 : BOOST_REQUIRE_EQUAL(block.vtx.size(), 1U);
+ - ]
130 : :
131 : : // waitNext() on an empty mempool should return nullptr because there is no better template
132 [ + - ]: 1 : auto should_be_nullptr = block_template->waitNext({.timeout = MillisecondsDouble{0}, .fee_threshold = 1});
133 [ + - + - : 2 : BOOST_REQUIRE(should_be_nullptr == nullptr);
+ - ]
134 : :
135 : : // Unless fee_threshold is 0
136 [ + - ]: 2 : block_template = block_template->waitNext({.timeout = MillisecondsDouble{0}, .fee_threshold = 0});
137 [ + - + - : 2 : BOOST_REQUIRE(block_template);
+ - ]
138 : :
139 : : // Test the ancestor feerate transaction selection.
140 : 1 : TestMemPoolEntryHelper entry;
141 : :
142 : : // Test that a medium fee transaction will be selected after a higher fee
143 : : // rate package with a low fee rate parent.
144 [ + - ]: 1 : CMutableTransaction tx;
145 [ + - ]: 1 : tx.vin.resize(1);
146 [ + - ]: 1 : tx.vin[0].scriptSig = CScript() << OP_1;
147 [ + - ]: 1 : tx.vin[0].prevout.hash = txFirst[0]->GetHash();
148 : 1 : tx.vin[0].prevout.n = 0;
149 [ + - ]: 1 : tx.vout.resize(1);
150 [ + - ]: 1 : tx.vout[0].nValue = 5000000000LL - 1000;
151 : : // This tx has a low fee: 1000 satoshis
152 [ + - ]: 1 : Txid hashParentTx = tx.GetHash(); // save this txid for later use
153 [ + - ]: 1 : const auto parent_tx{entry.Fee(1000).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx)};
154 [ + - ]: 1 : TryAddToMempool(tx_mempool, parent_tx);
155 : :
156 : : // This tx has a medium fee: 10000 satoshis
157 [ + - ]: 1 : tx.vin[0].prevout.hash = txFirst[1]->GetHash();
158 : 1 : tx.vout[0].nValue = 5000000000LL - 10000;
159 [ + - ]: 1 : Txid hashMediumFeeTx = tx.GetHash();
160 [ + - ]: 1 : const auto medium_fee_tx{entry.Fee(10000).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx)};
161 [ + - ]: 1 : TryAddToMempool(tx_mempool, medium_fee_tx);
162 : :
163 : : // This tx has a high fee, but depends on the first transaction
164 [ + - ]: 1 : tx.vin[0].prevout.hash = hashParentTx;
165 : 1 : tx.vout[0].nValue = 5000000000LL - 1000 - 50000; // 50k satoshi fee
166 [ + - ]: 1 : Txid hashHighFeeTx = tx.GetHash();
167 [ + - ]: 1 : const auto high_fee_tx{entry.Fee(50000).Time(Now<NodeSeconds>()).SpendsCoinbase(false).FromTx(tx)};
168 [ + - ]: 1 : TryAddToMempool(tx_mempool, high_fee_tx);
169 : :
170 [ + - ]: 2 : block_template = mining->createNewBlock(options, /*cooldown=*/false);
171 [ + - + - : 2 : BOOST_REQUIRE(block_template);
+ - ]
172 [ + - ]: 1 : block = block_template->getBlock();
173 [ + - - + : 1 : BOOST_REQUIRE_EQUAL(block.vtx.size(), 4U);
+ - ]
174 [ + - + - : 2 : BOOST_CHECK(block.vtx[1]->GetHash() == hashParentTx);
+ - ]
175 [ + - + - : 2 : BOOST_CHECK(block.vtx[2]->GetHash() == hashHighFeeTx);
+ - ]
176 [ + - + - : 2 : BOOST_CHECK(block.vtx[3]->GetHash() == hashMediumFeeTx);
+ - ]
177 : :
178 : : // Test the inclusion of package feerates in the block template and ensure they are sequential.
179 [ + - + - : 1 : const auto block_package_feerates = BlockAssembler{m_node.chainman->ActiveChainstate(), &tx_mempool, options}.CreateNewBlock()->m_package_feerates;
+ - + - ]
180 [ + - - + : 2 : BOOST_CHECK(block_package_feerates.size() == 2);
+ - + - ]
181 : :
182 : : // parent_tx and high_fee_tx are added to the block as a package.
183 : 1 : const auto combined_txs_fee = parent_tx.GetFee() + high_fee_tx.GetFee();
184 [ + - + - ]: 1 : const auto combined_txs_size = parent_tx.GetTxSize() + high_fee_tx.GetTxSize();
185 [ + - ]: 1 : FeeFrac package_feefrac{combined_txs_fee, combined_txs_size};
186 : : // The package should be added first.
187 [ + - + - : 3 : BOOST_CHECK(block_package_feerates[0] == package_feefrac);
+ - + - ]
188 : :
189 : : // The medium_fee_tx should be added next.
190 [ + - + - ]: 1 : FeeFrac medium_tx_feefrac{medium_fee_tx.GetFee(), medium_fee_tx.GetTxSize()};
191 [ + - + - : 3 : BOOST_CHECK(block_package_feerates[1] == medium_tx_feefrac);
+ - + - ]
192 : :
193 : : // Test that a package below the block min tx fee doesn't get included
194 [ + - ]: 1 : tx.vin[0].prevout.hash = hashHighFeeTx;
195 : 1 : tx.vout[0].nValue = 5000000000LL - 1000 - 50000; // 0 fee
196 [ + - ]: 1 : Txid hashFreeTx = tx.GetHash();
197 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(0).FromTx(tx));
198 : 1 : uint64_t freeTxSize{::GetSerializeSize(TX_WITH_WITNESS(tx))};
199 : :
200 : : // Calculate a fee on child transaction that will put the package just
201 : : // below the block min tx fee (assuming 1 child tx of the same size).
202 [ + - ]: 1 : CAmount feeToUse = blockMinFeeRate.GetFee(2*freeTxSize) - 1;
203 : :
204 [ + - ]: 1 : tx.vin[0].prevout.hash = hashFreeTx;
205 : 1 : tx.vout[0].nValue = 5000000000LL - 1000 - 50000 - feeToUse;
206 [ + - ]: 1 : Txid hashLowFeeTx = tx.GetHash();
207 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(feeToUse).FromTx(tx));
208 : :
209 : : // waitNext() should return nullptr because there is no better template
210 [ + - ]: 2 : should_be_nullptr = block_template->waitNext({.timeout = MillisecondsDouble{0}, .fee_threshold = 1});
211 [ + - + - : 2 : BOOST_REQUIRE(should_be_nullptr == nullptr);
+ - ]
212 : :
213 [ + - ]: 1 : block = block_template->getBlock();
214 : : // Verify that the free tx and the low fee tx didn't get selected
215 [ - + + + ]: 5 : for (size_t i=0; i<block.vtx.size(); ++i) {
216 [ + - + - : 8 : BOOST_CHECK(block.vtx[i]->GetHash() != hashFreeTx);
+ - ]
217 [ + - + - ]: 8 : BOOST_CHECK(block.vtx[i]->GetHash() != hashLowFeeTx);
218 : : }
219 : :
220 : : // Test that packages above the min relay fee do get included, even if one
221 : : // of the transactions is below the min relay fee
222 : : // Remove the low fee transaction and replace with a higher fee transaction
223 [ + - + - ]: 1 : tx_mempool.removeRecursive(CTransaction(tx), MemPoolRemovalReason::REPLACED);
224 [ + - ]: 1 : tx.vout[0].nValue -= 2; // Now we should be just over the min relay fee
225 [ + - ]: 1 : hashLowFeeTx = tx.GetHash();
226 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(feeToUse + 2).FromTx(tx));
227 : :
228 : : // waitNext() should return if fees for the new template are at least 1 sat up
229 [ + - ]: 2 : block_template = block_template->waitNext({.fee_threshold = 1});
230 [ + - + - : 2 : BOOST_REQUIRE(block_template);
+ - ]
231 [ + - ]: 1 : block = block_template->getBlock();
232 [ + - - + : 1 : BOOST_REQUIRE_EQUAL(block.vtx.size(), 6U);
+ - ]
233 [ + - + - : 2 : BOOST_CHECK(block.vtx[4]->GetHash() == hashFreeTx);
+ - ]
234 [ + - + - : 2 : BOOST_CHECK(block.vtx[5]->GetHash() == hashLowFeeTx);
+ - ]
235 : :
236 : : // Test that transaction selection properly updates ancestor fee
237 : : // calculations as ancestor transactions get included in a block.
238 : : // Add a 0-fee transaction that has 2 outputs.
239 [ + - ]: 1 : tx.vin[0].prevout.hash = txFirst[2]->GetHash();
240 [ + - ]: 1 : tx.vout.resize(2);
241 [ + - ]: 1 : tx.vout[0].nValue = 5000000000LL - 100000000;
242 : 1 : tx.vout[1].nValue = 100000000; // 1BTC output
243 : : // Increase size to avoid rounding errors: when the feerate is extremely small (i.e. 1sat/kvB), evaluating the fee
244 : : // at smaller sizes gives us rounded values that are equal to each other, which means we incorrectly include
245 : : // hashFreeTx2 + hashLowFeeTx2.
246 [ + - ]: 1 : BulkTransaction(tx, 4000);
247 [ + - ]: 1 : Txid hashFreeTx2 = tx.GetHash();
248 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(0).SpendsCoinbase(true).FromTx(tx));
249 : :
250 : : // This tx can't be mined by itself
251 [ + - ]: 1 : tx.vin[0].prevout.hash = hashFreeTx2;
252 [ + - ]: 1 : tx.vout.resize(1);
253 [ + - ]: 1 : feeToUse = blockMinFeeRate.GetFee(freeTxSize);
254 [ + - ]: 1 : tx.vout[0].nValue = 5000000000LL - 100000000 - feeToUse;
255 [ + - ]: 1 : Txid hashLowFeeTx2 = tx.GetHash();
256 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(feeToUse).SpendsCoinbase(false).FromTx(tx));
257 [ + - ]: 2 : block_template = mining->createNewBlock(options, /*cooldown=*/false);
258 [ + - + - : 2 : BOOST_REQUIRE(block_template);
+ - ]
259 [ + - ]: 1 : block = block_template->getBlock();
260 : :
261 : : // Verify that this tx isn't selected.
262 [ - + + + ]: 7 : for (size_t i=0; i<block.vtx.size(); ++i) {
263 [ + - + - : 12 : BOOST_CHECK(block.vtx[i]->GetHash() != hashFreeTx2);
+ - ]
264 [ + - + - ]: 12 : BOOST_CHECK(block.vtx[i]->GetHash() != hashLowFeeTx2);
265 : : }
266 : :
267 : : // This tx will be mineable, and should cause hashLowFeeTx2 to be selected
268 : : // as well.
269 [ + - ]: 1 : tx.vin[0].prevout.n = 1;
270 : 1 : tx.vout[0].nValue = 100000000 - 10000; // 10k satoshi fee
271 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(10000).FromTx(tx));
272 [ + - ]: 2 : block_template = mining->createNewBlock(options, /*cooldown=*/false);
273 [ + - + - : 2 : BOOST_REQUIRE(block_template);
+ - ]
274 [ + - ]: 1 : block = block_template->getBlock();
275 [ + - - + : 1 : BOOST_REQUIRE_EQUAL(block.vtx.size(), 9U);
+ - ]
276 [ + - + - ]: 2 : BOOST_CHECK(block.vtx[8]->GetHash() == hashLowFeeTx2);
277 [ + - ]: 3 : }
278 : :
279 : 2 : std::vector<CTransactionRef> CreateBigSigOpsCluster(const CTransactionRef& first_tx)
280 : : {
281 : 2 : std::vector<CTransactionRef> ret;
282 : :
283 [ + - ]: 2 : CMutableTransaction tx;
284 : : // block sigops > limit: 1000 CHECKMULTISIG + 1
285 [ + - ]: 2 : tx.vin.resize(1);
286 : : // NOTE: OP_NOP is used to force 20 SigOps for the CHECKMULTISIG
287 [ + - + - : 2 : tx.vin[0].scriptSig = CScript() << OP_0 << OP_0 << OP_CHECKSIG << OP_1;
+ - + - ]
288 [ + - ]: 2 : tx.vin[0].prevout.hash = first_tx->GetHash();
289 : 2 : tx.vin[0].prevout.n = 0;
290 [ + - ]: 2 : tx.vout.resize(50);
291 [ + + ]: 102 : for (auto &out : tx.vout) {
292 [ + - ]: 100 : out.nValue = first_tx->vout[0].nValue / 50;
293 [ + - ]: 100 : out.scriptPubKey = CScript() << OP_1;
294 : : }
295 : :
296 [ + - ]: 2 : tx.vout[0].nValue -= CENT;
297 [ + - ]: 2 : CTransactionRef parent_tx = MakeTransactionRef(tx);
298 [ + - ]: 2 : ret.push_back(parent_tx);
299 [ + - + - ]: 2 : assert(GetLegacySigOpCount(*parent_tx) == 1);
300 : :
301 : : // Tx1 has 1 sigops, 1 input, 50 outputs.
302 : : // Tx2-51 has 400 sigops: 1 input, 20 CHECKMULTISIG outputs
303 : : // Total: 1000 CHECKMULTISIG + 1
304 [ + + ]: 102 : for (unsigned int i = 0; i < 50; ++i) {
305 [ + - ]: 100 : auto tx2 = tx;
306 [ + - ]: 100 : tx2.vin.resize(1);
307 [ + - ]: 100 : tx2.vin[0].prevout.hash = parent_tx->GetHash();
308 : 100 : tx2.vin[0].prevout.n = i;
309 [ + - ]: 100 : tx2.vin[0].scriptSig = CScript() << OP_1;
310 [ + - ]: 100 : tx2.vout.resize(20);
311 : 100 : tx2.vout[0].nValue = parent_tx->vout[i].nValue - CENT;
312 [ + + ]: 2100 : for (auto &out : tx2.vout) {
313 : 2000 : out.nValue = 0;
314 [ + - + - : 2000 : out.scriptPubKey = CScript() << OP_0 << OP_0 << OP_0 << OP_NOP << OP_CHECKMULTISIG << OP_1;
+ - + - +
- + - ]
315 : : }
316 [ + - + - : 200 : ret.push_back(MakeTransactionRef(tx2));
- + ]
317 : 100 : }
318 [ + - ]: 2 : return ret;
319 : 4 : }
320 : :
321 : 1 : void MinerTestingSetup::TestBasicMining(const CScript& scriptPubKey, const std::vector<CTransactionRef>& txFirst, int baseheight)
322 : : {
323 : 1 : Txid hash;
324 : 1 : CMutableTransaction tx;
325 : 1 : TestMemPoolEntryHelper entry;
326 : 1 : entry.nFee = 11;
327 : 1 : entry.nHeight = 11;
328 : :
329 : 1 : const CAmount BLOCKSUBSIDY = 50 * COIN;
330 : 1 : const CAmount LOWFEE = CENT;
331 : 1 : const CAmount HIGHFEE = COIN;
332 : 1 : const CAmount HIGHERFEE = 4 * COIN;
333 : :
334 [ + - ]: 1 : auto mining{MakeMining()};
335 [ + - + - : 2 : BOOST_REQUIRE(mining);
+ - ]
336 : :
337 [ + - ]: 1 : BlockAssembler::Options options;
338 : 1 : options.coinbase_output_script = scriptPubKey;
339 : 1 : options.include_dummy_extranonce = true;
340 : :
341 : 1 : {
342 [ + - ]: 1 : CTxMemPool& tx_mempool{MakeMempool()};
343 [ + - ]: 1 : LOCK(tx_mempool.cs);
344 : :
345 : : // Just to make sure we can still make simple blocks
346 [ + - ]: 1 : auto block_template{mining->createNewBlock(options, /*cooldown=*/false)};
347 [ + - + - : 2 : BOOST_REQUIRE(block_template);
+ - ]
348 [ + - ]: 1 : CBlock block{block_template->getBlock()};
349 : :
350 [ + - ]: 1 : auto txs = CreateBigSigOpsCluster(txFirst[0]);
351 : :
352 : 1 : int64_t legacy_sigops = 0;
353 [ + + ]: 52 : for (auto& t : txs) {
354 : : // If we don't set the number of sigops in the CTxMemPoolEntry,
355 : : // template creation fails during sanity checks.
356 [ + - + - ]: 51 : TryAddToMempool(tx_mempool, entry.Fee(LOWFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(t));
357 [ + - ]: 51 : legacy_sigops += GetLegacySigOpCount(*t);
358 [ + - + - : 102 : BOOST_CHECK(tx_mempool.GetIter(t->GetHash()).has_value());
+ - ]
359 : : }
360 [ - + ]: 1 : assert(tx_mempool.mapTx.size() == 51);
361 [ - + ]: 1 : assert(legacy_sigops == 20001);
362 [ + - - + : 2 : BOOST_CHECK_EXCEPTION(mining->createNewBlock(options, /*cooldown=*/false), std::runtime_error, HasReason("bad-blk-sigops"));
- - - - -
+ + - + -
+ - ]
363 [ + - ]: 1 : }
364 : :
365 : 1 : {
366 [ + - ]: 1 : CTxMemPool& tx_mempool{MakeMempool()};
367 [ + - ]: 1 : LOCK(tx_mempool.cs);
368 : :
369 : : // Check that the mempool is empty.
370 [ - + ]: 1 : assert(tx_mempool.mapTx.empty());
371 : :
372 : : // Just to make sure we can still make simple blocks
373 [ + - ]: 1 : auto block_template{mining->createNewBlock(options, /*cooldown=*/false)};
374 [ + - + - : 2 : BOOST_REQUIRE(block_template);
+ - ]
375 [ + - ]: 1 : CBlock block{block_template->getBlock()};
376 : :
377 [ + - ]: 1 : auto txs = CreateBigSigOpsCluster(txFirst[0]);
378 : :
379 : 1 : int64_t legacy_sigops = 0;
380 [ + + ]: 52 : for (auto& t : txs) {
381 [ + - + - : 51 : TryAddToMempool(tx_mempool, entry.Fee(LOWFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(true).SigOpsCost(GetLegacySigOpCount(*t)*WITNESS_SCALE_FACTOR).FromTx(t));
+ - ]
382 [ + - ]: 51 : legacy_sigops += GetLegacySigOpCount(*t);
383 [ + - + - : 102 : BOOST_CHECK(tx_mempool.GetIter(t->GetHash()).has_value());
+ - ]
384 : : }
385 [ - + ]: 1 : assert(tx_mempool.mapTx.size() == 51);
386 [ - + ]: 1 : assert(legacy_sigops == 20001);
387 : :
388 [ + - + - : 2 : BOOST_REQUIRE(mining->createNewBlock(options, /*cooldown=*/false));
+ - ]
389 [ + - ]: 1 : }
390 : :
391 : 1 : {
392 [ + - ]: 1 : CTxMemPool& tx_mempool{MakeMempool()};
393 [ + - ]: 1 : LOCK(tx_mempool.cs);
394 : :
395 : : // block size > limit
396 [ + - ]: 1 : tx.vin.resize(1);
397 [ + - ]: 1 : tx.vout.resize(1);
398 [ + - ]: 1 : tx.vout[0].nValue = BLOCKSUBSIDY;
399 : : // 36 * (520char + DROP) + OP_1 = 18757 bytes
400 [ + - ]: 1 : std::vector<unsigned char> vchData(520);
401 [ + + ]: 19 : for (unsigned int i = 0; i < 18; ++i) {
402 [ - + + - ]: 18 : tx.vin[0].scriptSig << vchData << OP_DROP;
403 [ - + + - ]: 18 : tx.vout[0].scriptPubKey << vchData << OP_DROP;
404 : : }
405 [ + - ]: 1 : tx.vin[0].scriptSig << OP_1;
406 [ + - ]: 1 : tx.vout[0].scriptPubKey << OP_1;
407 : 1 : tx.vin[0].prevout.hash = txFirst[0]->GetHash();
408 : 1 : tx.vin[0].prevout.n = 0;
409 : 1 : tx.vout[0].nValue = BLOCKSUBSIDY;
410 [ + + ]: 64 : for (unsigned int i = 0; i < 63; ++i) {
411 [ + - ]: 63 : tx.vout[0].nValue -= LOWFEE;
412 [ + - ]: 63 : hash = tx.GetHash();
413 : 63 : bool spendsCoinbase = i == 0; // only first tx spends coinbase
414 [ + - + - ]: 63 : TryAddToMempool(tx_mempool, entry.Fee(LOWFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(spendsCoinbase).FromTx(tx));
415 [ + - + - : 126 : BOOST_CHECK(tx_mempool.GetIter(hash).has_value());
+ - ]
416 : 63 : tx.vin[0].prevout.hash = hash;
417 : : }
418 [ + - + - : 2 : BOOST_REQUIRE(mining->createNewBlock(options, /*cooldown=*/false));
+ - ]
419 [ + - ]: 1 : }
420 : :
421 : 1 : {
422 [ + - ]: 1 : CTxMemPool& tx_mempool{MakeMempool()};
423 [ + - ]: 1 : LOCK(tx_mempool.cs);
424 : :
425 : : // orphan in tx_mempool, template creation fails
426 [ + - ]: 1 : hash = tx.GetHash();
427 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(LOWFEE).Time(Now<NodeSeconds>()).FromTx(tx));
428 [ + - - + : 2 : BOOST_CHECK_EXCEPTION(mining->createNewBlock(options, /*cooldown=*/false), std::runtime_error, HasReason("bad-txns-inputs-missingorspent"));
- - - - +
- - + + -
+ - + - ]
429 : 0 : }
430 : :
431 : 1 : {
432 [ + - ]: 1 : CTxMemPool& tx_mempool{MakeMempool()};
433 [ + - ]: 1 : LOCK(tx_mempool.cs);
434 : :
435 : : // child with higher feerate than parent
436 [ + - ]: 1 : tx.vin[0].scriptSig = CScript() << OP_1;
437 [ + - ]: 1 : tx.vin[0].prevout.hash = txFirst[1]->GetHash();
438 : 1 : tx.vout[0].nValue = BLOCKSUBSIDY - HIGHFEE;
439 [ + - ]: 1 : hash = tx.GetHash();
440 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(HIGHFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx));
441 [ + - ]: 1 : tx.vin[0].prevout.hash = hash;
442 [ + - ]: 1 : tx.vin.resize(2);
443 [ + - ]: 1 : tx.vin[1].scriptSig = CScript() << OP_1;
444 [ + - ]: 1 : tx.vin[1].prevout.hash = txFirst[0]->GetHash();
445 : 1 : tx.vin[1].prevout.n = 0;
446 : 1 : tx.vout[0].nValue = tx.vout[0].nValue + BLOCKSUBSIDY - HIGHERFEE; // First txn output + fresh coinbase - new txn fee
447 [ + - ]: 1 : hash = tx.GetHash();
448 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(HIGHERFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx));
449 [ + - + - : 2 : BOOST_REQUIRE(mining->createNewBlock(options, /*cooldown=*/false));
+ - + - ]
450 : 0 : }
451 : :
452 : 1 : {
453 [ + - ]: 1 : CTxMemPool& tx_mempool{MakeMempool()};
454 [ + - ]: 1 : LOCK(tx_mempool.cs);
455 : :
456 : : // coinbase in tx_mempool, template creation fails
457 [ + - ]: 1 : tx.vin.resize(1);
458 : 1 : tx.vin[0].prevout.SetNull();
459 [ + - + - ]: 1 : tx.vin[0].scriptSig = CScript() << OP_0 << OP_1;
460 [ + - ]: 1 : tx.vout[0].nValue = 0;
461 [ + - ]: 1 : hash = tx.GetHash();
462 : : // give it a fee so it'll get mined
463 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(LOWFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(false).FromTx(tx));
464 : : // Should throw bad-cb-multiple
465 [ + - - + : 2 : BOOST_CHECK_EXCEPTION(mining->createNewBlock(options, /*cooldown=*/false), std::runtime_error, HasReason("bad-cb-multiple"));
- - - - +
- - + + -
+ - + - ]
466 : 0 : }
467 : :
468 : 1 : {
469 [ + - ]: 1 : CTxMemPool& tx_mempool{MakeMempool()};
470 [ + - ]: 1 : LOCK(tx_mempool.cs);
471 : :
472 : : // double spend txn pair in tx_mempool, template creation fails
473 [ + - ]: 1 : tx.vin[0].prevout.hash = txFirst[0]->GetHash();
474 [ + - ]: 1 : tx.vin[0].scriptSig = CScript() << OP_1;
475 [ + - ]: 1 : tx.vout[0].nValue = BLOCKSUBSIDY - HIGHFEE;
476 [ + - ]: 1 : tx.vout[0].scriptPubKey = CScript() << OP_1;
477 [ + - ]: 1 : hash = tx.GetHash();
478 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(HIGHFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx));
479 [ + - ]: 1 : tx.vout[0].scriptPubKey = CScript() << OP_2;
480 [ + - ]: 1 : hash = tx.GetHash();
481 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(HIGHFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx));
482 [ + - - + : 2 : BOOST_CHECK_EXCEPTION(mining->createNewBlock(options, /*cooldown=*/false), std::runtime_error, HasReason("bad-txns-inputs-missingorspent"));
- - - - +
- - + + -
+ - + - ]
483 : 0 : }
484 : :
485 : 1 : {
486 [ + - ]: 1 : CTxMemPool& tx_mempool{MakeMempool()};
487 [ + - ]: 1 : LOCK(tx_mempool.cs);
488 : :
489 : : // subsidy changing
490 [ + - - + ]: 1 : int nHeight = m_node.chainman->ActiveChain().Height();
491 : : // Create an actual 209999-long block chain (without valid blocks).
492 [ + - - + : 419780 : while (m_node.chainman->ActiveChain().Tip()->nHeight < 209999) {
+ + ]
493 [ + - - + ]: 209889 : CBlockIndex* prev = m_node.chainman->ActiveChain().Tip();
494 [ + - ]: 209889 : CBlockIndex* next = new CBlockIndex();
495 [ + - ]: 209889 : next->phashBlock = new uint256(m_rng.rand256());
496 [ + - + - : 209889 : m_node.chainman->ActiveChainstate().CoinsTip().SetBestBlock(next->GetBlockHash());
+ - ]
497 : 209889 : next->pprev = prev;
498 : 209889 : next->nHeight = prev->nHeight + 1;
499 [ + - ]: 209889 : next->BuildSkip();
500 [ + - + - ]: 209889 : m_node.chainman->ActiveChain().SetTip(*next);
501 : : }
502 [ + - + - : 2 : BOOST_REQUIRE(mining->createNewBlock(options, /*cooldown=*/false));
+ - ]
503 : : // Extend to a 210000-long block chain.
504 [ + - - + : 4 : while (m_node.chainman->ActiveChain().Tip()->nHeight < 210000) {
+ + ]
505 [ + - - + ]: 1 : CBlockIndex* prev = m_node.chainman->ActiveChain().Tip();
506 [ + - ]: 1 : CBlockIndex* next = new CBlockIndex();
507 [ + - ]: 1 : next->phashBlock = new uint256(m_rng.rand256());
508 [ + - + - : 1 : m_node.chainman->ActiveChainstate().CoinsTip().SetBestBlock(next->GetBlockHash());
+ - ]
509 : 1 : next->pprev = prev;
510 : 1 : next->nHeight = prev->nHeight + 1;
511 [ + - ]: 1 : next->BuildSkip();
512 [ + - + - ]: 1 : m_node.chainman->ActiveChain().SetTip(*next);
513 : : }
514 [ + - + - : 2 : BOOST_REQUIRE(mining->createNewBlock(options, /*cooldown=*/false));
+ - + - ]
515 : :
516 : : // invalid p2sh txn in tx_mempool, template creation fails
517 [ + - ]: 1 : tx.vin[0].prevout.hash = txFirst[0]->GetHash();
518 : 1 : tx.vin[0].prevout.n = 0;
519 [ + - ]: 1 : tx.vin[0].scriptSig = CScript() << OP_1;
520 [ + - ]: 1 : tx.vout[0].nValue = BLOCKSUBSIDY - LOWFEE;
521 [ + - ]: 1 : CScript script = CScript() << OP_0;
522 [ + - + - ]: 1 : tx.vout[0].scriptPubKey = GetScriptForDestination(ScriptHash(script));
523 [ + - ]: 1 : hash = tx.GetHash();
524 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(LOWFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx));
525 [ - + ]: 1 : tx.vin[0].prevout.hash = hash;
526 [ - + + - ]: 2 : tx.vin[0].scriptSig = CScript() << std::vector<unsigned char>(script.begin(), script.end());
527 [ + - ]: 1 : tx.vout[0].nValue -= LOWFEE;
528 [ + - ]: 1 : hash = tx.GetHash();
529 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(LOWFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(false).FromTx(tx));
530 [ + - - + : 2 : BOOST_CHECK_EXCEPTION(mining->createNewBlock(options, /*cooldown=*/false), std::runtime_error, HasReason("block-script-verify-flag-failed"));
- - - - -
+ + - + -
+ - ]
531 : :
532 : : // Delete the dummy blocks again.
533 [ + - - + : 419782 : while (m_node.chainman->ActiveChain().Tip()->nHeight > nHeight) {
+ + ]
534 [ + - - + ]: 209890 : CBlockIndex* del = m_node.chainman->ActiveChain().Tip();
535 [ + - - + : 209890 : m_node.chainman->ActiveChain().SetTip(*Assert(del->pprev));
+ - ]
536 [ + - + - : 209890 : m_node.chainman->ActiveChainstate().CoinsTip().SetBestBlock(del->pprev->GetBlockHash());
+ - ]
537 [ + - ]: 209890 : delete del->phashBlock;
538 [ + - ]: 209890 : delete del;
539 : : }
540 [ + - ]: 1 : }
541 : :
542 [ + - ]: 1 : CTxMemPool& tx_mempool{MakeMempool()};
543 [ + - ]: 1 : LOCK(tx_mempool.cs);
544 : :
545 : : // non-final txs in mempool
546 [ + - - + : 2 : SetMockTime(m_node.chainman->ActiveChain().Tip()->GetMedianTimePast() + 1);
+ - ]
547 : 1 : const int flags{LOCKTIME_VERIFY_SEQUENCE};
548 : : // height map
549 : 1 : std::vector<int> prevheights;
550 : :
551 : : // relative height locked
552 : 1 : tx.version = 2;
553 [ + - ]: 1 : tx.vin.resize(1);
554 [ + - ]: 1 : prevheights.resize(1);
555 [ + - ]: 1 : tx.vin[0].prevout.hash = txFirst[0]->GetHash(); // only 1 transaction
556 : 1 : tx.vin[0].prevout.n = 0;
557 [ + - ]: 1 : tx.vin[0].scriptSig = CScript() << OP_1;
558 [ + - - + : 2 : tx.vin[0].nSequence = m_node.chainman->ActiveChain().Tip()->nHeight + 1; // txFirst[0] is the 2nd block
+ - ]
559 : 1 : prevheights[0] = baseheight + 1;
560 [ + - ]: 1 : tx.vout.resize(1);
561 [ + - ]: 1 : tx.vout[0].nValue = BLOCKSUBSIDY-HIGHFEE;
562 [ + - ]: 1 : tx.vout[0].scriptPubKey = CScript() << OP_1;
563 : 1 : tx.nLockTime = 0;
564 [ + - ]: 1 : hash = tx.GetHash();
565 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(HIGHFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx));
566 [ + - + - : 4 : BOOST_CHECK(CheckFinalTxAtTip(*Assert(m_node.chainman->ActiveChain().Tip()), CTransaction{tx})); // Locktime passes
+ - - + -
+ + - + -
+ - ]
567 [ + - + - : 3 : BOOST_CHECK(!TestSequenceLocks(CTransaction{tx}, tx_mempool)); // Sequence locks fail
+ - + - +
- ]
568 : :
569 : 1 : {
570 [ + - - + ]: 1 : CBlockIndex* active_chain_tip = m_node.chainman->ActiveChain().Tip();
571 [ + - + - : 3 : BOOST_CHECK(SequenceLocks(CTransaction(tx), flags, prevheights, *CreateBlockIndex(active_chain_tip->nHeight + 2, active_chain_tip))); // Sequence locks pass on 2nd block
+ - + - +
- + - ]
572 : : }
573 : :
574 : : // relative time locked
575 [ + - ]: 1 : tx.vin[0].prevout.hash = txFirst[1]->GetHash();
576 [ + - - + : 3 : tx.vin[0].nSequence = CTxIn::SEQUENCE_LOCKTIME_TYPE_FLAG | (((m_node.chainman->ActiveChain().Tip()->GetMedianTimePast()+1-m_node.chainman->ActiveChain()[1]->GetMedianTimePast()) >> CTxIn::SEQUENCE_LOCKTIME_GRANULARITY) + 1); // txFirst[1] is the 3rd block
+ - - + +
- ]
577 : 1 : prevheights[0] = baseheight + 2;
578 [ + - ]: 1 : hash = tx.GetHash();
579 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Time(Now<NodeSeconds>()).FromTx(tx));
580 [ + - + - : 4 : BOOST_CHECK(CheckFinalTxAtTip(*Assert(m_node.chainman->ActiveChain().Tip()), CTransaction{tx})); // Locktime passes
+ - - + -
+ + - + -
+ - ]
581 [ + - + - : 3 : BOOST_CHECK(!TestSequenceLocks(CTransaction{tx}, tx_mempool)); // Sequence locks fail
+ - + - ]
582 : :
583 : 1 : const int SEQUENCE_LOCK_TIME = 512; // Sequence locks pass 512 seconds later
584 [ + + ]: 12 : for (int i = 0; i < CBlockIndex::nMedianTimeSpan; ++i)
585 [ + - - + : 33 : m_node.chainman->ActiveChain().Tip()->GetAncestor(m_node.chainman->ActiveChain().Tip()->nHeight - i)->nTime += SEQUENCE_LOCK_TIME; // Trick the MedianTimePast
+ - - + +
- ]
586 : 1 : {
587 [ + - - + ]: 1 : CBlockIndex* active_chain_tip = m_node.chainman->ActiveChain().Tip();
588 [ + - + - : 3 : BOOST_CHECK(SequenceLocks(CTransaction(tx), flags, prevheights, *CreateBlockIndex(active_chain_tip->nHeight + 1, active_chain_tip)));
+ - + - +
- ]
589 : : }
590 : :
591 [ + + ]: 12 : for (int i = 0; i < CBlockIndex::nMedianTimeSpan; ++i) {
592 [ + - - + : 33 : CBlockIndex* ancestor{Assert(m_node.chainman->ActiveChain().Tip()->GetAncestor(m_node.chainman->ActiveChain().Tip()->nHeight - i))};
+ - - + +
- - + ]
593 : 11 : ancestor->nTime -= SEQUENCE_LOCK_TIME; // undo tricked MTP
594 : : }
595 : :
596 : : // absolute height locked
597 [ + - ]: 1 : tx.vin[0].prevout.hash = txFirst[2]->GetHash();
598 : 1 : tx.vin[0].nSequence = CTxIn::MAX_SEQUENCE_NONFINAL;
599 : 1 : prevheights[0] = baseheight + 3;
600 [ + - - + ]: 1 : tx.nLockTime = m_node.chainman->ActiveChain().Tip()->nHeight + 1;
601 [ + - ]: 1 : hash = tx.GetHash();
602 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Time(Now<NodeSeconds>()).FromTx(tx));
603 [ + - + - : 4 : BOOST_CHECK(!CheckFinalTxAtTip(*Assert(m_node.chainman->ActiveChain().Tip()), CTransaction{tx})); // Locktime fails
+ - - + -
+ + - + -
+ - ]
604 [ + - + - : 3 : BOOST_CHECK(TestSequenceLocks(CTransaction{tx}, tx_mempool)); // Sequence locks pass
+ - + - +
- ]
605 [ + - + - : 5 : BOOST_CHECK(IsFinalTx(CTransaction(tx), m_node.chainman->ActiveChain().Tip()->nHeight + 2, m_node.chainman->ActiveChain().Tip()->GetMedianTimePast())); // Locktime passes on 2nd block
- + + - -
+ + - + -
+ - + - ]
606 : :
607 : : // ensure tx is final for a specific case where there is no locktime and block height is zero
608 : 1 : tx.nLockTime = 0;
609 [ + - + - : 4 : BOOST_CHECK(IsFinalTx(CTransaction(tx), /*nBlockHeight=*/0, m_node.chainman->ActiveChain().Tip()->GetMedianTimePast()));
- + + - +
- + - +
- ]
610 : :
611 : : // absolute time locked
612 [ + - ]: 1 : tx.vin[0].prevout.hash = txFirst[3]->GetHash();
613 [ + - - + ]: 2 : tx.nLockTime = m_node.chainman->ActiveChain().Tip()->GetMedianTimePast();
614 [ + - ]: 1 : prevheights.resize(1);
615 [ + - ]: 1 : prevheights[0] = baseheight + 4;
616 [ + - ]: 1 : hash = tx.GetHash();
617 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Time(Now<NodeSeconds>()).FromTx(tx));
618 [ + - + - : 4 : BOOST_CHECK(!CheckFinalTxAtTip(*Assert(m_node.chainman->ActiveChain().Tip()), CTransaction{tx})); // Locktime fails
+ - - + -
+ + - + -
+ - ]
619 [ + - + - : 3 : BOOST_CHECK(TestSequenceLocks(CTransaction{tx}, tx_mempool)); // Sequence locks pass
+ - + - +
- ]
620 [ + - + - : 5 : BOOST_CHECK(IsFinalTx(CTransaction(tx), m_node.chainman->ActiveChain().Tip()->nHeight + 2, m_node.chainman->ActiveChain().Tip()->GetMedianTimePast() + 1)); // Locktime passes 1 second later
- + + - -
+ + - + -
+ - + - ]
621 : :
622 : : // mempool-dependent transactions (not added)
623 [ + - ]: 1 : tx.vin[0].prevout.hash = hash;
624 [ + - - + : 2 : prevheights[0] = m_node.chainman->ActiveChain().Tip()->nHeight + 1;
+ - ]
625 : 1 : tx.nLockTime = 0;
626 : 1 : tx.vin[0].nSequence = 0;
627 [ + - + - : 4 : BOOST_CHECK(CheckFinalTxAtTip(*Assert(m_node.chainman->ActiveChain().Tip()), CTransaction{tx})); // Locktime passes
+ - - + -
+ + - + -
+ - ]
628 [ + - + - : 3 : BOOST_CHECK(TestSequenceLocks(CTransaction{tx}, tx_mempool)); // Sequence locks pass
+ - + - +
- ]
629 [ + - ]: 1 : tx.vin[0].nSequence = 1;
630 [ + - + - : 3 : BOOST_CHECK(!TestSequenceLocks(CTransaction{tx}, tx_mempool)); // Sequence locks fail
+ - + - +
- ]
631 [ + - ]: 1 : tx.vin[0].nSequence = CTxIn::SEQUENCE_LOCKTIME_TYPE_FLAG;
632 [ + - + - : 3 : BOOST_CHECK(TestSequenceLocks(CTransaction{tx}, tx_mempool)); // Sequence locks pass
+ - + - +
- ]
633 [ + - ]: 1 : tx.vin[0].nSequence = CTxIn::SEQUENCE_LOCKTIME_TYPE_FLAG | 1;
634 [ + - + - : 3 : BOOST_CHECK(!TestSequenceLocks(CTransaction{tx}, tx_mempool)); // Sequence locks fail
+ - + - +
- ]
635 : :
636 [ + - ]: 1 : auto block_template = mining->createNewBlock(options, /*cooldown=*/false);
637 [ + - + - : 2 : BOOST_REQUIRE(block_template);
+ - ]
638 : :
639 : : // None of the of the absolute height/time locked tx should have made
640 : : // it into the template because we still check IsFinalTx in CreateNewBlock,
641 : : // but relative locked txs will if inconsistently added to mempool.
642 : : // For now these will still generate a valid template until BIP68 soft fork
643 [ + - ]: 1 : CBlock block{block_template->getBlock()};
644 [ + - - + : 1 : BOOST_CHECK_EQUAL(block.vtx.size(), 3U);
+ - ]
645 : : // However if we advance height by 1 and time by SEQUENCE_LOCK_TIME, all of them should be mined
646 [ + + ]: 12 : for (int i = 0; i < CBlockIndex::nMedianTimeSpan; ++i) {
647 [ + - - + : 33 : CBlockIndex* ancestor{Assert(m_node.chainman->ActiveChain().Tip()->GetAncestor(m_node.chainman->ActiveChain().Tip()->nHeight - i))};
+ - - + +
- - + ]
648 : 11 : ancestor->nTime += SEQUENCE_LOCK_TIME; // Trick the MedianTimePast
649 : : }
650 [ + - - + ]: 1 : m_node.chainman->ActiveChain().Tip()->nHeight++;
651 [ + - - + : 2 : SetMockTime(m_node.chainman->ActiveChain().Tip()->GetMedianTimePast() + 1);
+ - ]
652 : :
653 [ + - ]: 2 : block_template = mining->createNewBlock(options, /*cooldown=*/false);
654 [ + - + - : 2 : BOOST_REQUIRE(block_template);
+ - ]
655 [ + - ]: 1 : block = block_template->getBlock();
656 [ + - - + : 1 : BOOST_CHECK_EQUAL(block.vtx.size(), 5U);
+ - ]
657 [ + - ]: 3 : }
658 : :
659 : 1 : void MinerTestingSetup::TestPrioritisedMining(const CScript& scriptPubKey, const std::vector<CTransactionRef>& txFirst)
660 : : {
661 : 1 : auto mining{MakeMining()};
662 [ + - + - : 2 : BOOST_REQUIRE(mining);
+ - ]
663 : :
664 [ + - ]: 1 : BlockAssembler::Options options;
665 : 1 : options.coinbase_output_script = scriptPubKey;
666 : 1 : options.include_dummy_extranonce = true;
667 : :
668 [ + - ]: 1 : CTxMemPool& tx_mempool{MakeMempool()};
669 [ + - ]: 1 : LOCK(tx_mempool.cs);
670 : :
671 : 1 : TestMemPoolEntryHelper entry;
672 : :
673 : : // Test that a tx below min fee but prioritised is included
674 [ + - ]: 1 : CMutableTransaction tx;
675 [ + - ]: 1 : tx.vin.resize(1);
676 [ + - ]: 1 : tx.vin[0].prevout.hash = txFirst[0]->GetHash();
677 : 1 : tx.vin[0].prevout.n = 0;
678 [ + - ]: 1 : tx.vin[0].scriptSig = CScript() << OP_1;
679 [ + - ]: 1 : tx.vout.resize(1);
680 [ + - ]: 1 : tx.vout[0].nValue = 5000000000LL; // 0 fee
681 [ + - ]: 1 : Txid hashFreePrioritisedTx = tx.GetHash();
682 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(0).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx));
683 [ + - ]: 1 : tx_mempool.PrioritiseTransaction(hashFreePrioritisedTx, 5 * COIN);
684 : :
685 [ + - ]: 1 : tx.vin[0].prevout.hash = txFirst[1]->GetHash();
686 : 1 : tx.vin[0].prevout.n = 0;
687 : 1 : tx.vout[0].nValue = 5000000000LL - 1000;
688 : : // This tx has a low fee: 1000 satoshis
689 [ + - ]: 1 : Txid hashParentTx = tx.GetHash(); // save this txid for later use
690 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(1000).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx));
691 : :
692 : : // This tx has a medium fee: 10000 satoshis
693 [ + - ]: 1 : tx.vin[0].prevout.hash = txFirst[2]->GetHash();
694 : 1 : tx.vout[0].nValue = 5000000000LL - 10000;
695 [ + - ]: 1 : Txid hashMediumFeeTx = tx.GetHash();
696 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(10000).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx));
697 [ + - ]: 1 : tx_mempool.PrioritiseTransaction(hashMediumFeeTx, -5 * COIN);
698 : :
699 : : // This tx also has a low fee, but is prioritised
700 [ + - ]: 1 : tx.vin[0].prevout.hash = hashParentTx;
701 : 1 : tx.vout[0].nValue = 5000000000LL - 1000 - 1000; // 1000 satoshi fee
702 [ + - ]: 1 : Txid hashPrioritsedChild = tx.GetHash();
703 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(1000).Time(Now<NodeSeconds>()).SpendsCoinbase(false).FromTx(tx));
704 [ + - ]: 1 : tx_mempool.PrioritiseTransaction(hashPrioritsedChild, 2 * COIN);
705 : :
706 : : // Test that transaction selection properly updates ancestor fee calculations as prioritised
707 : : // parents get included in a block. Create a transaction with two prioritised ancestors, each
708 : : // included by itself: FreeParent <- FreeChild <- FreeGrandchild.
709 : : // When FreeParent is added, a modified entry will be created for FreeChild + FreeGrandchild
710 : : // FreeParent's prioritisation should not be included in that entry.
711 : : // When FreeChild is included, FreeChild's prioritisation should also not be included.
712 [ + - ]: 1 : tx.vin[0].prevout.hash = txFirst[3]->GetHash();
713 : 1 : tx.vout[0].nValue = 5000000000LL; // 0 fee
714 [ + - ]: 1 : Txid hashFreeParent = tx.GetHash();
715 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(0).SpendsCoinbase(true).FromTx(tx));
716 [ + - ]: 1 : tx_mempool.PrioritiseTransaction(hashFreeParent, 10 * COIN);
717 : :
718 [ + - ]: 1 : tx.vin[0].prevout.hash = hashFreeParent;
719 : 1 : tx.vout[0].nValue = 5000000000LL; // 0 fee
720 [ + - ]: 1 : Txid hashFreeChild = tx.GetHash();
721 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(0).SpendsCoinbase(false).FromTx(tx));
722 [ + - ]: 1 : tx_mempool.PrioritiseTransaction(hashFreeChild, 1 * COIN);
723 : :
724 [ + - ]: 1 : tx.vin[0].prevout.hash = hashFreeChild;
725 : 1 : tx.vout[0].nValue = 5000000000LL; // 0 fee
726 [ + - ]: 1 : Txid hashFreeGrandchild = tx.GetHash();
727 [ + - + - ]: 1 : TryAddToMempool(tx_mempool, entry.Fee(0).SpendsCoinbase(false).FromTx(tx));
728 : :
729 [ + - ]: 1 : auto block_template = mining->createNewBlock(options, /*cooldown=*/false);
730 [ + - + - : 2 : BOOST_REQUIRE(block_template);
+ - ]
731 [ + - ]: 1 : CBlock block{block_template->getBlock()};
732 [ + - - + : 1 : BOOST_REQUIRE_EQUAL(block.vtx.size(), 6U);
+ - ]
733 [ + - + - : 2 : BOOST_CHECK(block.vtx[1]->GetHash() == hashFreeParent);
+ - ]
734 [ + - + - : 2 : BOOST_CHECK(block.vtx[2]->GetHash() == hashFreePrioritisedTx);
+ - ]
735 [ + - + - : 2 : BOOST_CHECK(block.vtx[3]->GetHash() == hashParentTx);
+ - ]
736 [ + - + - : 2 : BOOST_CHECK(block.vtx[4]->GetHash() == hashPrioritsedChild);
+ - ]
737 [ + - + - ]: 2 : BOOST_CHECK(block.vtx[5]->GetHash() == hashFreeChild);
738 [ - + + + ]: 7 : for (size_t i=0; i<block.vtx.size(); ++i) {
739 : : // The FreeParent and FreeChild's prioritisations should not impact the child.
740 [ + - + - : 12 : BOOST_CHECK(block.vtx[i]->GetHash() != hashFreeGrandchild);
+ - ]
741 : : // De-prioritised transaction should not be included.
742 [ + - + - ]: 12 : BOOST_CHECK(block.vtx[i]->GetHash() != hashMediumFeeTx);
743 : : }
744 [ + - ]: 3 : }
745 : :
746 : : // NOTE: These tests rely on CreateNewBlock doing its own self-validation!
747 [ + - + - : 7 : BOOST_AUTO_TEST_CASE(CreateNewBlock_validity)
+ - + - -
+ + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- + - + -
+ - + - +
- + - - +
+ - + - +
- + - + -
+ - - + +
- ]
748 : : {
749 : 1 : auto mining{MakeMining()};
750 [ + - + - ]: 2 : BOOST_REQUIRE(mining);
751 : :
752 : : // Note that by default, these tests run with size accounting enabled.
753 [ + - ]: 1 : CScript scriptPubKey = CScript() << "04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f"_hex << OP_CHECKSIG;
754 [ + - ]: 1 : BlockAssembler::Options options;
755 : 1 : options.coinbase_output_script = scriptPubKey;
756 : 1 : options.include_dummy_extranonce = true;
757 : :
758 : : // Create and check a simple template
759 [ + - ]: 1 : std::unique_ptr<BlockTemplate> block_template = mining->createNewBlock(options, /*cooldown=*/false);
760 [ + - + - : 2 : BOOST_REQUIRE(block_template);
+ - ]
761 : 1 : {
762 [ + - ]: 1 : CBlock block{block_template->getBlock()};
763 : 1 : {
764 [ + - ]: 1 : std::string reason;
765 : 1 : std::string debug;
766 [ + - + - : 2 : BOOST_REQUIRE(!mining->checkBlock(block, {.check_pow = false}, reason, debug));
+ - + - ]
767 [ + - + - ]: 1 : BOOST_REQUIRE_EQUAL(reason, "bad-txnmrklroot");
768 [ + - + - ]: 1 : BOOST_REQUIRE_EQUAL(debug, "hashMerkleRoot mismatch");
769 : 1 : }
770 : :
771 [ + - ]: 1 : block.hashMerkleRoot = BlockMerkleRoot(block);
772 : :
773 : 1 : {
774 [ + - ]: 1 : std::string reason;
775 : 1 : std::string debug;
776 [ + - + - : 2 : BOOST_REQUIRE(mining->checkBlock(block, {.check_pow = false}, reason, debug));
+ - + - ]
777 [ + - + - ]: 1 : BOOST_REQUIRE_EQUAL(reason, "");
778 [ + - + - ]: 1 : BOOST_REQUIRE_EQUAL(debug, "");
779 : 1 : }
780 : :
781 : 1 : {
782 : : // A block template does not have proof-of-work, but it might pass
783 : : // verification by coincidence. Grind the nonce if needed:
784 [ - + + - : 1 : while (CheckProofOfWork(block.GetHash(), block.nBits, Assert(m_node.chainman)->GetParams().GetConsensus())) {
+ - - + ]
785 : 0 : block.nNonce++;
786 : : }
787 : :
788 [ + - ]: 1 : std::string reason;
789 : 1 : std::string debug;
790 [ + - + - : 2 : BOOST_REQUIRE(!mining->checkBlock(block, {.check_pow = true}, reason, debug));
+ - + - ]
791 [ + - + - ]: 1 : BOOST_REQUIRE_EQUAL(reason, "high-hash");
792 [ + - + - ]: 1 : BOOST_REQUIRE_EQUAL(debug, "proof of work failed");
793 : 1 : }
794 : 0 : }
795 : :
796 : : // We can't make transactions until we have inputs
797 : : // Therefore, load 110 blocks :)
798 : 1 : static_assert(std::size(BLOCKINFO) == 110, "Should have 110 blocks to import");
799 : 1 : int baseheight = 0;
800 : 1 : std::vector<CTransactionRef> txFirst;
801 [ + + ]: 111 : for (const auto& bi : BLOCKINFO) {
802 [ + - ]: 110 : const int current_height{mining->getTip()->height};
803 : :
804 : : /**
805 : : * Simple block creation, nothing special yet.
806 : : * If current_height is odd, block_template will have already been
807 : : * set at the end of the previous loop.
808 : : */
809 [ + + ]: 110 : if (current_height % 2 == 0) {
810 [ + - ]: 110 : block_template = mining->createNewBlock(options, /*cooldown=*/false);
811 [ + - + - ]: 110 : BOOST_REQUIRE(block_template);
812 : : }
813 : :
814 [ + - ]: 110 : CBlock block{block_template->getBlock()};
815 [ + - ]: 110 : CMutableTransaction txCoinbase(*block.vtx[0]);
816 : 110 : {
817 [ + - ]: 110 : LOCK(cs_main);
818 : 110 : block.nVersion = VERSIONBITS_TOP_BITS;
819 [ - + + - : 220 : block.nTime = Assert(m_node.chainman)->ActiveChain().Tip()->GetMedianTimePast()+1;
- + ]
820 : 110 : txCoinbase.version = 1;
821 [ + - + - ]: 110 : txCoinbase.vin[0].scriptSig = CScript{} << (current_height + 1) << bi.extranonce;
822 [ + - ]: 110 : txCoinbase.vout.resize(1); // Ignore the (optional) segwit commitment added by CreateNewBlock (as the hardcoded nonces don't account for this)
823 : 110 : txCoinbase.vout[0].scriptPubKey = CScript();
824 [ + - - + ]: 220 : block.vtx[0] = MakeTransactionRef(txCoinbase);
825 [ - + + + ]: 110 : if (txFirst.size() == 0)
826 : 1 : baseheight = current_height;
827 [ + + ]: 110 : if (txFirst.size() < 4)
828 [ + - ]: 4 : txFirst.push_back(block.vtx[0]);
829 [ + - ]: 110 : block.hashMerkleRoot = BlockMerkleRoot(block);
830 [ + - ]: 110 : block.nNonce = bi.nonce;
831 : 0 : }
832 [ + - ]: 110 : std::shared_ptr<const CBlock> shared_pblock = std::make_shared<const CBlock>(block);
833 : : // Alternate calls between Chainman's ProcessNewBlock and submitSolution
834 : : // via the Mining interface. The former is used by net_processing as well
835 : : // as the submitblock RPC.
836 [ + + ]: 110 : if (current_height % 2 == 0) {
837 [ + - - + : 110 : BOOST_REQUIRE(Assert(m_node.chainman)->ProcessNewBlock(shared_pblock, /*force_processing=*/true, /*min_pow_checked=*/true, nullptr));
+ - + - ]
838 : : } else {
839 [ + - + - : 165 : BOOST_REQUIRE(block_template->submitSolution(block.nVersion, block.nTime, block.nNonce, MakeTransactionRef(txCoinbase)));
+ - + - -
+ ]
840 : : }
841 : 110 : {
842 [ + - ]: 110 : LOCK(cs_main);
843 : : // The above calls don't guarantee the tip is actually updated, so
844 : : // we explicitly check this.
845 [ - + + - : 110 : auto maybe_new_tip{Assert(m_node.chainman)->ActiveChain().Tip()};
- + ]
846 [ + - + - : 110 : BOOST_REQUIRE_EQUAL(maybe_new_tip->GetBlockHash(), block.GetHash());
+ - + - ]
847 : 0 : }
848 [ + + ]: 110 : if (current_height % 2 == 0) {
849 [ + - ]: 110 : block_template = block_template->waitNext();
850 [ + - + - ]: 110 : BOOST_REQUIRE(block_template);
851 : : } else {
852 : : // This just adds coverage
853 [ + - ]: 55 : mining->waitTipChanged(block.hashPrevBlock);
854 : : }
855 : 220 : }
856 : :
857 [ + - ]: 1 : LOCK(cs_main);
858 : :
859 [ + - ]: 1 : TestBasicMining(scriptPubKey, txFirst, baseheight);
860 : :
861 [ + - - + ]: 1 : m_node.chainman->ActiveChain().Tip()->nHeight--;
862 [ + - ]: 1 : SetMockTime(0);
863 : :
864 [ + - ]: 1 : TestPackageSelection(scriptPubKey, txFirst);
865 : :
866 [ + - - + ]: 1 : m_node.chainman->ActiveChain().Tip()->nHeight--;
867 [ + - ]: 1 : SetMockTime(0);
868 : :
869 [ + - ]: 1 : TestPrioritisedMining(scriptPubKey, txFirst);
870 : 1 : }
871 : :
872 : : BOOST_AUTO_TEST_SUITE_END()
|
