Bitcoin Core 29.99.0
P2P Digital Currency
miner_tests.cpp
Go to the documentation of this file.
1// Copyright (c) 2011-2022 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>
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/txmempool.h>
16#include <txmempool.h>
17#include <uint256.h>
18#include <util/check.h>
19#include <util/feefrac.h>
20#include <util/strencodings.h>
21#include <util/time.h>
22#include <util/translation.h>
23#include <validation.h>
24#include <versionbits.h>
25#include <pow.h>
26
28
29#include <memory>
30#include <vector>
31
32#include <boost/test/unit_test.hpp>
33
34using namespace util::hex_literals;
38
39namespace miner_tests {
41 void TestPackageSelection(const CScript& scriptPubKey, const std::vector<CTransactionRef>& txFirst) EXCLUSIVE_LOCKS_REQUIRED(::cs_main);
42 void TestBasicMining(const CScript& scriptPubKey, const std::vector<CTransactionRef>& txFirst, int baseheight) EXCLUSIVE_LOCKS_REQUIRED(::cs_main);
43 void TestPrioritisedMining(const CScript& scriptPubKey, const std::vector<CTransactionRef>& txFirst) EXCLUSIVE_LOCKS_REQUIRED(::cs_main);
45 {
46 CCoinsViewMemPool view_mempool{&m_node.chainman->ActiveChainstate().CoinsTip(), tx_mempool};
47 CBlockIndex* tip{m_node.chainman->ActiveChain().Tip()};
48 const std::optional<LockPoints> lock_points{CalculateLockPointsAtTip(tip, view_mempool, tx)};
49 return lock_points.has_value() && CheckSequenceLocksAtTip(tip, *lock_points);
50 }
52 {
53 // Delete the previous mempool to ensure with valgrind that the old
54 // pointer is not accessed, when the new one should be accessed
55 // instead.
56 m_node.mempool.reset();
57 bilingual_str error;
58 m_node.mempool = std::make_unique<CTxMemPool>(MemPoolOptionsForTest(m_node), error);
59 Assert(error.empty());
60 return *m_node.mempool;
61 }
62 std::unique_ptr<Mining> MakeMining()
63 {
65 }
66};
67} // namespace miner_tests
68
69BOOST_FIXTURE_TEST_SUITE(miner_tests, MinerTestingSetup)
70
72
73constexpr static struct {
74 unsigned int extranonce;
75 unsigned int nonce;
76} BLOCKINFO[]{{0, 3552706918}, {500, 37506755}, {1000, 948987788}, {400, 524762339}, {800, 258510074}, {300, 102309278},
77 {1300, 54365202}, {600, 1107740426}, {1000, 203094491}, {900, 391178848}, {800, 381177271}, {600, 87188412},
78 {0, 66522866}, {800, 874942736}, {1000, 89200838}, {400, 312638088}, {400, 66263693}, {500, 924648304},
79 {400, 369913599}, {500, 47630099}, {500, 115045364}, {100, 277026602}, {1100, 809621409}, {700, 155345322},
80 {800, 943579953}, {400, 28200730}, {900, 77200495}, {0, 105935488}, {400, 698721821}, {500, 111098863},
81 {1300, 445389594}, {500, 621849894}, {1400, 56010046}, {1100, 370669776}, {1200, 380301940}, {1200, 110654905},
82 {400, 213771024}, {1500, 120014726}, {1200, 835019014}, {1500, 624817237}, {900, 1404297}, {400, 189414558},
83 {400, 293178348}, {1100, 15393789}, {600, 396764180}, {800, 1387046371}, {800, 199368303}, {700, 111496662},
84 {100, 129759616}, {200, 536577982}, {500, 125881300}, {500, 101053391}, {1200, 471590548}, {900, 86957729},
85 {1200, 179604104}, {600, 68658642}, {1000, 203295701}, {500, 139615361}, {900, 233693412}, {300, 153225163},
86 {0, 27616254}, {1200, 9856191}, {100, 220392722}, {200, 66257599}, {1100, 145489641}, {1300, 37859442},
87 {400, 5816075}, {1200, 215752117}, {1400, 32361482}, {1400, 6529223}, {500, 143332977}, {800, 878392},
88 {700, 159290408}, {400, 123197595}, {700, 43988693}, {300, 304224916}, {700, 214771621}, {1100, 274148273},
89 {400, 285632418}, {1100, 923451065}, {600, 12818092}, {1200, 736282054}, {1000, 246683167}, {600, 92950402},
90 {1400, 29223405}, {1000, 841327192}, {700, 174301283}, {1400, 214009854}, {1000, 6989517}, {1200, 278226956},
91 {700, 540219613}, {400, 93663104}, {1100, 152345635}, {1500, 464194499}, {1300, 333850111}, {600, 258311263},
92 {600, 90173162}, {1000, 33590797}, {1500, 332866027}, {100, 204704427}, {1000, 463153545}, {800, 303244785},
93 {600, 88096214}, {0, 137477892}, {1200, 195514506}, {300, 704114595}, {900, 292087369}, {1400, 758684870},
94 {1300, 163493028}, {1200, 53151293}};
95
96static std::unique_ptr<CBlockIndex> CreateBlockIndex(int nHeight, CBlockIndex* active_chain_tip) EXCLUSIVE_LOCKS_REQUIRED(cs_main)
97{
98 auto index{std::make_unique<CBlockIndex>()};
99 index->nHeight = nHeight;
100 index->pprev = active_chain_tip;
101 return index;
102}
103
104// Test suite for ancestor feerate transaction selection.
105// Implemented as an additional function, rather than a separate test case,
106// to allow reusing the blockchain created in CreateNewBlock_validity.
107void MinerTestingSetup::TestPackageSelection(const CScript& scriptPubKey, const std::vector<CTransactionRef>& txFirst)
108{
109 CTxMemPool& tx_mempool{MakeMempool()};
110 auto mining{MakeMining()};
111 BlockAssembler::Options options;
112 options.coinbase_output_script = scriptPubKey;
113
114 LOCK(tx_mempool.cs);
115 // Test the ancestor feerate transaction selection.
117
118 // Test that a medium fee transaction will be selected after a higher fee
119 // rate package with a low fee rate parent.
121 tx.vin.resize(1);
122 tx.vin[0].scriptSig = CScript() << OP_1;
123 tx.vin[0].prevout.hash = txFirst[0]->GetHash();
124 tx.vin[0].prevout.n = 0;
125 tx.vout.resize(1);
126 tx.vout[0].nValue = 5000000000LL - 1000;
127 // This tx has a low fee: 1000 satoshis
128 Txid hashParentTx = tx.GetHash(); // save this txid for later use
129 const auto parent_tx{entry.Fee(1000).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx)};
130 AddToMempool(tx_mempool, parent_tx);
131
132 // This tx has a medium fee: 10000 satoshis
133 tx.vin[0].prevout.hash = txFirst[1]->GetHash();
134 tx.vout[0].nValue = 5000000000LL - 10000;
135 Txid hashMediumFeeTx = tx.GetHash();
136 const auto medium_fee_tx{entry.Fee(10000).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx)};
137 AddToMempool(tx_mempool, medium_fee_tx);
138
139 // This tx has a high fee, but depends on the first transaction
140 tx.vin[0].prevout.hash = hashParentTx;
141 tx.vout[0].nValue = 5000000000LL - 1000 - 50000; // 50k satoshi fee
142 Txid hashHighFeeTx = tx.GetHash();
143 const auto high_fee_tx{entry.Fee(50000).Time(Now<NodeSeconds>()).SpendsCoinbase(false).FromTx(tx)};
144 AddToMempool(tx_mempool, high_fee_tx);
145
146 std::unique_ptr<BlockTemplate> block_template = mining->createNewBlock(options);
147 BOOST_REQUIRE(block_template);
148 CBlock block{block_template->getBlock()};
149 BOOST_REQUIRE_EQUAL(block.vtx.size(), 4U);
150 BOOST_CHECK(block.vtx[1]->GetHash() == hashParentTx);
151 BOOST_CHECK(block.vtx[2]->GetHash() == hashHighFeeTx);
152 BOOST_CHECK(block.vtx[3]->GetHash() == hashMediumFeeTx);
153
154 // Test the inclusion of package feerates in the block template and ensure they are sequential.
155 const auto block_package_feerates = BlockAssembler{m_node.chainman->ActiveChainstate(), &tx_mempool, options}.CreateNewBlock()->m_package_feerates;
156 BOOST_CHECK(block_package_feerates.size() == 2);
157
158 // parent_tx and high_fee_tx are added to the block as a package.
159 const auto combined_txs_fee = parent_tx.GetFee() + high_fee_tx.GetFee();
160 const auto combined_txs_size = parent_tx.GetTxSize() + high_fee_tx.GetTxSize();
161 FeeFrac package_feefrac{combined_txs_fee, combined_txs_size};
162 // The package should be added first.
163 BOOST_CHECK(block_package_feerates[0] == package_feefrac);
164
165 // The medium_fee_tx should be added next.
166 FeeFrac medium_tx_feefrac{medium_fee_tx.GetFee(), medium_fee_tx.GetTxSize()};
167 BOOST_CHECK(block_package_feerates[1] == medium_tx_feefrac);
168
169 // Test that a package below the block min tx fee doesn't get included
170 tx.vin[0].prevout.hash = hashHighFeeTx;
171 tx.vout[0].nValue = 5000000000LL - 1000 - 50000; // 0 fee
172 Txid hashFreeTx = tx.GetHash();
173 AddToMempool(tx_mempool, entry.Fee(0).FromTx(tx));
174 size_t freeTxSize = ::GetSerializeSize(TX_WITH_WITNESS(tx));
175
176 // Calculate a fee on child transaction that will put the package just
177 // below the block min tx fee (assuming 1 child tx of the same size).
178 CAmount feeToUse = blockMinFeeRate.GetFee(2*freeTxSize) - 1;
179
180 tx.vin[0].prevout.hash = hashFreeTx;
181 tx.vout[0].nValue = 5000000000LL - 1000 - 50000 - feeToUse;
182 Txid hashLowFeeTx = tx.GetHash();
183 AddToMempool(tx_mempool, entry.Fee(feeToUse).FromTx(tx));
184
185 // waitNext() should return nullptr because there is no better template
186 auto should_be_nullptr = block_template->waitNext({.timeout = MillisecondsDouble{0}, .fee_threshold = 1});
187 BOOST_REQUIRE(should_be_nullptr == nullptr);
188
189 block = block_template->getBlock();
190 // Verify that the free tx and the low fee tx didn't get selected
191 for (size_t i=0; i<block.vtx.size(); ++i) {
192 BOOST_CHECK(block.vtx[i]->GetHash() != hashFreeTx);
193 BOOST_CHECK(block.vtx[i]->GetHash() != hashLowFeeTx);
194 }
195
196 // Test that packages above the min relay fee do get included, even if one
197 // of the transactions is below the min relay fee
198 // Remove the low fee transaction and replace with a higher fee transaction
199 tx_mempool.removeRecursive(CTransaction(tx), MemPoolRemovalReason::REPLACED);
200 tx.vout[0].nValue -= 2; // Now we should be just over the min relay fee
201 hashLowFeeTx = tx.GetHash();
202 AddToMempool(tx_mempool, entry.Fee(feeToUse + 2).FromTx(tx));
203
204 // waitNext() should return if fees for the new template are at least 1 sat up
205 block_template = block_template->waitNext({.fee_threshold = 1});
206 BOOST_REQUIRE(block_template);
207 block = block_template->getBlock();
208 BOOST_REQUIRE_EQUAL(block.vtx.size(), 6U);
209 BOOST_CHECK(block.vtx[4]->GetHash() == hashFreeTx);
210 BOOST_CHECK(block.vtx[5]->GetHash() == hashLowFeeTx);
211
212 // Test that transaction selection properly updates ancestor fee
213 // calculations as ancestor transactions get included in a block.
214 // Add a 0-fee transaction that has 2 outputs.
215 tx.vin[0].prevout.hash = txFirst[2]->GetHash();
216 tx.vout.resize(2);
217 tx.vout[0].nValue = 5000000000LL - 100000000;
218 tx.vout[1].nValue = 100000000; // 1BTC output
219 Txid hashFreeTx2 = tx.GetHash();
220 AddToMempool(tx_mempool, entry.Fee(0).SpendsCoinbase(true).FromTx(tx));
221
222 // This tx can't be mined by itself
223 tx.vin[0].prevout.hash = hashFreeTx2;
224 tx.vout.resize(1);
225 feeToUse = blockMinFeeRate.GetFee(freeTxSize);
226 tx.vout[0].nValue = 5000000000LL - 100000000 - feeToUse;
227 Txid hashLowFeeTx2 = tx.GetHash();
228 AddToMempool(tx_mempool, entry.Fee(feeToUse).SpendsCoinbase(false).FromTx(tx));
229 block_template = mining->createNewBlock(options);
230 BOOST_REQUIRE(block_template);
231 block = block_template->getBlock();
232
233 // Verify that this tx isn't selected.
234 for (size_t i=0; i<block.vtx.size(); ++i) {
235 BOOST_CHECK(block.vtx[i]->GetHash() != hashFreeTx2);
236 BOOST_CHECK(block.vtx[i]->GetHash() != hashLowFeeTx2);
237 }
238
239 // This tx will be mineable, and should cause hashLowFeeTx2 to be selected
240 // as well.
241 tx.vin[0].prevout.n = 1;
242 tx.vout[0].nValue = 100000000 - 10000; // 10k satoshi fee
243 AddToMempool(tx_mempool, entry.Fee(10000).FromTx(tx));
244 block_template = mining->createNewBlock(options);
245 BOOST_REQUIRE(block_template);
246 block = block_template->getBlock();
247 BOOST_REQUIRE_EQUAL(block.vtx.size(), 9U);
248 BOOST_CHECK(block.vtx[8]->GetHash() == hashLowFeeTx2);
249}
250
251void MinerTestingSetup::TestBasicMining(const CScript& scriptPubKey, const std::vector<CTransactionRef>& txFirst, int baseheight)
252{
253 Txid hash;
256 entry.nFee = 11;
257 entry.nHeight = 11;
258
259 const CAmount BLOCKSUBSIDY = 50 * COIN;
260 const CAmount LOWFEE = CENT;
261 const CAmount HIGHFEE = COIN;
262 const CAmount HIGHERFEE = 4 * COIN;
263
264 auto mining{MakeMining()};
265 BOOST_REQUIRE(mining);
266
267 BlockAssembler::Options options;
268 options.coinbase_output_script = scriptPubKey;
269
270 {
271 CTxMemPool& tx_mempool{MakeMempool()};
272 LOCK(tx_mempool.cs);
273
274 // Just to make sure we can still make simple blocks
275 auto block_template{mining->createNewBlock(options)};
276 BOOST_REQUIRE(block_template);
277 CBlock block{block_template->getBlock()};
278
279 // block sigops > limit: 1000 CHECKMULTISIG + 1
280 tx.vin.resize(1);
281 // NOTE: OP_NOP is used to force 20 SigOps for the CHECKMULTISIG
282 tx.vin[0].scriptSig = CScript() << OP_0 << OP_0 << OP_0 << OP_NOP << OP_CHECKMULTISIG << OP_1;
283 tx.vin[0].prevout.hash = txFirst[0]->GetHash();
284 tx.vin[0].prevout.n = 0;
285 tx.vout.resize(1);
286 tx.vout[0].nValue = BLOCKSUBSIDY;
287 for (unsigned int i = 0; i < 1001; ++i) {
288 tx.vout[0].nValue -= LOWFEE;
289 hash = tx.GetHash();
290 bool spendsCoinbase = i == 0; // only first tx spends coinbase
291 // If we don't set the # of sig ops in the CTxMemPoolEntry, template creation fails
292 AddToMempool(tx_mempool, entry.Fee(LOWFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(spendsCoinbase).FromTx(tx));
293 tx.vin[0].prevout.hash = hash;
294 }
295
296 BOOST_CHECK_EXCEPTION(mining->createNewBlock(options), std::runtime_error, HasReason("bad-blk-sigops"));
297 }
298
299 {
300 CTxMemPool& tx_mempool{MakeMempool()};
301 LOCK(tx_mempool.cs);
302
303 tx.vin[0].prevout.hash = txFirst[0]->GetHash();
304 tx.vout[0].nValue = BLOCKSUBSIDY;
305 for (unsigned int i = 0; i < 1001; ++i) {
306 tx.vout[0].nValue -= LOWFEE;
307 hash = tx.GetHash();
308 bool spendsCoinbase = i == 0; // only first tx spends coinbase
309 // If we do set the # of sig ops in the CTxMemPoolEntry, template creation passes
310 AddToMempool(tx_mempool, entry.Fee(LOWFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(spendsCoinbase).SigOpsCost(80).FromTx(tx));
311 tx.vin[0].prevout.hash = hash;
312 }
313 BOOST_REQUIRE(mining->createNewBlock(options));
314 }
315
316 {
317 CTxMemPool& tx_mempool{MakeMempool()};
318 LOCK(tx_mempool.cs);
319
320 // block size > limit
321 tx.vin[0].scriptSig = CScript();
322 // 18 * (520char + DROP) + OP_1 = 9433 bytes
323 std::vector<unsigned char> vchData(520);
324 for (unsigned int i = 0; i < 18; ++i) {
325 tx.vin[0].scriptSig << vchData << OP_DROP;
326 }
327 tx.vin[0].scriptSig << OP_1;
328 tx.vin[0].prevout.hash = txFirst[0]->GetHash();
329 tx.vout[0].nValue = BLOCKSUBSIDY;
330 for (unsigned int i = 0; i < 128; ++i) {
331 tx.vout[0].nValue -= LOWFEE;
332 hash = tx.GetHash();
333 bool spendsCoinbase = i == 0; // only first tx spends coinbase
334 AddToMempool(tx_mempool, entry.Fee(LOWFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(spendsCoinbase).FromTx(tx));
335 tx.vin[0].prevout.hash = hash;
336 }
337 BOOST_REQUIRE(mining->createNewBlock(options));
338 }
339
340 {
341 CTxMemPool& tx_mempool{MakeMempool()};
342 LOCK(tx_mempool.cs);
343
344 // orphan in tx_mempool, template creation fails
345 hash = tx.GetHash();
346 AddToMempool(tx_mempool, entry.Fee(LOWFEE).Time(Now<NodeSeconds>()).FromTx(tx));
347 BOOST_CHECK_EXCEPTION(mining->createNewBlock(options), std::runtime_error, HasReason("bad-txns-inputs-missingorspent"));
348 }
349
350 {
351 CTxMemPool& tx_mempool{MakeMempool()};
352 LOCK(tx_mempool.cs);
353
354 // child with higher feerate than parent
355 tx.vin[0].scriptSig = CScript() << OP_1;
356 tx.vin[0].prevout.hash = txFirst[1]->GetHash();
357 tx.vout[0].nValue = BLOCKSUBSIDY - HIGHFEE;
358 hash = tx.GetHash();
359 AddToMempool(tx_mempool, entry.Fee(HIGHFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx));
360 tx.vin[0].prevout.hash = hash;
361 tx.vin.resize(2);
362 tx.vin[1].scriptSig = CScript() << OP_1;
363 tx.vin[1].prevout.hash = txFirst[0]->GetHash();
364 tx.vin[1].prevout.n = 0;
365 tx.vout[0].nValue = tx.vout[0].nValue + BLOCKSUBSIDY - HIGHERFEE; // First txn output + fresh coinbase - new txn fee
366 hash = tx.GetHash();
367 AddToMempool(tx_mempool, entry.Fee(HIGHERFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx));
368 BOOST_REQUIRE(mining->createNewBlock(options));
369 }
370
371 {
372 CTxMemPool& tx_mempool{MakeMempool()};
373 LOCK(tx_mempool.cs);
374
375 // coinbase in tx_mempool, template creation fails
376 tx.vin.resize(1);
377 tx.vin[0].prevout.SetNull();
378 tx.vin[0].scriptSig = CScript() << OP_0 << OP_1;
379 tx.vout[0].nValue = 0;
380 hash = tx.GetHash();
381 // give it a fee so it'll get mined
382 AddToMempool(tx_mempool, entry.Fee(LOWFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(false).FromTx(tx));
383 // Should throw bad-cb-multiple
384 BOOST_CHECK_EXCEPTION(mining->createNewBlock(options), std::runtime_error, HasReason("bad-cb-multiple"));
385 }
386
387 {
388 CTxMemPool& tx_mempool{MakeMempool()};
389 LOCK(tx_mempool.cs);
390
391 // double spend txn pair in tx_mempool, template creation fails
392 tx.vin[0].prevout.hash = txFirst[0]->GetHash();
393 tx.vin[0].scriptSig = CScript() << OP_1;
394 tx.vout[0].nValue = BLOCKSUBSIDY - HIGHFEE;
395 tx.vout[0].scriptPubKey = CScript() << OP_1;
396 hash = tx.GetHash();
397 AddToMempool(tx_mempool, entry.Fee(HIGHFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx));
398 tx.vout[0].scriptPubKey = CScript() << OP_2;
399 hash = tx.GetHash();
400 AddToMempool(tx_mempool, entry.Fee(HIGHFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx));
401 BOOST_CHECK_EXCEPTION(mining->createNewBlock(options), std::runtime_error, HasReason("bad-txns-inputs-missingorspent"));
402 }
403
404 {
405 CTxMemPool& tx_mempool{MakeMempool()};
406 LOCK(tx_mempool.cs);
407
408 // subsidy changing
409 int nHeight = m_node.chainman->ActiveChain().Height();
410 // Create an actual 209999-long block chain (without valid blocks).
411 while (m_node.chainman->ActiveChain().Tip()->nHeight < 209999) {
412 CBlockIndex* prev = m_node.chainman->ActiveChain().Tip();
413 CBlockIndex* next = new CBlockIndex();
414 next->phashBlock = new uint256(m_rng.rand256());
415 m_node.chainman->ActiveChainstate().CoinsTip().SetBestBlock(next->GetBlockHash());
416 next->pprev = prev;
417 next->nHeight = prev->nHeight + 1;
418 next->BuildSkip();
419 m_node.chainman->ActiveChain().SetTip(*next);
420 }
421 BOOST_REQUIRE(mining->createNewBlock(options));
422 // Extend to a 210000-long block chain.
423 while (m_node.chainman->ActiveChain().Tip()->nHeight < 210000) {
424 CBlockIndex* prev = m_node.chainman->ActiveChain().Tip();
425 CBlockIndex* next = new CBlockIndex();
426 next->phashBlock = new uint256(m_rng.rand256());
427 m_node.chainman->ActiveChainstate().CoinsTip().SetBestBlock(next->GetBlockHash());
428 next->pprev = prev;
429 next->nHeight = prev->nHeight + 1;
430 next->BuildSkip();
431 m_node.chainman->ActiveChain().SetTip(*next);
432 }
433 BOOST_REQUIRE(mining->createNewBlock(options));
434
435 // invalid p2sh txn in tx_mempool, template creation fails
436 tx.vin[0].prevout.hash = txFirst[0]->GetHash();
437 tx.vin[0].prevout.n = 0;
438 tx.vin[0].scriptSig = CScript() << OP_1;
439 tx.vout[0].nValue = BLOCKSUBSIDY - LOWFEE;
440 CScript script = CScript() << OP_0;
441 tx.vout[0].scriptPubKey = GetScriptForDestination(ScriptHash(script));
442 hash = tx.GetHash();
443 AddToMempool(tx_mempool, entry.Fee(LOWFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx));
444 tx.vin[0].prevout.hash = hash;
445 tx.vin[0].scriptSig = CScript() << std::vector<unsigned char>(script.begin(), script.end());
446 tx.vout[0].nValue -= LOWFEE;
447 hash = tx.GetHash();
448 AddToMempool(tx_mempool, entry.Fee(LOWFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(false).FromTx(tx));
449 BOOST_CHECK_EXCEPTION(mining->createNewBlock(options), std::runtime_error, HasReason("mandatory-script-verify-flag-failed"));
450
451 // Delete the dummy blocks again.
452 while (m_node.chainman->ActiveChain().Tip()->nHeight > nHeight) {
453 CBlockIndex* del = m_node.chainman->ActiveChain().Tip();
454 m_node.chainman->ActiveChain().SetTip(*Assert(del->pprev));
455 m_node.chainman->ActiveChainstate().CoinsTip().SetBestBlock(del->pprev->GetBlockHash());
456 delete del->phashBlock;
457 delete del;
458 }
459 }
460
461 CTxMemPool& tx_mempool{MakeMempool()};
462 LOCK(tx_mempool.cs);
463
464 // non-final txs in mempool
465 SetMockTime(m_node.chainman->ActiveChain().Tip()->GetMedianTimePast() + 1);
467 // height map
468 std::vector<int> prevheights;
469
470 // relative height locked
471 tx.version = 2;
472 tx.vin.resize(1);
473 prevheights.resize(1);
474 tx.vin[0].prevout.hash = txFirst[0]->GetHash(); // only 1 transaction
475 tx.vin[0].prevout.n = 0;
476 tx.vin[0].scriptSig = CScript() << OP_1;
477 tx.vin[0].nSequence = m_node.chainman->ActiveChain().Tip()->nHeight + 1; // txFirst[0] is the 2nd block
478 prevheights[0] = baseheight + 1;
479 tx.vout.resize(1);
480 tx.vout[0].nValue = BLOCKSUBSIDY-HIGHFEE;
481 tx.vout[0].scriptPubKey = CScript() << OP_1;
482 tx.nLockTime = 0;
483 hash = tx.GetHash();
484 AddToMempool(tx_mempool, entry.Fee(HIGHFEE).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx));
485 BOOST_CHECK(CheckFinalTxAtTip(*Assert(m_node.chainman->ActiveChain().Tip()), CTransaction{tx})); // Locktime passes
486 BOOST_CHECK(!TestSequenceLocks(CTransaction{tx}, tx_mempool)); // Sequence locks fail
487
488 {
489 CBlockIndex* active_chain_tip = m_node.chainman->ActiveChain().Tip();
490 BOOST_CHECK(SequenceLocks(CTransaction(tx), flags, prevheights, *CreateBlockIndex(active_chain_tip->nHeight + 2, active_chain_tip))); // Sequence locks pass on 2nd block
491 }
492
493 // relative time locked
494 tx.vin[0].prevout.hash = txFirst[1]->GetHash();
495 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
496 prevheights[0] = baseheight + 2;
497 hash = tx.GetHash();
498 AddToMempool(tx_mempool, entry.Time(Now<NodeSeconds>()).FromTx(tx));
499 BOOST_CHECK(CheckFinalTxAtTip(*Assert(m_node.chainman->ActiveChain().Tip()), CTransaction{tx})); // Locktime passes
500 BOOST_CHECK(!TestSequenceLocks(CTransaction{tx}, tx_mempool)); // Sequence locks fail
501
502 const int SEQUENCE_LOCK_TIME = 512; // Sequence locks pass 512 seconds later
503 for (int i = 0; i < CBlockIndex::nMedianTimeSpan; ++i)
504 m_node.chainman->ActiveChain().Tip()->GetAncestor(m_node.chainman->ActiveChain().Tip()->nHeight - i)->nTime += SEQUENCE_LOCK_TIME; // Trick the MedianTimePast
505 {
506 CBlockIndex* active_chain_tip = m_node.chainman->ActiveChain().Tip();
507 BOOST_CHECK(SequenceLocks(CTransaction(tx), flags, prevheights, *CreateBlockIndex(active_chain_tip->nHeight + 1, active_chain_tip)));
508 }
509
510 for (int i = 0; i < CBlockIndex::nMedianTimeSpan; ++i) {
511 CBlockIndex* ancestor{Assert(m_node.chainman->ActiveChain().Tip()->GetAncestor(m_node.chainman->ActiveChain().Tip()->nHeight - i))};
512 ancestor->nTime -= SEQUENCE_LOCK_TIME; // undo tricked MTP
513 }
514
515 // absolute height locked
516 tx.vin[0].prevout.hash = txFirst[2]->GetHash();
517 tx.vin[0].nSequence = CTxIn::MAX_SEQUENCE_NONFINAL;
518 prevheights[0] = baseheight + 3;
519 tx.nLockTime = m_node.chainman->ActiveChain().Tip()->nHeight + 1;
520 hash = tx.GetHash();
521 AddToMempool(tx_mempool, entry.Time(Now<NodeSeconds>()).FromTx(tx));
522 BOOST_CHECK(!CheckFinalTxAtTip(*Assert(m_node.chainman->ActiveChain().Tip()), CTransaction{tx})); // Locktime fails
523 BOOST_CHECK(TestSequenceLocks(CTransaction{tx}, tx_mempool)); // Sequence locks pass
524 BOOST_CHECK(IsFinalTx(CTransaction(tx), m_node.chainman->ActiveChain().Tip()->nHeight + 2, m_node.chainman->ActiveChain().Tip()->GetMedianTimePast())); // Locktime passes on 2nd block
525
526 // absolute time locked
527 tx.vin[0].prevout.hash = txFirst[3]->GetHash();
528 tx.nLockTime = m_node.chainman->ActiveChain().Tip()->GetMedianTimePast();
529 prevheights.resize(1);
530 prevheights[0] = baseheight + 4;
531 hash = tx.GetHash();
532 AddToMempool(tx_mempool, entry.Time(Now<NodeSeconds>()).FromTx(tx));
533 BOOST_CHECK(!CheckFinalTxAtTip(*Assert(m_node.chainman->ActiveChain().Tip()), CTransaction{tx})); // Locktime fails
534 BOOST_CHECK(TestSequenceLocks(CTransaction{tx}, tx_mempool)); // Sequence locks pass
535 BOOST_CHECK(IsFinalTx(CTransaction(tx), m_node.chainman->ActiveChain().Tip()->nHeight + 2, m_node.chainman->ActiveChain().Tip()->GetMedianTimePast() + 1)); // Locktime passes 1 second later
536
537 // mempool-dependent transactions (not added)
538 tx.vin[0].prevout.hash = hash;
539 prevheights[0] = m_node.chainman->ActiveChain().Tip()->nHeight + 1;
540 tx.nLockTime = 0;
541 tx.vin[0].nSequence = 0;
542 BOOST_CHECK(CheckFinalTxAtTip(*Assert(m_node.chainman->ActiveChain().Tip()), CTransaction{tx})); // Locktime passes
543 BOOST_CHECK(TestSequenceLocks(CTransaction{tx}, tx_mempool)); // Sequence locks pass
544 tx.vin[0].nSequence = 1;
545 BOOST_CHECK(!TestSequenceLocks(CTransaction{tx}, tx_mempool)); // Sequence locks fail
546 tx.vin[0].nSequence = CTxIn::SEQUENCE_LOCKTIME_TYPE_FLAG;
547 BOOST_CHECK(TestSequenceLocks(CTransaction{tx}, tx_mempool)); // Sequence locks pass
548 tx.vin[0].nSequence = CTxIn::SEQUENCE_LOCKTIME_TYPE_FLAG | 1;
549 BOOST_CHECK(!TestSequenceLocks(CTransaction{tx}, tx_mempool)); // Sequence locks fail
550
551 auto block_template = mining->createNewBlock(options);
552 BOOST_REQUIRE(block_template);
553
554 // None of the of the absolute height/time locked tx should have made
555 // it into the template because we still check IsFinalTx in CreateNewBlock,
556 // but relative locked txs will if inconsistently added to mempool.
557 // For now these will still generate a valid template until BIP68 soft fork
558 CBlock block{block_template->getBlock()};
559 BOOST_CHECK_EQUAL(block.vtx.size(), 3U);
560 // However if we advance height by 1 and time by SEQUENCE_LOCK_TIME, all of them should be mined
561 for (int i = 0; i < CBlockIndex::nMedianTimeSpan; ++i) {
562 CBlockIndex* ancestor{Assert(m_node.chainman->ActiveChain().Tip()->GetAncestor(m_node.chainman->ActiveChain().Tip()->nHeight - i))};
563 ancestor->nTime += SEQUENCE_LOCK_TIME; // Trick the MedianTimePast
564 }
565 m_node.chainman->ActiveChain().Tip()->nHeight++;
566 SetMockTime(m_node.chainman->ActiveChain().Tip()->GetMedianTimePast() + 1);
567
568 block_template = mining->createNewBlock(options);
569 BOOST_REQUIRE(block_template);
570 block = block_template->getBlock();
571 BOOST_CHECK_EQUAL(block.vtx.size(), 5U);
572}
573
574void MinerTestingSetup::TestPrioritisedMining(const CScript& scriptPubKey, const std::vector<CTransactionRef>& txFirst)
575{
576 auto mining{MakeMining()};
577 BOOST_REQUIRE(mining);
578
579 BlockAssembler::Options options;
580 options.coinbase_output_script = scriptPubKey;
581
582 CTxMemPool& tx_mempool{MakeMempool()};
583 LOCK(tx_mempool.cs);
584
586
587 // Test that a tx below min fee but prioritised is included
589 tx.vin.resize(1);
590 tx.vin[0].prevout.hash = txFirst[0]->GetHash();
591 tx.vin[0].prevout.n = 0;
592 tx.vin[0].scriptSig = CScript() << OP_1;
593 tx.vout.resize(1);
594 tx.vout[0].nValue = 5000000000LL; // 0 fee
595 uint256 hashFreePrioritisedTx = tx.GetHash();
596 AddToMempool(tx_mempool, entry.Fee(0).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx));
597 tx_mempool.PrioritiseTransaction(hashFreePrioritisedTx, 5 * COIN);
598
599 tx.vin[0].prevout.hash = txFirst[1]->GetHash();
600 tx.vin[0].prevout.n = 0;
601 tx.vout[0].nValue = 5000000000LL - 1000;
602 // This tx has a low fee: 1000 satoshis
603 Txid hashParentTx = tx.GetHash(); // save this txid for later use
604 AddToMempool(tx_mempool, entry.Fee(1000).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx));
605
606 // This tx has a medium fee: 10000 satoshis
607 tx.vin[0].prevout.hash = txFirst[2]->GetHash();
608 tx.vout[0].nValue = 5000000000LL - 10000;
609 Txid hashMediumFeeTx = tx.GetHash();
610 AddToMempool(tx_mempool, entry.Fee(10000).Time(Now<NodeSeconds>()).SpendsCoinbase(true).FromTx(tx));
611 tx_mempool.PrioritiseTransaction(hashMediumFeeTx, -5 * COIN);
612
613 // This tx also has a low fee, but is prioritised
614 tx.vin[0].prevout.hash = hashParentTx;
615 tx.vout[0].nValue = 5000000000LL - 1000 - 1000; // 1000 satoshi fee
616 Txid hashPrioritsedChild = tx.GetHash();
617 AddToMempool(tx_mempool, entry.Fee(1000).Time(Now<NodeSeconds>()).SpendsCoinbase(false).FromTx(tx));
618 tx_mempool.PrioritiseTransaction(hashPrioritsedChild, 2 * COIN);
619
620 // Test that transaction selection properly updates ancestor fee calculations as prioritised
621 // parents get included in a block. Create a transaction with two prioritised ancestors, each
622 // included by itself: FreeParent <- FreeChild <- FreeGrandchild.
623 // When FreeParent is added, a modified entry will be created for FreeChild + FreeGrandchild
624 // FreeParent's prioritisation should not be included in that entry.
625 // When FreeChild is included, FreeChild's prioritisation should also not be included.
626 tx.vin[0].prevout.hash = txFirst[3]->GetHash();
627 tx.vout[0].nValue = 5000000000LL; // 0 fee
628 Txid hashFreeParent = tx.GetHash();
629 AddToMempool(tx_mempool, entry.Fee(0).SpendsCoinbase(true).FromTx(tx));
630 tx_mempool.PrioritiseTransaction(hashFreeParent, 10 * COIN);
631
632 tx.vin[0].prevout.hash = hashFreeParent;
633 tx.vout[0].nValue = 5000000000LL; // 0 fee
634 Txid hashFreeChild = tx.GetHash();
635 AddToMempool(tx_mempool, entry.Fee(0).SpendsCoinbase(false).FromTx(tx));
636 tx_mempool.PrioritiseTransaction(hashFreeChild, 1 * COIN);
637
638 tx.vin[0].prevout.hash = hashFreeChild;
639 tx.vout[0].nValue = 5000000000LL; // 0 fee
640 Txid hashFreeGrandchild = tx.GetHash();
641 AddToMempool(tx_mempool, entry.Fee(0).SpendsCoinbase(false).FromTx(tx));
642
643 auto block_template = mining->createNewBlock(options);
644 BOOST_REQUIRE(block_template);
645 CBlock block{block_template->getBlock()};
646 BOOST_REQUIRE_EQUAL(block.vtx.size(), 6U);
647 BOOST_CHECK(block.vtx[1]->GetHash() == hashFreeParent);
648 BOOST_CHECK(block.vtx[2]->GetHash() == hashFreePrioritisedTx);
649 BOOST_CHECK(block.vtx[3]->GetHash() == hashParentTx);
650 BOOST_CHECK(block.vtx[4]->GetHash() == hashPrioritsedChild);
651 BOOST_CHECK(block.vtx[5]->GetHash() == hashFreeChild);
652 for (size_t i=0; i<block.vtx.size(); ++i) {
653 // The FreeParent and FreeChild's prioritisations should not impact the child.
654 BOOST_CHECK(block.vtx[i]->GetHash() != hashFreeGrandchild);
655 // De-prioritised transaction should not be included.
656 BOOST_CHECK(block.vtx[i]->GetHash() != hashMediumFeeTx);
657 }
658}
659
660// NOTE: These tests rely on CreateNewBlock doing its own self-validation!
661BOOST_AUTO_TEST_CASE(CreateNewBlock_validity)
662{
663 auto mining{MakeMining()};
664 BOOST_REQUIRE(mining);
665
666 // Note that by default, these tests run with size accounting enabled.
667 CScript scriptPubKey = CScript() << "04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f"_hex << OP_CHECKSIG;
668 BlockAssembler::Options options;
669 options.coinbase_output_script = scriptPubKey;
670
671 // Create and check a simple template
672 std::unique_ptr<BlockTemplate> block_template = mining->createNewBlock(options);
673 BOOST_REQUIRE(block_template);
674 {
675 CBlock block{block_template->getBlock()};
676 {
677 std::string reason;
678 std::string debug;
679 BOOST_REQUIRE(!mining->checkBlock(block, {.check_pow = false}, reason, debug));
680 BOOST_REQUIRE_EQUAL(reason, "bad-txnmrklroot");
681 BOOST_REQUIRE_EQUAL(debug, "hashMerkleRoot mismatch");
682 }
683
684 block.hashMerkleRoot = BlockMerkleRoot(block);
685
686 {
687 std::string reason;
688 std::string debug;
689 BOOST_REQUIRE(mining->checkBlock(block, {.check_pow = false}, reason, debug));
690 BOOST_REQUIRE_EQUAL(reason, "");
691 BOOST_REQUIRE_EQUAL(debug, "");
692 }
693
694 {
695 // A block template does not have proof-of-work, but it might pass
696 // verification by coincidence. Grind the nonce if needed:
697 while (CheckProofOfWork(block.GetHash(), block.nBits, Assert(m_node.chainman)->GetParams().GetConsensus())) {
698 block.nNonce++;
699 }
700
701 std::string reason;
702 std::string debug;
703 BOOST_REQUIRE(!mining->checkBlock(block, {.check_pow = true}, reason, debug));
704 BOOST_REQUIRE_EQUAL(reason, "high-hash");
705 BOOST_REQUIRE_EQUAL(debug, "proof of work failed");
706 }
707 }
708
709 // We can't make transactions until we have inputs
710 // Therefore, load 110 blocks :)
711 static_assert(std::size(BLOCKINFO) == 110, "Should have 110 blocks to import");
712 int baseheight = 0;
713 std::vector<CTransactionRef> txFirst;
714 for (const auto& bi : BLOCKINFO) {
715 const int current_height{mining->getTip()->height};
716
722 if (current_height % 2 == 0) {
723 block_template = mining->createNewBlock(options);
724 BOOST_REQUIRE(block_template);
725 }
726
727 CBlock block{block_template->getBlock()};
728 CMutableTransaction txCoinbase(*block.vtx[0]);
729 {
730 LOCK(cs_main);
731 block.nVersion = VERSIONBITS_TOP_BITS;
732 block.nTime = Assert(m_node.chainman)->ActiveChain().Tip()->GetMedianTimePast()+1;
733 txCoinbase.version = 1;
734 txCoinbase.vin[0].scriptSig = CScript{} << (current_height + 1) << bi.extranonce;
735 txCoinbase.vout.resize(1); // Ignore the (optional) segwit commitment added by CreateNewBlock (as the hardcoded nonces don't account for this)
736 txCoinbase.vout[0].scriptPubKey = CScript();
737 block.vtx[0] = MakeTransactionRef(txCoinbase);
738 if (txFirst.size() == 0)
739 baseheight = current_height;
740 if (txFirst.size() < 4)
741 txFirst.push_back(block.vtx[0]);
742 block.hashMerkleRoot = BlockMerkleRoot(block);
743 block.nNonce = bi.nonce;
744 }
745 std::shared_ptr<const CBlock> shared_pblock = std::make_shared<const CBlock>(block);
746 // Alternate calls between Chainman's ProcessNewBlock and submitSolution
747 // via the Mining interface. The former is used by net_processing as well
748 // as the submitblock RPC.
749 if (current_height % 2 == 0) {
750 BOOST_REQUIRE(Assert(m_node.chainman)->ProcessNewBlock(shared_pblock, /*force_processing=*/true, /*min_pow_checked=*/true, nullptr));
751 } else {
752 BOOST_REQUIRE(block_template->submitSolution(block.nVersion, block.nTime, block.nNonce, MakeTransactionRef(txCoinbase)));
753 }
754 {
755 LOCK(cs_main);
756 // The above calls don't guarantee the tip is actually updated, so
757 // we explicitly check this.
758 auto maybe_new_tip{Assert(m_node.chainman)->ActiveChain().Tip()};
759 BOOST_REQUIRE_EQUAL(maybe_new_tip->GetBlockHash(), block.GetHash());
760 }
761 if (current_height % 2 == 0) {
762 block_template = block_template->waitNext();
763 BOOST_REQUIRE(block_template);
764 } else {
765 // This just adds coverage
766 mining->waitTipChanged(block.hashPrevBlock);
767 }
768 }
769
770 LOCK(cs_main);
771
772 TestBasicMining(scriptPubKey, txFirst, baseheight);
773
774 m_node.chainman->ActiveChain().Tip()->nHeight--;
775 SetMockTime(0);
776
777 TestPackageSelection(scriptPubKey, txFirst);
778
779 m_node.chainman->ActiveChain().Tip()->nHeight--;
780 SetMockTime(0);
781
782 TestPrioritisedMining(scriptPubKey, txFirst);
783}
784
CScript GetScriptForDestination(const CTxDestination &dest)
Generate a Bitcoin scriptPubKey for the given CTxDestination.
int64_t CAmount
Amount in satoshis (Can be negative)
Definition: amount.h:12
static constexpr CAmount COIN
The amount of satoshis in one BTC.
Definition: amount.h:15
node::NodeContext m_node
Definition: bitcoin-gui.cpp:42
int flags
Definition: bitcoin-tx.cpp:529
#define Assert(val)
Identity function.
Definition: check.h:106
Definition: block.h:69
The block chain is a tree shaped structure starting with the genesis block at the root,...
Definition: chain.h:141
CBlockIndex * pprev
pointer to the index of the predecessor of this block
Definition: chain.h:147
void BuildSkip()
Build the skiplist pointer for this entry.
Definition: chain.cpp:125
uint256 GetBlockHash() const
Definition: chain.h:243
int nHeight
height of the entry in the chain. The genesis block has height 0
Definition: chain.h:153
static constexpr int nMedianTimeSpan
Definition: chain.h:276
const uint256 * phashBlock
pointer to the hash of the block, if any. Memory is owned by this CBlockIndex
Definition: chain.h:144
CCoinsView that brings transactions from a mempool into view.
Definition: txmempool.h:925
Fee rate in satoshis per kilovirtualbyte: CAmount / kvB.
Definition: feerate.h:33
CAmount GetFee(uint32_t num_bytes) const
Return the fee in satoshis for the given vsize in vbytes.
Definition: feerate.cpp:23
Serialized script, used inside transaction inputs and outputs.
Definition: script.h:415
The basic transaction that is broadcasted on the network and contained in blocks.
Definition: transaction.h:296
static const uint32_t MAX_SEQUENCE_NONFINAL
This is the maximum sequence number that enables both nLockTime and OP_CHECKLOCKTIMEVERIFY (BIP 65).
Definition: transaction.h:87
static const uint32_t SEQUENCE_LOCKTIME_TYPE_FLAG
If CTxIn::nSequence encodes a relative lock-time and this flag is set, the relative lock-time has uni...
Definition: transaction.h:104
static const int SEQUENCE_LOCKTIME_GRANULARITY
In order to use the same number of bits to encode roughly the same wall-clock duration,...
Definition: transaction.h:119
CTxMemPool stores valid-according-to-the-current-best-chain transactions that may be included in the ...
Definition: txmempool.h:304
BOOST_CHECK_EXCEPTION predicates to check the specific validation error.
Definition: setup_common.h:302
Block template interface.
Definition: mining.h:32
Interface giving clients (RPC, Stratum v2 Template Provider in the future) ability to create block te...
Definition: mining.h:80
Generate a new block, without valid proof-of-work.
Definition: miner.h:151
256-bit opaque blob.
Definition: uint256.h:196
static constexpr unsigned int LOCKTIME_VERIFY_SEQUENCE
Flags for nSequence and nLockTime locks.
Definition: consensus.h:28
RecursiveMutex cs_main
Mutex to guard access to validation specific variables, such as reading or changing the chainstate.
Definition: cs_main.cpp:8
BOOST_FIXTURE_TEST_SUITE(cuckoocache_tests, BasicTestingSetup)
Test Suite for CuckooCache.
BOOST_AUTO_TEST_SUITE_END()
AddToMempool(pool, CTxMemPoolEntry(tx, fee, nTime, nHeight, sequence, spendsCoinbase, sigOpCost, lp))
unsigned int nHeight
bool spendsCoinbase
@ REPLACED
Removed for replacement.
uint256 BlockMerkleRoot(const CBlock &block, bool *mutated)
Definition: merkle.cpp:66
BOOST_AUTO_TEST_CASE(CreateNewBlock_validity)
unsigned int extranonce
Definition: miner_tests.cpp:74
static std::unique_ptr< CBlockIndex > CreateBlockIndex(int nHeight, CBlockIndex *active_chain_tip) EXCLUSIVE_LOCKS_REQUIRED(cs_main)
Definition: miner_tests.cpp:96
static constexpr struct @14 BLOCKINFO[]
static CFeeRate blockMinFeeRate
Definition: miner_tests.cpp:71
unsigned int nonce
Definition: miner_tests.cpp:75
std::unique_ptr< Mining > MakeMining(node::NodeContext &node)
Return implementation of Mining interface.
""_hex is a compile-time user-defined literal returning a std::array<std::byte>, equivalent to ParseH...
Definition: strencodings.h:384
#define BOOST_CHECK_EQUAL(v1, v2)
Definition: object.cpp:18
#define BOOST_CHECK(expr)
Definition: object.cpp:17
static constexpr unsigned int DEFAULT_BLOCK_MIN_TX_FEE
Default for -blockmintxfee, which sets the minimum feerate for a transaction in blocks created by min...
Definition: policy.h:32
bool CheckProofOfWork(uint256 hash, unsigned int nBits, const Consensus::Params &params)
Check whether a block hash satisfies the proof-of-work requirement specified by nBits.
Definition: pow.cpp:140
static constexpr TransactionSerParams TX_WITH_WITNESS
Definition: transaction.h:195
static CTransactionRef MakeTransactionRef(Tx &&txIn)
Definition: transaction.h:424
@ OP_2
Definition: script.h:85
@ OP_CHECKMULTISIG
Definition: script.h:192
@ OP_CHECKSIG
Definition: script.h:190
@ OP_NOP
Definition: script.h:102
@ OP_1
Definition: script.h:83
@ OP_DROP
Definition: script.h:124
@ OP_0
Definition: script.h:76
size_t GetSerializeSize(const T &t)
Definition: serialize.h:1105
static constexpr CAmount CENT
Definition: setup_common.h:47
node::NodeContext m_node
Definition: setup_common.h:66
A mutable version of CTransaction.
Definition: transaction.h:378
std::vector< CTxOut > vout
Definition: transaction.h:380
Txid GetHash() const
Compute the hash of this CMutableTransaction.
Definition: transaction.cpp:69
std::vector< CTxIn > vin
Definition: transaction.h:379
Data structure storing a fee and size, ordered by increasing fee/size.
Definition: feefrac.h:40
Definition: txmempool.h:19
TestMemPoolEntryHelper & SigOpsCost(unsigned int _sigopsCost)
Definition: txmempool.h:38
TestMemPoolEntryHelper & Time(NodeSeconds tp)
Definition: txmempool.h:34
CAmount nFee
Definition: txmempool.h:21
CTxMemPoolEntry FromTx(const CMutableTransaction &tx) const
Definition: txmempool.cpp:33
TestMemPoolEntryHelper & SpendsCoinbase(bool _flag)
Definition: txmempool.h:37
unsigned int nHeight
Definition: txmempool.h:23
TestMemPoolEntryHelper & Fee(CAmount _fee)
Definition: txmempool.h:33
Testing setup that configures a complete environment.
Definition: setup_common.h:121
Bilingual messages:
Definition: translation.h:24
bool empty() const
Definition: translation.h:35
std::unique_ptr< Mining > MakeMining()
Definition: miner_tests.cpp:62
void TestPackageSelection(const CScript &scriptPubKey, const std::vector< CTransactionRef > &txFirst) EXCLUSIVE_LOCKS_REQUIRED(void TestBasicMining(const CScript &scriptPubKey, const std::vector< CTransactionRef > &txFirst, int baseheight) EXCLUSIVE_LOCKS_REQUIRED(void TestPrioritisedMining(const CScript &scriptPubKey, const std::vector< CTransactionRef > &txFirst) EXCLUSIVE_LOCKS_REQUIRED(bool TestSequenceLocks(const CTransaction &tx, CTxMemPool &tx_mempool) EXCLUSIVE_LOCKS_REQUIRED(
Definition: miner_tests.cpp:44
std::unique_ptr< CTxMemPool > mempool
Definition: context.h:68
std::unique_ptr< ChainstateManager > chainman
Definition: context.h:72
#define LOCK(cs)
Definition: sync.h:265
CTxMemPool::Options MemPoolOptionsForTest(const NodeContext &node)
Definition: txmempool.cpp:20
#define EXCLUSIVE_LOCKS_REQUIRED(...)
Definition: threadsafety.h:51
bool SequenceLocks(const CTransaction &tx, int flags, std::vector< int > &prevHeights, const CBlockIndex &block)
Check if transaction is final per BIP 68 sequence numbers and can be included in a block.
Definition: tx_verify.cpp:107
bool IsFinalTx(const CTransaction &tx, int nBlockHeight, int64_t nBlockTime)
Check if transaction is final and can be included in a block with the specified height and time.
Definition: tx_verify.cpp:17
void SetMockTime(int64_t nMockTimeIn)
DEPRECATED Use SetMockTime with chrono type.
Definition: time.cpp:40
std::chrono::duration< double, std::chrono::milliseconds::period > MillisecondsDouble
Definition: time.h:88
bool CheckFinalTxAtTip(const CBlockIndex &active_chain_tip, const CTransaction &tx)
Definition: validation.cpp:148
bool CheckSequenceLocksAtTip(CBlockIndex *tip, const LockPoints &lock_points)
Check if transaction will be BIP68 final in the next block to be created on top of tip.
Definition: validation.cpp:247
bool CheckFinalTxAtTip(const CBlockIndex &active_chain_tip, const CTransaction &tx) EXCLUSIVE_LOCKS_REQUIRED(std::optional< LockPoints > CalculateLockPointsAtTip(CBlockIndex *tip, const CCoinsView &coins_view, const CTransaction &tx)
Check if transaction will be final in the next block to be created.
Definition: validation.h:310
static const int32_t VERSIONBITS_TOP_BITS
What bits to set in version for versionbits blocks.
Definition: versionbits.h:21