mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2025-01-08 18:51:19 +00:00
e49a190754
* refactor repo to use protos * removed block successfully in types * db package updated * db, core passing * chain service done * no more block instances * all pass * deprecate all block protos * tests pass
68 lines
2.4 KiB
Go
68 lines
2.4 KiB
Go
package state
|
|
|
|
import (
|
|
"fmt"
|
|
|
|
"github.com/prysmaticlabs/prysm/beacon-chain/core/randao"
|
|
"github.com/prysmaticlabs/prysm/beacon-chain/core/types"
|
|
pb "github.com/prysmaticlabs/prysm/proto/beacon/p2p/v1"
|
|
"github.com/prysmaticlabs/prysm/shared/params"
|
|
)
|
|
|
|
// ExecuteStateTransition defines the procedure for a state transition function.
|
|
// Spec:
|
|
// We now define the state transition function. At a high level the state transition is made up of two parts:
|
|
// - The per-slot transitions, which happens every slot, and only affects a parts of the state.
|
|
// - The per-epoch transitions, which happens at every epoch boundary (i.e. state.slot % EPOCH_LENGTH == 0), and affects the entire state.
|
|
// The per-slot transitions generally focus on verifying aggregate signatures and saving temporary records relating to the per-slot
|
|
// activity in the BeaconState. The per-epoch transitions focus on the validator registry, including adjusting balances and activating
|
|
// and exiting validators, as well as processing crosslinks and managing block justification/finalization.
|
|
func ExecuteStateTransition(
|
|
beaconState *types.BeaconState,
|
|
block *pb.BeaconBlock,
|
|
) (*types.BeaconState, error) {
|
|
|
|
var err error
|
|
|
|
newState := beaconState.CopyState()
|
|
|
|
currentSlot := newState.Slot()
|
|
newState.SetSlot(currentSlot + 1)
|
|
|
|
newState, err = randao.UpdateRandaoLayers(newState, newState.Slot())
|
|
if err != nil {
|
|
return nil, fmt.Errorf("unable to update randao layer %v", err)
|
|
}
|
|
|
|
newHashes, err := newState.CalculateNewBlockHashes(block, currentSlot)
|
|
if err != nil {
|
|
return nil, fmt.Errorf("unable to calculate recent blockhashes")
|
|
}
|
|
|
|
newState.SetLatestBlockHashes(newHashes)
|
|
|
|
if block != nil {
|
|
newState = ProcessBlock(newState, block)
|
|
if newState.Slot()%params.BeaconConfig().EpochLength == 0 {
|
|
newState = NewEpochTransition(newState)
|
|
}
|
|
}
|
|
|
|
return newState, nil
|
|
}
|
|
|
|
// ProcessBlock describes the per block operations that happen on every slot.
|
|
func ProcessBlock(state *types.BeaconState, block *pb.BeaconBlock) *types.BeaconState {
|
|
_ = block
|
|
// TODO(#1073): This function will encompass all the per block slot transition functions, this will
|
|
// contain checks for randao,proposer validity and block operations.
|
|
return state
|
|
}
|
|
|
|
// NewEpochTransition describes the per epoch operations that are performed on the
|
|
// beacon state.
|
|
func NewEpochTransition(state *types.BeaconState) *types.BeaconState {
|
|
// TODO(#1074): This will encompass all the related logic to epoch transitions.
|
|
return state
|
|
}
|