package governance import ( "sort" "testing" "github.com/nspcc-dev/neo-go/pkg/crypto/keys" "github.com/stretchr/testify/require" ) func TestNewAlphabetList(t *testing.T) { k, err := generateKeys(14) require.NoError(t, err) orig := keys.PublicKeys{k[0], k[1], k[2], k[3], k[4], k[5], k[6]} t.Run("no sidechain keys", func(t *testing.T) { _, err := newAlphabetList(nil, orig) require.ErrorIs(t, err, errEmptySidechain) }) t.Run("same keys", func(t *testing.T) { list, err := newAlphabetList(orig, orig) require.NoError(t, err) require.Nil(t, list) }) t.Run("not enough mainnet keys", func(t *testing.T) { _, err := newAlphabetList(orig, orig[:len(orig)-1]) require.ErrorIs(t, err, errNotEnoughKeys) }) t.Run("less than third new keys", func(t *testing.T) { exp := keys.PublicKeys{k[1], k[2], k[3], k[4], k[5], k[6], k[7]} got, err := newAlphabetList(orig, exp) require.NoError(t, err) require.True(t, equalPublicKeyLists(exp, got)) }) t.Run("completely new list of keys", func(t *testing.T) { list := orig exp := keys.PublicKeys{k[7], k[8], k[9], k[10], k[11], k[12], k[13]} rounds := []keys.PublicKeys{ {k[0], k[1], k[2], k[3], k[4], k[7], k[8]}, {k[0], k[1], k[2], k[7], k[8], k[9], k[10]}, {k[0], k[7], k[8], k[9], k[10], k[11], k[12]}, exp, } ln := len(rounds) for i := 0; i < ln; i++ { list, err = newAlphabetList(list, exp) require.NoError(t, err) require.True(t, equalPublicKeyLists(list, rounds[i])) } }) t.Run("unsorted keys", func(t *testing.T) { orig := keys.PublicKeys{k[1], k[2], k[3], k[4]} main := keys.PublicKeys{k[1], k[2], k[5], k[4]} exp := main.Copy() sort.Sort(exp) got, err := newAlphabetList(orig, main) require.NoError(t, err) require.True(t, equalPublicKeyLists(exp, got)) // expect {1, 2, 4, 5}, not {1, 2, 3, 5} }) t.Run("new keys in the middle", func(t *testing.T) { orig := keys.PublicKeys{k[0], k[1], k[2], k[6], k[7], k[8], k[9]} // `exp` should contain maximum amount of new keys (2) in the middle exp := keys.PublicKeys{k[0], k[3], k[4], k[6], k[7], k[8], k[9]} got, err := newAlphabetList(orig, exp) require.NoError(t, err) require.True(t, equalPublicKeyLists(exp, got)) }) } func TestUpdateInnerRing(t *testing.T) { k, err := generateKeys(6) require.NoError(t, err) t.Run("same keys", func(t *testing.T) { ir := k[:3] before := k[1:3] after := keys.PublicKeys{k[2], k[1]} list, err := updateInnerRing(ir, before, after) require.NoError(t, err) sort.Sort(ir) sort.Sort(list) require.True(t, equalPublicKeyLists(ir, list)) }) t.Run("unknown keys", func(t *testing.T) { ir := k[:3] before := k[3:4] after := k[4:5] list, err := updateInnerRing(ir, before, after) require.NoError(t, err) require.True(t, equalPublicKeyLists(ir, list)) }) t.Run("different size", func(t *testing.T) { ir := k[:3] before := k[1:3] after := k[4:5] _, err = updateInnerRing(ir, before, after) require.ErrorIs(t, err, errNotEqualLen) }) t.Run("new list", func(t *testing.T) { ir := k[:3] before := k[1:3] after := k[4:6] exp := keys.PublicKeys{k[0], k[4], k[5]} list, err := updateInnerRing(ir, before, after) require.NoError(t, err) require.True(t, equalPublicKeyLists(exp, list)) }) } func generateKeys(n int) (keys.PublicKeys, error) { pubKeys := make(keys.PublicKeys, 0, n) for i := 0; i < n; i++ { privKey, err := keys.NewPrivateKey() if err != nil { return nil, err } pubKeys = append(pubKeys, privKey.PublicKey()) } sort.Sort(pubKeys) return pubKeys, nil } func equalPublicKeyLists(a, b keys.PublicKeys) bool { if len(a) != len(b) { return false } for i, node := range a { if !b[i].Equal(node) { return false } } return true }