// Copyright (c) 2009-2010 Satoshi Nakamoto

// Copyright (c) 2009-2022 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 <pow.h>

#include <arith_uint256.h>

#include <chain.h>

#include <primitives/block.h>

#include <uint256.h>

unsigned int GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlockHeader *pblock, const Consensus::Params& params)

{

    assert(pindexLast != nullptr);

    unsigned int nProofOfWorkLimit = UintToArith256(params.powLimit).GetCompact();

    // Only change once per difficulty adjustment interval

    if ((pindexLast->nHeight+1) % params.DifficultyAdjustmentInterval() != 0)

  Branch (19:9): [True: 6.84k, False: 0]

    {

        if (params.fPowAllowMinDifficultyBlocks)

  Branch (21:13): [True: 0, False: 6.84k]

        {

            // Special difficulty rule for testnet:

            // If the new block's timestamp is more than 2* 10 minutes

            // then allow mining of a min-difficulty block.

            if (pblock->GetBlockTime() > pindexLast->GetBlockTime() + params.nPowTargetSpacing*2)

  Branch (26:17): [True: 0, False: 0]

                return nProofOfWorkLimit;

            else

            {

                // Return the last non-special-min-difficulty-rules-block

                const CBlockIndex* pindex = pindexLast;

                while (pindex->pprev && pindex->nHeight % params.DifficultyAdjustmentInterval() != 0 && pindex->nBits == nProofOfWorkLimit)

  Branch (32:24): [True: 0, False: 0]
  Branch (32:41): [True: 0, False: 0]
  Branch (32:105): [True: 0, False: 0]

                    pindex = pindex->pprev;

                return pindex->nBits;

            }

        }

        return pindexLast->nBits;

    }

    // Go back by what we want to be 14 days worth of blocks

    int nHeightFirst = pindexLast->nHeight - (params.DifficultyAdjustmentInterval()-1);

    assert(nHeightFirst >= 0);

    const CBlockIndex* pindexFirst = pindexLast->GetAncestor(nHeightFirst);

    assert(pindexFirst);

    return CalculateNextWorkRequired(pindexLast, pindexFirst->GetBlockTime(), params);

}

unsigned int CalculateNextWorkRequired(const CBlockIndex* pindexLast, int64_t nFirstBlockTime, const Consensus::Params& params)

{

    if (params.fPowNoRetargeting)

  Branch (51:9): [True: 0, False: 0]

        return pindexLast->nBits;

    // Limit adjustment step

    int64_t nActualTimespan = pindexLast->GetBlockTime() - nFirstBlockTime;

    if (nActualTimespan < params.nPowTargetTimespan/4)

  Branch (56:9): [True: 0, False: 0]

        nActualTimespan = params.nPowTargetTimespan/4;

    if (nActualTimespan > params.nPowTargetTimespan*4)

  Branch (58:9): [True: 0, False: 0]

        nActualTimespan = params.nPowTargetTimespan*4;

    // Retarget

    const arith_uint256 bnPowLimit = UintToArith256(params.powLimit);

    arith_uint256 bnNew;

    // Special difficulty rule for Testnet4

    if (params.enforce_BIP94) {

  Branch (66:9): [True: 0, False: 0]

        // Here we use the first block of the difficulty period. This way

        // the real difficulty is always preserved in the first block as

        // it is not allowed to use the min-difficulty exception.

        int nHeightFirst = pindexLast->nHeight - (params.DifficultyAdjustmentInterval()-1);

        const CBlockIndex* pindexFirst = pindexLast->GetAncestor(nHeightFirst);

        bnNew.SetCompact(pindexFirst->nBits);

    } else {

        bnNew.SetCompact(pindexLast->nBits);

    }

    bnNew *= nActualTimespan;

    bnNew /= params.nPowTargetTimespan;

    if (bnNew > bnPowLimit)

  Branch (80:9): [True: 0, False: 0]

        bnNew = bnPowLimit;

    return bnNew.GetCompact();

}

// Check that on difficulty adjustments, the new difficulty does not increase

// or decrease beyond the permitted limits.

bool PermittedDifficultyTransition(const Consensus::Params& params, int64_t height, uint32_t old_nbits, uint32_t new_nbits)

{

    if (params.fPowAllowMinDifficultyBlocks) return true;

  Branch (90:9): [True: 0, False: 25.9k]

    if (height % params.DifficultyAdjustmentInterval() == 0) {

  Branch (92:9): [True: 0, False: 25.9k]

        int64_t smallest_timespan = params.nPowTargetTimespan/4;

        int64_t largest_timespan = params.nPowTargetTimespan*4;

        const arith_uint256 pow_limit = UintToArith256(params.powLimit);

        arith_uint256 observed_new_target;

        observed_new_target.SetCompact(new_nbits);

        // Calculate the largest difficulty value possible:

        arith_uint256 largest_difficulty_target;

        largest_difficulty_target.SetCompact(old_nbits);

        largest_difficulty_target *= largest_timespan;

        largest_difficulty_target /= params.nPowTargetTimespan;

        if (largest_difficulty_target > pow_limit) {

  Branch (106:13): [True: 0, False: 0]

            largest_difficulty_target = pow_limit;

        }

        // Round and then compare this new calculated value to what is

        // observed.

        arith_uint256 maximum_new_target;

        maximum_new_target.SetCompact(largest_difficulty_target.GetCompact());

        if (maximum_new_target < observed_new_target) return false;

  Branch (114:13): [True: 0, False: 0]

        // Calculate the smallest difficulty value possible:

        arith_uint256 smallest_difficulty_target;

        smallest_difficulty_target.SetCompact(old_nbits);

        smallest_difficulty_target *= smallest_timespan;

        smallest_difficulty_target /= params.nPowTargetTimespan;

        if (smallest_difficulty_target > pow_limit) {

  Branch (122:13): [True: 0, False: 0]

            smallest_difficulty_target = pow_limit;

        }

        // Round and then compare this new calculated value to what is

        // observed.

        arith_uint256 minimum_new_target;

        minimum_new_target.SetCompact(smallest_difficulty_target.GetCompact());

        if (minimum_new_target > observed_new_target) return false;

  Branch (130:13): [True: 0, False: 0]

    } else if (old_nbits != new_nbits) {

  Branch (131:16): [True: 139, False: 25.8k]

        return false;

    }

    return true;

}

// Bypasses the actual proof of work check during fuzz testing with a simplified validation checking whether

// the most signficant bit of the last byte of the hash is set.

bool CheckProofOfWork(uint256 hash, unsigned int nBits, const Consensus::Params& params)

{

#ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION

    return (hash.data()[31] & 0x80) == 0;

#else

    return CheckProofOfWorkImpl(hash, nBits, params);

#endif

}

bool CheckProofOfWorkImpl(uint256 hash, unsigned int nBits, const Consensus::Params& params)

{

    bool fNegative;

    bool fOverflow;

    arith_uint256 bnTarget;

    bnTarget.SetCompact(nBits, &fNegative, &fOverflow);

    // Check range

    if (fNegative || bnTarget == 0 || fOverflow || bnTarget > UintToArith256(params.powLimit))

  Branch (157:9): [True: 0, False: 0]
  Branch (157:9): [True: 0, False: 0]
  Branch (157:22): [True: 0, False: 0]
  Branch (157:39): [True: 0, False: 0]
  Branch (157:52): [True: 0, False: 0]

        return false;

    // Check proof of work matches claimed amount

    if (UintToArith256(hash) > bnTarget)

  Branch (161:9): [True: 0, False: 0]

        return false;

    return true;

}