mirror of
https://github.com/dashpay/dash.git
synced 2024-12-28 05:23:01 +01:00
4a3e3af6e7
fa0074e2d82928016a43ca408717154a1c70a4db scripted-diff: Bump copyright headers (MarcoFalke) Pull request description: Needs to be done because no one has removed the years yet ACKs for top commit: practicalswift: ACK fa0074e2d82928016a43ca408717154a1c70a4db Tree-SHA512: 210e92acd7d400b556cf8259c3ec9967797420cfd19f0c2a4fa54cb2b3d32ad9ae27e771269201e7d554c0f4cd73a8b1c1a42c9f65d8685ca4d52e5134b071a3
557 lines
26 KiB
C++
557 lines
26 KiB
C++
// Copyright (c) 2011-2020 The Bitcoin Core developers
|
|
// Distributed under the MIT software license, see the accompanying
|
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
|
|
#include <chainparams.h>
|
|
#include <consensus/consensus.h>
|
|
#include <consensus/merkle.h>
|
|
#include <consensus/tx_verify.h>
|
|
#include <consensus/validation.h>
|
|
#include <evo/evodb.h>
|
|
#include <governance/governance.h>
|
|
#include <llmq/blockprocessor.h>
|
|
#include <llmq/chainlocks.h>
|
|
#include <llmq/context.h>
|
|
#include <llmq/instantsend.h>
|
|
#include <miner.h>
|
|
#include <policy/policy.h>
|
|
#include <pow.h>
|
|
#include <script/standard.h>
|
|
#include <spork.h>
|
|
#include <uint256.h>
|
|
#include <util/strencodings.h>
|
|
#include <util/system.h>
|
|
#include <util/time.h>
|
|
#include <validation.h>
|
|
|
|
#include <test/util/setup_common.h>
|
|
|
|
#include <memory>
|
|
|
|
#include <boost/test/unit_test.hpp>
|
|
|
|
namespace miner_tests {
|
|
struct MinerTestingSetup : public TestingSetup {
|
|
void TestPackageSelection(const CChainParams& chainparams, const CScript& scriptPubKey, const std::vector<CTransactionRef>& txFirst) EXCLUSIVE_LOCKS_REQUIRED(::cs_main, m_node.mempool->cs);
|
|
bool TestSequenceLocks(const CTransaction& tx, int flags) EXCLUSIVE_LOCKS_REQUIRED(::cs_main, m_node.mempool->cs)
|
|
{
|
|
CCoinsViewMemPool view_mempool(&m_node.chainman->ActiveChainstate().CoinsTip(), *m_node.mempool);
|
|
return CheckSequenceLocks(m_node.chainman->ActiveChain().Tip(), view_mempool, tx, flags);
|
|
}
|
|
BlockAssembler AssemblerForTest(const CChainParams& params);
|
|
};
|
|
} // namespace miner_tests
|
|
|
|
BOOST_FIXTURE_TEST_SUITE(miner_tests, MinerTestingSetup)
|
|
|
|
static CFeeRate blockMinFeeRate = CFeeRate(DEFAULT_BLOCK_MIN_TX_FEE);
|
|
|
|
BlockAssembler MinerTestingSetup::AssemblerForTest(const CChainParams& params)
|
|
{
|
|
BlockAssembler::Options options;
|
|
|
|
options.nBlockMaxSize = DEFAULT_BLOCK_MAX_SIZE;
|
|
options.blockMinFeeRate = blockMinFeeRate;
|
|
return BlockAssembler(::ChainstateActive(), m_node, *m_node.mempool, params, options);
|
|
}
|
|
|
|
constexpr static struct {
|
|
unsigned char extranonce;
|
|
unsigned int nonce;
|
|
} blockinfo[] = {
|
|
{0, 0x0017f257}, {0, 0x000d4581}, {0, 0x0048042c}, {0, 0x0025bff0},
|
|
{0, 0x2002d3f8}, {0, 0x6001161f}, {0, 0xe000c5e5}, {0, 0x2000cce2},
|
|
{0, 0x40004753}, {0, 0x80025297}, {0, 0x600009de}, {0, 0x6005780c},
|
|
{0, 0x40025ae9}, {0, 0xc000341c}, {0, 0xc0053062}, {0, 0x40002f90},
|
|
{0, 0xc00047ae}, {0, 0xa0015716}, {0, 0x2000d499}, {0, 0x80009b45},
|
|
{0, 0xc000a7c9}, {0, 0x8001f8ba}, {0, 0xc000d147}, {0, 0x60018ac3},
|
|
{0, 0xc000a9ac}, {0, 0xa003f6e6}, {0, 0x2007436e}, {0, 0xc0013f28},
|
|
{0, 0x00010892}, {0, 0xa0000027}, {0, 0x40008de9}, {0, 0x400019f3},
|
|
{0, 0x00025b86}, {0, 0x80002799}, {0, 0xc001eb0e}, {0, 0xe003e950},
|
|
{0, 0xe001ff87}, {0, 0x000158b0}, {0, 0x600189da}, {0, 0x0000028c},
|
|
{0, 0x600014ca}, {0, 0x60000e4d}, {0, 0xc0000820}, {0, 0xa005184e},
|
|
{0, 0x40012b22}, {0, 0xe0028f6b}, {0, 0xe0027bce}, {0, 0xa0007b51},
|
|
{0, 0x8002496d}, {0, 0xc001f211}, {0, 0x00032bf0}, {0, 0x4002d767},
|
|
{0, 0x6008410a}, {0, 0x800361c3}, {0, 0xe000f80d}, {0, 0xe009ac97},
|
|
{0, 0x80002103}, {0, 0x6001fab4}, {0, 0x4002843b}, {0, 0x6002b67c},
|
|
{0, 0xa000faf3}, {0, 0x6000949e}, {0, 0x80000f1f}, {0, 0x6000c946},
|
|
{0, 0xe00314b3}, {0, 0x20012bbf}, {0, 0x00009c7e}, {0, 0x2003e63a},
|
|
{0, 0x20025157}, {0, 0x80041ff5}, {0, 0x60012a6c}, {0, 0x4000119b},
|
|
{0, 0xc000a454}, {0, 0x20042c4b}, {0, 0x0003003c}, {0, 0x000558b2},
|
|
{0, 0x2000198c}, {0, 0x200b0b3e}, {0, 0x4001c1e4}, {0, 0x80000034},
|
|
{0, 0xe00039d1}, {0, 0xc001ded3}, {0, 0x80006740}, {0, 0xc0014546},
|
|
{0, 0x00036a1a}, {0, 0xa001ae9c}, {0, 0x6000a148}, {0, 0xe001fd73},
|
|
{0, 0xa001cebb}, {0, 0xa000d4b8}, {0, 0xe00154b3}, {0, 0x40004bec},
|
|
{0, 0xc003f230}, {0, 0xe0069a26}, {0, 0xa00072b4}, {0, 0xc002e1b2},
|
|
{0, 0x20009a02}, {0, 0xc0004a10}, {0, 0xe0045a11}, {0, 0x60034d09},
|
|
{0, 0x000073ff}, {0, 0x00003f1c}, {0, 0x4002c4fd}, {0, 0x2000bb60},
|
|
{0, 0x4000b6b6}, {0, 0x6000ea25}, {0, 0x400989d9}, {0, 0xc000877f},
|
|
{0, 0x6000d17c}, {0, 0xc0009228}, {0, 0x4002827f}, {0, 0x80056a85},
|
|
{0, 0x40045af7}, {0, 0x6000df7a}, {0, 0xe00131a1}, {0, 0x40021386},
|
|
{0, 0xa00891b5}, {0, 0x60007854}, {0, 0x602cee70}
|
|
};
|
|
constexpr static size_t blockinfo_size = sizeof(blockinfo) / sizeof(blockinfo[0]);
|
|
|
|
static CBlockIndex CreateBlockIndex(int nHeight) EXCLUSIVE_LOCKS_REQUIRED(cs_main)
|
|
{
|
|
CBlockIndex index;
|
|
index.nHeight = nHeight;
|
|
index.pprev = ::ChainActive().Tip();
|
|
return index;
|
|
}
|
|
|
|
// Test suite for ancestor feerate transaction selection.
|
|
// Implemented as an additional function, rather than a separate test case,
|
|
// to allow reusing the blockchain created in CreateNewBlock_validity.
|
|
void MinerTestingSetup::TestPackageSelection(const CChainParams& chainparams, const CScript& scriptPubKey, const std::vector<CTransactionRef>& txFirst)
|
|
{
|
|
// Disable free transactions, otherwise TX selection is non-deterministic
|
|
gArgs.SoftSetArg("-blockprioritysize", "0");
|
|
|
|
// Test the ancestor feerate transaction selection.
|
|
TestMemPoolEntryHelper entry;
|
|
|
|
// Test that a medium fee transaction will be selected after a higher fee
|
|
// rate package with a low fee rate parent.
|
|
CMutableTransaction tx;
|
|
tx.vin.resize(1);
|
|
tx.vin[0].scriptSig = CScript() << OP_1;
|
|
tx.vin[0].prevout.hash = txFirst[0]->GetHash();
|
|
tx.vin[0].prevout.n = 0;
|
|
tx.vout.resize(1);
|
|
tx.vout[0].nValue = 5000000000LL - 1000;
|
|
// This tx has a low fee: 1000 satoshis
|
|
uint256 hashParentTx = tx.GetHash(); // save this txid for later use
|
|
m_node.mempool->addUnchecked(entry.Fee(1000).Time(GetTime()).SpendsCoinbase(true).FromTx(tx));
|
|
|
|
// This tx has a medium fee: 10000 satoshis
|
|
tx.vin[0].prevout.hash = txFirst[1]->GetHash();
|
|
tx.vout[0].nValue = 5000000000LL - 10000;
|
|
uint256 hashMediumFeeTx = tx.GetHash();
|
|
m_node.mempool->addUnchecked(entry.Fee(10000).Time(GetTime()).SpendsCoinbase(true).FromTx(tx));
|
|
|
|
// This tx has a high fee, but depends on the first transaction
|
|
tx.vin[0].prevout.hash = hashParentTx;
|
|
tx.vout[0].nValue = 5000000000LL - 1000 - 50000; // 50k satoshi fee
|
|
uint256 hashHighFeeTx = tx.GetHash();
|
|
m_node.mempool->addUnchecked(entry.Fee(50000).Time(GetTime()).SpendsCoinbase(false).FromTx(tx));
|
|
|
|
std::unique_ptr<CBlockTemplate> pblocktemplate = AssemblerForTest(chainparams).CreateNewBlock(scriptPubKey);
|
|
BOOST_REQUIRE_EQUAL(pblocktemplate->block.vtx.size(), 4U);
|
|
BOOST_CHECK(pblocktemplate->block.vtx[1]->GetHash() == hashParentTx);
|
|
BOOST_CHECK(pblocktemplate->block.vtx[2]->GetHash() == hashHighFeeTx);
|
|
BOOST_CHECK(pblocktemplate->block.vtx[3]->GetHash() == hashMediumFeeTx);
|
|
|
|
// Test that a package below the block min tx fee doesn't get included
|
|
tx.vin[0].prevout.hash = hashHighFeeTx;
|
|
tx.vout[0].nValue = 5000000000LL - 1000 - 50000; // 0 fee
|
|
uint256 hashFreeTx = tx.GetHash();
|
|
m_node.mempool->addUnchecked(entry.Fee(0).FromTx(tx));
|
|
size_t freeTxSize = GetVirtualTransactionSize(CTransaction(tx));
|
|
|
|
// Calculate a fee on child transaction that will put the package just
|
|
// below the block min tx fee (assuming 1 child tx of the same size).
|
|
CAmount feeToUse = blockMinFeeRate.GetFee(2*freeTxSize) - 1;
|
|
|
|
tx.vin[0].prevout.hash = hashFreeTx;
|
|
tx.vout[0].nValue = 5000000000LL - 1000 - 50000 - feeToUse;
|
|
uint256 hashLowFeeTx = tx.GetHash();
|
|
m_node.mempool->addUnchecked(entry.Fee(feeToUse).FromTx(tx));
|
|
pblocktemplate = AssemblerForTest(chainparams).CreateNewBlock(scriptPubKey);
|
|
// Verify that the free tx and the low fee tx didn't get selected
|
|
for (size_t i=0; i<pblocktemplate->block.vtx.size(); ++i) {
|
|
BOOST_CHECK(pblocktemplate->block.vtx[i]->GetHash() != hashFreeTx);
|
|
BOOST_CHECK(pblocktemplate->block.vtx[i]->GetHash() != hashLowFeeTx);
|
|
}
|
|
|
|
// Test that packages above the min relay fee do get included, even if one
|
|
// of the transactions is below the min relay fee
|
|
// Remove the low fee transaction and replace with a higher fee transaction
|
|
m_node.mempool->removeRecursive(CTransaction(tx), MemPoolRemovalReason::MANUAL);
|
|
tx.vout[0].nValue -= 2; // Now we should be just over the min relay fee
|
|
hashLowFeeTx = tx.GetHash();
|
|
m_node.mempool->addUnchecked(entry.Fee(feeToUse+2).FromTx(tx));
|
|
pblocktemplate = AssemblerForTest(chainparams).CreateNewBlock(scriptPubKey);
|
|
BOOST_REQUIRE_EQUAL(pblocktemplate->block.vtx.size(), 6U);
|
|
BOOST_CHECK(pblocktemplate->block.vtx[4]->GetHash() == hashFreeTx);
|
|
BOOST_CHECK(pblocktemplate->block.vtx[5]->GetHash() == hashLowFeeTx);
|
|
|
|
// Test that transaction selection properly updates ancestor fee
|
|
// calculations as ancestor transactions get included in a block.
|
|
// Add a 0-fee transaction that has 2 outputs.
|
|
tx.vin[0].prevout.hash = txFirst[2]->GetHash();
|
|
tx.vout.resize(2);
|
|
tx.vout[0].nValue = 5000000000LL - 100000000;
|
|
tx.vout[1].nValue = 100000000; // 1BTC output
|
|
uint256 hashFreeTx2 = tx.GetHash();
|
|
m_node.mempool->addUnchecked(entry.Fee(0).SpendsCoinbase(true).FromTx(tx));
|
|
|
|
// This tx can't be mined by itself
|
|
tx.vin[0].prevout.hash = hashFreeTx2;
|
|
tx.vout.resize(1);
|
|
feeToUse = blockMinFeeRate.GetFee(freeTxSize);
|
|
tx.vout[0].nValue = 5000000000LL - 100000000 - feeToUse;
|
|
uint256 hashLowFeeTx2 = tx.GetHash();
|
|
m_node.mempool->addUnchecked(entry.Fee(feeToUse).SpendsCoinbase(false).FromTx(tx));
|
|
pblocktemplate = AssemblerForTest(chainparams).CreateNewBlock(scriptPubKey);
|
|
|
|
// Verify that this tx isn't selected.
|
|
for (size_t i=0; i<pblocktemplate->block.vtx.size(); ++i) {
|
|
BOOST_CHECK(pblocktemplate->block.vtx[i]->GetHash() != hashFreeTx2);
|
|
BOOST_CHECK(pblocktemplate->block.vtx[i]->GetHash() != hashLowFeeTx2);
|
|
}
|
|
|
|
// This tx will be mineable, and should cause hashLowFeeTx2 to be selected
|
|
// as well.
|
|
tx.vin[0].prevout.n = 1;
|
|
tx.vout[0].nValue = 100000000 - 10000; // 10k satoshi fee
|
|
m_node.mempool->addUnchecked(entry.Fee(10000).FromTx(tx));
|
|
pblocktemplate = AssemblerForTest(chainparams).CreateNewBlock(scriptPubKey);
|
|
BOOST_REQUIRE_EQUAL(pblocktemplate->block.vtx.size(), 9U);
|
|
BOOST_CHECK(pblocktemplate->block.vtx[8]->GetHash() == hashLowFeeTx2);
|
|
}
|
|
|
|
// NOTE: These tests rely on CreateNewBlock doing its own self-validation!
|
|
BOOST_AUTO_TEST_CASE(CreateNewBlock_validity)
|
|
{
|
|
const auto chainParams = CreateChainParams(*m_node.args, CBaseChainParams::MAIN);
|
|
const CChainParams& chainparams = *chainParams;
|
|
CScript scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
|
|
std::unique_ptr<CBlockTemplate> pblocktemplate, pemptyblocktemplate;
|
|
CMutableTransaction tx;
|
|
CScript script;
|
|
uint256 hash;
|
|
TestMemPoolEntryHelper entry;
|
|
entry.nFee = 11;
|
|
entry.nHeight = 11;
|
|
|
|
fCheckpointsEnabled = false;
|
|
|
|
// Simple block creation, nothing special yet:
|
|
BOOST_CHECK(pemptyblocktemplate = AssemblerForTest(chainparams).CreateNewBlock(scriptPubKey));
|
|
|
|
// We can't make transactions until we have inputs
|
|
// Therefore, load 100 blocks :)
|
|
int baseheight = 0;
|
|
std::vector<CTransactionRef> txFirst;
|
|
|
|
auto createAndProcessEmptyBlock = [&]() {
|
|
int i = ::ChainActive().Height() % blockinfo_size;
|
|
CBlock *pblock = &pemptyblocktemplate->block; // pointer for convenience
|
|
{
|
|
LOCK(cs_main);
|
|
pblock->nVersion = 2;
|
|
pblock->nTime = ::ChainActive().Tip()->GetMedianTimePast()+1;
|
|
CMutableTransaction txCoinbase(*pblock->vtx[0]);
|
|
txCoinbase.nVersion = 1;
|
|
txCoinbase.vin[0].scriptSig = CScript() << (::ChainActive().Height() + 1);
|
|
txCoinbase.vin[0].scriptSig.push_back(blockinfo[i].extranonce);
|
|
txCoinbase.vin[0].scriptSig.push_back(::ChainActive().Height());
|
|
txCoinbase.vout[0].scriptPubKey = CScript();
|
|
pblock->vtx[0] = MakeTransactionRef(std::move(txCoinbase));
|
|
if (txFirst.size() == 0)
|
|
baseheight = ::ChainActive().Height();
|
|
if (txFirst.size() < 4)
|
|
txFirst.push_back(pblock->vtx[0]);
|
|
pblock->hashMerkleRoot = BlockMerkleRoot(*pblock);
|
|
pblock->nNonce = blockinfo[i].nonce;
|
|
|
|
// This will usually succeed in the first round as we take the nonce from blockinfo
|
|
// It's however useful when adding new blocks with unknown nonces (you should add the found block to blockinfo)
|
|
while (!CheckProofOfWork(pblock->GetHash(), pblock->nBits, chainparams.GetConsensus())) {
|
|
pblock->nNonce++;
|
|
}
|
|
}
|
|
std::shared_ptr<const CBlock> shared_pblock = std::make_shared<const CBlock>(*pblock);
|
|
BOOST_CHECK(Assert(m_node.chainman)->ProcessNewBlock(chainparams, shared_pblock, true, nullptr));
|
|
pblock->hashPrevBlock = pblock->GetHash();
|
|
};
|
|
|
|
for ([[maybe_unused]] const auto& _ : blockinfo) {
|
|
createAndProcessEmptyBlock();
|
|
}
|
|
|
|
{
|
|
LOCK(cs_main);
|
|
LOCK(m_node.mempool->cs);
|
|
|
|
// Just to make sure we can still make simple blocks
|
|
BOOST_CHECK(pblocktemplate = AssemblerForTest(chainparams).CreateNewBlock(scriptPubKey));
|
|
|
|
const CAmount BLOCKSUBSIDY = 500*COIN;
|
|
const CAmount LOWFEE = CENT;
|
|
const CAmount HIGHFEE = COIN;
|
|
const CAmount HIGHERFEE = 4*COIN;
|
|
|
|
// block sigops > limit: 1000 CHECKMULTISIG + 1
|
|
tx.vin.resize(1);
|
|
// NOTE: OP_NOP is used to force 20 SigOps for the CHECKMULTISIG
|
|
tx.vin[0].scriptSig = CScript() << OP_0 << OP_0 << OP_0 << OP_NOP << OP_CHECKMULTISIG << OP_1;
|
|
tx.vin[0].prevout.hash = txFirst[0]->GetHash();
|
|
tx.vin[0].prevout.n = 0;
|
|
tx.vout.resize(1);
|
|
tx.vout[0].nValue = BLOCKSUBSIDY;
|
|
for (unsigned int i = 0; i < 1001; ++i)
|
|
{
|
|
tx.vout[0].nValue -= LOWFEE;
|
|
hash = tx.GetHash();
|
|
bool spendsCoinbase = i == 0; // only first tx spends coinbase
|
|
// If we don't set the # of sig ops in the CTxMemPoolEntry, template creation fails
|
|
m_node.mempool->addUnchecked(entry.Fee(LOWFEE).Time(GetTime()).SpendsCoinbase(spendsCoinbase).FromTx(tx));
|
|
tx.vin[0].prevout.hash = hash;
|
|
}
|
|
|
|
BOOST_CHECK_EXCEPTION(AssemblerForTest(chainparams).CreateNewBlock(scriptPubKey), std::runtime_error, HasReason("bad-blk-sigops"));
|
|
m_node.mempool->clear();
|
|
|
|
tx.vin[0].prevout.hash = txFirst[0]->GetHash();
|
|
tx.vout[0].nValue = BLOCKSUBSIDY;
|
|
for (unsigned int i = 0; i < 1001; ++i)
|
|
{
|
|
tx.vout[0].nValue -= LOWFEE;
|
|
hash = tx.GetHash();
|
|
bool spendsCoinbase = i == 0; // only first tx spends coinbase
|
|
// If we do set the # of sig ops in the CTxMemPoolEntry, template creation passes
|
|
m_node.mempool->addUnchecked(entry.Fee(LOWFEE).Time(GetTime()).SpendsCoinbase(spendsCoinbase).SigOps(20).FromTx(tx));
|
|
tx.vin[0].prevout.hash = hash;
|
|
}
|
|
BOOST_CHECK(pblocktemplate = AssemblerForTest(chainparams).CreateNewBlock(scriptPubKey));
|
|
m_node.mempool->clear();
|
|
|
|
// block size > limit
|
|
tx.vin[0].scriptSig = CScript();
|
|
// 18 * (520char + DROP) + OP_1 = 9433 bytes
|
|
std::vector<unsigned char> vchData(520);
|
|
for (unsigned int i = 0; i < 18; ++i)
|
|
tx.vin[0].scriptSig << vchData << OP_DROP;
|
|
tx.vin[0].scriptSig << OP_1;
|
|
tx.vin[0].prevout.hash = txFirst[0]->GetHash();
|
|
tx.vout[0].nValue = BLOCKSUBSIDY;
|
|
for (unsigned int i = 0; i < 128; ++i)
|
|
{
|
|
tx.vout[0].nValue -= LOWFEE;
|
|
hash = tx.GetHash();
|
|
bool spendsCoinbase = i == 0; // only first tx spends coinbase
|
|
m_node.mempool->addUnchecked(entry.Fee(LOWFEE).Time(GetTime()).SpendsCoinbase(spendsCoinbase).FromTx(tx));
|
|
tx.vin[0].prevout.hash = hash;
|
|
}
|
|
BOOST_CHECK(pblocktemplate = AssemblerForTest(chainparams).CreateNewBlock(scriptPubKey));
|
|
m_node.mempool->clear();
|
|
|
|
// orphan in mempool, template creation fails
|
|
hash = tx.GetHash();
|
|
m_node.mempool->addUnchecked(entry.Fee(LOWFEE).Time(GetTime()).FromTx(tx));
|
|
BOOST_CHECK_EXCEPTION(AssemblerForTest(chainparams).CreateNewBlock(scriptPubKey), std::runtime_error, HasReason("bad-txns-inputs-missingorspent"));
|
|
m_node.mempool->clear();
|
|
|
|
// child with higher feerate than parent
|
|
tx.vin[0].scriptSig = CScript() << OP_1;
|
|
tx.vin[0].prevout.hash = txFirst[1]->GetHash();
|
|
tx.vout[0].nValue = BLOCKSUBSIDY-HIGHFEE;
|
|
hash = tx.GetHash();
|
|
m_node.mempool->addUnchecked(entry.Fee(HIGHFEE).Time(GetTime()).SpendsCoinbase(true).FromTx(tx));
|
|
tx.vin[0].prevout.hash = hash;
|
|
tx.vin.resize(2);
|
|
tx.vin[1].scriptSig = CScript() << OP_1;
|
|
tx.vin[1].prevout.hash = txFirst[0]->GetHash();
|
|
tx.vin[1].prevout.n = 0;
|
|
tx.vout[0].nValue = tx.vout[0].nValue+BLOCKSUBSIDY-HIGHERFEE; //First txn output + fresh coinbase - new txn fee
|
|
hash = tx.GetHash();
|
|
m_node.mempool->addUnchecked(entry.Fee(HIGHERFEE).Time(GetTime()).SpendsCoinbase(true).FromTx(tx));
|
|
BOOST_CHECK(pblocktemplate = AssemblerForTest(chainparams).CreateNewBlock(scriptPubKey));
|
|
m_node.mempool->clear();
|
|
|
|
// coinbase in mempool, template creation fails
|
|
tx.vin.resize(1);
|
|
tx.vin[0].prevout.SetNull();
|
|
tx.vin[0].scriptSig = CScript() << OP_0 << OP_1;
|
|
tx.vout[0].nValue = 0;
|
|
hash = tx.GetHash();
|
|
// give it a fee so it'll get mined
|
|
m_node.mempool->addUnchecked(entry.Fee(LOWFEE).Time(GetTime()).SpendsCoinbase(false).FromTx(tx));
|
|
// Should throw bad-cb-multiple
|
|
BOOST_CHECK_EXCEPTION(AssemblerForTest(chainparams).CreateNewBlock(scriptPubKey), std::runtime_error, HasReason("bad-cb-multiple"));
|
|
m_node.mempool->clear();
|
|
|
|
// double spend txn pair in mempool, template creation fails
|
|
tx.vin[0].prevout.hash = txFirst[0]->GetHash();
|
|
tx.vin[0].scriptSig = CScript() << OP_1;
|
|
tx.vout[0].nValue = BLOCKSUBSIDY-HIGHFEE;
|
|
tx.vout[0].scriptPubKey = CScript() << OP_1;
|
|
hash = tx.GetHash();
|
|
m_node.mempool->addUnchecked(entry.Fee(HIGHFEE).Time(GetTime()).SpendsCoinbase(true).FromTx(tx));
|
|
tx.vout[0].scriptPubKey = CScript() << OP_2;
|
|
hash = tx.GetHash();
|
|
m_node.mempool->addUnchecked(entry.Fee(HIGHFEE).Time(GetTime()).SpendsCoinbase(true).FromTx(tx));
|
|
BOOST_CHECK_EXCEPTION(AssemblerForTest(chainparams).CreateNewBlock(scriptPubKey), std::runtime_error, HasReason("bad-txns-inputs-missingorspent"));
|
|
m_node.mempool->clear();
|
|
|
|
// subsidy changing
|
|
// int nHeight = ::ChainActive().Height();
|
|
// // Create an actual 209999-long block chain (without valid blocks).
|
|
// while (::ChainActive().Tip()->nHeight < 209999) {
|
|
// CBlockIndex* prev = ::ChainActive().Tip();
|
|
// CBlockIndex* next = new CBlockIndex();
|
|
// next->phashBlock = new uint256(InsecureRand256());
|
|
// pcoinsTip->SetBestBlock(next->GetBlockHash());
|
|
// next->pprev = prev;
|
|
// next->nHeight = prev->nHeight + 1;
|
|
// next->BuildSkip();
|
|
// ::ChainActive().SetTip(next);
|
|
// }
|
|
//BOOST_CHECK(pblocktemplate = BlockAssembler(chainparams).CreateNewBlock(scriptPubKey));
|
|
// // Extend to a 210000-long block chain.
|
|
// while (::ChainActive().Tip()->nHeight < 210000) {
|
|
// CBlockIndex* prev = ::ChainActive().Tip();
|
|
// CBlockIndex* next = new CBlockIndex();
|
|
// next->phashBlock = new uint256(InsecureRand256());
|
|
// pcoinsTip->SetBestBlock(next->GetBlockHash());
|
|
// next->pprev = prev;
|
|
// next->nHeight = prev->nHeight + 1;
|
|
// next->BuildSkip();
|
|
// ::ChainActive().SetTip(next);
|
|
// }
|
|
//BOOST_CHECK(pblocktemplate = BlockAssembler(chainparams).CreateNewBlock(scriptPubKey));
|
|
|
|
// invalid (pre-p2sh) txn in mempool, template creation fails
|
|
tx.vin[0].prevout.hash = txFirst[0]->GetHash();
|
|
tx.vin[0].prevout.n = 0;
|
|
tx.vin[0].scriptSig = CScript() << OP_1;
|
|
tx.vout[0].nValue = BLOCKSUBSIDY-LOWFEE;
|
|
script = CScript() << OP_0;
|
|
tx.vout[0].scriptPubKey = GetScriptForDestination(ScriptHash(script));
|
|
hash = tx.GetHash();
|
|
m_node.mempool->addUnchecked(entry.Fee(LOWFEE).Time(GetTime()).SpendsCoinbase(true).FromTx(tx));
|
|
tx.vin[0].prevout.hash = hash;
|
|
tx.vin[0].scriptSig = CScript() << std::vector<unsigned char>(script.begin(), script.end());
|
|
tx.vout[0].nValue -= LOWFEE;
|
|
hash = tx.GetHash();
|
|
m_node.mempool->addUnchecked(entry.Fee(LOWFEE).Time(GetTime()).SpendsCoinbase(false).FromTx(tx));
|
|
// Should throw block-validation-failed
|
|
BOOST_CHECK_EXCEPTION(AssemblerForTest(chainparams).CreateNewBlock(scriptPubKey), std::runtime_error, HasReason("block-validation-failed"));
|
|
m_node.mempool->clear();
|
|
|
|
// // Delete the dummy blocks again.
|
|
// while (::ChainActive().Tip()->nHeight > nHeight) {
|
|
// CBlockIndex* del = ::ChainActive().Tip();
|
|
// ::ChainActive().SetTip(del->pprev);
|
|
// ::ChainstateActive().CoinsTip().SetBestBlock(del->pprev->GetBlockHash());
|
|
// delete del->phashBlock;
|
|
// delete del;
|
|
// }
|
|
|
|
// non-final txs in mempool
|
|
SetMockTime(::ChainActive().Tip()->GetMedianTimePast()+1);
|
|
int flags = LOCKTIME_VERIFY_SEQUENCE|LOCKTIME_MEDIAN_TIME_PAST;
|
|
// height map
|
|
std::vector<int> prevheights;
|
|
|
|
// relative height locked
|
|
tx.nVersion = 2;
|
|
tx.vin.resize(1);
|
|
prevheights.resize(1);
|
|
tx.vin[0].prevout.hash = txFirst[0]->GetHash(); // only 1 transaction
|
|
tx.vin[0].prevout.n = 0;
|
|
tx.vin[0].scriptSig = CScript() << OP_1;
|
|
tx.vin[0].nSequence = ::ChainActive().Tip()->nHeight + 1; // txFirst[0] is the 2nd block
|
|
prevheights[0] = baseheight + 1;
|
|
tx.vout.resize(1);
|
|
tx.vout[0].nValue = BLOCKSUBSIDY-HIGHFEE;
|
|
tx.vout[0].scriptPubKey = CScript() << OP_1;
|
|
tx.nLockTime = 0;
|
|
hash = tx.GetHash();
|
|
m_node.mempool->addUnchecked(entry.Fee(HIGHFEE).Time(GetTime()).SpendsCoinbase(true).FromTx(tx));
|
|
BOOST_CHECK(CheckFinalTx(::ChainActive().Tip(), CTransaction(tx), flags)); // Locktime passes
|
|
BOOST_CHECK(!TestSequenceLocks(CTransaction(tx), flags)); // Sequence locks fail
|
|
BOOST_CHECK(SequenceLocks(CTransaction(tx), flags, prevheights, CreateBlockIndex(::ChainActive().Tip()->nHeight + 2))); // Sequence locks pass on 2nd block
|
|
|
|
// relative time locked
|
|
tx.vin[0].prevout.hash = txFirst[1]->GetHash();
|
|
tx.vin[0].nSequence = CTxIn::SEQUENCE_LOCKTIME_TYPE_FLAG | (((::ChainActive().Tip()->GetMedianTimePast()+1-::ChainActive()[1]->GetMedianTimePast()) >> CTxIn::SEQUENCE_LOCKTIME_GRANULARITY) + 1); // txFirst[1] is the 3rd block
|
|
prevheights[0] = baseheight + 2;
|
|
hash = tx.GetHash();
|
|
m_node.mempool->addUnchecked(entry.Time(GetTime()).FromTx(tx));
|
|
BOOST_CHECK(CheckFinalTx(::ChainActive().Tip(), CTransaction(tx), flags)); // Locktime passes
|
|
BOOST_CHECK(!TestSequenceLocks(CTransaction(tx), flags)); // Sequence locks fail
|
|
|
|
for (int i = 0; i < CBlockIndex::nMedianTimeSpan; i++)
|
|
::ChainActive().Tip()->GetAncestor(::ChainActive().Tip()->nHeight - i)->nTime += 512; // Trick the MedianTimePast
|
|
BOOST_CHECK(SequenceLocks(CTransaction(tx), flags, prevheights, CreateBlockIndex(::ChainActive().Tip()->nHeight + 1))); // Sequence locks pass 512 seconds later
|
|
for (int i = 0; i < CBlockIndex::nMedianTimeSpan; i++)
|
|
::ChainActive().Tip()->GetAncestor(::ChainActive().Tip()->nHeight - i)->nTime -= 512; //undo tricked MTP
|
|
|
|
// absolute height locked
|
|
tx.vin[0].prevout.hash = txFirst[2]->GetHash();
|
|
tx.vin[0].nSequence = CTxIn::SEQUENCE_FINAL - 1;
|
|
prevheights[0] = baseheight + 3;
|
|
tx.nLockTime = ::ChainActive().Tip()->nHeight + 1;
|
|
hash = tx.GetHash();
|
|
m_node.mempool->addUnchecked(entry.Time(GetTime()).FromTx(tx));
|
|
BOOST_CHECK(!CheckFinalTx(::ChainActive().Tip(), CTransaction(tx), flags)); // Locktime fails
|
|
BOOST_CHECK(TestSequenceLocks(CTransaction(tx), flags)); // Sequence locks pass
|
|
BOOST_CHECK(IsFinalTx(CTransaction(tx), ::ChainActive().Tip()->nHeight + 2, ::ChainActive().Tip()->GetMedianTimePast())); // Locktime passes on 2nd block
|
|
|
|
// absolute time locked
|
|
tx.vin[0].prevout.hash = txFirst[3]->GetHash();
|
|
tx.nLockTime = ::ChainActive().Tip()->GetMedianTimePast();
|
|
prevheights.resize(1);
|
|
prevheights[0] = baseheight + 4;
|
|
hash = tx.GetHash();
|
|
m_node.mempool->addUnchecked(entry.Time(GetTime()).FromTx(tx));
|
|
BOOST_CHECK(!CheckFinalTx(::ChainActive().Tip(), CTransaction(tx), flags)); // Locktime fails
|
|
BOOST_CHECK(TestSequenceLocks(CTransaction(tx), flags)); // Sequence locks pass
|
|
BOOST_CHECK(IsFinalTx(CTransaction(tx), ::ChainActive().Tip()->nHeight + 2, ::ChainActive().Tip()->GetMedianTimePast() + 1)); // Locktime passes 1 second later
|
|
|
|
// mempool-dependent transactions (not added)
|
|
tx.vin[0].prevout.hash = hash;
|
|
prevheights[0] = ::ChainActive().Tip()->nHeight + 1;
|
|
tx.nLockTime = 0;
|
|
tx.vin[0].nSequence = 0;
|
|
BOOST_CHECK(CheckFinalTx(::ChainActive().Tip(), CTransaction(tx), flags)); // Locktime passes
|
|
BOOST_CHECK(TestSequenceLocks(CTransaction(tx), flags)); // Sequence locks pass
|
|
tx.vin[0].nSequence = 1;
|
|
BOOST_CHECK(!TestSequenceLocks(CTransaction(tx), flags)); // Sequence locks fail
|
|
tx.vin[0].nSequence = CTxIn::SEQUENCE_LOCKTIME_TYPE_FLAG;
|
|
BOOST_CHECK(TestSequenceLocks(CTransaction(tx), flags)); // Sequence locks pass
|
|
tx.vin[0].nSequence = CTxIn::SEQUENCE_LOCKTIME_TYPE_FLAG | 1;
|
|
BOOST_CHECK(!TestSequenceLocks(CTransaction(tx), flags)); // Sequence locks fail
|
|
|
|
BOOST_CHECK(pblocktemplate = AssemblerForTest(chainparams).CreateNewBlock(scriptPubKey));
|
|
|
|
// None of the of the absolute height/time locked tx should have made
|
|
// it into the template because we still check IsFinalTx in CreateNewBlock,
|
|
// but relative locked txs will if inconsistently added to mempool.
|
|
// For now these will still generate a valid template until BIP68 soft fork
|
|
BOOST_CHECK_EQUAL(pblocktemplate->block.vtx.size(), 3U);
|
|
// However if we advance height by 1 and time by 512, all of them should be mined
|
|
for (int i = 0; i < CBlockIndex::nMedianTimeSpan; i++)
|
|
::ChainActive().Tip()->GetAncestor(::ChainActive().Tip()->nHeight - i)->nTime += 512; //Trick the MedianTimePast
|
|
|
|
} // unlock cs_main while calling createAndProcessEmptyBlock
|
|
|
|
// Mine an empty block
|
|
createAndProcessEmptyBlock();
|
|
|
|
{
|
|
LOCK(cs_main);
|
|
|
|
SetMockTime(::ChainActive().Tip()->GetMedianTimePast() + 1);
|
|
|
|
BOOST_CHECK(pblocktemplate = AssemblerForTest(chainparams).CreateNewBlock(scriptPubKey));
|
|
BOOST_CHECK_EQUAL(pblocktemplate->block.vtx.size(), 5U);
|
|
} // unlock cs_main while calling InvalidateBlock
|
|
|
|
BlockValidationState state;
|
|
::ChainstateActive().InvalidateBlock(state, WITH_LOCK(cs_main, return ::ChainActive().Tip()));
|
|
|
|
SetMockTime(0);
|
|
m_node.mempool->clear();
|
|
|
|
LOCK2(cs_main, m_node.mempool->cs);
|
|
TestPackageSelection(chainparams, scriptPubKey, txFirst);
|
|
|
|
fCheckpointsEnabled = true;
|
|
}
|
|
|
|
BOOST_AUTO_TEST_SUITE_END()
|