github.com/core-coin/go-core/v2@v2.1.9/core/block_validator.go

// Copyright 2015 by the Authors
// This file is part of the go-core library.
//
// The go-core library is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// The go-core library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with the go-core library. If not, see <http://www.gnu.org/licenses/>.

package core

import (
	"fmt"

	"github.com/core-coin/go-core/v2/common"
	"github.com/core-coin/go-core/v2/consensus"
	"github.com/core-coin/go-core/v2/core/state"
	"github.com/core-coin/go-core/v2/core/types"
	"github.com/core-coin/go-core/v2/params"
	"github.com/core-coin/go-core/v2/trie"
)

// BlockValidator is responsible for validating block headers, uncles and
// processed state.
//
// BlockValidator implements Validator.
type BlockValidator struct {
	config *params.ChainConfig // Chain configuration options
	bc     *BlockChain         // Canonical block chain
	engine consensus.Engine    // Consensus engine used for validating
}

// NewBlockValidator returns a new block validator which is safe for re-use
func NewBlockValidator(config *params.ChainConfig, blockchain *BlockChain, engine consensus.Engine) *BlockValidator {
	validator := &BlockValidator{
		config: config,
		engine: engine,
		bc:     blockchain,
	}
	return validator
}

// ValidateBody validates the given block's uncles and verifies the block
// header's transaction and uncle roots. The headers are assumed to be already
// validated at this point.
func (v *BlockValidator) ValidateBody(block *types.Block) error {
	// Check whether the block's known, and if not, that it's linkable
	if v.bc.HasBlockAndState(block.Hash(), block.NumberU64()) {
		return ErrKnownBlock
	}
	// Header validity is known at this point, check the uncles and transactions
	header := block.Header()
	if err := v.engine.VerifyUncles(v.bc, block); err != nil {
		return err
	}
	if hash := types.CalcUncleHash(block.Uncles()); hash != header.UncleHash {
		return fmt.Errorf("uncle root hash mismatch: have %x, want %x", hash, header.UncleHash)
	}
	if hash := types.DeriveSha(block.Transactions(), trie.NewStackTrie(nil)); hash != header.TxHash {
		return fmt.Errorf("transaction root hash mismatch: have %x, want %x", hash, header.TxHash)
	}

	// Validate transactions network IDs and addresses
	for _, tx := range block.Transactions() {
		if tx.Hash().Hex() != params.ZeroNetworkIDTxHash.Hex() && tx.NetworkID() != uint(v.config.NetworkID.Uint64()) {
			return types.ErrInvalidNetworkId
		}
		if tx.To() != nil && common.VerifyAddress(*tx.To()) != nil {
			return ErrInvalidRecipientOrSig
		}
	}

	if !v.bc.HasBlockAndState(block.ParentHash(), block.NumberU64()-1) {
		if !v.bc.HasBlock(block.ParentHash(), block.NumberU64()-1) {
			return consensus.ErrUnknownAncestor
		}
		return consensus.ErrPrunedAncestor
	}
	return nil
}

// ValidateState validates the various changes that happen after a state
// transition, such as amount of used energy, the receipt roots and the state root
// itself. ValidateState returns a database batch if the validation was a success
// otherwise nil and an error is returned.
func (v *BlockValidator) ValidateState(block *types.Block, statedb *state.StateDB, receipts types.Receipts, usedEnergy uint64) error {
	header := block.Header()
	if block.EnergyUsed() != usedEnergy {
		return fmt.Errorf("invalid energy used (remote: %d local: %d)", block.EnergyUsed(), usedEnergy)
	}
	// Validate the received block's bloom with the one derived from the generated receipts.
	// For valid blocks this should always validate to true.
	rbloom := types.CreateBloom(receipts)
	if rbloom != header.Bloom {
		return fmt.Errorf("invalid bloom (remote: %x  local: %x)", header.Bloom, rbloom)
	}
	// Tre receipt Trie's root (R = (Tr [[H1, R1], ... [Hn, Rn]]))
	receiptSha := types.DeriveSha(receipts, trie.NewStackTrie(nil))
	if receiptSha != header.ReceiptHash {
		return fmt.Errorf("invalid receipt root hash (remote: %x local: %x)", header.ReceiptHash, receiptSha)
	}
	// Validate the state root against the received state root and throw
	// an error if they don't match.
	if root := statedb.IntermediateRoot(true); header.Root != root {
		return fmt.Errorf("invalid merkle root (remote: %x local: %x)", header.Root, root)
	}
	return nil
}

// CalcEnergyLimit computes the energy limit of the next block after parent. It aims
// to keep the baseline energy above the provided floor, and increase it towards the
// ceil if the blocks are full. If the ceil is exceeded, it will always decrease
// the energy allowance.
func CalcEnergyLimit(parent *types.Block, energyFloor, energyCeil uint64) uint64 {
	// contrib = (parentEnergyUsed * 3 / 2) / 1024
	contrib := (parent.EnergyUsed() + parent.EnergyUsed()/2) / params.EnergyLimitBoundDivisor

	// decay = parentEnergyLimit / 1024 -1
	decay := parent.EnergyLimit()/params.EnergyLimitBoundDivisor - 1

	/*
		strategy: energyLimit of block-to-mine is set based on parent's
		energyUsed value.  if parentEnergyUsed > parentEnergyLimit * (2/3) then we
		increase it, otherwise lower it (or leave it unchanged if it's right
		at that usage) the amount increased/decreased depends on how far away
		from parentEnergyLimit * (2/3) parentEnergyUsed is.
	*/
	limit := parent.EnergyLimit() - decay + contrib
	if limit < params.MinEnergyLimit {
		limit = params.MinEnergyLimit
	}
	// If we're outside our allowed energy range, we try to hone towards them
	if limit < energyFloor {
		limit = parent.EnergyLimit() + decay
		if limit > energyFloor {
			limit = energyFloor
		}
	} else if limit > energyCeil {
		limit = parent.EnergyLimit() - decay
		if limit < energyCeil {
			limit = energyCeil
		}
	}
	return limit
}