Files
prysm/testing/util/helpers.go
Preston Van Loon 2fd6bd8150 Add golang.org/x/tools modernize static analyzer and fix violations (#15946)
* Ran gopls modernize to fix everything

go run golang.org/x/tools/gopls/internal/analysis/modernize/cmd/modernize@latest -fix -test ./...

* Override rules_go provided dependency for golang.org/x/tools to v0.38.0.

To update this, checked out rules_go, then ran `bazel run //go/tools/releaser -- upgrade-dep -mirror=false org_golang_x_tools` and copied the patches.

* Fix buildtag violations and ignore buildtag violations in external

* Introduce modernize analyzer package.

* Add modernize "any" analyzer.

* Fix violations of any analyzer

* Add modernize "appendclipped" analyzer.

* Fix violations of appendclipped

* Add modernize "bloop" analyzer.

* Add modernize "fmtappendf" analyzer.

* Add modernize "forvar" analyzer.

* Add modernize "mapsloop" analyzer.

* Add modernize "minmax" analyzer.

* Fix violations of minmax analyzer

* Add modernize "omitzero" analyzer.

* Add modernize "rangeint" analyzer.

* Fix violations of rangeint.

* Add modernize "reflecttypefor" analyzer.

* Fix violations of reflecttypefor analyzer.

* Add modernize "slicescontains" analyzer.

* Add modernize "slicessort" analyzer.

* Add modernize "slicesdelete" analyzer. This is disabled by default for now. See https://go.dev/issue/73686.

* Add modernize "stringscutprefix" analyzer.

* Add modernize "stringsbuilder" analyzer.

* Fix violations of stringsbuilder analyzer.

* Add modernize "stringsseq" analyzer.

* Add modernize "testingcontext" analyzer.

* Add modernize "waitgroup" analyzer.

* Changelog fragment

* gofmt

* gazelle

* Add modernize "newexpr" analyzer.

* Disable newexpr until go1.26

* Add more details in WORKSPACE on how to update the override

* @nalepae feedback on min()

* gofmt

* Fix violations of forvar
2025-11-14 01:27:22 +00:00

180 lines
6.2 KiB
Go

package util
import (
"context"
"encoding/binary"
"fmt"
"math"
"testing"
"github.com/OffchainLabs/prysm/v7/beacon-chain/core/helpers"
"github.com/OffchainLabs/prysm/v7/beacon-chain/core/signing"
"github.com/OffchainLabs/prysm/v7/beacon-chain/core/time"
"github.com/OffchainLabs/prysm/v7/beacon-chain/core/transition"
"github.com/OffchainLabs/prysm/v7/beacon-chain/state"
"github.com/OffchainLabs/prysm/v7/config/params"
"github.com/OffchainLabs/prysm/v7/consensus-types/blocks"
"github.com/OffchainLabs/prysm/v7/consensus-types/interfaces"
"github.com/OffchainLabs/prysm/v7/consensus-types/primitives"
"github.com/OffchainLabs/prysm/v7/crypto/bls"
"github.com/OffchainLabs/prysm/v7/crypto/rand"
ethpb "github.com/OffchainLabs/prysm/v7/proto/prysm/v1alpha1"
"github.com/OffchainLabs/prysm/v7/runtime/version"
"github.com/OffchainLabs/prysm/v7/testing/require"
"github.com/pkg/errors"
)
// RandaoReveal returns a signature of the requested epoch using the beacon proposer private key.
func RandaoReveal(beaconState state.ReadOnlyBeaconState, epoch primitives.Epoch, privKeys []bls.SecretKey) ([]byte, error) {
// We fetch the proposer's index as that is whom the RANDAO will be verified against.
proposerIdx, err := helpers.BeaconProposerIndex(context.Background(), beaconState)
if err != nil {
return []byte{}, errors.Wrap(err, "could not get beacon proposer index")
}
buf := make([]byte, 32)
binary.LittleEndian.PutUint64(buf, uint64(epoch))
// We make the previous validator's index sign the message instead of the proposer.
sszEpoch := primitives.SSZUint64(epoch)
return signing.ComputeDomainAndSign(beaconState, epoch, &sszEpoch, params.BeaconConfig().DomainRandao, privKeys[proposerIdx])
}
// BlockSignature calculates the post-state root of the block and returns the signature.
func BlockSignature(
bState state.BeaconState,
block any,
privKeys []bls.SecretKey,
) (bls.Signature, error) {
var wsb interfaces.ReadOnlySignedBeaconBlock
var err error
// copy the state since we need to process slots
bState = bState.Copy()
switch b := block.(type) {
case *ethpb.BeaconBlock:
wsb, err = blocks.NewSignedBeaconBlock(&ethpb.SignedBeaconBlock{Block: b})
case *ethpb.BeaconBlockAltair:
wsb, err = blocks.NewSignedBeaconBlock(&ethpb.SignedBeaconBlockAltair{Block: b})
case *ethpb.BeaconBlockBellatrix:
wsb, err = blocks.NewSignedBeaconBlock(&ethpb.SignedBeaconBlockBellatrix{Block: b})
case *ethpb.BeaconBlockCapella:
wsb, err = blocks.NewSignedBeaconBlock(&ethpb.SignedBeaconBlockCapella{Block: b})
case *ethpb.BeaconBlockDeneb:
wsb, err = blocks.NewSignedBeaconBlock(&ethpb.SignedBeaconBlockDeneb{Block: b})
case *ethpb.BeaconBlockElectra:
wsb, err = blocks.NewSignedBeaconBlock(&ethpb.SignedBeaconBlockElectra{Block: b})
default:
return nil, fmt.Errorf("unsupported block type %T", b)
}
if err != nil {
return nil, errors.Wrap(err, "could not wrap block")
}
s, err := transition.CalculateStateRoot(context.Background(), bState, wsb)
if err != nil {
return nil, errors.Wrap(err, "could not calculate state root")
}
switch b := block.(type) {
case *ethpb.BeaconBlock:
b.StateRoot = s[:]
case *ethpb.BeaconBlockAltair:
b.StateRoot = s[:]
case *ethpb.BeaconBlockBellatrix:
b.StateRoot = s[:]
case *ethpb.BeaconBlockCapella:
b.StateRoot = s[:]
case *ethpb.BeaconBlockDeneb:
b.StateRoot = s[:]
case *ethpb.BeaconBlockElectra:
b.StateRoot = s[:]
}
// Temporarily increasing the beacon state slot here since BeaconProposerIndex is a
// function deterministic on beacon state slot.
var blockSlot primitives.Slot
switch b := block.(type) {
case *ethpb.BeaconBlock:
blockSlot = b.Slot
case *ethpb.BeaconBlockAltair:
blockSlot = b.Slot
case *ethpb.BeaconBlockBellatrix:
blockSlot = b.Slot
case *ethpb.BeaconBlockCapella:
blockSlot = b.Slot
case *ethpb.BeaconBlockDeneb:
blockSlot = b.Slot
case *ethpb.BeaconBlockElectra:
blockSlot = b.Slot
}
// process slots to get the right fork
bState, err = transition.ProcessSlots(context.Background(), bState, blockSlot)
if err != nil {
return nil, err
}
domain, err := signing.Domain(bState.Fork(), time.CurrentEpoch(bState), params.BeaconConfig().DomainBeaconProposer, bState.GenesisValidatorsRoot())
if err != nil {
return nil, err
}
var blockRoot [32]byte
switch b := block.(type) {
case *ethpb.BeaconBlock:
blockRoot, err = signing.ComputeSigningRoot(b, domain)
case *ethpb.BeaconBlockAltair:
blockRoot, err = signing.ComputeSigningRoot(b, domain)
case *ethpb.BeaconBlockBellatrix:
blockRoot, err = signing.ComputeSigningRoot(b, domain)
case *ethpb.BeaconBlockCapella:
blockRoot, err = signing.ComputeSigningRoot(b, domain)
case *ethpb.BeaconBlockDeneb:
blockRoot, err = signing.ComputeSigningRoot(b, domain)
case *ethpb.BeaconBlockElectra:
blockRoot, err = signing.ComputeSigningRoot(b, domain)
}
if err != nil {
return nil, err
}
proposerIdx, err := helpers.BeaconProposerIndex(context.Background(), bState)
if err != nil {
return nil, err
}
return privKeys[proposerIdx].Sign(blockRoot[:]), nil
}
// Random32Bytes generates a random 32 byte slice.
func Random32Bytes(t *testing.T) []byte {
b := make([]byte, 32)
_, err := rand.NewDeterministicGenerator().Read(b)
if err != nil {
t.Fatal(err)
}
return b
}
// HackForksMaxuint is helpful for tests that need to set up cases for some future forks.
// We have unit tests that assert our config matches the upstream config, where some forks epoch are always
// set to MaxUint64 until they are formally set. This creates an issue for tests that want to
// work with slots that are defined to be after these forks because converting the max epoch to a slot leads
// to multiplication overflow.
// Monkey patching tests with this function is the simplest workaround in these cases.
func HackForksMaxuint(t *testing.T, forksVersion []int) func() {
bc := params.MainnetConfig()
for _, forkVersion := range forksVersion {
switch forkVersion {
case version.Electra:
bc.ElectraForkEpoch = math.MaxUint32 - 1
case version.Fulu:
bc.FuluForkEpoch = math.MaxUint32
default:
t.Fatalf("unsupported fork version %d", forkVersion)
}
}
undo, err := params.SetActiveWithUndo(bc)
require.NoError(t, err)
return func() {
require.NoError(t, undo())
}
}