difficulty

Documentation

Index

• func BigToCompact(n *big.Int) uint64
• func CalcNextRequiredDifficulty(lastBH, compareBH *types.BlockHeader) uint64
• func CalcWork(bits uint64) *big.Int
• func CheckProofOfWork(hash, seed *bc.Hash, bits uint64) bool
• func CompactToBig(compact uint64) *big.Int
• func HashToBig(hash *bc.Hash) *big.Int

Functions

func BigToCompact

func BigToCompact(n *big.Int) uint64

BigToCompact converts a whole number N to a compact representation using an unsigned 64-bit number. Sign is not really being used, but it's kept here.

func CalcNextRequiredDifficulty

func CalcNextRequiredDifficulty(lastBH, compareBH *types.BlockHeader) uint64

CalcNextRequiredDifficulty return the difficulty using compact representation for next block, when a lower difficulty Int actually reflects a more difficult mining progress.

func CalcWork

func CalcWork(bits uint64) *big.Int

CalcWork calculates a work value from difficulty bits.

func CheckProofOfWork

func CheckProofOfWork(hash, seed *bc.Hash, bits uint64) bool

CheckProofOfWork checks whether the hash is vaild for a given difficulty.

func CompactToBig

func CompactToBig(compact uint64) *big.Int

CompactToBig converts a compact representation of a whole unsigned integer N to an big.Int. The representation is similar to IEEE754 floating point numbers. Sign is not really being used.

	-------------------------------------------------
	|   Exponent     |    Sign    |    Mantissa     |
	-------------------------------------------------
	| 8 bits [63-56] | 1 bit [55] | 55 bits [54-00] |
	-------------------------------------------------

	N = (-1^sign) * mantissa * 256^(exponent-3)
 Actually it will be nicer to use 7 instead of 3 for robustness reason.

func HashToBig

func HashToBig(hash *bc.Hash) *big.Int

HashToBig convert bc.Hash to a difficulty int