mirror of
https://github.com/OffchainLabs/prysm.git
synced 2026-01-09 13:28:01 -05:00
* overhaul fork schedule management for bpos * Unify log * Radek's comments * Use arg config to determine previous epoch, with regression test * Remove unnecessary NewClock. @potuz feedback * Continuation of previous commit: Remove unnecessary NewClock. @potuz feedback * Remove VerifyBlockHeaderSignatureUsingCurrentFork * cosmetic changes * Remove unnecessary copy. entryWithForkDigest passes by value, not by pointer so it shold be fine * Reuse ErrInvalidTopic from p2p package * Unskip TestServer_GetBeaconConfig * Resolve TODO about forkwatcher in local mode * remove Copy() --------- Co-authored-by: Kasey <kasey@users.noreply.github.com> Co-authored-by: terence tsao <terence@prysmaticlabs.com> Co-authored-by: rkapka <radoslaw.kapka@gmail.com> Co-authored-by: Preston Van Loon <preston@pvl.dev>
153 lines
4.6 KiB
Go
153 lines
4.6 KiB
Go
package backfill
|
|
|
|
import (
|
|
"github.com/OffchainLabs/prysm/v6/beacon-chain/core/signing"
|
|
fieldparams "github.com/OffchainLabs/prysm/v6/config/fieldparams"
|
|
"github.com/OffchainLabs/prysm/v6/config/params"
|
|
"github.com/OffchainLabs/prysm/v6/consensus-types/blocks"
|
|
"github.com/OffchainLabs/prysm/v6/consensus-types/interfaces"
|
|
"github.com/OffchainLabs/prysm/v6/consensus-types/primitives"
|
|
"github.com/OffchainLabs/prysm/v6/crypto/bls"
|
|
"github.com/OffchainLabs/prysm/v6/encoding/bytesutil"
|
|
"github.com/OffchainLabs/prysm/v6/runtime/version"
|
|
"github.com/OffchainLabs/prysm/v6/time/slots"
|
|
"github.com/pkg/errors"
|
|
)
|
|
|
|
var errInvalidBatchChain = errors.New("parent_root of block does not match the previous block's root")
|
|
var errProposerIndexTooHigh = errors.New("proposer index not present in origin state")
|
|
var errUnknownDomain = errors.New("runtime error looking up signing domain for fork")
|
|
|
|
// verifiedROBlocks represents a slice of blocks that have passed signature verification.
|
|
type verifiedROBlocks []blocks.ROBlock
|
|
|
|
func (v verifiedROBlocks) blobIdents(retentionStart primitives.Slot) ([]blobSummary, error) {
|
|
// early return if the newest block is outside the retention window
|
|
if len(v) > 0 && v[len(v)-1].Block().Slot() < retentionStart {
|
|
return nil, nil
|
|
}
|
|
bs := make([]blobSummary, 0)
|
|
for i := range v {
|
|
if v[i].Block().Slot() < retentionStart {
|
|
continue
|
|
}
|
|
if v[i].Block().Version() < version.Deneb {
|
|
continue
|
|
}
|
|
c, err := v[i].Block().Body().BlobKzgCommitments()
|
|
if err != nil {
|
|
return nil, errors.Wrapf(err, "unexpected error checking commitments for block root %#x", v[i].Root())
|
|
}
|
|
if len(c) == 0 {
|
|
continue
|
|
}
|
|
for ci := range c {
|
|
bs = append(bs, blobSummary{
|
|
blockRoot: v[i].Root(), signature: v[i].Signature(),
|
|
index: uint64(ci), commitment: bytesutil.ToBytes48(c[ci])})
|
|
}
|
|
}
|
|
return bs, nil
|
|
}
|
|
|
|
type verifier struct {
|
|
keys [][fieldparams.BLSPubkeyLength]byte
|
|
maxVal primitives.ValidatorIndex
|
|
domain *domainCache
|
|
}
|
|
|
|
// TODO: rewrite this to use ROBlock.
|
|
func (vr verifier) verify(blks []interfaces.ReadOnlySignedBeaconBlock) (verifiedROBlocks, error) {
|
|
var err error
|
|
result := make([]blocks.ROBlock, len(blks))
|
|
sigSet := bls.NewSet()
|
|
for i := range blks {
|
|
result[i], err = blocks.NewROBlock(blks[i])
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
if i > 0 && result[i-1].Root() != result[i].Block().ParentRoot() {
|
|
p, b := result[i-1], result[i]
|
|
return nil, errors.Wrapf(errInvalidBatchChain,
|
|
"slot %d parent_root=%#x, slot %d root=%#x",
|
|
b.Block().Slot(), b.Block().ParentRoot(),
|
|
p.Block().Slot(), p.Root())
|
|
}
|
|
set, err := vr.blockSignatureBatch(result[i])
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
sigSet.Join(set)
|
|
}
|
|
v, err := sigSet.Verify()
|
|
if err != nil {
|
|
return nil, errors.Wrap(err, "block signature verification error")
|
|
}
|
|
if !v {
|
|
return nil, errors.New("batch block signature verification failed")
|
|
}
|
|
return result, nil
|
|
}
|
|
|
|
func (vr verifier) blockSignatureBatch(b blocks.ROBlock) (*bls.SignatureBatch, error) {
|
|
pidx := b.Block().ProposerIndex()
|
|
if pidx > vr.maxVal {
|
|
return nil, errProposerIndexTooHigh
|
|
}
|
|
dom, err := vr.domain.forEpoch(slots.ToEpoch(b.Block().Slot()))
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
sig := b.Signature()
|
|
pk := vr.keys[pidx][:]
|
|
root := b.Root()
|
|
rootF := func() ([32]byte, error) { return root, nil }
|
|
return signing.BlockSignatureBatch(pk, sig[:], dom, rootF)
|
|
}
|
|
|
|
func newBackfillVerifier(vr []byte, keys [][fieldparams.BLSPubkeyLength]byte) (*verifier, error) {
|
|
dc, err := newDomainCache(vr, params.BeaconConfig().DomainBeaconProposer)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
v := &verifier{
|
|
keys: keys,
|
|
domain: dc,
|
|
}
|
|
v.maxVal = primitives.ValidatorIndex(len(v.keys) - 1)
|
|
return v, nil
|
|
}
|
|
|
|
// domainCache provides a fast signing domain lookup by epoch.
|
|
type domainCache struct {
|
|
forkDomains map[[4]byte][]byte
|
|
dType [bls.DomainByteLength]byte
|
|
}
|
|
|
|
func newDomainCache(vRoot []byte, dType [bls.DomainByteLength]byte) (*domainCache, error) {
|
|
dc := &domainCache{
|
|
forkDomains: make(map[[4]byte][]byte),
|
|
dType: dType,
|
|
}
|
|
for _, entry := range params.SortedForkSchedule() {
|
|
d, err := signing.ComputeDomain(dc.dType, entry.ForkVersion[:], vRoot)
|
|
if err != nil {
|
|
return nil, errors.Wrapf(err, "failed to pre-compute signing domain for fork version=%#x", entry.ForkVersion)
|
|
}
|
|
dc.forkDomains[entry.ForkVersion] = d
|
|
}
|
|
return dc, nil
|
|
}
|
|
|
|
func (dc *domainCache) forEpoch(e primitives.Epoch) ([]byte, error) {
|
|
fork, err := params.Fork(e)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
d, ok := dc.forkDomains[[4]byte(fork.CurrentVersion)]
|
|
if !ok {
|
|
return nil, errors.Wrapf(errUnknownDomain, "fork version=%#x, epoch=%d", fork, e)
|
|
}
|
|
return d, nil
|
|
}
|