mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2025-01-15 14:38:20 +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
380 lines
9.3 KiB
Go
380 lines
9.3 KiB
Go
package kv
|
|
|
|
import (
|
|
"bytes"
|
|
"context"
|
|
"reflect"
|
|
"sort"
|
|
"sync"
|
|
"testing"
|
|
|
|
"github.com/gogo/protobuf/proto"
|
|
"github.com/prysmaticlabs/go-bitfield"
|
|
"github.com/prysmaticlabs/go-ssz"
|
|
"github.com/prysmaticlabs/prysm/beacon-chain/db/filters"
|
|
ethpb "github.com/prysmaticlabs/prysm/proto/eth/v1alpha1"
|
|
)
|
|
|
|
func TestStore_AttestationCRUD(t *testing.T) {
|
|
db := setupDB(t)
|
|
defer teardownDB(t, db)
|
|
att := ðpb.Attestation{
|
|
Data: ðpb.AttestationData{Slot: 10},
|
|
AggregationBits: bitfield.Bitlist{0b00000001, 0b1},
|
|
CustodyBits: bitfield.NewBitlist(8),
|
|
}
|
|
ctx := context.Background()
|
|
attDataRoot, err := ssz.HashTreeRoot(att.Data)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
retrievedAtts, err := db.AttestationsByDataRoot(ctx, attDataRoot)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if len(retrievedAtts) != 0 {
|
|
t.Errorf("Expected no attestations, received %v", retrievedAtts)
|
|
}
|
|
if err := db.SaveAttestation(ctx, att); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if !db.HasAttestation(ctx, attDataRoot) {
|
|
t.Error("Expected attestation to exist in the db")
|
|
}
|
|
retrievedAtts, err = db.AttestationsByDataRoot(ctx, attDataRoot)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if !proto.Equal(att, retrievedAtts[0]) {
|
|
t.Errorf("Wanted %v, received %v", att, retrievedAtts[0])
|
|
}
|
|
if err := db.DeleteAttestation(ctx, attDataRoot); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if db.HasAttestation(ctx, attDataRoot) {
|
|
t.Error("Expected attestation to have been deleted from the db")
|
|
}
|
|
}
|
|
|
|
func TestStore_AttestationsBatchDelete(t *testing.T) {
|
|
db := setupDB(t)
|
|
defer teardownDB(t, db)
|
|
ctx := context.Background()
|
|
numAtts := 10
|
|
totalAtts := make([]*ethpb.Attestation, numAtts)
|
|
// We track the data roots for the even indexed attestations.
|
|
attDataRoots := make([][32]byte, 0)
|
|
oddAtts := make([]*ethpb.Attestation, 0)
|
|
for i := 0; i < len(totalAtts); i++ {
|
|
totalAtts[i] = ðpb.Attestation{
|
|
Data: ðpb.AttestationData{
|
|
BeaconBlockRoot: []byte("head"),
|
|
Slot: uint64(i),
|
|
},
|
|
AggregationBits: bitfield.Bitlist{0b00000001, 0b1},
|
|
CustodyBits: bitfield.NewBitlist(8),
|
|
}
|
|
if i%2 == 0 {
|
|
r, err := ssz.HashTreeRoot(totalAtts[i].Data)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
attDataRoots = append(attDataRoots, r)
|
|
} else {
|
|
oddAtts = append(oddAtts, totalAtts[i])
|
|
}
|
|
}
|
|
if err := db.SaveAttestations(ctx, totalAtts); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
retrieved, err := db.Attestations(ctx, filters.NewFilter().SetHeadBlockRoot([]byte("head")))
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if len(retrieved) != numAtts {
|
|
t.Errorf("Received %d attestations, wanted 1000", len(retrieved))
|
|
}
|
|
// We delete all even indexed attestation.
|
|
if err := db.DeleteAttestations(ctx, attDataRoots); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
// When we retrieve the data, only the odd indexed attestations should remain.
|
|
retrieved, err = db.Attestations(ctx, filters.NewFilter().SetHeadBlockRoot([]byte("head")))
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
sort.Slice(retrieved, func(i, j int) bool {
|
|
return retrieved[i].Data.Slot < retrieved[j].Data.Slot
|
|
})
|
|
if !reflect.DeepEqual(retrieved, oddAtts) {
|
|
t.Errorf("Wanted %v, received %v", oddAtts, retrieved)
|
|
}
|
|
}
|
|
|
|
func TestStore_BoltDontPanic(t *testing.T) {
|
|
db := setupDB(t)
|
|
defer teardownDB(t, db)
|
|
var wg sync.WaitGroup
|
|
|
|
for i := 0; i <= 100; i++ {
|
|
att := ðpb.Attestation{
|
|
Data: ðpb.AttestationData{Slot: uint64(i)},
|
|
AggregationBits: bitfield.Bitlist{0b11},
|
|
}
|
|
ctx := context.Background()
|
|
attDataRoot, err := ssz.HashTreeRoot(att.Data)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
retrievedAtts, err := db.AttestationsByDataRoot(ctx, attDataRoot)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if len(retrievedAtts) != 0 {
|
|
t.Errorf("Expected no attestation, received %v", retrievedAtts)
|
|
}
|
|
if err := db.SaveAttestation(ctx, att); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
}
|
|
// if indices are improperly deleted this test will then panic.
|
|
for i := 0; i <= 100; i++ {
|
|
startEpoch := i + 1
|
|
wg.Add(1)
|
|
go func() {
|
|
att := ðpb.Attestation{
|
|
Data: ðpb.AttestationData{Slot: uint64(startEpoch)},
|
|
AggregationBits: bitfield.Bitlist{0b11},
|
|
}
|
|
ctx := context.Background()
|
|
attDataRoot, err := ssz.HashTreeRoot(att.Data)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if err := db.DeleteAttestation(ctx, attDataRoot); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if db.HasAttestation(ctx, attDataRoot) {
|
|
t.Error("Expected attestation to have been deleted from the db")
|
|
}
|
|
wg.Done()
|
|
}()
|
|
}
|
|
wg.Wait()
|
|
}
|
|
|
|
func TestStore_Attestations_FiltersCorrectly(t *testing.T) {
|
|
db := setupDB(t)
|
|
defer teardownDB(t, db)
|
|
someRoot := [32]byte{1, 2, 3}
|
|
otherRoot := [32]byte{4, 5, 6}
|
|
atts := []*ethpb.Attestation{
|
|
{
|
|
Data: ðpb.AttestationData{
|
|
BeaconBlockRoot: someRoot[:],
|
|
Source: ðpb.Checkpoint{
|
|
Root: someRoot[:],
|
|
Epoch: 5,
|
|
},
|
|
Target: ðpb.Checkpoint{
|
|
Root: someRoot[:],
|
|
Epoch: 7,
|
|
},
|
|
},
|
|
AggregationBits: bitfield.Bitlist{0b11},
|
|
},
|
|
{
|
|
Data: ðpb.AttestationData{
|
|
BeaconBlockRoot: someRoot[:],
|
|
Source: ðpb.Checkpoint{
|
|
Root: otherRoot[:],
|
|
Epoch: 5,
|
|
},
|
|
Target: ðpb.Checkpoint{
|
|
Root: otherRoot[:],
|
|
Epoch: 7,
|
|
},
|
|
},
|
|
AggregationBits: bitfield.Bitlist{0b11},
|
|
},
|
|
{
|
|
Data: ðpb.AttestationData{
|
|
BeaconBlockRoot: otherRoot[:],
|
|
Source: ðpb.Checkpoint{
|
|
Root: someRoot[:],
|
|
Epoch: 7,
|
|
},
|
|
Target: ðpb.Checkpoint{
|
|
Root: someRoot[:],
|
|
Epoch: 5,
|
|
},
|
|
},
|
|
AggregationBits: bitfield.Bitlist{0b11},
|
|
},
|
|
}
|
|
ctx := context.Background()
|
|
if err := db.SaveAttestations(ctx, atts); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
|
|
tests := []struct {
|
|
filter *filters.QueryFilter
|
|
expectedNumAtt int
|
|
}{
|
|
{
|
|
filter: filters.NewFilter().
|
|
SetSourceEpoch(5),
|
|
expectedNumAtt: 2,
|
|
},
|
|
{
|
|
filter: filters.NewFilter().
|
|
SetHeadBlockRoot(someRoot[:]),
|
|
expectedNumAtt: 2,
|
|
},
|
|
{
|
|
filter: filters.NewFilter().
|
|
SetHeadBlockRoot(otherRoot[:]),
|
|
expectedNumAtt: 1,
|
|
},
|
|
{
|
|
filter: filters.NewFilter().SetTargetEpoch(7),
|
|
expectedNumAtt: 2,
|
|
},
|
|
{
|
|
// Only two attestation in the list meet the composite filter criteria above.
|
|
filter: filters.NewFilter().
|
|
SetHeadBlockRoot(someRoot[:]).
|
|
SetTargetEpoch(7),
|
|
expectedNumAtt: 2,
|
|
},
|
|
{
|
|
// No attestation meets the criteria below.
|
|
filter: filters.NewFilter().
|
|
SetTargetEpoch(1000),
|
|
expectedNumAtt: 0,
|
|
},
|
|
}
|
|
for _, tt := range tests {
|
|
retrievedAtts, err := db.Attestations(ctx, tt.filter)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if len(retrievedAtts) != tt.expectedNumAtt {
|
|
t.Errorf("Expected %d attestations, received %d", tt.expectedNumAtt, len(retrievedAtts))
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestStore_Attestations_BitfieldLogic(t *testing.T) {
|
|
commonData := ðpb.AttestationData{Slot: 10}
|
|
|
|
tests := []struct {
|
|
name string
|
|
input []*ethpb.Attestation
|
|
output []*ethpb.Attestation
|
|
}{
|
|
{
|
|
name: "all distinct aggregation bitfields",
|
|
input: []*ethpb.Attestation{
|
|
{
|
|
Data: commonData,
|
|
AggregationBits: []byte{0b10000001},
|
|
},
|
|
{
|
|
Data: commonData,
|
|
AggregationBits: []byte{0b10000010},
|
|
},
|
|
},
|
|
output: []*ethpb.Attestation{
|
|
{
|
|
Data: commonData,
|
|
AggregationBits: []byte{0b10000001},
|
|
},
|
|
{
|
|
Data: commonData,
|
|
AggregationBits: []byte{0b10000010},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "Incoming attestation is fully contained already",
|
|
input: []*ethpb.Attestation{
|
|
{
|
|
Data: commonData,
|
|
AggregationBits: []byte{0b11111111},
|
|
},
|
|
{
|
|
Data: commonData,
|
|
AggregationBits: []byte{0b10000010},
|
|
},
|
|
},
|
|
output: []*ethpb.Attestation{
|
|
{
|
|
Data: commonData,
|
|
AggregationBits: []byte{0b11111111},
|
|
},
|
|
},
|
|
},
|
|
{
|
|
name: "Existing attestations are fully contained incoming attestation",
|
|
input: []*ethpb.Attestation{
|
|
{
|
|
Data: commonData,
|
|
AggregationBits: []byte{0b10000001},
|
|
},
|
|
{
|
|
Data: commonData,
|
|
AggregationBits: []byte{0b10000010},
|
|
},
|
|
{
|
|
Data: commonData,
|
|
AggregationBits: []byte{0b11111111},
|
|
},
|
|
},
|
|
output: []*ethpb.Attestation{
|
|
{
|
|
Data: commonData,
|
|
AggregationBits: []byte{0b11111111},
|
|
},
|
|
},
|
|
},
|
|
}
|
|
|
|
for _, tt := range tests {
|
|
t.Run(tt.name, func(t *testing.T) {
|
|
db := setupDB(t)
|
|
defer teardownDB(t, db)
|
|
ctx := context.Background()
|
|
if err := db.SaveAttestations(ctx, tt.input); err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
r, err := ssz.HashTreeRoot(tt.input[0].Data)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
output, err := db.AttestationsByDataRoot(ctx, r)
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
if len(output) != len(tt.output) {
|
|
t.Fatalf(
|
|
"Wrong number of attestations returned. Got %d attestations but wanted %d",
|
|
len(output),
|
|
len(tt.output),
|
|
)
|
|
}
|
|
sort.Slice(output, func(i, j int) bool {
|
|
return output[i].AggregationBits.Bytes()[0] < output[j].AggregationBits.Bytes()[0]
|
|
})
|
|
sort.Slice(tt.output, func(i, j int) bool {
|
|
return tt.output[i].AggregationBits.Bytes()[0] < tt.output[j].AggregationBits.Bytes()[0]
|
|
})
|
|
for i, att := range output {
|
|
if !bytes.Equal(att.AggregationBits, tt.output[i].AggregationBits) {
|
|
t.Errorf("Aggregation bits are not the same. Got %b, wanted %b", att.AggregationBits, tt.output[i].AggregationBits)
|
|
}
|
|
}
|
|
})
|
|
}
|
|
}
|