-
Notifications
You must be signed in to change notification settings - Fork 9
Expand file tree
/
Copy pathpow_tests.cpp
More file actions
250 lines (215 loc) · 9.4 KB
/
Copy pathpow_tests.cpp
File metadata and controls
250 lines (215 loc) · 9.4 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
// Copyright (c) 2015-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 <chain.h>
#include <chainparams.h>
#include <crypto/scrypt.h>
#include <pow.h>
#include <primitives/block.h>
#include <test/util/setup_common.h>
#include <uint256.h>
#include <boost/test/unit_test.hpp>
#ifndef WIN32
#include <algorithm>
#include <climits>
#include <pthread.h>
#include <unistd.h>
#endif
BOOST_FIXTURE_TEST_SUITE(pow_tests, BasicTestingSetup)
/* Test CalculateNextWorkRequired stub returns 0 */
// NOTE: Reddcoin uses Kimoto Gravity Well, not Bitcoin's CalculateNextWorkRequired
// CalculateNextWorkRequired() is a stub that returns 0 in Reddcoin
BOOST_AUTO_TEST_CASE(calculate_next_work_stub)
{
const auto chainParams = CreateChainParams(*m_node.args, CBaseChainParams::MAIN);
CBlockIndex pindexLast;
pindexLast.nHeight = 1000;
pindexLast.nTime = 1391411877;
pindexLast.nBits = 0x1c05f176;
BOOST_CHECK_EQUAL(CalculateNextWorkRequired(&pindexLast, 0, chainParams->GetConsensus()), 0U);
}
/* Test GetNextWorkRequired with actual Reddcoin mainnet blocks */
// Kimoto Gravity Well difficulty adjustment
BOOST_AUTO_TEST_CASE(get_next_work_kgw)
{
const auto chainParams = CreateChainParams(*m_node.args, CBaseChainParams::MAIN);
// Build a simple chain to test KGW
// Using actual mainnet block data: height 1000, time 1391411877, bits 0x1c05f176
CBlockIndex pindexLast;
pindexLast.nHeight = 1000;
pindexLast.nTime = 1391411877;
pindexLast.nBits = 0x1c05f176;
pindexLast.pprev = nullptr;
// Test that GetNextWorkRequired returns a valid difficulty
CBlockHeader blockHeader;
blockHeader.nTime = pindexLast.nTime + 60; // 1 minute later
unsigned int nBits = GetNextWorkRequired(&pindexLast, &blockHeader, chainParams->GetConsensus());
// Verify it's within powLimit
arith_uint256 bnTarget;
bnTarget.SetCompact(nBits);
BOOST_CHECK(bnTarget <= UintToArith256(chainParams->GetConsensus().powLimit));
BOOST_CHECK(bnTarget > 0);
}
/* Test GetNextWorkRequired returns powLimit for very early blocks */
BOOST_AUTO_TEST_CASE(get_next_work_pow_limit)
{
const auto chainParams = CreateChainParams(*m_node.args, CBaseChainParams::MAIN);
// Very early block should return powLimit
CBlockIndex pindexLast;
pindexLast.nHeight = 5;
pindexLast.nTime = 1390280460; // shortly after genesis
pindexLast.nBits = 0x1e0ffff0;
pindexLast.pprev = nullptr;
CBlockHeader blockHeader;
blockHeader.nTime = pindexLast.nTime + 60;
unsigned int nBits = GetNextWorkRequired(&pindexLast, &blockHeader, chainParams->GetConsensus());
// Should return powLimit for blocks with height < PastBlocksMin
BOOST_CHECK_EQUAL(nBits, UintToArith256(chainParams->GetConsensus().powLimit).GetCompact());
}
BOOST_AUTO_TEST_CASE(CheckProofOfWork_test_negative_target)
{
const auto consensus = CreateChainParams(*m_node.args, CBaseChainParams::MAIN)->GetConsensus();
uint256 hash;
unsigned int nBits;
nBits = UintToArith256(consensus.powLimit).GetCompact(true);
hash.SetHex("0x1");
BOOST_CHECK(!CheckProofOfWork(hash, nBits, consensus));
}
BOOST_AUTO_TEST_CASE(CheckProofOfWork_test_overflow_target)
{
const auto consensus = CreateChainParams(*m_node.args, CBaseChainParams::MAIN)->GetConsensus();
uint256 hash;
unsigned int nBits = ~0x00800000;
hash.SetHex("0x1");
BOOST_CHECK(!CheckProofOfWork(hash, nBits, consensus));
}
BOOST_AUTO_TEST_CASE(CheckProofOfWork_test_too_easy_target)
{
const auto consensus = CreateChainParams(*m_node.args, CBaseChainParams::MAIN)->GetConsensus();
uint256 hash;
unsigned int nBits;
arith_uint256 nBits_arith = UintToArith256(consensus.powLimit);
nBits_arith *= 2;
nBits = nBits_arith.GetCompact();
hash.SetHex("0x1");
BOOST_CHECK(!CheckProofOfWork(hash, nBits, consensus));
}
BOOST_AUTO_TEST_CASE(CheckProofOfWork_test_biger_hash_than_target)
{
const auto consensus = CreateChainParams(*m_node.args, CBaseChainParams::MAIN)->GetConsensus();
uint256 hash;
unsigned int nBits;
arith_uint256 hash_arith = UintToArith256(consensus.powLimit);
nBits = hash_arith.GetCompact();
hash_arith *= 2; // hash > nBits
hash = ArithToUint256(hash_arith);
BOOST_CHECK(!CheckProofOfWork(hash, nBits, consensus));
}
BOOST_AUTO_TEST_CASE(CheckProofOfWork_test_zero_target)
{
const auto consensus = CreateChainParams(*m_node.args, CBaseChainParams::MAIN)->GetConsensus();
uint256 hash;
unsigned int nBits;
arith_uint256 hash_arith{0};
nBits = hash_arith.GetCompact();
hash = ArithToUint256(hash_arith);
BOOST_CHECK(!CheckProofOfWork(hash, nBits, consensus));
}
BOOST_AUTO_TEST_CASE(GetBlockProofEquivalentTime_test)
{
const auto chainParams = CreateChainParams(*m_node.args, CBaseChainParams::MAIN);
std::vector<CBlockIndex> blocks(10000);
for (int i = 0; i < 10000; i++) {
blocks[i].pprev = i ? &blocks[i - 1] : nullptr;
blocks[i].nHeight = i;
blocks[i].nTime = 1269211443 + i * chainParams->GetConsensus().nPowTargetSpacing;
blocks[i].nBits = 0x207fffff; /* target 0x7fffff000... */
blocks[i].nChainWork = i ? blocks[i - 1].nChainWork + GetBlockProof(blocks[i - 1]) : arith_uint256(0);
}
for (int j = 0; j < 1000; j++) {
CBlockIndex *p1 = &blocks[InsecureRandRange(10000)];
CBlockIndex *p2 = &blocks[InsecureRandRange(10000)];
CBlockIndex *p3 = &blocks[InsecureRandRange(10000)];
int64_t tdiff = GetBlockProofEquivalentTime(*p1, *p2, *p3, chainParams->GetConsensus());
BOOST_CHECK_EQUAL(tdiff, p1->GetBlockTime() - p2->GetBlockTime());
}
}
void sanity_check_chainparams(const ArgsManager& args, std::string chainName)
{
const auto chainParams = CreateChainParams(args, chainName);
const auto consensus = chainParams->GetConsensus();
// hash genesis is correct
BOOST_CHECK_EQUAL(consensus.hashGenesisBlock, chainParams->GenesisBlock().GetHash());
// target timespan is an even multiple of spacing
BOOST_CHECK_EQUAL(consensus.nPowTargetTimespan % consensus.nPowTargetSpacing, 0);
// genesis nBits is positive, doesn't overflow and is lower than powLimit
arith_uint256 pow_compact;
bool neg, over;
pow_compact.SetCompact(chainParams->GenesisBlock().nBits, &neg, &over);
BOOST_CHECK(!neg && pow_compact != 0);
BOOST_CHECK(!over);
BOOST_CHECK(UintToArith256(consensus.powLimit) >= pow_compact);
// check max target * 4*nPowTargetTimespan doesn't overflow -- see pow.cpp:CalculateNextWorkRequired()
if (!consensus.fPowNoRetargeting) {
arith_uint256 targ_max("0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF");
targ_max /= consensus.nPowTargetTimespan*4;
BOOST_CHECK(UintToArith256(consensus.powLimit) < targ_max);
}
}
BOOST_AUTO_TEST_CASE(ChainParams_MAIN_sanity)
{
sanity_check_chainparams(*m_node.args, CBaseChainParams::MAIN);
}
BOOST_AUTO_TEST_CASE(ChainParams_REGTEST_sanity)
{
sanity_check_chainparams(*m_node.args, CBaseChainParams::REGTEST);
}
BOOST_AUTO_TEST_CASE(ChainParams_TESTNET_sanity)
{
sanity_check_chainparams(*m_node.args, CBaseChainParams::TESTNET);
}
BOOST_AUTO_TEST_CASE(ChainParams_SIGNET_sanity)
{
sanity_check_chainparams(*m_node.args, CBaseChainParams::SIGNET);
}
#ifndef WIN32
//! The proof-of-work hash must not depend on the size of the thread stack.
//!
//! scrypt's scratchpad is 128 KiB, and musl gives every thread but the main
//! one a 128 KiB stack. While the scratchpad sat on the stack, reddcoind
//! segfaulted in the Alpine docker image the first time a header was hashed
//! off the main thread: at the testnet genesis block used here on testnet and
//! regtest, and during header sync on mainnet.
//!
//! The expected hash was computed independently with OpenSSL's scrypt
//! (N=1024, r=1, p=1). The guard below the stack is made at least as large as
//! the scratchpad, so a scratchpad back on the stack faults rather than
//! writing over whatever is mapped below it. macOS refuses a guard that is not
//! a whole number of pages, so the size is rounded up to one.
BOOST_AUTO_TEST_CASE(pow_hash_on_a_small_thread_stack)
{
const auto chainParams = CreateChainParams(*m_node.args, CBaseChainParams::TESTNET);
struct Job {
CBlockHeader header;
uint256 hash;
} job{chainParams->GenesisBlock().GetBlockHeader(), {}};
const size_t page_size{static_cast<size_t>(sysconf(_SC_PAGESIZE))};
const size_t guard_size{(SCRYPT_SCRATCHPAD_SIZE + page_size - 1) / page_size * page_size};
pthread_attr_t attr;
BOOST_REQUIRE_EQUAL(pthread_attr_init(&attr), 0);
BOOST_REQUIRE_EQUAL(pthread_attr_setstacksize(&attr, std::max<size_t>(64 * 1024, PTHREAD_STACK_MIN)), 0);
BOOST_REQUIRE_EQUAL(pthread_attr_setguardsize(&attr, guard_size), 0);
pthread_t thread;
const int created{pthread_create(&thread, &attr, [](void* arg) -> void* {
auto* job = static_cast<Job*>(arg);
job->hash = job->header.GetPoWHash();
return nullptr;
}, &job)};
pthread_attr_destroy(&attr);
BOOST_REQUIRE_EQUAL(created, 0);
BOOST_REQUIRE_EQUAL(pthread_join(thread, nullptr), 0);
BOOST_CHECK_EQUAL(job.hash, uint256S("00000a9a56d92855f2590eb528ddfb52ac93811c53c9b50a3e8b25653efd509b"));
BOOST_CHECK(CheckProofOfWork(job.hash, job.header.nBits, chainParams->GetConsensus()));
}
#endif
BOOST_AUTO_TEST_SUITE_END()