mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2024-12-23 20:07:17 +00:00
81c53c26fb
* Update seed domains (#3872) * Remove Transfers (#3870) * Remove active index roots and compact committee roots (#3869) * Update inclusion reward (#3886) * Alter proposer selection logic (#3884) * Fix early committee bias (#3888) * Remove shards and committees (#3896) * Epoch spec tests v0.9 (#3907) * Block spec test v0.9 (#3905) * rm'ed in protobuf * build proto * build proto * build proto * fix core package * Gazelle * Fixed all the tests * Fixed static test * Comment out spec test for now * One more skip * fix-roundRobinSync (#3862) * Starting but need new seed function * Revert initial sync * Updated Proposer Slashing * Fixed all tests * Lint * Update inclusion reward * Fill randao mixes with eth1 data hash * Test * Fixing test part1 * All tests passing * One last test * Updated config * Build proto * Proper skip message * Conflict and fmt * Removed crosslinks and shards. Built * Format and gazelle * Fixed all the block package tests * Fixed all the helper tests * All epoch package tests pass * All core package tests pass * Fixed operation tests * Started fixing rpc test * RPC tests passed! * Fixed all init sync tests * All tests pass * Fixed blockchain tests * Lint * Lint * Preston's feedback * Starting * Remove container * Fixed block spec tests * All passing except for block_processing test * Failing block processing test * Starting * Add AggregateAndProof * All mainnet test passes * Update deposit contract (#3906) * Proto spec tests v0.9 (#3908) * Starting * Add AggregateAndProof * Unskip block util tests (#3910) * rm'ed in protobuf * build proto * build proto * build proto * fix core package * Gazelle * Fixed all the tests * Fixed static test * Comment out spec test for now * One more skip * fix-roundRobinSync (#3862) * Starting but need new seed function * Revert initial sync * Updated Proposer Slashing * Fixed all tests * Lint * Update inclusion reward * Fill randao mixes with eth1 data hash * Test * Fixing test part1 * All tests passing * One last test * Updated config * Build proto * Proper skip message * Conflict and fmt * Removed crosslinks and shards. Built * Format and gazelle * Fixed all the block package tests * Fixed all the helper tests * All epoch package tests pass * All core package tests pass * Fixed operation tests * Started fixing rpc test * RPC tests passed! * Fixed all init sync tests * All tests pass * Fixed blockchain tests * Lint * Lint * Preston's feedback * Starting * Remove container * Fixed block spec tests * All passing except for block_processing test * Failing block processing test * Starting * Add AggregateAndProof * All mainnet test passes * Unskip block util tests * Slot processing spec test V0.9 (#3912) * Starting * Add AggregateAndProof * Unskip slot processing mainnet test * Unskip minimal spec test for finalization (#3920) * Remove outdated interop tests (#3922) * Rm outdated interop tests * Rm test runner * Gazelle * Update validator to use proposer slot (#3919) * Fix committee assignment (#3931) * Replace shard with committee index (#3930) * Conflict * Clean up (#3933) * Remove shard filter in db (#3936) * Remove lightouse compatibility test (#3939) * Update Committee Cache for v0.9 (#3948) * Updated committee cache * Removed shuffled indices cache * Started testing run time * Lint * Fixed test * Safeguard against nil head state * address edge case * add test * Fixed TestRoundRobinSync by doubling the epochs * Unskip TestProtoCompatability (#3958) * Unskip TestProtoCompatability * Update WORKSPACE * Fix minimal config (#3959) * fix minimal configs * fix hardcoded value in test * Simplify verify att time (#3961) * update readme for deposit contract, regen bindings for vyper 0.1.0b12 (#3963) * update readme for deposit contract, regen bindings * medium * Check nil base state (#3964) * Copy Block When Receiving it From Sync (#3966) * copy block * clone for other service methods too * Change logging of Bitfield (#3956) * change logging of bits * preston's review * Unskip Beacon Server Test (#3962) * run test till the end * fix up proto message types * fmt * resolve broken tests * better error handling * fixing new logic to use archived proposer info * fix up logic * clip using the max effective balance * broken build fix with num arg mismatch * amend archive * archival logic changed * rename test * archive both proposer and attester seeds * page size 100 * further experiments * further experimentation, archivedProposerIndex seems wrong * test passes * rem log * fix broken test * fix test * gaz * fix imports * ethapis
180 lines
4.0 KiB
Go
180 lines
4.0 KiB
Go
package cache
|
|
|
|
import (
|
|
"reflect"
|
|
"strconv"
|
|
"testing"
|
|
|
|
"github.com/prysmaticlabs/prysm/shared/params"
|
|
)
|
|
|
|
func TestCommitteeKeyFn_OK(t *testing.T) {
|
|
item := &Committee{
|
|
Epoch: 999,
|
|
CommitteeCount: 1,
|
|
Committee: []uint64{1, 2, 3, 4, 5},
|
|
}
|
|
|
|
key, err := committeeKeyFn(item)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if key != strconv.Itoa(int(item.Epoch)) {
|
|
t.Errorf("Incorrect hash key: %s, expected %s", key, strconv.Itoa(int(item.Epoch)))
|
|
}
|
|
}
|
|
|
|
func TestCommitteeKeyFn_InvalidObj(t *testing.T) {
|
|
_, err := committeeKeyFn("bad")
|
|
if err != ErrNotCommittee {
|
|
t.Errorf("Expected error %v, got %v", ErrNotCommittee, err)
|
|
}
|
|
}
|
|
|
|
func TestCommitteeCache_CommitteesByEpoch(t *testing.T) {
|
|
cache := NewCommitteeCache()
|
|
|
|
item := &Committee{
|
|
Epoch: 1,
|
|
Committee: []uint64{1, 2, 3, 4, 5, 6},
|
|
CommitteeCount: 3,
|
|
}
|
|
|
|
slot := uint64(item.Epoch * params.BeaconConfig().SlotsPerEpoch)
|
|
committeeIndex := uint64(1)
|
|
indices, err := cache.ShuffledIndices(slot, committeeIndex)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if indices != nil {
|
|
t.Error("Expected committee not to exist in empty cache")
|
|
}
|
|
|
|
if err := cache.AddCommitteeShuffledList(item); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
wantedIndex := uint64(0)
|
|
indices, err = cache.ShuffledIndices(slot, wantedIndex)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
|
|
start, end := startEndIndices(item, wantedIndex)
|
|
if !reflect.DeepEqual(indices, item.Committee[start:end]) {
|
|
t.Errorf(
|
|
"Expected fetched active indices to be %v, got %v",
|
|
indices,
|
|
item.Committee[start:end],
|
|
)
|
|
}
|
|
}
|
|
|
|
func TestCommitteeCache_CanRotate(t *testing.T) {
|
|
cache := NewCommitteeCache()
|
|
item1 := &Committee{Epoch: 1}
|
|
if err := cache.AddCommitteeShuffledList(item1); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
item2 := &Committee{Epoch: 2}
|
|
if err := cache.AddCommitteeShuffledList(item2); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
epochs, err := cache.Epochs()
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
wanted := item1.Epoch + item2.Epoch
|
|
if sum(epochs) != wanted {
|
|
t.Errorf("Wanted: %v, got: %v", wanted, sum(epochs))
|
|
}
|
|
|
|
item3 := &Committee{Epoch: 4}
|
|
if err := cache.AddCommitteeShuffledList(item3); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
epochs, err = cache.Epochs()
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
wanted = item1.Epoch + item2.Epoch + item3.Epoch
|
|
if sum(epochs) != wanted {
|
|
t.Errorf("Wanted: %v, got: %v", wanted, sum(epochs))
|
|
}
|
|
|
|
item4 := &Committee{Epoch: 6}
|
|
if err := cache.AddCommitteeShuffledList(item4); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
epochs, err = cache.Epochs()
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
wanted = item2.Epoch + item3.Epoch + item4.Epoch
|
|
if sum(epochs) != wanted {
|
|
t.Errorf("Wanted: %v, got: %v", wanted, sum(epochs))
|
|
}
|
|
}
|
|
|
|
func TestCommitteeCache_EpochInCache(t *testing.T) {
|
|
cache := NewCommitteeCache()
|
|
if err := cache.AddCommitteeShuffledList(&Committee{Epoch: 1}); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if err := cache.AddCommitteeShuffledList(&Committee{Epoch: 2}); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if err := cache.AddCommitteeShuffledList(&Committee{Epoch: 99}); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if err := cache.AddCommitteeShuffledList(&Committee{Epoch: 100}); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
inCache, err := cache.EpochInCache(1)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if inCache {
|
|
t.Error("Epoch shouldn't be in cache")
|
|
}
|
|
inCache, err = cache.EpochInCache(100)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if !inCache {
|
|
t.Error("Epoch should be in cache")
|
|
}
|
|
}
|
|
|
|
func TestCommitteeCache_ActiveIndices(t *testing.T) {
|
|
cache := NewCommitteeCache()
|
|
|
|
item := &Committee{Epoch: 1, Committee: []uint64{1, 2, 3, 4, 5, 6}}
|
|
indices, err := cache.ActiveIndices(1)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if indices != nil {
|
|
t.Error("Expected committee count not to exist in empty cache")
|
|
}
|
|
|
|
if err := cache.AddCommitteeShuffledList(item); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
|
|
indices, err = cache.ActiveIndices(1)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if !reflect.DeepEqual(indices, item.Committee) {
|
|
t.Error("Did not receive correct active indices from cache")
|
|
}
|
|
}
|
|
|
|
func sum(values []uint64) uint64 {
|
|
sum := uint64(0)
|
|
for _, v := range values {
|
|
sum = v + sum
|
|
}
|
|
return sum
|
|
}
|