mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2024-12-25 04:47:18 +00:00
cae24068d4
* prevent OR on bitlists of different length * prevent OR on bitlists of different length
79 lines
2.4 KiB
Go
79 lines
2.4 KiB
Go
package db
|
|
|
|
import (
|
|
ethpb "github.com/prysmaticlabs/ethereumapis/eth/v1alpha1"
|
|
"github.com/prysmaticlabs/go-bitfield"
|
|
)
|
|
|
|
// NewContainerFromAttestations creates a new attestation contain with signature pairs from the
|
|
// given list of attestations.
|
|
func NewContainerFromAttestations(atts []*ethpb.Attestation) *AttestationContainer {
|
|
if len(atts) == 0 {
|
|
panic("no attestations provided")
|
|
}
|
|
var sp []*AttestationContainer_SignaturePair
|
|
for _, att := range atts {
|
|
sp = append(sp, &AttestationContainer_SignaturePair{
|
|
AggregationBits: att.AggregationBits,
|
|
Signature: att.Signature,
|
|
})
|
|
}
|
|
return &AttestationContainer{
|
|
Data: atts[0].Data,
|
|
SignaturePairs: sp,
|
|
}
|
|
}
|
|
|
|
// Contains returns true if the attestation bits are fully contained in some attestations.
|
|
func (ac *AttestationContainer) Contains(att *ethpb.Attestation) bool {
|
|
all := bitfield.NewBitlist(att.AggregationBits.Len())
|
|
for _, sp := range ac.SignaturePairs {
|
|
if all.Len() != sp.AggregationBits.Len() {
|
|
continue
|
|
}
|
|
all = all.Or(sp.AggregationBits)
|
|
}
|
|
return all.Contains(att.AggregationBits)
|
|
}
|
|
|
|
// ToAttestations converts an attestationContainer signature pairs to full attestations.
|
|
func (ac *AttestationContainer) ToAttestations() []*ethpb.Attestation {
|
|
if ac == nil {
|
|
return nil
|
|
}
|
|
|
|
atts := make([]*ethpb.Attestation, len(ac.SignaturePairs))
|
|
for i, sp := range ac.SignaturePairs {
|
|
atts[i] = ðpb.Attestation{
|
|
Data: ac.Data,
|
|
AggregationBits: sp.AggregationBits,
|
|
Signature: sp.Signature,
|
|
// TODO(3791): Add custody bits in phase 1.
|
|
// Stub: CustodyBits must be same length as aggregation bits; committee size.
|
|
CustodyBits: bitfield.NewBitlist(sp.AggregationBits.Len()),
|
|
}
|
|
}
|
|
return atts
|
|
}
|
|
|
|
// InsertAttestation if bitfields do not exist already.
|
|
func (ac *AttestationContainer) InsertAttestation(att *ethpb.Attestation) {
|
|
sigPairsNotEclipsed := make([]*AttestationContainer_SignaturePair, 0, len(ac.SignaturePairs))
|
|
// if att is fully contained in some existing bitfields, do nothing.
|
|
if ac.Contains(att) {
|
|
return
|
|
}
|
|
|
|
for _, sp := range ac.SignaturePairs {
|
|
// filter any existing signature pairs that are fully contained within
|
|
// the new attestation.
|
|
if !att.AggregationBits.Contains(sp.AggregationBits) {
|
|
sigPairsNotEclipsed = append(sigPairsNotEclipsed, sp)
|
|
}
|
|
}
|
|
ac.SignaturePairs = append(sigPairsNotEclipsed, &AttestationContainer_SignaturePair{
|
|
AggregationBits: att.AggregationBits,
|
|
Signature: att.Signature,
|
|
})
|
|
}
|