mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2025-01-03 16:37:39 +00:00
ce725ceec3
* Move state pkg to stateV0 pkg * Build.bazel * Remove unused RootsArrayHashTreeRoot * Revert "Remove unused RootsArrayHashTreeRoot" This reverts commit bf0bda30d1a8eb7a071f6e3ce9ee85041b45aca6. Co-authored-by: prylabs-bulldozer[bot] <58059840+prylabs-bulldozer[bot]@users.noreply.github.com>
83 lines
2.3 KiB
Go
83 lines
2.3 KiB
Go
package validator
|
|
|
|
import (
|
|
"fmt"
|
|
"testing"
|
|
|
|
ethpb "github.com/prysmaticlabs/ethereumapis/eth/v1alpha1"
|
|
"github.com/prysmaticlabs/go-bitfield"
|
|
"github.com/prysmaticlabs/prysm/beacon-chain/state/stateV0"
|
|
aggtesting "github.com/prysmaticlabs/prysm/shared/aggregation/testing"
|
|
"github.com/prysmaticlabs/prysm/shared/featureconfig"
|
|
"github.com/prysmaticlabs/prysm/shared/params"
|
|
)
|
|
|
|
func BenchmarkProposerAtts_sortByProfitability(b *testing.B) {
|
|
bitlistLen := params.BeaconConfig().MaxValidatorsPerCommittee
|
|
|
|
tests := []struct {
|
|
name string
|
|
inputs []bitfield.Bitlist
|
|
}{
|
|
{
|
|
name: "256 attestations with single bit set",
|
|
inputs: aggtesting.BitlistsWithSingleBitSet(256, bitlistLen),
|
|
},
|
|
{
|
|
name: "256 attestations with 64 random bits set",
|
|
inputs: aggtesting.BitlistsWithSingleBitSet(256, bitlistLen),
|
|
},
|
|
{
|
|
name: "512 attestations with single bit set",
|
|
inputs: aggtesting.BitlistsWithSingleBitSet(512, bitlistLen),
|
|
},
|
|
{
|
|
name: "1024 attestations with 64 random bits set",
|
|
inputs: aggtesting.BitlistsWithMultipleBitSet(b, 1024, bitlistLen, 64),
|
|
},
|
|
{
|
|
name: "1024 attestations with 512 random bits set",
|
|
inputs: aggtesting.BitlistsWithMultipleBitSet(b, 1024, bitlistLen, 512),
|
|
},
|
|
{
|
|
name: "1024 attestations with 1000 random bits set",
|
|
inputs: aggtesting.BitlistsWithMultipleBitSet(b, 1024, bitlistLen, 1000),
|
|
},
|
|
}
|
|
|
|
runner := func(atts []*ethpb.Attestation) {
|
|
attsCopy := make(proposerAtts, len(atts))
|
|
for i, att := range atts {
|
|
attsCopy[i] = stateV0.CopyAttestation(att)
|
|
}
|
|
attsCopy.sortByProfitability()
|
|
}
|
|
|
|
for _, tt := range tests {
|
|
b.Run(fmt.Sprintf("naive_%s", tt.name), func(b *testing.B) {
|
|
b.StopTimer()
|
|
resetCfg := featureconfig.InitWithReset(&featureconfig.Flags{
|
|
ProposerAttsSelectionUsingMaxCover: false,
|
|
})
|
|
defer resetCfg()
|
|
atts := aggtesting.MakeAttestationsFromBitlists(tt.inputs)
|
|
b.StartTimer()
|
|
for i := 0; i < b.N; i++ {
|
|
runner(atts)
|
|
}
|
|
})
|
|
b.Run(fmt.Sprintf("max-cover_%s", tt.name), func(b *testing.B) {
|
|
b.StopTimer()
|
|
resetCfg := featureconfig.InitWithReset(&featureconfig.Flags{
|
|
ProposerAttsSelectionUsingMaxCover: true,
|
|
})
|
|
defer resetCfg()
|
|
atts := aggtesting.MakeAttestationsFromBitlists(tt.inputs)
|
|
b.StartTimer()
|
|
for i := 0; i < b.N; i++ {
|
|
runner(atts)
|
|
}
|
|
})
|
|
}
|
|
}
|