mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2024-12-25 12:57:18 +00:00
c1c3b75867
* Functions that are to be moved to //shared/htrutils captured in separate file. * Move files into new //shared/htutils package hash_function.go renamed to hashers.go * Refactor to reference moved methods in new package - Added import for htrutils to state and stateutil packages - Update references to imported funcs (append "htrutils.") - Updated funcs in htrutils to be exported where necessary * Add tests
237 lines
8.1 KiB
Go
237 lines
8.1 KiB
Go
package stateutil
|
|
|
|
import (
|
|
"bytes"
|
|
"encoding/binary"
|
|
|
|
"github.com/pkg/errors"
|
|
ethpb "github.com/prysmaticlabs/ethereumapis/eth/v1alpha1"
|
|
"github.com/prysmaticlabs/prysm/shared/bytesutil"
|
|
"github.com/prysmaticlabs/prysm/shared/featureconfig"
|
|
"github.com/prysmaticlabs/prysm/shared/hashutil"
|
|
"github.com/prysmaticlabs/prysm/shared/htrutils"
|
|
"github.com/prysmaticlabs/prysm/shared/params"
|
|
)
|
|
|
|
// ValidatorRegistryRoot computes the HashTreeRoot Merkleization of
|
|
// a list of validator structs according to the eth2
|
|
// Simple Serialize specification.
|
|
func ValidatorRegistryRoot(vals []*ethpb.Validator) ([32]byte, error) {
|
|
if featureconfig.Get().EnableSSZCache {
|
|
return cachedHasher.validatorRegistryRoot(vals)
|
|
}
|
|
return nocachedHasher.validatorRegistryRoot(vals)
|
|
}
|
|
|
|
// ValidatorBalancesRoot computes the HashTreeRoot Merkleization of
|
|
// a list of validator uint64 balances according to the eth2
|
|
// Simple Serialize specification.
|
|
func ValidatorBalancesRoot(balances []uint64) ([32]byte, error) {
|
|
hasher := hashutil.CustomSHA256Hasher()
|
|
balancesMarshaling := make([][]byte, 0)
|
|
for i := 0; i < len(balances); i++ {
|
|
balanceBuf := make([]byte, 8)
|
|
binary.LittleEndian.PutUint64(balanceBuf, balances[i])
|
|
balancesMarshaling = append(balancesMarshaling, balanceBuf)
|
|
}
|
|
balancesChunks, err := htrutils.Pack(balancesMarshaling)
|
|
if err != nil {
|
|
return [32]byte{}, errors.Wrap(err, "could not pack balances into chunks")
|
|
}
|
|
maxBalCap := params.BeaconConfig().ValidatorRegistryLimit
|
|
elemSize := uint64(8)
|
|
balLimit := (maxBalCap*elemSize + 31) / 32
|
|
if balLimit == 0 {
|
|
if len(balances) == 0 {
|
|
balLimit = 1
|
|
} else {
|
|
balLimit = uint64(len(balances))
|
|
}
|
|
}
|
|
balancesRootsRoot, err := htrutils.BitwiseMerkleize(hasher, balancesChunks, uint64(len(balancesChunks)), balLimit)
|
|
if err != nil {
|
|
return [32]byte{}, errors.Wrap(err, "could not compute balances merkleization")
|
|
}
|
|
balancesRootsBuf := new(bytes.Buffer)
|
|
if err := binary.Write(balancesRootsBuf, binary.LittleEndian, uint64(len(balances))); err != nil {
|
|
return [32]byte{}, errors.Wrap(err, "could not marshal balances length")
|
|
}
|
|
balancesRootsBufRoot := make([]byte, 32)
|
|
copy(balancesRootsBufRoot, balancesRootsBuf.Bytes())
|
|
return htrutils.MixInLength(balancesRootsRoot, balancesRootsBufRoot), nil
|
|
}
|
|
|
|
// ValidatorRoot describes a method from which the hash tree root
|
|
// of a validator is returned.
|
|
func ValidatorRoot(hasher htrutils.HashFn, validator *ethpb.Validator) ([32]byte, error) {
|
|
fieldRoots := [][32]byte{}
|
|
if validator != nil {
|
|
pubkey := bytesutil.ToBytes48(validator.PublicKey)
|
|
withdrawCreds := bytesutil.ToBytes32(validator.WithdrawalCredentials)
|
|
effectiveBalanceBuf := [32]byte{}
|
|
binary.LittleEndian.PutUint64(effectiveBalanceBuf[:8], validator.EffectiveBalance)
|
|
// Slashed.
|
|
slashBuf := [32]byte{}
|
|
if validator.Slashed {
|
|
slashBuf[0] = uint8(1)
|
|
} else {
|
|
slashBuf[0] = uint8(0)
|
|
}
|
|
activationEligibilityBuf := [32]byte{}
|
|
binary.LittleEndian.PutUint64(activationEligibilityBuf[:8], validator.ActivationEligibilityEpoch)
|
|
|
|
activationBuf := [32]byte{}
|
|
binary.LittleEndian.PutUint64(activationBuf[:8], validator.ActivationEpoch)
|
|
|
|
exitBuf := [32]byte{}
|
|
binary.LittleEndian.PutUint64(exitBuf[:8], validator.ExitEpoch)
|
|
|
|
withdrawalBuf := [32]byte{}
|
|
binary.LittleEndian.PutUint64(withdrawalBuf[:8], validator.WithdrawableEpoch)
|
|
|
|
// Public key.
|
|
pubKeyChunks, err := htrutils.Pack([][]byte{pubkey[:]})
|
|
if err != nil {
|
|
return [32]byte{}, err
|
|
}
|
|
pubKeyRoot, err := htrutils.BitwiseMerkleize(hasher, pubKeyChunks, uint64(len(pubKeyChunks)), uint64(len(pubKeyChunks)))
|
|
if err != nil {
|
|
return [32]byte{}, err
|
|
}
|
|
fieldRoots = [][32]byte{pubKeyRoot, withdrawCreds, effectiveBalanceBuf, slashBuf, activationEligibilityBuf,
|
|
activationBuf, exitBuf, withdrawalBuf}
|
|
}
|
|
return htrutils.BitwiseMerkleizeArrays(hasher, fieldRoots, uint64(len(fieldRoots)), uint64(len(fieldRoots)))
|
|
}
|
|
|
|
func (h *stateRootHasher) validatorRegistryRoot(validators []*ethpb.Validator) ([32]byte, error) {
|
|
hashKeyElements := make([]byte, len(validators)*32)
|
|
roots := make([][32]byte, len(validators))
|
|
emptyKey := hashutil.FastSum256(hashKeyElements)
|
|
hasher := hashutil.CustomSHA256Hasher()
|
|
bytesProcessed := 0
|
|
for i := 0; i < len(validators); i++ {
|
|
val, err := h.validatorRoot(hasher, validators[i])
|
|
if err != nil {
|
|
return [32]byte{}, errors.Wrap(err, "could not compute validators merkleization")
|
|
}
|
|
copy(hashKeyElements[bytesProcessed:bytesProcessed+32], val[:])
|
|
roots[i] = val
|
|
bytesProcessed += 32
|
|
}
|
|
|
|
hashKey := hashutil.FastSum256(hashKeyElements)
|
|
if hashKey != emptyKey && h.rootsCache != nil {
|
|
if found, ok := h.rootsCache.Get(string(hashKey[:])); found != nil && ok {
|
|
return found.([32]byte), nil
|
|
}
|
|
}
|
|
|
|
validatorsRootsRoot, err := htrutils.BitwiseMerkleizeArrays(hasher, roots, uint64(len(roots)), params.BeaconConfig().ValidatorRegistryLimit)
|
|
if err != nil {
|
|
return [32]byte{}, errors.Wrap(err, "could not compute validator registry merkleization")
|
|
}
|
|
validatorsRootsBuf := new(bytes.Buffer)
|
|
if err := binary.Write(validatorsRootsBuf, binary.LittleEndian, uint64(len(validators))); err != nil {
|
|
return [32]byte{}, errors.Wrap(err, "could not marshal validator registry length")
|
|
}
|
|
// We need to mix in the length of the slice.
|
|
var validatorsRootsBufRoot [32]byte
|
|
copy(validatorsRootsBufRoot[:], validatorsRootsBuf.Bytes())
|
|
res := htrutils.MixInLength(validatorsRootsRoot, validatorsRootsBufRoot[:])
|
|
if hashKey != emptyKey && h.rootsCache != nil {
|
|
h.rootsCache.Set(string(hashKey[:]), res, 32)
|
|
}
|
|
return res, nil
|
|
}
|
|
|
|
func (h *stateRootHasher) validatorRoot(hasher htrutils.HashFn, validator *ethpb.Validator) ([32]byte, error) {
|
|
// Validator marshaling for caching.
|
|
enc := make([]byte, 122)
|
|
fieldRoots := make([][32]byte, 2, 8)
|
|
|
|
if validator != nil {
|
|
pubkey := bytesutil.ToBytes48(validator.PublicKey)
|
|
copy(enc[0:48], pubkey[:])
|
|
withdrawCreds := bytesutil.ToBytes32(validator.WithdrawalCredentials)
|
|
copy(enc[48:80], withdrawCreds[:])
|
|
effectiveBalanceBuf := [32]byte{}
|
|
binary.LittleEndian.PutUint64(effectiveBalanceBuf[:8], validator.EffectiveBalance)
|
|
copy(enc[80:88], effectiveBalanceBuf[:8])
|
|
if validator.Slashed {
|
|
enc[88] = uint8(1)
|
|
} else {
|
|
enc[88] = uint8(0)
|
|
}
|
|
activationEligibilityBuf := [32]byte{}
|
|
binary.LittleEndian.PutUint64(activationEligibilityBuf[:8], validator.ActivationEligibilityEpoch)
|
|
copy(enc[89:97], activationEligibilityBuf[:8])
|
|
|
|
activationBuf := [32]byte{}
|
|
binary.LittleEndian.PutUint64(activationBuf[:8], validator.ActivationEpoch)
|
|
copy(enc[97:105], activationBuf[:8])
|
|
|
|
exitBuf := [32]byte{}
|
|
binary.LittleEndian.PutUint64(exitBuf[:8], validator.ExitEpoch)
|
|
copy(enc[105:113], exitBuf[:8])
|
|
|
|
withdrawalBuf := [32]byte{}
|
|
binary.LittleEndian.PutUint64(withdrawalBuf[:8], validator.WithdrawableEpoch)
|
|
copy(enc[113:121], withdrawalBuf[:8])
|
|
|
|
// Check if it exists in cache:
|
|
if h.rootsCache != nil {
|
|
if found, ok := h.rootsCache.Get(string(enc)); found != nil && ok {
|
|
return found.([32]byte), nil
|
|
}
|
|
}
|
|
|
|
// Public key.
|
|
pubKeyChunks, err := htrutils.Pack([][]byte{pubkey[:]})
|
|
if err != nil {
|
|
return [32]byte{}, err
|
|
}
|
|
pubKeyRoot, err := htrutils.BitwiseMerkleize(hasher, pubKeyChunks, uint64(len(pubKeyChunks)), uint64(len(pubKeyChunks)))
|
|
if err != nil {
|
|
return [32]byte{}, err
|
|
}
|
|
fieldRoots[0] = pubKeyRoot
|
|
|
|
// Withdrawal credentials.
|
|
copy(fieldRoots[1][:], withdrawCreds[:])
|
|
|
|
// Effective balance.
|
|
fieldRoots = append(fieldRoots, effectiveBalanceBuf)
|
|
|
|
// Slashed.
|
|
slashBuf := [32]byte{}
|
|
if validator.Slashed {
|
|
slashBuf[0] = uint8(1)
|
|
} else {
|
|
slashBuf[0] = uint8(0)
|
|
}
|
|
fieldRoots = append(fieldRoots, slashBuf)
|
|
|
|
// Activation eligibility epoch.
|
|
fieldRoots = append(fieldRoots, activationEligibilityBuf)
|
|
|
|
// Activation epoch.
|
|
fieldRoots = append(fieldRoots, activationBuf)
|
|
|
|
// Exit epoch.
|
|
fieldRoots = append(fieldRoots, exitBuf)
|
|
|
|
// Withdrawable epoch.
|
|
fieldRoots = append(fieldRoots, withdrawalBuf)
|
|
}
|
|
|
|
valRoot, err := htrutils.BitwiseMerkleizeArrays(hasher, fieldRoots, uint64(len(fieldRoots)), uint64(len(fieldRoots)))
|
|
if err != nil {
|
|
return [32]byte{}, err
|
|
}
|
|
if h.rootsCache != nil {
|
|
h.rootsCache.Set(string(enc), valRoot, 32)
|
|
}
|
|
return valRoot, nil
|
|
}
|