prysm-pulse/shared/stateutil/state_root_test.go
Raul Jordan 9e5cc81340 Implement Prysm-Specific HashTreeRootState (#4077)
* new ssz hash tree root
* Merge branch 'master' into new-ssz-state
* better comments on func
* add errors instead of panic in state
* utilize errors wrap everywhere
* include bench
* added bench info
* equality test
* dup
* gaz
* use new hash tree root in state transition
* fix build
* separate test package
* three targets failign
* single target fails
* please test targets...pass for me
* revert
* Merge branch 'master' into new-ssz-state
* rev
* Merge branch 'new-ssz-state' of github.com:prysmaticlabs/prysm into new-ssz-state
* broken build
* Merge branch 'master' into new-ssz-state
* gaz
* Merge branch 'new-ssz-state' of github.com:prysmaticlabs/prysm into new-ssz-state
* ssz workspace
* master ssz
* Merge branch 'master' into new-ssz-state
* resolve conf
* resolve some conflicts and fix up broken file
* fix up build file issues and sync
* eth1 data votes included
* further abstractions, simplifications
* Merge branch 'master' into new-ssz-state
* gaz
* Merge branch 'new-ssz-state' of github.com:prysmaticlabs/prysm into new-ssz-state
* feature flag gating
* add field count test
* Merge branch 'master' into new-ssz-state
* resolving ivan feedback
* Merge branch 'new-ssz-state' of github.com:prysmaticlabs/prysm into new-ssz-state
* gaz
* Merge branch 'master' into new-ssz-state
* addressed
* Merge branch 'new-ssz-state' of github.com:prysmaticlabs/prysm into new-ssz-state
2019-12-04 19:20:33 +00:00

73 lines
1.6 KiB
Go

package stateutil_test
import (
"reflect"
"strings"
"testing"
"github.com/prysmaticlabs/go-ssz"
pb "github.com/prysmaticlabs/prysm/proto/beacon/p2p/v1"
"github.com/prysmaticlabs/prysm/shared/interop"
"github.com/prysmaticlabs/prysm/shared/stateutil"
)
func TestState_FieldCount(t *testing.T) {
count := 20
typ := reflect.TypeOf(pb.BeaconState{})
numFields := 0
for i := 0; i < typ.NumField(); i++ {
if strings.HasPrefix(typ.Field(i).Name, "XXX_") {
continue
}
numFields++
}
if numFields != count {
t.Errorf("Expected state to have %d fields, received %d", count, numFields)
}
}
func TestHashTreeRootEquality(t *testing.T) {
genesisState := setupGenesisState(t, 512)
r1, err := ssz.HashTreeRoot(genesisState)
if err != nil {
t.Fatal(err)
}
r2, err := stateutil.HashTreeRootState(genesisState)
if err != nil {
t.Fatal(err)
}
if r1 != r2 {
t.Errorf("Wanted %#x, got %#x", r1, r2)
}
}
func BenchmarkHashTreeRootState_Custom(b *testing.B) {
b.StopTimer()
genesisState := setupGenesisState(b, 512)
b.StartTimer()
for i := 0; i < b.N; i++ {
if _, err := stateutil.HashTreeRootState(genesisState); err != nil {
b.Fatal(err)
}
}
}
func BenchmarkHashTreeRootState_Generic(b *testing.B) {
b.StopTimer()
genesisState := setupGenesisState(b, 512)
b.StartTimer()
for i := 0; i < b.N; i++ {
if _, err := ssz.HashTreeRoot(genesisState); err != nil {
b.Fatal(err)
}
}
}
func setupGenesisState(tb testing.TB, count uint64) *pb.BeaconState {
genesisState, _, err := interop.GenerateGenesisState(0, count)
if err != nil {
tb.Fatalf("Could not generate genesis beacon state: %v", err)
}
return genesisState
}