源码地址:https://github.com/corgi-kx/blockchain_consensus_algorithm/tree/master/pow
工作量证明机制的核心在于不断hash区块自身,将hash值与根据难度值计算出的一串大数对比,如果自身hash小于大数则说明挖矿成功,否则变化自身随机数重新计算。并且程序会随着出块间隔时间动态调节难度值(比如比特币)
区块结构
type block struct {
//上一个区块的Hash
Lasthash string
//本区块Hash
Hash string
//区块存储的数据(比如比特币UTXO模型 则此处可用于存储交易)
Data string
//时间戳
Timestamp string
//区块高度
Height int
//难度值
DiffNum uint
//随机数
Nonce int64
}
挖矿函数:
使用math/big包,根据全局变量的难度值diffNum计算出用于实际比较的一串大数newBigint ,并同时将区块hash转换为大数hashInt 两个大数进行数值比较,如果hashInt小于newBigint 则代表挖矿成功
//区块挖矿(通过自身递增nonce值计算hash)
func mine(data string) block {
if len(blockchain) < 1 {
log.Panic("还未生成创世区块!")
}
lastBlock := blockchain[len(blockchain)-1]
//制造一个新的区块
newBlock := new(block)
newBlock.Lasthash = lastBlock.Hash
newBlock.Timestamp = time.Now().String()
newBlock.Height = lastBlock.Height + 1
newBlock.DiffNum = diffNum
newBlock.Data = data
var nonce int64 = 0
//根据挖矿难度值计算的一个大数
newBigint := big.NewInt(1)
newBigint.Lsh(newBigint, 256-diffNum) //相当于左移 1<<256-diffNum
for {
newBlock.Nonce = nonce
newBlock.getHash()
hashInt := big.Int{}
hashBytes, _ := hex.DecodeString(newBlock.Hash)
hashInt.SetBytes(hashBytes) //把本区块hash值转换为一串数字
//如果hash小于挖矿难度值计算的一个大数,则代表挖矿成功
if hashInt.Cmp(newBigint) == -1 {
break
} else {
nonce++ //不满足条件,则不断递增随机数,直到本区块的散列值小于指定的大数
}
}
return *newBlock
}
func main() {
//制造一个创世区块
genesisBlock := new(block)
genesisBlock.Timestamp = time.Now().String()
genesisBlock.Data = "我是创世区块!"
genesisBlock.Lasthash = "0000000000000000000000000000000000000000000000000000000000000000"
genesisBlock.Height = 1
genesisBlock.Nonce = 0
genesisBlock.DiffNum = 0
genesisBlock.getHash()
fmt.Println(*genesisBlock)
//将创世区块添加进区块链
blockchain = append(blockchain, *genesisBlock)
for i := 0; i < 10; i++ {
newBlock := mine("天气不错"+strconv.Itoa(i))
blockchain = append(blockchain, newBlock)
fmt.Println(newBlock)
}
运行结果: