mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2025-01-09 19:21:19 +00:00
c20d9ccbb3
* update aggregated * update block att * update forkchoice att * update unaggregated att * gazelle * Use copy * Locks * Genesis time * Fixed tests * Comments * Fixed tests
271 lines
6.8 KiB
Go
271 lines
6.8 KiB
Go
package kv
|
|
|
|
import (
|
|
"reflect"
|
|
"sort"
|
|
"strings"
|
|
"testing"
|
|
|
|
ethpb "github.com/prysmaticlabs/ethereumapis/eth/v1alpha1"
|
|
"github.com/prysmaticlabs/go-bitfield"
|
|
)
|
|
|
|
func TestKV_Aggregated_NotAggregated(t *testing.T) {
|
|
cache := NewAttCaches()
|
|
|
|
att := ðpb.Attestation{AggregationBits: bitfield.Bitlist{0b11}}
|
|
|
|
wanted := "attestation is not aggregated"
|
|
if err := cache.SaveAggregatedAttestation(att); !strings.Contains(err.Error(), wanted) {
|
|
t.Error("Did not received wanted error")
|
|
}
|
|
}
|
|
|
|
func TestKV_Aggregated_CanSaveRetrieve(t *testing.T) {
|
|
cache := NewAttCaches()
|
|
|
|
att1 := ðpb.Attestation{Data: ðpb.AttestationData{Slot: 1}, AggregationBits: bitfield.Bitlist{0b1101}}
|
|
att2 := ðpb.Attestation{Data: ðpb.AttestationData{Slot: 2}, AggregationBits: bitfield.Bitlist{0b1101}}
|
|
att3 := ðpb.Attestation{Data: ðpb.AttestationData{Slot: 3}, AggregationBits: bitfield.Bitlist{0b1101}}
|
|
atts := []*ethpb.Attestation{att1, att2, att3}
|
|
|
|
for _, att := range atts {
|
|
if err := cache.SaveAggregatedAttestation(att); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
}
|
|
|
|
returned := cache.AggregatedAttestations()
|
|
|
|
sort.Slice(returned, func(i, j int) bool {
|
|
return returned[i].Data.Slot < returned[j].Data.Slot
|
|
})
|
|
|
|
if !reflect.DeepEqual(atts, returned) {
|
|
t.Error("Did not receive correct aggregated atts")
|
|
}
|
|
}
|
|
|
|
func TestKV_Aggregated_CanDelete(t *testing.T) {
|
|
cache := NewAttCaches()
|
|
|
|
att1 := ðpb.Attestation{Data: ðpb.AttestationData{Slot: 1}, AggregationBits: bitfield.Bitlist{0b1101}}
|
|
att2 := ðpb.Attestation{Data: ðpb.AttestationData{Slot: 2}, AggregationBits: bitfield.Bitlist{0b1101}}
|
|
att3 := ðpb.Attestation{Data: ðpb.AttestationData{Slot: 3}, AggregationBits: bitfield.Bitlist{0b1101}}
|
|
atts := []*ethpb.Attestation{att1, att2, att3}
|
|
|
|
for _, att := range atts {
|
|
if err := cache.SaveAggregatedAttestation(att); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
}
|
|
|
|
if err := cache.DeleteAggregatedAttestation(att1); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if err := cache.DeleteAggregatedAttestation(att3); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
|
|
returned := cache.AggregatedAttestations()
|
|
wanted := []*ethpb.Attestation{att2}
|
|
|
|
if !reflect.DeepEqual(wanted, returned) {
|
|
t.Error("Did not receive correct aggregated atts")
|
|
}
|
|
}
|
|
|
|
func TestKV_HasAggregatedAttestation(t *testing.T) {
|
|
tests := []struct {
|
|
name string
|
|
existing []*ethpb.Attestation
|
|
input *ethpb.Attestation
|
|
want bool
|
|
}{
|
|
{
|
|
name: "empty cache aggregated",
|
|
input: ðpb.Attestation{
|
|
Data: ðpb.AttestationData{
|
|
Slot: 1,
|
|
},
|
|
AggregationBits: bitfield.Bitlist{0b1111}},
|
|
want: false,
|
|
},
|
|
{
|
|
name: "empty cache unaggregated",
|
|
input: ðpb.Attestation{
|
|
Data: ðpb.AttestationData{
|
|
Slot: 1,
|
|
},
|
|
AggregationBits: bitfield.Bitlist{0b1001}},
|
|
want: false,
|
|
},
|
|
{
|
|
name: "single attestation in cache with exact match",
|
|
existing: []*ethpb.Attestation{{
|
|
Data: ðpb.AttestationData{
|
|
Slot: 1,
|
|
},
|
|
AggregationBits: bitfield.Bitlist{0b1111}},
|
|
},
|
|
input: ðpb.Attestation{
|
|
Data: ðpb.AttestationData{
|
|
Slot: 1,
|
|
},
|
|
AggregationBits: bitfield.Bitlist{0b1111}},
|
|
want: true,
|
|
},
|
|
{
|
|
name: "single attestation in cache with subset aggregation",
|
|
existing: []*ethpb.Attestation{{
|
|
Data: ðpb.AttestationData{
|
|
Slot: 1,
|
|
},
|
|
AggregationBits: bitfield.Bitlist{0b1111}},
|
|
},
|
|
input: ðpb.Attestation{
|
|
Data: ðpb.AttestationData{
|
|
Slot: 1,
|
|
},
|
|
AggregationBits: bitfield.Bitlist{0b1110}},
|
|
want: true,
|
|
},
|
|
{
|
|
name: "single attestation in cache with superset aggregation",
|
|
existing: []*ethpb.Attestation{{
|
|
Data: ðpb.AttestationData{
|
|
Slot: 1,
|
|
},
|
|
AggregationBits: bitfield.Bitlist{0b1110}},
|
|
},
|
|
input: ðpb.Attestation{
|
|
Data: ðpb.AttestationData{
|
|
Slot: 1,
|
|
},
|
|
AggregationBits: bitfield.Bitlist{0b1111}},
|
|
want: false,
|
|
},
|
|
{
|
|
name: "multiple attestations with same data in cache with overlapping aggregation, input is subset",
|
|
existing: []*ethpb.Attestation{
|
|
{
|
|
Data: ðpb.AttestationData{
|
|
Slot: 1,
|
|
},
|
|
AggregationBits: bitfield.Bitlist{0b1111000},
|
|
},
|
|
{
|
|
Data: ðpb.AttestationData{
|
|
Slot: 1,
|
|
},
|
|
AggregationBits: bitfield.Bitlist{0b1100111},
|
|
},
|
|
},
|
|
input: ðpb.Attestation{
|
|
Data: ðpb.AttestationData{
|
|
Slot: 1,
|
|
},
|
|
AggregationBits: bitfield.Bitlist{0b1100000}},
|
|
want: true,
|
|
},
|
|
{
|
|
name: "multiple attestations with same data in cache with overlapping aggregation and input is superset",
|
|
existing: []*ethpb.Attestation{
|
|
{
|
|
Data: ðpb.AttestationData{
|
|
Slot: 1,
|
|
},
|
|
AggregationBits: bitfield.Bitlist{0b1111000},
|
|
},
|
|
{
|
|
Data: ðpb.AttestationData{
|
|
Slot: 1,
|
|
},
|
|
AggregationBits: bitfield.Bitlist{0b1100111},
|
|
},
|
|
},
|
|
input: ðpb.Attestation{
|
|
Data: ðpb.AttestationData{
|
|
Slot: 1,
|
|
},
|
|
AggregationBits: bitfield.Bitlist{0b1111111}},
|
|
want: false,
|
|
},
|
|
{
|
|
name: "multiple attestations with different data in cache",
|
|
existing: []*ethpb.Attestation{
|
|
{
|
|
Data: ðpb.AttestationData{
|
|
Slot: 2,
|
|
},
|
|
AggregationBits: bitfield.Bitlist{0b1111000},
|
|
},
|
|
{
|
|
Data: ðpb.AttestationData{
|
|
Slot: 3,
|
|
},
|
|
AggregationBits: bitfield.Bitlist{0b1100111},
|
|
},
|
|
},
|
|
input: ðpb.Attestation{
|
|
Data: ðpb.AttestationData{
|
|
Slot: 1,
|
|
},
|
|
AggregationBits: bitfield.Bitlist{0b1111111}},
|
|
want: false,
|
|
},
|
|
}
|
|
|
|
for _, tt := range tests {
|
|
t.Run(tt.name, func(t *testing.T) {
|
|
cache := NewAttCaches()
|
|
if err := cache.SaveAggregatedAttestations(tt.existing); err != nil {
|
|
t.Error(err)
|
|
}
|
|
|
|
result, err := cache.HasAggregatedAttestation(tt.input)
|
|
if err != nil {
|
|
t.Error(err)
|
|
}
|
|
if result != tt.want {
|
|
t.Errorf("Result = %v, wanted = %v", result, tt.want)
|
|
}
|
|
|
|
// Same test for block attestations
|
|
cache = NewAttCaches()
|
|
if err := cache.SaveBlockAttestations(tt.existing); err != nil {
|
|
t.Error(err)
|
|
}
|
|
|
|
result, err = cache.HasAggregatedAttestation(tt.input)
|
|
if err != nil {
|
|
t.Error(err)
|
|
}
|
|
if result != tt.want {
|
|
t.Errorf("Result = %v, wanted = %v", result, tt.want)
|
|
}
|
|
})
|
|
}
|
|
}
|
|
|
|
func TestKV_Aggregated_AggregatesAttestations(t *testing.T) {
|
|
cache := NewAttCaches()
|
|
|
|
att1 := ðpb.Attestation{Data: ðpb.AttestationData{Slot: 1}, AggregationBits: bitfield.Bitlist{0b1101}}
|
|
att2 := ðpb.Attestation{Data: ðpb.AttestationData{Slot: 1}, AggregationBits: bitfield.Bitlist{0b1111}}
|
|
atts := []*ethpb.Attestation{att1, att2}
|
|
|
|
for _, att := range atts {
|
|
if err := cache.SaveAggregatedAttestation(att); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
}
|
|
|
|
returned := cache.AggregatedAttestations()
|
|
|
|
// It should have only returned att2.
|
|
if !reflect.DeepEqual(att2, returned[0]) || len(returned) != 1 {
|
|
t.Error("Did not receive correct aggregated atts")
|
|
}
|
|
}
|