mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2025-01-10 19:51:20 +00:00
f2125e5f64
* Proposer attestation selection using max-cover * better alisgn struct field * more tests * cleanup * simplify expressions * add benchmarks Co-authored-by: Raul Jordan <raul@prysmaticlabs.com> Co-authored-by: prylabs-bulldozer[bot] <58059840+prylabs-bulldozer[bot]@users.noreply.github.com>
93 lines
2.6 KiB
Go
93 lines
2.6 KiB
Go
package testing
|
|
|
|
import (
|
|
"math/rand"
|
|
"testing"
|
|
|
|
ethpb "github.com/prysmaticlabs/ethereumapis/eth/v1alpha1"
|
|
"github.com/prysmaticlabs/go-bitfield"
|
|
"github.com/prysmaticlabs/prysm/shared/bls"
|
|
"github.com/prysmaticlabs/prysm/shared/timeutils"
|
|
)
|
|
|
|
// BitlistWithAllBitsSet creates list of bitlists with all bits set.
|
|
func BitlistWithAllBitsSet(length uint64) bitfield.Bitlist {
|
|
b := bitfield.NewBitlist(length)
|
|
for i := uint64(0); i < length; i++ {
|
|
b.SetBitAt(i, true)
|
|
}
|
|
return b
|
|
}
|
|
|
|
// BitlistsWithSingleBitSet creates list of bitlists with a single bit set in each.
|
|
func BitlistsWithSingleBitSet(n, length uint64) []bitfield.Bitlist {
|
|
lists := make([]bitfield.Bitlist, n)
|
|
for i := uint64(0); i < n; i++ {
|
|
b := bitfield.NewBitlist(length)
|
|
b.SetBitAt(i%length, true)
|
|
lists[i] = b
|
|
}
|
|
return lists
|
|
}
|
|
|
|
// Bitlists64WithSingleBitSet creates list of bitlists with a single bit set in each.
|
|
func Bitlists64WithSingleBitSet(n, length uint64) []*bitfield.Bitlist64 {
|
|
lists := make([]*bitfield.Bitlist64, n)
|
|
for i := uint64(0); i < n; i++ {
|
|
b := bitfield.NewBitlist64(length)
|
|
b.SetBitAt(i%length, true)
|
|
lists[i] = b
|
|
}
|
|
return lists
|
|
}
|
|
|
|
// BitlistsWithMultipleBitSet creates list of bitlists with random n bits set.
|
|
func BitlistsWithMultipleBitSet(t testing.TB, n, length, count uint64) []bitfield.Bitlist {
|
|
seed := timeutils.Now().UnixNano()
|
|
t.Logf("bitlistsWithMultipleBitSet random seed: %v", seed)
|
|
rand.Seed(seed)
|
|
lists := make([]bitfield.Bitlist, n)
|
|
for i := uint64(0); i < n; i++ {
|
|
b := bitfield.NewBitlist(length)
|
|
keys := rand.Perm(int(length))
|
|
for _, key := range keys[:count] {
|
|
b.SetBitAt(uint64(key), true)
|
|
}
|
|
lists[i] = b
|
|
}
|
|
return lists
|
|
}
|
|
|
|
// Bitlists64WithMultipleBitSet creates list of bitlists with random n bits set.
|
|
func Bitlists64WithMultipleBitSet(t testing.TB, n, length, count uint64) []*bitfield.Bitlist64 {
|
|
seed := timeutils.Now().UnixNano()
|
|
t.Logf("Bitlists64WithMultipleBitSet random seed: %v", seed)
|
|
rand.Seed(seed)
|
|
lists := make([]*bitfield.Bitlist64, n)
|
|
for i := uint64(0); i < n; i++ {
|
|
b := bitfield.NewBitlist64(length)
|
|
keys := rand.Perm(int(length))
|
|
for _, key := range keys[:count] {
|
|
b.SetBitAt(uint64(key), true)
|
|
}
|
|
lists[i] = b
|
|
}
|
|
return lists
|
|
}
|
|
|
|
// MakeAttestationsFromBitlists creates list of bitlists from list of attestations.
|
|
func MakeAttestationsFromBitlists(bl []bitfield.Bitlist) []*ethpb.Attestation {
|
|
atts := make([]*ethpb.Attestation, len(bl))
|
|
for i, b := range bl {
|
|
atts[i] = ðpb.Attestation{
|
|
AggregationBits: b,
|
|
Data: ðpb.AttestationData{
|
|
Slot: 42,
|
|
CommitteeIndex: 1,
|
|
},
|
|
Signature: bls.NewAggregateSignature().Marshal(),
|
|
}
|
|
}
|
|
return atts
|
|
}
|