attestations

func Aggregate ¶

func Aggregate(atts []*ethpb.Attestation) ([]*ethpb.Attestation, error)

Aggregate aggregates attestations. The minimal number of attestations is returned. Aggregation occurs in-place i.e. contents of input array will be modified. Should you need to preserve input attestations, clone them before aggregating:

clonedAtts := make([]*ethpb.Attestation, len(atts))
for i, a := range atts {
    clonedAtts[i] = stateTrie.CopyAttestation(a)
}
aggregatedAtts, err := attaggregation.Aggregate(clonedAtts)

func AggregateDisjointOneBitAtts ¶

func AggregateDisjointOneBitAtts(atts []*ethpb.Attestation) (*ethpb.Attestation, error)

AggregateDisjointOneBitAtts aggregates unaggregated attestations with the exact same attestation data.

func AggregatePair ¶

func AggregatePair(a1, a2 *ethpb.Attestation) (*ethpb.Attestation, error)

AggregatePair aggregates pair of attestations a1 and a2 together.

func MaxCoverAttestationAggregation ¶

func MaxCoverAttestationAggregation(atts []*ethpb.Attestation) ([]*ethpb.Attestation, error)

MaxCoverAttestationAggregation relies on Maximum Coverage greedy algorithm for aggregation. Aggregation occurs in many rounds, up until no more aggregation is possible (all attestations are overlapping). See https://hackmd.io/@farazdagi/in-place-attagg for design and rationale.

func NewMaxCover ¶

func NewMaxCover(atts []*ethpb.Attestation) *aggregation.MaxCoverProblem

NewMaxCover returns initialized Maximum Coverage problem for attestations aggregation.