mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2024-12-25 12:57:18 +00:00
44973b0bb3
* in progress... * in progress... * remove log * log root * Revert "Auxiliary commit to revert individual files from f12a609ea2a2f1e87e97321f3a717cd324b5ae97" This reverts commit 5ae35edb6477d8d0ea4e94b273efc6590484da85. * cleanup * remove log * remove whitespace * remove logs * more stuff * copy * always rebuild trie * revert * add state * init state * fix all * uintptr * move slice to new package * lock in `Detach` * remove constraint * reorder * blockroots and stateroots * fill roots in empty() * fix hasher * implement slice for balances and inactivity scores * detach in setters * Revert "implement slice for balances and inactivity scores" This reverts commit 59eb9df8d766cb1c44a7eb5b3f5e3c042249943d. # Conflicts: # beacon-chain/state/state-native/setters_validator.go * use counter to track states * typos * rename interface * balances * gauge * some improvements * first try with map * fix * inactivity scores in progress * fix test # Conflicts: # beacon-chain/state/state-native/helpers_test.go * test fixes * ToProto fix * copy roots * validators * build fixes * fix bug in `ToProto` * fix fuzz test * fix bug in slice getters * fix state equality checks * make tests pass * make tests pass * more test updates * Revert "Auxiliary commit to revert individual files from 34e7344bff08a589e6341bb1829e3cb74159e878" This reverts commit ecd64efa8917f37ca41460e0356ff007fe55dd9d. * Revert "make tests pass" This reverts commit 0cf00f19eecf4678cd2b866dd107f3179d0426ef. * Revert "make tests pass" This reverts commit 521b65e1d2e13be3d720f333008b6838a8e78878. * pass tests * deepequal identifiable types * Deflake `cloners_test.go` * feature flag for block roots * feature flag * remove recursive locks * reduce complexity of rootSelector * fix randao mixes root * some fixes * revisit tests * revert change to field trie helpers * initialize field map for tests * remove whitespace * initialize roots with proper length * more fixes * out of bounds message fix * optimize length calculation * remove call to Len in PubkeyAtIndex * don't log deposits * unit tests * unit tests * fix * comments * test fixes * id * remove Enumerator interface * review feedback * simplify field trie * bring back fieldtrie package * fix bazel file * use handle32ByteArrays for root computation * fix locks * metrics * bzl * simplify some things * use htr in state test * remove code from require package * gzl * more htr * Fuzzing of the multi-value slice * assert values * getter optimizations * use At when reading from validators * Nishant's review * restore safe copy * remove empty line * build fix * restore how we get root at index for deafult mode * more review comments * optimize default behavior * simplify Slice calls * test fix * remove unnecessary package * remove unused setter * make fieldMap unexported * some improvements in state package * call `Slice` instead of manually copying * unlock in ReadFromEveryValidator * Potuz's comments * lock the state when reading from all validators # Conflicts: # beacon-chain/state/state-native/getters_validator.go * add back preston's changes * add index --------- Co-authored-by: Potuz <potuz@prysmaticlabs.com> Co-authored-by: nisdas <nishdas93@gmail.com> Co-authored-by: Preston Van Loon <pvanloon@offchainlabs.com>
268 lines
10 KiB
Go
268 lines
10 KiB
Go
package state_native
|
|
|
|
import (
|
|
"context"
|
|
"encoding/binary"
|
|
|
|
"github.com/pkg/errors"
|
|
"github.com/prysmaticlabs/prysm/v4/beacon-chain/state/state-native/types"
|
|
"github.com/prysmaticlabs/prysm/v4/beacon-chain/state/stateutil"
|
|
fieldparams "github.com/prysmaticlabs/prysm/v4/config/fieldparams"
|
|
"github.com/prysmaticlabs/prysm/v4/config/params"
|
|
"github.com/prysmaticlabs/prysm/v4/encoding/bytesutil"
|
|
"github.com/prysmaticlabs/prysm/v4/encoding/ssz"
|
|
"github.com/prysmaticlabs/prysm/v4/runtime/version"
|
|
"go.opencensus.io/trace"
|
|
)
|
|
|
|
// ComputeFieldRootsWithHasher hashes the provided state and returns its respective field roots.
|
|
func ComputeFieldRootsWithHasher(ctx context.Context, state *BeaconState) ([][]byte, error) {
|
|
ctx, span := trace.StartSpan(ctx, "ComputeFieldRootsWithHasher")
|
|
defer span.End()
|
|
|
|
if state == nil {
|
|
return nil, errors.New("nil state")
|
|
}
|
|
var fieldRoots [][]byte
|
|
switch state.version {
|
|
case version.Phase0:
|
|
fieldRoots = make([][]byte, params.BeaconConfig().BeaconStateFieldCount)
|
|
case version.Altair:
|
|
fieldRoots = make([][]byte, params.BeaconConfig().BeaconStateAltairFieldCount)
|
|
case version.Bellatrix:
|
|
fieldRoots = make([][]byte, params.BeaconConfig().BeaconStateBellatrixFieldCount)
|
|
case version.Capella:
|
|
fieldRoots = make([][]byte, params.BeaconConfig().BeaconStateCapellaFieldCount)
|
|
case version.Deneb:
|
|
fieldRoots = make([][]byte, params.BeaconConfig().BeaconStateDenebFieldCount)
|
|
}
|
|
|
|
// Genesis time root.
|
|
genesisRoot := ssz.Uint64Root(state.genesisTime)
|
|
fieldRoots[types.GenesisTime.RealPosition()] = genesisRoot[:]
|
|
|
|
// Genesis validators root.
|
|
var r [32]byte
|
|
copy(r[:], state.genesisValidatorsRoot[:])
|
|
fieldRoots[types.GenesisValidatorsRoot.RealPosition()] = r[:]
|
|
|
|
// Slot root.
|
|
slotRoot := ssz.Uint64Root(uint64(state.slot))
|
|
fieldRoots[types.Slot.RealPosition()] = slotRoot[:]
|
|
|
|
// Fork data structure root.
|
|
forkHashTreeRoot, err := ssz.ForkRoot(state.fork)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute fork merkleization")
|
|
}
|
|
fieldRoots[types.Fork.RealPosition()] = forkHashTreeRoot[:]
|
|
|
|
// BeaconBlockHeader data structure root.
|
|
headerHashTreeRoot, err := stateutil.BlockHeaderRoot(state.latestBlockHeader)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute block header merkleization")
|
|
}
|
|
fieldRoots[types.LatestBlockHeader.RealPosition()] = headerHashTreeRoot[:]
|
|
|
|
// BlockRoots array root.
|
|
blockRootsRoot, err := stateutil.ArraysRoot(state.blockRootsVal().Slice(), fieldparams.BlockRootsLength)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute block roots merkleization")
|
|
}
|
|
fieldRoots[types.BlockRoots.RealPosition()] = blockRootsRoot[:]
|
|
|
|
// StateRoots array root.
|
|
stateRootsRoot, err := stateutil.ArraysRoot(state.stateRootsVal().Slice(), fieldparams.StateRootsLength)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute state roots merkleization")
|
|
}
|
|
fieldRoots[types.StateRoots.RealPosition()] = stateRootsRoot[:]
|
|
|
|
// HistoricalRoots slice root.
|
|
hRoots := make([][]byte, len(state.historicalRoots))
|
|
for i := range hRoots {
|
|
hRoots[i] = state.historicalRoots[i][:]
|
|
}
|
|
historicalRootsRt, err := ssz.ByteArrayRootWithLimit(hRoots, fieldparams.HistoricalRootsLength)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute historical roots merkleization")
|
|
}
|
|
fieldRoots[types.HistoricalRoots.RealPosition()] = historicalRootsRt[:]
|
|
|
|
// Eth1Data data structure root.
|
|
eth1HashTreeRoot, err := stateutil.Eth1Root(state.eth1Data)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute eth1data merkleization")
|
|
}
|
|
fieldRoots[types.Eth1Data.RealPosition()] = eth1HashTreeRoot[:]
|
|
|
|
// Eth1DataVotes slice root.
|
|
eth1VotesRoot, err := stateutil.Eth1DataVotesRoot(state.eth1DataVotes)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute eth1data votes merkleization")
|
|
}
|
|
fieldRoots[types.Eth1DataVotes.RealPosition()] = eth1VotesRoot[:]
|
|
|
|
// Eth1DepositIndex root.
|
|
eth1DepositIndexBuf := make([]byte, 8)
|
|
binary.LittleEndian.PutUint64(eth1DepositIndexBuf, state.eth1DepositIndex)
|
|
eth1DepositBuf := bytesutil.ToBytes32(eth1DepositIndexBuf)
|
|
fieldRoots[types.Eth1DepositIndex.RealPosition()] = eth1DepositBuf[:]
|
|
|
|
// Validators slice root.
|
|
validatorsRoot, err := stateutil.ValidatorRegistryRoot(state.validatorsVal())
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute validator registry merkleization")
|
|
}
|
|
fieldRoots[types.Validators.RealPosition()] = validatorsRoot[:]
|
|
|
|
// Balances slice root.
|
|
balancesRoot, err := stateutil.Uint64ListRootWithRegistryLimit(state.balancesVal())
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute validator balances merkleization")
|
|
}
|
|
fieldRoots[types.Balances.RealPosition()] = balancesRoot[:]
|
|
|
|
// RandaoMixes array root.
|
|
randaoRootsRoot, err := stateutil.ArraysRoot(state.randaoMixesVal().Slice(), fieldparams.RandaoMixesLength)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute randao roots merkleization")
|
|
}
|
|
fieldRoots[types.RandaoMixes.RealPosition()] = randaoRootsRoot[:]
|
|
|
|
// Slashings array root.
|
|
slashingsRootsRoot, err := ssz.SlashingsRoot(state.slashings)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute slashings merkleization")
|
|
}
|
|
fieldRoots[types.Slashings.RealPosition()] = slashingsRootsRoot[:]
|
|
|
|
if state.version == version.Phase0 {
|
|
// PreviousEpochAttestations slice root.
|
|
prevAttsRoot, err := stateutil.EpochAttestationsRoot(state.previousEpochAttestations)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute previous epoch attestations merkleization")
|
|
}
|
|
fieldRoots[types.PreviousEpochAttestations.RealPosition()] = prevAttsRoot[:]
|
|
|
|
// CurrentEpochAttestations slice root.
|
|
currAttsRoot, err := stateutil.EpochAttestationsRoot(state.currentEpochAttestations)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute current epoch attestations merkleization")
|
|
}
|
|
fieldRoots[types.CurrentEpochAttestations.RealPosition()] = currAttsRoot[:]
|
|
}
|
|
|
|
if state.version >= version.Altair {
|
|
// PreviousEpochParticipation slice root.
|
|
prevParticipationRoot, err := stateutil.ParticipationBitsRoot(state.previousEpochParticipation)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute previous epoch participation merkleization")
|
|
}
|
|
fieldRoots[types.PreviousEpochParticipationBits.RealPosition()] = prevParticipationRoot[:]
|
|
|
|
// CurrentEpochParticipation slice root.
|
|
currParticipationRoot, err := stateutil.ParticipationBitsRoot(state.currentEpochParticipation)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute current epoch participation merkleization")
|
|
}
|
|
fieldRoots[types.CurrentEpochParticipationBits.RealPosition()] = currParticipationRoot[:]
|
|
}
|
|
|
|
// JustificationBits root.
|
|
justifiedBitsRoot := bytesutil.ToBytes32(state.justificationBits)
|
|
fieldRoots[types.JustificationBits.RealPosition()] = justifiedBitsRoot[:]
|
|
|
|
// PreviousJustifiedCheckpoint data structure root.
|
|
prevCheckRoot, err := ssz.CheckpointRoot(state.previousJustifiedCheckpoint)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute previous justified checkpoint merkleization")
|
|
}
|
|
fieldRoots[types.PreviousJustifiedCheckpoint.RealPosition()] = prevCheckRoot[:]
|
|
|
|
// CurrentJustifiedCheckpoint data structure root.
|
|
currJustRoot, err := ssz.CheckpointRoot(state.currentJustifiedCheckpoint)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute current justified checkpoint merkleization")
|
|
}
|
|
fieldRoots[types.CurrentJustifiedCheckpoint.RealPosition()] = currJustRoot[:]
|
|
|
|
// FinalizedCheckpoint data structure root.
|
|
finalRoot, err := ssz.CheckpointRoot(state.finalizedCheckpoint)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute finalized checkpoint merkleization")
|
|
}
|
|
fieldRoots[types.FinalizedCheckpoint.RealPosition()] = finalRoot[:]
|
|
|
|
if state.version >= version.Altair {
|
|
// Inactivity scores root.
|
|
inactivityScoresRoot, err := stateutil.Uint64ListRootWithRegistryLimit(state.inactivityScoresVal())
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute inactivityScoreRoot")
|
|
}
|
|
fieldRoots[types.InactivityScores.RealPosition()] = inactivityScoresRoot[:]
|
|
|
|
// Current sync committee root.
|
|
currentSyncCommitteeRoot, err := stateutil.SyncCommitteeRoot(state.currentSyncCommittee)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute sync committee merkleization")
|
|
}
|
|
fieldRoots[types.CurrentSyncCommittee.RealPosition()] = currentSyncCommitteeRoot[:]
|
|
|
|
// Next sync committee root.
|
|
nextSyncCommitteeRoot, err := stateutil.SyncCommitteeRoot(state.nextSyncCommittee)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute sync committee merkleization")
|
|
}
|
|
fieldRoots[types.NextSyncCommittee.RealPosition()] = nextSyncCommitteeRoot[:]
|
|
}
|
|
|
|
if state.version == version.Bellatrix {
|
|
// Execution payload root.
|
|
executionPayloadRoot, err := state.latestExecutionPayloadHeader.HashTreeRoot()
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
fieldRoots[types.LatestExecutionPayloadHeader.RealPosition()] = executionPayloadRoot[:]
|
|
}
|
|
|
|
if state.version == version.Capella {
|
|
// Execution payload root.
|
|
executionPayloadRoot, err := state.latestExecutionPayloadHeaderCapella.HashTreeRoot()
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
fieldRoots[types.LatestExecutionPayloadHeaderCapella.RealPosition()] = executionPayloadRoot[:]
|
|
}
|
|
|
|
if state.version == version.Deneb {
|
|
// Execution payload root.
|
|
executionPayloadRoot, err := state.latestExecutionPayloadHeaderDeneb.HashTreeRoot()
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
fieldRoots[types.LatestExecutionPayloadHeaderDeneb.RealPosition()] = executionPayloadRoot[:]
|
|
}
|
|
|
|
if state.version >= version.Capella {
|
|
// Next withdrawal index root.
|
|
nextWithdrawalIndexRoot := make([]byte, 32)
|
|
binary.LittleEndian.PutUint64(nextWithdrawalIndexRoot, state.nextWithdrawalIndex)
|
|
fieldRoots[types.NextWithdrawalIndex.RealPosition()] = nextWithdrawalIndexRoot
|
|
|
|
// Next partial withdrawal validator index root.
|
|
nextWithdrawalValidatorIndexRoot := make([]byte, 32)
|
|
binary.LittleEndian.PutUint64(nextWithdrawalValidatorIndexRoot, uint64(state.nextWithdrawalValidatorIndex))
|
|
fieldRoots[types.NextWithdrawalValidatorIndex.RealPosition()] = nextWithdrawalValidatorIndexRoot
|
|
|
|
// Historical summary root.
|
|
historicalSummaryRoot, err := stateutil.HistoricalSummariesRoot(state.historicalSummaries)
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "could not compute historical summary merkleization")
|
|
}
|
|
fieldRoots[types.HistoricalSummaries.RealPosition()] = historicalSummaryRoot[:]
|
|
}
|
|
|
|
return fieldRoots, nil
|
|
}
|