mirror of
https://github.com/OffchainLabs/prysm.git
synced 2026-01-08 23:18:15 -05:00
* Merkle Proofs of KZG commitments * fix mock * Implement Merkle proof spectests * Check Proof construction in spectests * fix Merkle proof generator * Add unit test * add ssz package unit tests * add benchmark * fix typo in comment * ProposerSlashing was repeated * Terence's review * move to consensus_blocks * use existing error
193 lines
4.9 KiB
Go
193 lines
4.9 KiB
Go
package blocks
|
|
|
|
import (
|
|
"github.com/pkg/errors"
|
|
"github.com/prysmaticlabs/gohashtree"
|
|
field_params "github.com/prysmaticlabs/prysm/v4/config/fieldparams"
|
|
"github.com/prysmaticlabs/prysm/v4/config/params"
|
|
"github.com/prysmaticlabs/prysm/v4/consensus-types/interfaces"
|
|
"github.com/prysmaticlabs/prysm/v4/container/trie"
|
|
"github.com/prysmaticlabs/prysm/v4/encoding/ssz"
|
|
"github.com/prysmaticlabs/prysm/v4/runtime/version"
|
|
)
|
|
|
|
const (
|
|
bodyLength = 12 // The number of elements in the BeaconBlockBody Container
|
|
logBodyLength = 4 // The log 2 of bodyLength
|
|
kzgPosition = 11 // The index of the KZG commitment list in the Body
|
|
)
|
|
|
|
var (
|
|
errInvalidIndex = errors.New("index out of bounds")
|
|
)
|
|
|
|
// MerkleProofKZGCommitment constructs a Merkle proof of inclusion of the KZG
|
|
// commitment of index `index` into the Beacon Block with the given `body`
|
|
func MerkleProofKZGCommitment(body interfaces.ReadOnlyBeaconBlockBody, index int) ([][]byte, error) {
|
|
bodyVersion := body.Version()
|
|
if bodyVersion < version.Deneb {
|
|
return nil, errUnsupportedBeaconBlockBody
|
|
}
|
|
commitments, err := body.BlobKzgCommitments()
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
proof, err := bodyProof(commitments, index)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
membersRoots, err := topLevelRoots(body)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
sparse, err := trie.GenerateTrieFromItems(membersRoots, logBodyLength)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
topProof, err := sparse.MerkleProof(kzgPosition)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
// sparse.MerkleProof always includes the length of the slice this is
|
|
// why we remove the last element that is not needed in topProof
|
|
proof = append(proof, topProof[:len(topProof)-1]...)
|
|
return proof, nil
|
|
}
|
|
|
|
// leavesFromCommitments hashes each commitment to construct a slice of roots
|
|
func leavesFromCommitments(commitments [][]byte) [][]byte {
|
|
leaves := make([][]byte, len(commitments))
|
|
for i, kzg := range commitments {
|
|
chunk := make([][32]byte, 2)
|
|
copy(chunk[0][:], kzg)
|
|
copy(chunk[1][:], kzg[field_params.RootLength:])
|
|
gohashtree.HashChunks(chunk, chunk)
|
|
leaves[i] = chunk[0][:]
|
|
}
|
|
return leaves
|
|
}
|
|
|
|
// bodyProof returns the Merkle proof of the subtree up to the root of the KZG
|
|
// commitment list.
|
|
func bodyProof(commitments [][]byte, index int) ([][]byte, error) {
|
|
if index < 0 || index >= len(commitments) {
|
|
return nil, errInvalidIndex
|
|
}
|
|
leaves := leavesFromCommitments(commitments)
|
|
sparse, err := trie.GenerateTrieFromItems(leaves, field_params.LogMaxBlobCommitments)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
proof, err := sparse.MerkleProof(index)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
return proof, err
|
|
}
|
|
|
|
// topLevelRoots computes the slice with the roots of each element in the
|
|
// BeaconBlockBody. Notice that the KZG commitments root is not needed for the
|
|
// proof computation thus it's omitted
|
|
func topLevelRoots(body interfaces.ReadOnlyBeaconBlockBody) ([][]byte, error) {
|
|
layer := make([][]byte, bodyLength)
|
|
for i := range layer {
|
|
layer[i] = make([]byte, 32)
|
|
}
|
|
|
|
// Randao Reveal
|
|
randao := body.RandaoReveal()
|
|
root, err := ssz.MerkleizeByteSliceSSZ(randao[:])
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
copy(layer[0], root[:])
|
|
|
|
// eth1_data
|
|
eth1 := body.Eth1Data()
|
|
root, err = eth1.HashTreeRoot()
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
copy(layer[1], root[:])
|
|
|
|
// graffiti
|
|
root = body.Graffiti()
|
|
copy(layer[2], root[:])
|
|
|
|
// Proposer slashings
|
|
ps := body.ProposerSlashings()
|
|
root, err = ssz.MerkleizeListSSZ(ps, params.BeaconConfig().MaxProposerSlashings)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
copy(layer[3], root[:])
|
|
|
|
// Attester slashings
|
|
as := body.AttesterSlashings()
|
|
root, err = ssz.MerkleizeListSSZ(as, params.BeaconConfig().MaxAttesterSlashings)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
copy(layer[4], root[:])
|
|
|
|
// Attestations
|
|
att := body.Attestations()
|
|
root, err = ssz.MerkleizeListSSZ(att, params.BeaconConfig().MaxAttestations)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
copy(layer[5], root[:])
|
|
|
|
// Deposits
|
|
dep := body.Deposits()
|
|
root, err = ssz.MerkleizeListSSZ(dep, params.BeaconConfig().MaxDeposits)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
copy(layer[6], root[:])
|
|
|
|
// Voluntary Exits
|
|
ve := body.VoluntaryExits()
|
|
root, err = ssz.MerkleizeListSSZ(ve, params.BeaconConfig().MaxVoluntaryExits)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
copy(layer[7], root[:])
|
|
|
|
// Sync Aggregate
|
|
sa, err := body.SyncAggregate()
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
root, err = sa.HashTreeRoot()
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
copy(layer[8], root[:])
|
|
|
|
// Execution Payload
|
|
ep, err := body.Execution()
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
root, err = ep.HashTreeRoot()
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
copy(layer[9], root[:])
|
|
|
|
// BLS Changes
|
|
bls, err := body.BLSToExecutionChanges()
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
root, err = ssz.MerkleizeListSSZ(bls, params.BeaconConfig().MaxBlsToExecutionChanges)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
copy(layer[10], root[:])
|
|
|
|
// KZG commitments is not needed
|
|
return layer, nil
|
|
}
|