mirror of https://github.com/certusone/vouch.git
96 lines
3.3 KiB
Go
96 lines
3.3 KiB
Go
// Copyright © 2020 Attestant Limited.
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
package attester
|
|
|
|
import (
|
|
"context"
|
|
"sort"
|
|
|
|
api "github.com/attestantio/go-eth2-client/api/v1"
|
|
)
|
|
|
|
// MergeDuties merges attester duties given by an Ethereum 2 client into vouch's per-slot structure.
|
|
func MergeDuties(ctx context.Context, attesterDuties []*api.AttesterDuty) ([]*Duty, error) {
|
|
validatorIndices := make(map[uint64][]uint64)
|
|
committeeIndices := make(map[uint64][]uint64)
|
|
validatorCommitteeIndices := make(map[uint64][]uint64)
|
|
committeeLengths := make(map[uint64]map[uint64]uint64)
|
|
|
|
// Set the base capacity for our arrays based on the number of attester duties.
|
|
// This is much higher than we need, but is overall minimal and avoids reallocations.
|
|
arrayCap := uint64(len(attesterDuties))
|
|
|
|
// Sort the response by slot, then committee index, then validator index.
|
|
sort.Slice(attesterDuties, func(i int, j int) bool {
|
|
if attesterDuties[i].Slot < attesterDuties[j].Slot {
|
|
return true
|
|
}
|
|
if attesterDuties[i].Slot > attesterDuties[j].Slot {
|
|
return false
|
|
}
|
|
if attesterDuties[i].CommitteeIndex < attesterDuties[j].CommitteeIndex {
|
|
return true
|
|
}
|
|
if attesterDuties[i].CommitteeIndex > attesterDuties[j].CommitteeIndex {
|
|
return false
|
|
}
|
|
return attesterDuties[i].ValidatorIndex < attesterDuties[j].ValidatorIndex
|
|
})
|
|
|
|
for _, duty := range attesterDuties {
|
|
// Future optimisation (maybe; depends how much effort it is to fetch validator status here):
|
|
// There are three states where a validator is given duties: active, exiting and slashing.
|
|
// However, if the validator is slashing its attestations are ignored by the network.
|
|
// Hence, if the validator is slashed we don't need to include its duty.
|
|
|
|
_, exists := validatorIndices[duty.Slot]
|
|
if !exists {
|
|
validatorIndices[duty.Slot] = make([]uint64, 0, arrayCap)
|
|
committeeIndices[duty.Slot] = make([]uint64, 0, arrayCap)
|
|
committeeLengths[duty.Slot] = make(map[uint64]uint64)
|
|
}
|
|
validatorIndices[duty.Slot] = append(validatorIndices[duty.Slot], duty.ValidatorIndex)
|
|
committeeIndices[duty.Slot] = append(committeeIndices[duty.Slot], duty.CommitteeIndex)
|
|
committeeLengths[duty.Slot][duty.CommitteeIndex] = duty.CommitteeLength
|
|
validatorCommitteeIndices[duty.Slot] = append(validatorCommitteeIndices[duty.Slot], duty.ValidatorCommitteeIndex)
|
|
}
|
|
|
|
duties := make([]*Duty, 0, len(validatorIndices))
|
|
for slot := range validatorIndices {
|
|
if duty, err := NewDuty(
|
|
ctx,
|
|
slot,
|
|
validatorIndices[slot],
|
|
committeeIndices[slot],
|
|
validatorCommitteeIndices[slot],
|
|
committeeLengths[slot],
|
|
); err == nil {
|
|
duties = append(duties, duty)
|
|
}
|
|
}
|
|
|
|
// Order the attester duties by slot.
|
|
sort.Slice(duties, func(i int, j int) bool {
|
|
if duties[i].Slot() < duties[j].Slot() {
|
|
return true
|
|
}
|
|
if duties[i].Slot() > duties[j].Slot() {
|
|
return false
|
|
}
|
|
return true
|
|
})
|
|
|
|
return duties, nil
|
|
}
|