mirror of
https://github.com/kaspanet/kaspad.git
synced 2025-07-31 07:43:19 +00:00
1a43cabfb9
* [NOD-1119] Removed all p2p server from all the initialization of server * [NOD-1119] Removed any calling for p2p server in main * [NOD-1119] Simplified some functions to not take both dag and dagParams * [NOD-1119] Simplify creation of mempool and rpc server * [NOD-1119] Setup indexes in separate function * [NOD-1119] Some cleanup in NewServer * [NOD-1119] Fix mempool test * [NOD-1119] Fix go format * [NOD-1119] Unexport dag.timeSource * [NOD-1119] Removed server package + renamed the Server object to Kaspad, and made it minimal * [NOD-1119] Delete redundant functions * Unexported kaspad and related methods * [NOD-1119] Unexported newKaspad * [NOD-1119] Revise comments and remove redundant function * [NOD-1119] Make comments of unexported methods lower-case * [NOD-1119] Some more refactoring in newKaspad
62 lines
2.5 KiB
Go
62 lines
2.5 KiB
Go
// Copyright (c) 2013-2017 The btcsuite developers
|
|
// Use of this source code is governed by an ISC
|
|
// license that can be found in the LICENSE file.
|
|
|
|
package blockdag
|
|
|
|
import (
|
|
"github.com/kaspanet/kaspad/util/bigintpool"
|
|
"github.com/kaspanet/kaspad/util/mstime"
|
|
|
|
"github.com/kaspanet/kaspad/util"
|
|
)
|
|
|
|
// requiredDifficulty calculates the required difficulty for a
|
|
// block given its bluest parent.
|
|
func (dag *BlockDAG) requiredDifficulty(bluestParent *blockNode, newBlockTime mstime.Time) uint32 {
|
|
// Genesis block.
|
|
if bluestParent == nil || bluestParent.blueScore < dag.difficultyAdjustmentWindowSize+1 {
|
|
return dag.powMaxBits
|
|
}
|
|
|
|
// Fetch window of dag.difficultyAdjustmentWindowSize + 1 so we can have dag.difficultyAdjustmentWindowSize block intervals
|
|
timestampsWindow := blueBlockWindow(bluestParent, dag.difficultyAdjustmentWindowSize+1)
|
|
windowMinTimestamp, windowMaxTimeStamp := timestampsWindow.minMaxTimestamps()
|
|
|
|
// Remove the last block from the window so to calculate the average target of dag.difficultyAdjustmentWindowSize blocks
|
|
targetsWindow := timestampsWindow[:dag.difficultyAdjustmentWindowSize]
|
|
|
|
// Calculate new target difficulty as:
|
|
// averageWindowTarget * (windowMinTimestamp / (targetTimePerBlock * windowSize))
|
|
// The result uses integer division which means it will be slightly
|
|
// rounded down.
|
|
newTarget := bigintpool.Acquire(0)
|
|
defer bigintpool.Release(newTarget)
|
|
windowTimeStampDifference := bigintpool.Acquire(windowMaxTimeStamp - windowMinTimestamp)
|
|
defer bigintpool.Release(windowTimeStampDifference)
|
|
targetTimePerBlock := bigintpool.Acquire(dag.Params.TargetTimePerBlock.Milliseconds())
|
|
defer bigintpool.Release(targetTimePerBlock)
|
|
difficultyAdjustmentWindowSize := bigintpool.Acquire(int64(dag.difficultyAdjustmentWindowSize))
|
|
defer bigintpool.Release(difficultyAdjustmentWindowSize)
|
|
|
|
targetsWindow.averageTarget(newTarget)
|
|
newTarget.
|
|
Mul(newTarget, windowTimeStampDifference).
|
|
Div(newTarget, targetTimePerBlock).
|
|
Div(newTarget, difficultyAdjustmentWindowSize)
|
|
if newTarget.Cmp(dag.Params.PowMax) > 0 {
|
|
return dag.powMaxBits
|
|
}
|
|
newTargetBits := util.BigToCompact(newTarget)
|
|
return newTargetBits
|
|
}
|
|
|
|
// NextRequiredDifficulty calculates the required difficulty for a block that will
|
|
// be built on top of the current tips.
|
|
//
|
|
// This function is safe for concurrent access.
|
|
func (dag *BlockDAG) NextRequiredDifficulty(timestamp mstime.Time) uint32 {
|
|
difficulty := dag.requiredDifficulty(dag.virtual.parents.bluest(), timestamp)
|
|
return difficulty
|
|
}
|