28 m_id(id), m_consensus_params(consensus_params),
29 m_chain_start(chain_start),
30 m_minimum_required_work(minimum_required_work),
31 m_current_chain_work(chain_start->nChainWork),
32 m_last_header_received(m_chain_start->GetBlockHeader()),
33 m_current_height(chain_start->
nHeight)
69 std::vector<CBlockHeader>& received_headers,
const bool full_headers_message)
73 Assume(!received_headers.empty());
74 if (received_headers.empty())
return ret;
89 ret.request_more =
true;
104 for (
const auto& hdr : received_headers) {
122 }
else if (full_headers_message) {
124 ret.request_more =
true;
142 Assume(headers.size() > 0);
143 if (headers.size() == 0)
return true;
159 for (
const auto& hdr : headers) {
191 LogPrint(
BCLog::NET,
"Initial headers sync aborted with peer=%d: invalid difficulty transition at height=%i (presync phase)\n",
m_id, next_height);
203 LogPrint(
BCLog::NET,
"Initial headers sync aborted with peer=%d: exceeded max commitments at height=%i (presync phase)\n",
m_id, next_height);
225 LogPrint(
BCLog::NET,
"Initial headers sync aborted with peer=%d: non-continuous headers at height=%i (redownload phase)\n",
m_id, next_height);
230 uint32_t previous_nBits{0};
238 previous_nBits, header.
nBits)) {
239 LogPrint(
BCLog::NET,
"Initial headers sync aborted with peer=%d: invalid difficulty transition at height=%i (redownload phase)\n",
m_id, next_height);
258 LogPrint(
BCLog::NET,
"Initial headers sync aborted with peer=%d: commitment overrun at height=%i (redownload phase)\n",
m_id, next_height);
266 if (commitment != expected_commitment) {
267 LogPrint(
BCLog::NET,
"Initial headers sync aborted with peer=%d: commitment mismatch at height=%i (redownload phase)\n",
m_id, next_height);
282 std::vector<CBlockHeader>
ret;
302 std::vector<uint256> locator;
314 locator.insert(locator.end(), chain_start_locator.begin(), chain_start_locator.end());
arith_uint256 GetBlockProof(const CBlockIndex &block)
std::vector< uint256 > LocatorEntries(const CBlockIndex *index)
Construct a list of hash entries to put in a locator.
static constexpr int64_t MAX_FUTURE_BLOCK_TIME
Maximum amount of time that a block timestamp is allowed to exceed the current network-adjusted time ...
#define Assume(val)
Assume is the identity function.
The block chain is a tree shaped structure starting with the genesis block at the root,...
arith_uint256 nChainWork
(memory only) Total amount of work (expected number of hashes) in the chain up to and including this ...
uint256 GetBlockHash() const
int64_t GetMedianTimePast() const
int nHeight
height of the entry in the chain. The genesis block has height 0
256-bit unsigned big integer.
std::string ToString() const
size_type size() const noexcept
Count the number of bits in the container.
#define LogPrint(category,...)
bool PermittedDifficultyTransition(const Consensus::Params ¶ms, int64_t height, uint32_t old_nbits, uint32_t new_nbits)
Return false if the proof-of-work requirement specified by new_nbits at a given height is not possibl...
T GetRand(T nMax=std::numeric_limits< T >::max()) noexcept
Generate a uniform random integer of type T in the range [0..nMax) nMax defaults to std::numeric_limi...
Describes a place in the block chain to another node such that if the other node doesn't have the sam...
Parameters that influence chain consensus.
std::chrono::time_point< NodeClock, std::chrono::seconds > NodeSeconds
NodeClock::time_point GetAdjustedTime()