# Ethereum 2.0 Phase 0 -- Beacon Chain Fork Choice **Notice**: This document is a work-in-progress for researchers and implementers. ## Table of contents - [Ethereum 2.0 Phase 0 -- Beacon Chain Fork Choice](#ethereum-20-phase-0----beacon-chain-fork-choice) - [Table of contents](#table-of-contents) - [Introduction](#introduction) - [Constants](#constants) - [Time parameters](#time-parameters) - [Fork choice](#fork-choice) - [Containers](#containers) - [`Target`](#target) - [`Store`](#store) - [Helpers](#helpers) - [`get_genesis_store`](#get_genesis_store) - [`get_ancestor`](#get_ancestor) - [`get_attesting_balance_from_store`](#get_attesting_balance_from_store) - [`get_head`](#get_head) - [Handlers](#handlers) - [`on_tick`](#on_tick) - [`on_block`](#on_block) - [`on_attestation`](#on_attestation) ## Introduction This document is the beacon chain fork choice spec, part of Ethereum 2.0 Phase 0. It assumes the [beacon chain state transition function spec](./0_beacon-chain.md). ## Configuration ### Time parameters | Name | Value | Unit | Duration | | - | - | :-: | :-: | | `SECONDS_PER_SLOT` | `6` | seconds | 6 seconds | ## Fork choice The head block root associated with a `store` is defined as `get_head(store)`. At genesis let `store = get_genesis_store(genesis_state)` and update `store` by running: * `on_tick(time)` whenever `time > store.time` where `time` is the current Unix time * `on_block(block)` whenever a block `block` is received * `on_attestation(attestation)` whenever an attestation `attestation` is received *Notes*: 1) **Leap seconds**: Slots will last `SECONDS_PER_SLOT + 1` or `SECONDS_PER_SLOT - 1` seconds around leap seconds. 2) **Honest clocks**: Honest nodes are assumed to have clocks synchronized within `SECONDS_PER_SLOT` seconds of each other. 3) **Eth1 data**: The large `ETH1_FOLLOW_DISTANCE` specified in the [honest validator document](https://github.com/ethereum/eth2.0-specs/blob/dev/specs/validator/0_beacon-chain-validator.md) should ensure that `state.latest_eth1_data` of the canonical Ethereum 2.0 chain remains consistent with the canonical Ethereum 1.0 chain. If not, emergency manual intervention will be required. 4) **Manual forks**: Manual forks may arbitrarily change the fork choice rule but are expected to be enacted at epoch transitions, with the fork details reflected in `state.fork`. ### Containers #### `Target` ```python @dataclass class Target(object): epoch: Epoch root: Bytes32 ``` #### `Store` ```python @dataclass class Store(object): blocks: Dict[Bytes32, BeaconBlock] = field(default_factory=dict) states: Dict[Bytes32, BeaconState] = field(default_factory=dict) time: int = 0 latest_targets: Dict[ValidatorIndex, Target] = field(default_factory=dict) justified_root: Bytes32 = ZERO_HASH finalized_root: Bytes32 = ZERO_HASH ``` ### Helpers #### `get_genesis_store` ```python def get_genesis_store(genesis_state: BeaconState) -> Store: genesis_block = BeaconBlock(state_root=hash_tree_root(genesis_state)) root = signing_root(genesis_block) return Store(blocks={root: genesis_block}, states={root: genesis_state}, finalized_root=root, justified_root=root) ``` #### `get_ancestor` ```python def get_ancestor(store: Store, root: Bytes32, slot: Slot) -> Bytes32: block = store.blocks[root] assert block.slot >= slot return root if block.slot == slot else get_ancestor(store, block.parent_root, slot) ``` #### `get_attesting_balance_from_store` ```python def get_attesting_balance_from_store(store: Store, root: Bytes32) -> Gwei: state = store.states[store.justified_root] active_indices = get_active_validator_indices(state.validator_registry, slot_to_epoch(state.slot)) return sum( state.validator_registry[i].effective_balance for i in active_indices if get_ancestor(store, store.latest_targets[i].root, store.blocks[root].slot) == root ) ``` #### `get_head` ```python def get_head(store: Store) -> Bytes32: # Execute the LMD-GHOST fork choice head = store.justified_root while True: children = [root for root in store.blocks.keys() if store.blocks[root].parent_root == head] if len(children) == 0: return head # Sort by attesting balance with ties broken lexicographically head = max(children, key=lambda root: (get_attesting_balance_from_store(store, root), root)) ``` ### Handlers #### `on_tick` ```python def on_tick(store: Store, time: int) -> None: store.time = time ``` #### `on_block` ```python def on_block(store: Store, block: BeaconBlock) -> None: # Add new block to the store store.blocks[signing_root(block)] = block # Check block is a descendant of the finalized block assert get_ancestor(store, signing_root(block), store.blocks[store.finalized_root].slot) == store.finalized_root # Check block slot against Unix time pre_state = deepcopy(store.states[block.parent_root]) assert store.time >= pre_state.genesis_time + block.slot * SECONDS_PER_SLOT # Check the block is valid and compute the post-state state = state_transition(pre_state, block) # Add new state to the store store.states[signing_root(block)] = state # Update justified and finalized blocks if state.finalized_epoch > slot_to_epoch(store.blocks[store.finalized_root].slot): store.finalized_root = state.finalized_root if state.current_justified_epoch > slot_to_epoch(store.blocks[store.justified_root].slot): store.justified_root = state.current_justified_root elif state.previous_justified_epoch > slot_to_epoch(store.blocks[store.justified_root].slot): store.justified_root = state.previous_justified_root ``` #### `on_attestation` ```python def on_attestation(store: Store, attestation: Attestation) -> None: state = store.states[get_head(store)] indexed_attestation = convert_to_indexed(state, attestation) validate_indexed_attestation(state, indexed_attestation) for i in indexed_attestation.custody_bit_0_indices + indexed_attestation.custody_bit_1_indices: if i not in store.latest_targets or attestation.data.target_epoch > store.latest_targets[i].epoch: store.latest_targets[i] = Target( epoch=attestation.data.target_epoch, root=attestation.data.target_root, ) ```