mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2025-01-08 10:41:19 +00:00
fb8be4d555
* refactor BLS to expose an interface rather than a single implementation * Split up tests, gofmt, goimports, docs * godoc for signature.Copy() * more godocs * revert gomod / deps changes * rm newline * revert proto changes * rename bls12 to herumi for clarity
87 lines
3.0 KiB
Go
87 lines
3.0 KiB
Go
package attestations
|
|
|
|
import (
|
|
"github.com/pkg/errors"
|
|
ethpb "github.com/prysmaticlabs/ethereumapis/eth/v1alpha1"
|
|
stateTrie "github.com/prysmaticlabs/prysm/beacon-chain/state"
|
|
"github.com/prysmaticlabs/prysm/shared/aggregation"
|
|
"github.com/prysmaticlabs/prysm/shared/bls"
|
|
"github.com/prysmaticlabs/prysm/shared/featureconfig"
|
|
"github.com/sirupsen/logrus"
|
|
)
|
|
|
|
const (
|
|
// NaiveAggregation is an aggregation strategy without any optimizations.
|
|
NaiveAggregation AttestationAggregationStrategy = "naive"
|
|
|
|
// MaxCoverAggregation is a strategy based on Maximum Coverage greedy algorithm.
|
|
MaxCoverAggregation AttestationAggregationStrategy = "max_cover"
|
|
)
|
|
|
|
// AttestationAggregationStrategy defines attestation aggregation strategy.
|
|
type AttestationAggregationStrategy string
|
|
|
|
// attList represents list of attestations, defined for easier en masse operations (filtering, sorting).
|
|
type attList []*ethpb.Attestation
|
|
|
|
// BLS aggregate signature aliases for testing / benchmark substitution. These methods are
|
|
// significantly more expensive than the inner logic of AggregateAttestations so they must be
|
|
// substituted for benchmarks which analyze AggregateAttestations.
|
|
var aggregateSignatures = bls.AggregateSignatures
|
|
var signatureFromBytes = bls.SignatureFromBytes
|
|
|
|
var log = logrus.WithField("prefix", "aggregation.attestations")
|
|
|
|
// ErrInvalidAttestationCount is returned when insufficient number
|
|
// of attestations is provided for aggregation.
|
|
var ErrInvalidAttestationCount = errors.New("invalid number of attestations")
|
|
|
|
// Aggregate aggregates attestations. The minimal number of attestations is returned.
|
|
func Aggregate(atts []*ethpb.Attestation) ([]*ethpb.Attestation, error) {
|
|
strategy := AttestationAggregationStrategy(featureconfig.Get().AttestationAggregationStrategy)
|
|
switch strategy {
|
|
case "", NaiveAggregation:
|
|
return NaiveAttestationAggregation(atts)
|
|
case MaxCoverAggregation:
|
|
return MaxCoverAttestationAggregation(atts)
|
|
default:
|
|
return nil, errors.Wrapf(aggregation.ErrInvalidStrategy, "%q", strategy)
|
|
}
|
|
}
|
|
|
|
// AggregatePair aggregates pair of attestations a1 and a2 together.
|
|
func AggregatePair(a1 *ethpb.Attestation, a2 *ethpb.Attestation) (*ethpb.Attestation, error) {
|
|
if a1.AggregationBits.Len() != a2.AggregationBits.Len() {
|
|
return nil, aggregation.ErrBitsDifferentLen
|
|
}
|
|
if a1.AggregationBits.Overlaps(a2.AggregationBits) {
|
|
return nil, aggregation.ErrBitsOverlap
|
|
}
|
|
|
|
baseAtt := stateTrie.CopyAttestation(a1)
|
|
newAtt := stateTrie.CopyAttestation(a2)
|
|
if newAtt.AggregationBits.Count() > baseAtt.AggregationBits.Count() {
|
|
baseAtt, newAtt = newAtt, baseAtt
|
|
}
|
|
|
|
if baseAtt.AggregationBits.Contains(newAtt.AggregationBits) {
|
|
return baseAtt, nil
|
|
}
|
|
|
|
newBits := baseAtt.AggregationBits.Or(newAtt.AggregationBits)
|
|
newSig, err := signatureFromBytes(newAtt.Signature)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
baseSig, err := signatureFromBytes(baseAtt.Signature)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
aggregatedSig := aggregateSignatures([]bls.Signature{baseSig, newSig})
|
|
baseAtt.Signature = aggregatedSig.Marshal()
|
|
baseAtt.AggregationBits = newBits
|
|
|
|
return baseAtt, nil
|
|
}
|