Hush Full Node software. We were censored from Github, this is where all development happens now.
https://hush.is
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
99 lines
3.6 KiB
99 lines
3.6 KiB
// Copyright (c) 2015 The Bitcoin Core developers
|
|
// Distributed under the GPLv3/X11 software license, see the accompanying
|
|
// file COPYING or https://www.gnu.org/licenses/gpl-3.0.en.html
|
|
|
|
#include "main.h"
|
|
#include "pow.h"
|
|
#include "util.h"
|
|
#include "test/test_bitcoin.h"
|
|
|
|
#include <boost/test/unit_test.hpp>
|
|
|
|
using namespace std;
|
|
|
|
BOOST_FIXTURE_TEST_SUITE(pow_tests, BasicTestingSetup)
|
|
|
|
/* Test calculation of next difficulty target with no constraints applying */
|
|
BOOST_AUTO_TEST_CASE(get_next_work)
|
|
{
|
|
SelectParams(CBaseChainParams::MAIN);
|
|
const Consensus::Params& params = Params().GetConsensus();
|
|
|
|
int64_t nLastRetargetTime = 1262149169; // NOTE: Not an actual block time
|
|
int64_t nThisTime = 1262152739; // Block #32255 of Bitcoin
|
|
arith_uint256 bnAvg;
|
|
bnAvg.SetCompact(0x1d00ffff);
|
|
BOOST_CHECK_EQUAL(0x1d011998,
|
|
CalculateNextWorkRequired(bnAvg, nThisTime, nLastRetargetTime, params));
|
|
}
|
|
|
|
/* Test the constraint on the upper bound for next work */
|
|
BOOST_AUTO_TEST_CASE(get_next_work_pow_limit)
|
|
{
|
|
SelectParams(CBaseChainParams::MAIN);
|
|
const Consensus::Params& params = Params().GetConsensus();
|
|
|
|
int64_t nLastRetargetTime = 1231006505; // Block #0 of Bitcoin
|
|
int64_t nThisTime = 1233061996; // Block #2015 of Bitcoin
|
|
arith_uint256 bnAvg;
|
|
// TODO change once the harder genesis block is generated
|
|
bnAvg.SetCompact(KOMODO_MINDIFF_NBITS);
|
|
BOOST_CHECK_EQUAL(KOMODO_MINDIFF_NBITS,
|
|
CalculateNextWorkRequired(bnAvg, nThisTime, nLastRetargetTime, params));
|
|
}
|
|
|
|
/* Test the constraint on the lower bound for actual time taken */
|
|
BOOST_AUTO_TEST_CASE(get_next_work_lower_limit_actual)
|
|
{
|
|
SelectParams(CBaseChainParams::MAIN);
|
|
const Consensus::Params& params = Params().GetConsensus();
|
|
|
|
int64_t nLastRetargetTime = 1279296753; // NOTE: Not an actual block time
|
|
int64_t nThisTime = 1279297671; // Block #68543 of Bitcoin
|
|
arith_uint256 bnAvg;
|
|
bnAvg.SetCompact(0x1c05a3f4);
|
|
BOOST_CHECK_EQUAL(0x1c04bceb,
|
|
CalculateNextWorkRequired(bnAvg, nThisTime, nLastRetargetTime, params));
|
|
}
|
|
|
|
/* Test the constraint on the upper bound for actual time taken */
|
|
BOOST_AUTO_TEST_CASE(get_next_work_upper_limit_actual)
|
|
{
|
|
SelectParams(CBaseChainParams::MAIN);
|
|
const Consensus::Params& params = Params().GetConsensus();
|
|
|
|
int64_t nLastRetargetTime = 1269205629; // NOTE: Not an actual block time
|
|
int64_t nThisTime = 1269211443; // Block #46367 of Bitcoin
|
|
arith_uint256 bnAvg;
|
|
bnAvg.SetCompact(0x1c387f6f);
|
|
BOOST_CHECK_EQUAL(0x1c4a93bb,
|
|
CalculateNextWorkRequired(bnAvg, nThisTime, nLastRetargetTime, params));
|
|
}
|
|
|
|
BOOST_AUTO_TEST_CASE(GetBlockProofEquivalentTime_test)
|
|
{
|
|
SelectParams(CBaseChainParams::MAIN);
|
|
const Consensus::Params& params = Params().GetConsensus();
|
|
|
|
std::vector<CBlockIndex> blocks(10000);
|
|
for (int i = 0; i < 10000; i++) {
|
|
blocks[i].pprev = i ? &blocks[i - 1] : NULL;
|
|
blocks[i].SetHeight(i);
|
|
blocks[i].nTime = 1269211443 + i * params.nPowTargetSpacing;
|
|
blocks[i].nBits = 0x207fffff; /* target 0x7fffff000... */
|
|
blocks[i].chainPower = CChainPower(&blocks[i]);
|
|
if (i != 0)
|
|
blocks[i].chainPower += GetBlockProof(blocks[i - 1]);
|
|
}
|
|
|
|
for (int j = 0; j < 1000; j++) {
|
|
CBlockIndex *p1 = &blocks[GetRand(10000)];
|
|
CBlockIndex *p2 = &blocks[GetRand(10000)];
|
|
CBlockIndex *p3 = &blocks[GetRand(10000)];
|
|
|
|
int64_t tdiff = GetBlockProofEquivalentTime(*p1, *p2, *p3, params);
|
|
BOOST_CHECK_EQUAL(tdiff, p1->GetBlockTime() - p2->GetBlockTime());
|
|
}
|
|
}
|
|
|
|
BOOST_AUTO_TEST_SUITE_END()
|
|
|