prysm-pulse/beacon-chain/state/stateutil/participation_bit_root.go
terence 5a66807989
Update to V5 (#13622)
* First take at updating everything to v5

* Patch gRPC gateway to use prysm v5

Fix patch

* Update go ssz

---------

Co-authored-by: Preston Van Loon <pvanloon@offchainlabs.com>
2024-02-15 05:46:47 +00:00

56 lines
1.5 KiB
Go

package stateutil
import (
"encoding/binary"
"github.com/pkg/errors"
fieldparams "github.com/prysmaticlabs/prysm/v5/config/fieldparams"
"github.com/prysmaticlabs/prysm/v5/encoding/ssz"
)
// ParticipationBitsRoot computes the HashTreeRoot merkleization of
// participation roots.
func ParticipationBitsRoot(bits []byte) ([32]byte, error) {
chunkedRoots, err := packParticipationBits(bits)
if err != nil {
return [32]byte{}, err
}
limit := (uint64(fieldparams.ValidatorRegistryLimit + 31)) / 32
bytesRoot, err := ssz.BitwiseMerkleize(chunkedRoots, uint64(len(chunkedRoots)), limit)
if err != nil {
return [32]byte{}, errors.Wrap(err, "could not compute merkleization")
}
bytesRootBufRoot := make([]byte, 32)
binary.LittleEndian.PutUint64(bytesRootBufRoot[:8], uint64(len(bits)))
return ssz.MixInLength(bytesRoot, bytesRootBufRoot), nil
}
// packParticipationBits into chunks. It'll pad the last chunk with zero bytes if
// it does not have length bytes per chunk.
func packParticipationBits(bytes []byte) ([][32]byte, error) {
numItems := len(bytes)
chunks := make([][32]byte, 0, numItems/32)
for i := 0; i < numItems; i += 32 {
j := i + 32
// We create our upper bound index of the chunk, if it is greater than numItems,
// we set it as numItems itself.
if j > numItems {
j = numItems
}
// We create chunks from the list of items based on the
// indices determined above.
var chunk [32]byte
copy(chunk[:], bytes[i:j])
chunks = append(chunks, chunk)
}
if len(chunks) == 0 {
return chunks, nil
}
return chunks, nil
}