-
Notifications
You must be signed in to change notification settings - Fork 985
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Advance Beacon State Transition Part 2: Simulate Block Randao at Ever…
…y Slot (#1252)
- Loading branch information
1 parent
1f11b82
commit 5258f3d
Showing
15 changed files
with
272 additions
and
142 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -2,7 +2,6 @@ | |
| bazel-* | ||
|
|
||
| .DS_Store | ||
| .gitattributes | ||
|
|
||
| # IntelliJ | ||
| .idea | ||
|
|
||
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
30 changes: 15 additions & 15 deletions
30
...in/chaintest/backend/chain_test_format.go → ...intest/backend/fork_choice_test_format.go
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,122 @@ | ||
| package backend | ||
|
|
||
| import ( | ||
| "fmt" | ||
| "strconv" | ||
|
|
||
| "github.com/gogo/protobuf/proto" | ||
| b "github.com/prysmaticlabs/prysm/beacon-chain/core/blocks" | ||
| pb "github.com/prysmaticlabs/prysm/proto/beacon/p2p/v1" | ||
| "github.com/prysmaticlabs/prysm/shared/hashutil" | ||
| "github.com/prysmaticlabs/prysm/shared/params" | ||
| ) | ||
|
|
||
| // Generates a simulated beacon block to use | ||
| // in the next state transition given the current state, | ||
| // the previous beacon block, and previous beacon block root. | ||
| func generateSimulatedBlock( | ||
| beaconState *pb.BeaconState, | ||
| prevBlockRoot [32]byte, | ||
| randaoReveal [32]byte, | ||
| ) (*pb.BeaconBlock, [32]byte, error) { | ||
| encodedState, err := proto.Marshal(beaconState) | ||
| if err != nil { | ||
| return nil, [32]byte{}, fmt.Errorf("could not marshal beacon state: %v", err) | ||
| } | ||
| stateRoot := hashutil.Hash(encodedState) | ||
| block := &pb.BeaconBlock{ | ||
| Slot: beaconState.Slot + 1, | ||
| RandaoRevealHash32: randaoReveal[:], | ||
| ParentRootHash32: prevBlockRoot[:], | ||
| StateRootHash32: stateRoot[:], | ||
| Body: &pb.BeaconBlockBody{ | ||
| ProposerSlashings: []*pb.ProposerSlashing{}, | ||
| CasperSlashings: []*pb.CasperSlashing{}, | ||
| Attestations: []*pb.Attestation{}, | ||
| Deposits: []*pb.Deposit{}, | ||
| Exits: []*pb.Exit{}, | ||
| }, | ||
| } | ||
| encodedBlock, err := proto.Marshal(block) | ||
| if err != nil { | ||
| return nil, [32]byte{}, fmt.Errorf("could not marshal new block: %v", err) | ||
| } | ||
| return block, hashutil.Hash(encodedBlock), nil | ||
| } | ||
|
|
||
| // Given a number of slots, we create a list of hash onions from an underlying randao reveal. For example, | ||
| // if we have N slots, we create a list of [secret, hash(secret), hash(hash(secret)), hash(...(prev N-1 hashes))]. | ||
| func generateSimulatedRandaoHashOnions(numSlots uint64) [][32]byte { | ||
| // We create a list of randao hash onions for the given number of epochs | ||
| // we run the state transition. | ||
| numEpochs := numSlots % params.BeaconConfig().EpochLength | ||
| hashOnions := [][32]byte{params.BeaconConfig().SimulatedBlockRandao} | ||
|
|
||
| // We make the length of the hash onions list equal to the number of epochs + 10 to be safe. | ||
| for i := uint64(0); i < numEpochs+10; i++ { | ||
| prevHash := hashOnions[i] | ||
| hashOnions = append(hashOnions, hashutil.Hash(prevHash[:])) | ||
| } | ||
| return hashOnions | ||
| } | ||
|
|
||
| // This function determines the block randao reveal assuming there are no skipped slots, | ||
| // given a list of randao hash onions such as [pre-image, 0x01, 0x02, 0x03], for the | ||
| // 0th epoch, the block randao reveal will be 0x02 and the proposer commitment 0x03. | ||
| // The next epoch, the block randao reveal will be 0x01 and the commitment 0x02, | ||
| // so on and so forth until all randao layers are peeled off. | ||
| func determineSimulatedBlockRandaoReveal(layersPeeled int, hashOnions [][32]byte) [32]byte { | ||
| if layersPeeled == 0 { | ||
| return hashOnions[len(hashOnions)-2] | ||
| } | ||
| return hashOnions[len(hashOnions)-layersPeeled-2] | ||
| } | ||
|
|
||
| // Generates initial deposits for creating a beacon state in the simulated | ||
| // backend based on the yaml configuration. | ||
| func generateInitialSimulatedDeposits(randaoCommit [32]byte) ([]*pb.Deposit, error) { | ||
| genesisTime := params.BeaconConfig().GenesisTime.Unix() | ||
| deposits := make([]*pb.Deposit, params.BeaconConfig().DepositsForChainStart) | ||
| for i := 0; i < len(deposits); i++ { | ||
| depositInput := &pb.DepositInput{ | ||
| Pubkey: []byte(strconv.Itoa(i)), | ||
| RandaoCommitmentHash32: randaoCommit[:], | ||
| } | ||
| depositData, err := b.EncodeDepositData( | ||
| depositInput, | ||
| params.BeaconConfig().MaxDepositInGwei, | ||
| genesisTime, | ||
| ) | ||
| if err != nil { | ||
| return nil, fmt.Errorf("could not encode initial block deposits: %v", err) | ||
| } | ||
| deposits[i] = &pb.Deposit{DepositData: depositData} | ||
| } | ||
| return deposits, nil | ||
| } | ||
|
|
||
| // Finds the index of the next slot's proposer in the beacon state's | ||
| // validator set. | ||
| func findNextSlotProposerIndex(beaconState *pb.BeaconState) (uint32, error) { | ||
| nextSlot := beaconState.Slot + 1 | ||
| epochLength := params.BeaconConfig().EpochLength | ||
| var earliestSlot uint64 | ||
|
|
||
| // If the state slot is less than epochLength, then the earliestSlot would | ||
| // result in a negative number. Therefore we should default to | ||
| // earliestSlot = 0 in this case. | ||
| if nextSlot > epochLength { | ||
| earliestSlot = nextSlot - (nextSlot % epochLength) - epochLength | ||
| } | ||
|
|
||
| if nextSlot < earliestSlot || nextSlot >= earliestSlot+(epochLength*2) { | ||
| return 0, fmt.Errorf("slot %d out of bounds: %d <= slot < %d", | ||
| nextSlot, | ||
| earliestSlot, | ||
| earliestSlot+(epochLength*2), | ||
| ) | ||
| } | ||
| committeeArray := beaconState.ShardCommitteesAtSlots[nextSlot-earliestSlot] | ||
| firstCommittee := committeeArray.ArrayShardCommittee[0].Committee | ||
| return firstCommittee[nextSlot%uint64(len(firstCommittee))], nil | ||
| } |
Oops, something went wrong.