eece63fa72
This switches the Merkle tree logic for blocks to one that runs in constant (small) space. The old code is moved to tests, and a new test is added that for various combinations of block sizes, transaction positions to compute a branch for, and mutations: * Verifies that the old code and new code agree for the Merkle root. * Verifies that the old code and new code agree for the Merkle branch. * Verifies that the computed Merkle branch is valid. * Verifies that mutations don't change the Merkle root. * Verifies that mutations are correctly detected.
76 lines
2.5 KiB
C++
76 lines
2.5 KiB
C++
// Copyright (c) 2014 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 "main.h"
|
|
|
|
#include "test/test_bitcoin.h"
|
|
|
|
#include <boost/signals2/signal.hpp>
|
|
#include <boost/test/unit_test.hpp>
|
|
|
|
BOOST_FIXTURE_TEST_SUITE(main_tests, TestingSetup)
|
|
|
|
static void TestBlockSubsidyHalvings(const Consensus::Params& consensusParams)
|
|
{
|
|
int maxHalvings = 64;
|
|
CAmount nInitialSubsidy = 50 * COIN;
|
|
|
|
CAmount nPreviousSubsidy = nInitialSubsidy * 2; // for height == 0
|
|
BOOST_CHECK_EQUAL(nPreviousSubsidy, nInitialSubsidy * 2);
|
|
for (int nHalvings = 0; nHalvings < maxHalvings; nHalvings++) {
|
|
int nHeight = nHalvings * consensusParams.nSubsidyHalvingInterval;
|
|
CAmount nSubsidy = GetBlockSubsidy(nHeight, consensusParams);
|
|
BOOST_CHECK(nSubsidy <= nInitialSubsidy);
|
|
BOOST_CHECK_EQUAL(nSubsidy, nPreviousSubsidy / 2);
|
|
nPreviousSubsidy = nSubsidy;
|
|
}
|
|
BOOST_CHECK_EQUAL(GetBlockSubsidy(maxHalvings * consensusParams.nSubsidyHalvingInterval, consensusParams), 0);
|
|
}
|
|
|
|
static void TestBlockSubsidyHalvings(int nSubsidyHalvingInterval)
|
|
{
|
|
Consensus::Params consensusParams;
|
|
consensusParams.nSubsidyHalvingInterval = nSubsidyHalvingInterval;
|
|
TestBlockSubsidyHalvings(consensusParams);
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(block_subsidy_test)
|
|
{
|
|
TestBlockSubsidyHalvings(Params(CBaseChainParams::MAIN).GetConsensus()); // As in main
|
|
TestBlockSubsidyHalvings(150); // As in regtest
|
|
TestBlockSubsidyHalvings(1000); // Just another interval
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(subsidy_limit_test)
|
|
{
|
|
const Consensus::Params& consensusParams = Params(CBaseChainParams::MAIN).GetConsensus();
|
|
CAmount nSum = 0;
|
|
for (int nHeight = 0; nHeight < 14000000; nHeight += 1000) {
|
|
CAmount nSubsidy = GetBlockSubsidy(nHeight, consensusParams);
|
|
BOOST_CHECK(nSubsidy <= 50 * COIN);
|
|
nSum += nSubsidy * 1000;
|
|
BOOST_CHECK(MoneyRange(nSum));
|
|
}
|
|
BOOST_CHECK_EQUAL(nSum, 2099999997690000ULL);
|
|
}
|
|
|
|
bool ReturnFalse() { return false; }
|
|
bool ReturnTrue() { return true; }
|
|
|
|
BOOST_AUTO_TEST_CASE(test_combiner_all)
|
|
{
|
|
boost::signals2::signal<bool (), CombinerAll> Test;
|
|
BOOST_CHECK(Test());
|
|
Test.connect(&ReturnFalse);
|
|
BOOST_CHECK(!Test());
|
|
Test.connect(&ReturnTrue);
|
|
BOOST_CHECK(!Test());
|
|
Test.disconnect(&ReturnFalse);
|
|
BOOST_CHECK(Test());
|
|
Test.disconnect(&ReturnTrue);
|
|
BOOST_CHECK(Test());
|
|
}
|
|
BOOST_AUTO_TEST_SUITE_END()
|