114 lines
3.6 KiB
Nim
114 lines
3.6 KiB
Nim
# beacon_chain
|
|
# Copyright (c) 2018 Status Research & Development GmbH
|
|
# Licensed and distributed under either of
|
|
# * MIT license (license terms in the root directory or at http://opensource.org/licenses/MIT).
|
|
# * Apache v2 license (license terms in the root directory or at http://www.apache.org/licenses/LICENSE-2.0).
|
|
# at your option. This file may not be copied, modified, or distributed except according to those terms.
|
|
|
|
import
|
|
options, sequtils, unittest,
|
|
./testutil,
|
|
../beacon_chain/spec/[beaconstate, crypto, datatypes, digest, helpers, validator],
|
|
../beacon_chain/[extras, state_transition, ssz]
|
|
|
|
suite "Block processing":
|
|
## For now just test that we can compile and execute block processing with
|
|
## mock data.
|
|
|
|
let
|
|
# Genesis state with minimal number of deposits
|
|
# TODO bls verification is a bit of a bottleneck here
|
|
genesisState = get_genesis_beacon_state(
|
|
makeInitialDeposits(), 0, Eth1Data(), {})
|
|
genesisBlock = get_initial_beacon_block(genesisState)
|
|
|
|
test "Passes from genesis state, no block":
|
|
var
|
|
state = genesisState
|
|
previous_block_root = hash_tree_root(genesisBlock)
|
|
|
|
advanceState(state, previous_block_root)
|
|
check:
|
|
state.slot == genesisState.slot + 1
|
|
|
|
test "Passes from genesis state, empty block":
|
|
var
|
|
state = genesisState
|
|
previous_block_root = hash_tree_root(genesisBlock)
|
|
new_block = makeBlock(state, previous_block_root, BeaconBlockBody())
|
|
|
|
let block_ok = updateState(state, previous_block_root, new_block, {})
|
|
|
|
check:
|
|
block_ok
|
|
|
|
state.slot == genesisState.slot + 1
|
|
|
|
test "Passes through epoch update, no block":
|
|
var
|
|
state = genesisState
|
|
previous_block_root = hash_tree_root(genesisBlock)
|
|
|
|
for i in 1..SLOTS_PER_EPOCH.int:
|
|
advanceState(state, previous_block_root)
|
|
|
|
check:
|
|
state.slot == genesisState.slot + SLOTS_PER_EPOCH
|
|
|
|
test "Passes through epoch update, empty block":
|
|
var
|
|
state = genesisState
|
|
previous_block_root = hash_tree_root(genesisBlock)
|
|
|
|
for i in 1..SLOTS_PER_EPOCH.int:
|
|
var new_block = makeBlock(state, previous_block_root, BeaconBlockBody())
|
|
|
|
let block_ok = updateState(
|
|
state, previous_block_root, new_block, {})
|
|
|
|
check:
|
|
block_ok
|
|
|
|
previous_block_root = hash_tree_root(new_block)
|
|
|
|
check:
|
|
state.slot == genesisState.slot + SLOTS_PER_EPOCH
|
|
|
|
test "Attestation gets processed at epoch":
|
|
var
|
|
state = genesisState
|
|
previous_block_root = hash_tree_root(genesisBlock)
|
|
|
|
# Slot 0 is a finalized slot - won't be making attestations for it..
|
|
advanceState(state, previous_block_root)
|
|
|
|
let
|
|
# Create an attestation for slot 1 signed by the only attester we have!
|
|
crosslink_committees = get_crosslink_committees_at_slot(state, state.slot)
|
|
attestation = makeAttestation(
|
|
state, previous_block_root,
|
|
crosslink_committees[0].committee[0])
|
|
|
|
# Some time needs to pass before attestations are included - this is
|
|
# to let the attestation propagate properly to interested participants
|
|
while state.slot < GENESIS_SLOT + MIN_ATTESTATION_INCLUSION_DELAY + 1:
|
|
advanceState(state, previous_block_root)
|
|
|
|
let
|
|
new_block = makeBlock(state, previous_block_root, BeaconBlockBody(
|
|
attestations: @[attestation]
|
|
))
|
|
discard updateState(state, previous_block_root, new_block, {})
|
|
|
|
check:
|
|
state.current_epoch_attestations.len == 1
|
|
|
|
while state.slot < 191:
|
|
advanceState(state, previous_block_root)
|
|
|
|
# Would need to process more epochs for the attestation to be removed from
|
|
# the state! (per above bug)
|
|
#
|
|
# check:
|
|
# state.latest_attestations.len == 0
|