2018-11-14 21:01:57 +00:00
# Ethereum 2.0 Phase 0 -- The Beacon Chain
2018-09-20 05:20:49 +00:00
2018-11-30 18:58:44 +00:00
**NOTICE**: This document is a work-in-progress for researchers and implementers. It reflects recent spec changes and takes precedence over the Python proof-of-concept implementation [[python-poc]](#ref-python-poc).
2018-09-20 05:20:49 +00:00
2018-11-28 07:23:37 +00:00
## Table of contents
2018-12-01 05:29:19 +00:00
<!-- TOC -->
- [Ethereum 2.0 Phase 0 -- The Beacon Chain ](#ethereum-20-phase-0----the-beacon-chain )
- [Table of contents ](#table-of-contents )
- [Introduction ](#introduction )
- [Notation ](#notation )
- [Terminology ](#terminology )
- [Constants ](#constants )
2018-12-04 10:57:09 +00:00
- [Misc ](#misc )
- [Deposit contract ](#deposit-contract )
2019-02-06 16:34:19 +00:00
- [Gwei values ](#gwei-values )
2018-12-04 10:57:09 +00:00
- [Initial values ](#initial-values )
- [Time parameters ](#time-parameters )
2019-01-28 00:25:29 +00:00
- [State list lengths ](#state-list-lengths )
2018-12-04 10:57:09 +00:00
- [Reward and penalty quotients ](#reward-and-penalty-quotients )
2019-02-12 12:24:19 +00:00
- [Max transactions per block ](#max-transactions-per-block )
2018-12-04 10:57:09 +00:00
- [Signature domains ](#signature-domains )
2018-12-01 05:29:19 +00:00
- [Data structures ](#data-structures )
2019-03-07 18:02:13 +00:00
- [Misc dependencies ](#misc-dependencies )
2019-01-17 11:18:30 +00:00
- [`Fork` ](#fork )
2019-03-07 18:02:13 +00:00
- [`Crosslink` ](#crosslink )
2019-01-17 11:43:47 +00:00
- [`Eth1Data` ](#eth1data )
- [`Eth1DataVote` ](#eth1datavote )
2019-03-07 18:02:13 +00:00
- [`AttestationData` ](#attestationdata )
- [`AttestationDataAndCustodyBit` ](#attestationdataandcustodybit )
- [`SlashableAttestation` ](#slashableattestation )
- [`DepositInput` ](#depositinput )
- [`DepositData` ](#depositdata )
- [`BeaconBlockHeader` ](#beaconblockheader )
- [`Validator` ](#validator )
- [`PendingAttestation` ](#pendingattestation )
2019-03-08 17:13:05 +00:00
- [`HistoricalBatch` ](#historicalbatch )
2019-03-07 18:02:13 +00:00
- [Beacon transactions ](#beacon-transactions )
- [`ProposerSlashing` ](#proposerslashing )
- [`AttesterSlashing` ](#attesterslashing )
- [`Attestation` ](#attestation )
- [`Deposit` ](#deposit )
- [`VoluntaryExit` ](#voluntaryexit )
- [`Transfer` ](#transfer )
- [Beacon blocks ](#beacon-blocks )
- [`BeaconBlockBody` ](#beaconblockbody )
- [`BeaconBlock` ](#beaconblock )
- [Beacon state ](#beacon-state )
- [`BeaconState` ](#beaconstate )
2019-01-19 07:58:24 +00:00
- [Custom Types ](#custom-types )
2019-01-28 19:15:43 +00:00
- [Helper functions ](#helper-functions )
2019-03-04 22:49:21 +00:00
- [`xor` ](#xor )
2019-01-28 19:15:43 +00:00
- [`hash` ](#hash )
- [`hash_tree_root` ](#hash_tree_root )
2019-02-26 09:07:10 +00:00
- [`signed_root` ](#signed_root )
2019-03-03 11:04:28 +00:00
- [`get_temporary_block_header` ](#get_temporary_block_header )
2019-01-28 19:15:43 +00:00
- [`slot_to_epoch` ](#slot_to_epoch )
2019-02-03 09:36:21 +00:00
- [`get_previous_epoch` ](#get_previous_epoch )
2019-01-28 19:15:43 +00:00
- [`get_current_epoch` ](#get_current_epoch )
- [`get_epoch_start_slot` ](#get_epoch_start_slot )
- [`is_active_validator` ](#is_active_validator )
- [`get_active_validator_indices` ](#get_active_validator_indices )
2019-02-07 21:08:25 +00:00
- [`get_permuted_index` ](#get_permuted_index )
2019-03-19 17:24:36 +00:00
- [`get_split_offset` ](#get_split_offset )
2019-01-28 19:15:43 +00:00
- [`get_epoch_committee_count` ](#get_epoch_committee_count )
2019-03-15 01:28:44 +00:00
- [`compute_committee` ](#compute_committee )
2019-01-28 19:15:43 +00:00
- [`get_previous_epoch_committee_count` ](#get_previous_epoch_committee_count )
- [`get_current_epoch_committee_count` ](#get_current_epoch_committee_count )
2019-01-30 15:38:24 +00:00
- [`get_next_epoch_committee_count` ](#get_next_epoch_committee_count )
2019-01-28 19:15:43 +00:00
- [`get_crosslink_committees_at_slot` ](#get_crosslink_committees_at_slot )
- [`get_block_root` ](#get_block_root )
2019-03-04 18:45:41 +00:00
- [`get_state_root` ](#get_state_root )
2019-01-28 19:15:43 +00:00
- [`get_randao_mix` ](#get_randao_mix )
- [`get_active_index_root` ](#get_active_index_root )
- [`generate_seed` ](#generate_seed )
- [`get_beacon_proposer_index` ](#get_beacon_proposer_index )
2019-03-01 03:07:10 +00:00
- [`verify_merkle_branch` ](#verify_merkle_branch )
2019-01-28 19:15:43 +00:00
- [`get_attestation_participants` ](#get_attestation_participants )
2019-01-30 15:07:41 +00:00
- [`is_power_of_two` ](#is_power_of_two )
2019-01-28 19:15:43 +00:00
- [`int_to_bytes1`, `int_to_bytes2`, ... ](#int_to_bytes1-int_to_bytes2- )
2019-02-07 21:12:58 +00:00
- [`bytes_to_int` ](#bytes_to_int )
2019-01-28 19:15:43 +00:00
- [`get_effective_balance` ](#get_effective_balance )
2019-02-03 10:43:33 +00:00
- [`get_total_balance` ](#get_total_balance )
2019-01-28 19:15:43 +00:00
- [`get_fork_version` ](#get_fork_version )
- [`get_domain` ](#get_domain )
2019-01-28 20:33:50 +00:00
- [`get_bitfield_bit` ](#get_bitfield_bit )
- [`verify_bitfield` ](#verify_bitfield )
2019-01-30 13:38:45 +00:00
- [`verify_slashable_attestation` ](#verify_slashable_attestation )
2019-01-28 19:15:43 +00:00
- [`is_double_vote` ](#is_double_vote )
- [`is_surround_vote` ](#is_surround_vote )
- [`integer_squareroot` ](#integer_squareroot )
2019-02-20 07:45:19 +00:00
- [`get_delayed_activation_exit_epoch` ](#get_delayed_activation_exit_epoch )
2019-01-28 19:15:43 +00:00
- [`bls_verify` ](#bls_verify )
- [`bls_verify_multiple` ](#bls_verify_multiple )
- [`bls_aggregate_pubkeys` ](#bls_aggregate_pubkeys )
- [`process_deposit` ](#process_deposit )
2019-01-29 04:32:36 +00:00
- [Routines for updating validator status ](#routines-for-updating-validator-status )
2019-01-28 19:15:43 +00:00
- [`activate_validator` ](#activate_validator )
- [`initiate_validator_exit` ](#initiate_validator_exit )
- [`exit_validator` ](#exit_validator )
2019-02-12 12:24:19 +00:00
- [`slash_validator` ](#slash_validator )
2019-01-28 19:15:43 +00:00
- [`prepare_validator_for_withdrawal` ](#prepare_validator_for_withdrawal )
2018-12-04 10:57:09 +00:00
- [Ethereum 1.0 deposit contract ](#ethereum-10-deposit-contract )
2018-12-04 11:47:41 +00:00
- [Deposit arguments ](#deposit-arguments )
2019-01-02 13:18:35 +00:00
- [Withdrawal credentials ](#withdrawal-credentials )
2019-01-02 15:44:12 +00:00
- [`Deposit` logs ](#deposit-logs )
2019-02-12 12:24:19 +00:00
- [`Eth2Genesis` log ](#eth2genesis-log )
2018-12-04 11:47:41 +00:00
- [Vyper code ](#vyper-code )
2019-02-12 12:24:19 +00:00
- [On genesis ](#on-genesis )
2018-12-01 05:29:19 +00:00
- [Beacon chain processing ](#beacon-chain-processing )
- [Beacon chain fork choice rule ](#beacon-chain-fork-choice-rule )
- [Beacon chain state transition function ](#beacon-chain-state-transition-function )
2019-03-08 16:48:46 +00:00
- [State caching ](#state-caching )
2019-01-29 13:17:05 +00:00
- [Per-epoch processing ](#per-epoch-processing )
2019-03-02 06:40:43 +00:00
- [Helper functions ](#helper-functions-1 )
2019-01-29 13:17:05 +00:00
- [Justification ](#justification )
- [Crosslinks ](#crosslinks )
2019-03-02 06:40:43 +00:00
- [Eth1 data ](#eth1-data-1 )
2019-01-29 13:17:05 +00:00
- [Rewards and penalties ](#rewards-and-penalties )
- [Justification and finalization ](#justification-and-finalization )
- [Crosslinks ](#crosslinks-1 )
2019-03-07 18:02:13 +00:00
- [Apply rewards ](#apply-rewards )
2019-01-29 13:17:05 +00:00
- [Ejections ](#ejections )
- [Validator registry and shuffling seed data ](#validator-registry-and-shuffling-seed-data )
2019-03-02 01:49:28 +00:00
- [Slashings and exit queue ](#slashings-and-exit-queue )
2019-01-29 13:17:05 +00:00
- [Final updates ](#final-updates )
2019-03-07 19:05:34 +00:00
- [Per-slot processing ](#per-slot-processing )
- [Per-block processing ](#per-block-processing )
- [Block header ](#block-header )
- [RANDAO ](#randao )
- [Eth1 data ](#eth1-data )
- [Transactions ](#transactions )
2019-03-08 17:34:51 +00:00
- [Proposer slashings ](#proposer-slashings )
- [Attester slashings ](#attester-slashings )
- [Attestations ](#attestations )
- [Deposits ](#deposits )
- [Voluntary exits ](#voluntary-exits )
- [Transfers ](#transfers )
2019-03-07 19:05:34 +00:00
- [State root verification ](#state-root-verification )
2018-12-01 05:29:19 +00:00
- [References ](#references )
- [Normative ](#normative )
- [Informative ](#informative )
- [Copyright ](#copyright )
<!-- /TOC -->
2018-11-28 07:23:37 +00:00
## Introduction
2018-09-20 05:20:49 +00:00
2018-11-14 21:01:57 +00:00
This document represents the specification for Phase 0 of Ethereum 2.0 -- The Beacon Chain.
2019-01-02 13:18:35 +00:00
At the core of Ethereum 2.0 is a system chain called the "beacon chain". The beacon chain stores and manages the registry of [validators ](#dfn-validator ). In the initial deployment phases of Ethereum 2.0 the only mechanism to become a [validator ](#dfn-validator ) is to make a one-way ETH transaction to a deposit contract on Ethereum 1.0. Activation as a [validator ](#dfn-validator ) happens when Ethereum 1.0 deposit receipts are processed by the beacon chain, the activation balance is reached, and after a queuing process. Exit is either voluntary or done forcibly as a penalty for misbehavior.
2018-09-20 05:20:49 +00:00
2019-01-18 21:37:30 +00:00
The primary source of load on the beacon chain is "attestations". Attestations are availability votes for a shard block, and simultaneously proof of stake votes for a beacon block. A sufficient number of attestations for the same shard block create a "crosslink", confirming the shard segment up to that shard block into the beacon chain. Crosslinks also serve as infrastructure for asynchronous cross-shard communication.
2018-09-20 05:20:49 +00:00
2018-11-29 01:56:25 +00:00
## Notation
2019-02-11 21:30:36 +00:00
Code snippets appearing in `this style` are to be interpreted as Python code.
2018-11-28 07:23:37 +00:00
## Terminology
2018-09-20 05:20:49 +00:00
2019-01-28 19:16:11 +00:00
* **Validator** < a id = "dfn-validator" ></ a > - a registered participant in the beacon chain. You can become one by sending Ether into the Ethereum 1.0 deposit contract.
* **Active validator** < a id = "dfn-active-validator" ></ a > - an active participant in the Ethereum 2.0 consensus invited to, among other things, propose and attest to blocks and vote for crosslinks.
2018-11-30 18:14:17 +00:00
* **Committee** - a (pseudo-) randomly sampled subset of [active validators ](#dfn-active-validator ). When a committee is referred to collectively, as in "this committee attests to X", this is assumed to mean "some subset of that committee that contains enough [validators ](#dfn-validator ) that the protocol recognizes it as representing the committee".
2018-11-30 17:31:09 +00:00
* **Proposer** - the [validator ](#dfn-validator ) that creates a beacon chain block
* **Attester** - a [validator ](#dfn-validator ) that is part of a committee that needs to sign off on a beacon chain block while simultaneously creating a link (crosslink) to a recent shard block on a particular shard chain.
2018-09-20 05:20:49 +00:00
* **Beacon chain** - the central PoS chain that is the base of the sharding system.
2018-10-02 02:21:15 +00:00
* **Shard chain** - one of the chains on which user transactions take place and account data is stored.
2018-12-14 04:01:32 +00:00
* **Block root** - a 32-byte Merkle root of a beacon chain block or shard chain block. Previously called "block hash".
2018-09-20 05:20:49 +00:00
* **Crosslink** - a set of signatures from a committee attesting to a block in a shard chain, which can be included into the beacon chain. Crosslinks are the main means by which the beacon chain "learns about" the updated state of shard chains.
2019-02-11 13:29:54 +00:00
* **Slot** - a period during which one proposer has the ability to create a beacon chain block and some attesters have the ability to make attestations
2018-11-30 17:31:09 +00:00
* **Epoch** - an aligned span of slots during which all [validators ](#dfn-validator ) get exactly one chance to make an attestation
2018-12-17 20:15:37 +00:00
* **Finalized**, **justified** - see Casper FFG finalization [[casper-ffg]](#ref-casper-ffg)
2018-11-30 17:31:09 +00:00
* **Withdrawal period** - the number of slots between a [validator ](#dfn-validator ) exit and the [validator ](#dfn-validator ) balance being withdrawable
2018-10-03 07:27:39 +00:00
* **Genesis time** - the Unix time of the genesis beacon chain block at slot 0
2018-09-20 05:20:49 +00:00
2018-11-28 07:23:37 +00:00
## Constants
2018-09-20 05:20:49 +00:00
2018-12-04 10:57:09 +00:00
### Misc
2019-02-12 13:37:30 +00:00
| Name | Value |
2019-02-16 09:11:29 +00:00
| - | - |
2019-02-12 13:37:30 +00:00
| `SHARD_COUNT` | `2**10` (= 1,024) |
| `TARGET_COMMITTEE_SIZE` | `2**7` (= 128) |
| `MAX_BALANCE_CHURN_QUOTIENT` | `2**5` (= 32) |
| `MAX_INDICES_PER_SLASHABLE_VOTE` | `2**12` (= 4,096) |
| `MAX_EXIT_DEQUEUES_PER_EPOCH` | `2**2` (= 4) |
| `SHUFFLE_ROUND_COUNT` | 90 |
2018-11-30 14:28:33 +00:00
2019-03-16 12:46:45 +00:00
* For the safety of crosslinks `TARGET_COMMITTEE_SIZE` exceeds [the recommended minimum committee size of 111 ](https://vitalik.ca/files/Ithaca201807_Sharding.pdf ); with sufficient active validators (at least `SLOTS_PER_EPOCH * TARGET_COMMITTEE_SIZE` ), the shuffling algorithm ensures committee sizes of at least `TARGET_COMMITTEE_SIZE` . (Unbiasable randomness with a Verifiable Delay Function (VDF) will improve committee robustness and lower the safe minimum committee size.)
2018-12-04 10:57:09 +00:00
### Deposit contract
2019-02-06 16:34:19 +00:00
| Name | Value |
| - | - |
| `DEPOSIT_CONTRACT_ADDRESS` | **TBD** |
| `DEPOSIT_CONTRACT_TREE_DEPTH` | `2**5` (= 32) |
### Gwei values
2018-12-04 10:57:09 +00:00
| Name | Value | Unit |
| - | - | :-: |
2019-03-05 09:30:42 +00:00
| `MIN_DEPOSIT_AMOUNT` | `2**0 * 10**9` (= 1,000,000,000) | Gwei |
| `MAX_DEPOSIT_AMOUNT` | `2**5 * 10**9` (= 32,000,000,000) | Gwei |
| `FORK_CHOICE_BALANCE_INCREMENT` | `2**0 * 10**9` (= 1,000,000,000) | Gwei |
| `EJECTION_BALANCE` | `2**4 * 10**9` (= 16,000,000,000) | Gwei |
2018-12-04 10:57:09 +00:00
### Initial values
| Name | Value |
| - | - |
2019-03-17 11:33:42 +00:00
| `GENESIS_FORK_VERSION` | `int_to_bytes4(0)` |
2019-02-19 21:08:10 +00:00
| `GENESIS_SLOT` | `2**32` |
2019-01-26 22:27:50 +00:00
| `GENESIS_EPOCH` | `slot_to_epoch(GENESIS_SLOT)` |
2019-01-02 14:20:01 +00:00
| `GENESIS_START_SHARD` | `0` |
2019-01-26 00:33:15 +00:00
| `FAR_FUTURE_EPOCH` | `2**64 - 1` |
2019-01-17 08:30:04 +00:00
| `ZERO_HASH` | `int_to_bytes32(0)` |
2019-01-17 19:19:38 +00:00
| `EMPTY_SIGNATURE` | `int_to_bytes96(0)` |
2019-01-17 08:30:04 +00:00
| `BLS_WITHDRAWAL_PREFIX_BYTE` | `int_to_bytes1(0)` |
2018-12-04 10:57:09 +00:00
2019-02-12 22:38:29 +00:00
* `GENESIS_SLOT` should be at least as large in terms of time as the largest of the time parameters or state list lengths below (ie. it should be at least as large as any value measured in slots, and at least `SLOTS_PER_EPOCH` times as large as any value measured in epochs).
2019-01-28 05:12:37 +00:00
2018-12-04 10:57:09 +00:00
### Time parameters
2018-11-30 14:28:33 +00:00
| Name | Value | Unit | Duration |
| - | - | :-: | :-: |
2019-02-12 22:38:29 +00:00
| `SECONDS_PER_SLOT` | `6` | seconds | 6 seconds |
2018-11-30 14:28:33 +00:00
| `MIN_ATTESTATION_INCLUSION_DELAY` | `2**2` (= 4) | slots | 24 seconds |
2019-02-12 22:38:29 +00:00
| `SLOTS_PER_EPOCH` | `2**6` (= 64) | slots | 6.4 minutes |
2019-01-31 02:22:25 +00:00
| `MIN_SEED_LOOKAHEAD` | `2**0` (= 1) | epochs | 6.4 minutes |
2019-01-31 15:56:48 +00:00
| `ACTIVATION_EXIT_DELAY` | `2**2` (= 4) | epochs | 25.6 minutes |
2019-02-12 22:38:29 +00:00
| `EPOCHS_PER_ETH1_VOTING_PERIOD` | `2**4` (= 16) | epochs | ~1.7 hours |
2019-03-08 22:16:06 +00:00
| `SLOTS_PER_HISTORICAL_ROOT` | `2**13` (= 8,192) | slots | ~13 hours |
2019-02-20 15:58:25 +00:00
| `MIN_VALIDATOR_WITHDRAWABILITY_DELAY` | `2**8` (= 256) | epochs | ~27 hours |
2019-03-08 22:16:06 +00:00
| `PERSISTENT_COMMITTEE_PERIOD` | `2**11` (= 2,048) | epochs | 9 days |
2018-11-30 14:28:33 +00:00
2019-01-28 00:25:29 +00:00
### State list lengths
2019-01-28 05:12:37 +00:00
| Name | Value | Unit | Duration |
| - | - | :-: | :-: |
| `LATEST_RANDAO_MIXES_LENGTH` | `2**13` (= 8,192) | epochs | ~36 days |
2019-01-31 15:56:48 +00:00
| `LATEST_ACTIVE_INDEX_ROOTS_LENGTH` | `2**13` (= 8,192) | epochs | ~36 days |
2019-01-31 02:22:25 +00:00
| `LATEST_SLASHED_EXIT_LENGTH` | `2**13` (= 8,192) | epochs | ~36 days |
2018-11-30 14:28:33 +00:00
2018-12-04 10:57:09 +00:00
### Reward and penalty quotients
2018-10-03 07:27:39 +00:00
2018-11-30 14:28:33 +00:00
| Name | Value |
| - | - |
2019-01-17 10:55:05 +00:00
| `BASE_REWARD_QUOTIENT` | `2**5` (= 32) |
2018-11-30 14:28:33 +00:00
| `WHISTLEBLOWER_REWARD_QUOTIENT` | `2**9` (= 512) |
2019-02-12 12:24:19 +00:00
| `ATTESTATION_INCLUSION_REWARD_QUOTIENT` | `2**3` (= 8) |
2018-12-21 22:12:38 +00:00
| `INACTIVITY_PENALTY_QUOTIENT` | `2**24` (= 16,777,216) |
2019-02-14 14:00:12 +00:00
| `MIN_PENALTY_QUOTIENT` | `2**5` (= 32) |
2018-10-03 07:27:39 +00:00
2018-12-09 13:08:11 +00:00
* The `BASE_REWARD_QUOTIENT` parameter dictates the per-epoch reward. It corresponds to ~2.54% annual interest assuming 10 million participating ETH in every epoch.
2018-12-21 14:07:04 +00:00
* The `INACTIVITY_PENALTY_QUOTIENT` equals `INVERSE_SQRT_E_DROP_TIME**2` where `INVERSE_SQRT_E_DROP_TIME := 2**12 epochs` (~18 days) is the time it takes the inactivity penalty to reduce the balance of non-participating [validators ](#dfn-validator ) to about `1/sqrt(e) ~= 60.6%` . Indeed, the balance retained by offline [validators ](#dfn-validator ) after `n` epochs is about `(1-1/INACTIVITY_PENALTY_QUOTIENT)**(n**2/2)` so after `INVERSE_SQRT_E_DROP_TIME` epochs it is roughly `(1-1/INACTIVITY_PENALTY_QUOTIENT)**(INACTIVITY_PENALTY_QUOTIENT/2) ~= 1/sqrt(e)` .
2018-12-04 10:57:09 +00:00
2018-10-04 13:16:31 +00:00
2019-02-12 12:24:19 +00:00
### Max transactions per block
2018-10-04 13:16:31 +00:00
2018-12-07 01:02:23 +00:00
| Name | Value |
2018-12-07 01:07:26 +00:00
| - | - |
2018-12-07 01:02:23 +00:00
| `MAX_PROPOSER_SLASHINGS` | `2**4` (= 16) |
2019-01-28 20:33:50 +00:00
| `MAX_ATTESTER_SLASHINGS` | `2**0` (= 1) |
2018-12-07 01:02:23 +00:00
| `MAX_ATTESTATIONS` | `2**7` (= 128) |
| `MAX_DEPOSITS` | `2**4` (= 16) |
2019-02-12 12:24:19 +00:00
| `MAX_VOLUNTARY_EXITS` | `2**4` (= 16) |
2019-02-12 22:41:38 +00:00
| `MAX_TRANSFERS` | `2**4` (= 16) |
2018-10-04 13:16:31 +00:00
2018-12-04 10:57:09 +00:00
### Signature domains
2018-11-20 01:13:58 +00:00
2018-12-10 19:55:11 +00:00
| Name | Value |
2018-11-30 14:28:33 +00:00
| - | - |
2019-03-03 11:04:28 +00:00
| `DOMAIN_BEACON_BLOCK` | `0` |
| `DOMAIN_RANDAO` | `1` |
| `DOMAIN_ATTESTATION` | `2` |
| `DOMAIN_DEPOSIT` | `3` |
| `DOMAIN_VOLUNTARY_EXIT` | `4` |
2019-03-04 02:14:03 +00:00
| `DOMAIN_TRANSFER` | `5` |
2018-11-30 14:28:33 +00:00
2018-10-04 10:09:39 +00:00
## Data structures
2018-11-30 14:28:33 +00:00
2019-01-19 08:06:00 +00:00
The following data structures are defined as [SimpleSerialize (SSZ) ](https://github.com/ethereum/eth2.0-specs/blob/master/specs/simple-serialize.md ) objects.
2019-01-19 07:58:24 +00:00
2019-03-07 18:02:13 +00:00
The types are defined topologically to aid in facilitating an executable version of the spec.
2018-11-30 14:28:33 +00:00
2019-03-07 18:02:13 +00:00
### Misc dependencies
2018-11-30 14:28:33 +00:00
2019-03-07 18:02:13 +00:00
#### `Fork`
2018-11-30 14:28:33 +00:00
```python
{
2019-03-07 18:02:13 +00:00
# Previous fork version
2019-03-08 08:57:09 +00:00
'previous_version': 'bytes4',
2019-03-07 18:02:13 +00:00
# Current fork version
2019-03-08 08:57:09 +00:00
'current_version': 'bytes4',
2019-03-07 18:02:13 +00:00
# Fork epoch number
'epoch': 'uint64',
2018-11-30 14:28:33 +00:00
}
```
2019-03-07 18:02:13 +00:00
#### `Crosslink`
2018-09-20 05:20:49 +00:00
```python
2018-10-04 10:09:39 +00:00
{
2019-03-07 18:02:13 +00:00
# Epoch number
'epoch': 'uint64',
# Shard data since the previous crosslink
'crosslink_data_root': 'bytes32',
2018-12-06 23:51:01 +00:00
}
```
2019-03-07 18:02:13 +00:00
#### `Eth1Data`
2018-12-06 23:51:01 +00:00
```python
{
2019-03-07 18:02:13 +00:00
# Root of the deposit tree
'deposit_root': 'bytes32',
# Block hash
'block_hash': 'bytes32',
2018-12-06 23:51:01 +00:00
}
```
2019-03-07 18:02:13 +00:00
#### `Eth1DataVote`
2018-10-02 02:21:15 +00:00
```python
2018-10-04 10:09:39 +00:00
{
2019-03-07 18:02:13 +00:00
# Data being voted for
'eth1_data': Eth1Data,
# Vote count
'vote_count': 'uint64',
2018-10-02 02:21:15 +00:00
}
```
2019-03-07 18:02:13 +00:00
#### `AttestationData`
2018-11-20 07:40:04 +00:00
2018-10-02 02:21:15 +00:00
```python
2018-10-04 10:09:39 +00:00
{
2019-03-12 10:17:34 +00:00
# LMD GHOST vote
2018-10-16 11:55:03 +00:00
'slot': 'uint64',
2019-01-17 08:33:59 +00:00
'beacon_block_root': 'bytes32',
2019-03-12 10:17:34 +00:00
# FFG vote
'source_epoch': 'uint64',
'source_root': 'bytes32',
'target_root': 'bytes32',
# Crosslink vote
'shard': 'uint64',
'previous_crosslink': Crosslink,
2019-02-22 06:21:56 +00:00
'crosslink_data_root': 'bytes32',
2018-10-02 02:21:15 +00:00
}
```
2019-03-07 18:02:13 +00:00
#### `AttestationDataAndCustodyBit`
2018-12-23 10:48:11 +00:00
```python
{
# Attestation data
2019-01-23 09:57:48 +00:00
'data': AttestationData,
2019-01-02 13:35:57 +00:00
# Custody bit
2019-01-28 18:31:13 +00:00
'custody_bit': 'bool',
2018-12-23 10:48:11 +00:00
}
```
2019-03-07 18:02:13 +00:00
#### `SlashableAttestation`
2018-12-07 01:02:23 +00:00
2019-03-07 18:02:13 +00:00
```python
{
# Validator indices
'validator_indices': ['uint64'],
# Attestation data
'data': AttestationData,
# Custody bitfield
'custody_bitfield': 'bytes',
# Aggregate signature
'aggregate_signature': 'bytes96',
}
```
#### `DepositInput`
2018-11-20 07:40:04 +00:00
```python
{
2019-03-07 18:02:13 +00:00
# BLS pubkey
'pubkey': 'bytes48',
# Withdrawal credentials
'withdrawal_credentials': 'bytes32',
# A BLS signature of this `DepositInput`
'proof_of_possession': 'bytes96',
2018-12-07 01:02:23 +00:00
}
```
2019-03-07 18:02:13 +00:00
#### `DepositData`
2018-12-13 15:36:57 +00:00
```python
{
2018-12-31 15:14:14 +00:00
# Amount in Gwei
'amount': 'uint64',
2018-12-13 15:36:57 +00:00
# Timestamp from deposit contract
'timestamp': 'uint64',
2019-01-09 20:35:26 +00:00
# Deposit input
'deposit_input': DepositInput,
2018-12-13 15:36:57 +00:00
}
```
2019-03-07 18:02:13 +00:00
#### `BeaconBlockHeader`
2018-12-07 01:13:19 +00:00
```python
{
2019-03-07 18:02:13 +00:00
'slot': 'uint64',
'previous_block_root': 'bytes32',
'state_root': 'bytes32',
'block_body_root': 'bytes32',
'signature': 'bytes96',
}
```
#### `Validator`
```python
{
# BLS public key
2019-01-17 08:51:50 +00:00
'pubkey': 'bytes48',
2018-12-07 01:13:19 +00:00
# Withdrawal credentials
2019-01-17 08:33:59 +00:00
'withdrawal_credentials': 'bytes32',
2019-03-07 18:02:13 +00:00
# Epoch when validator activated
'activation_epoch': 'uint64',
# Epoch when validator exited
'exit_epoch': 'uint64',
# Epoch when validator is eligible to withdraw
'withdrawable_epoch': 'uint64',
# Did the validator initiate an exit
'initiated_exit': 'bool',
# Was the validator slashed
'slashed': 'bool',
}
```
#### `PendingAttestation`
```python
{
# Attester aggregation bitfield
'aggregation_bitfield': 'bytes',
# Attestation data
'data': AttestationData,
# Custody bitfield
'custody_bitfield': 'bytes',
# Inclusion slot
'inclusion_slot': 'uint64',
}
```
2019-03-08 17:13:05 +00:00
#### `HistoricalBatch`
```python
{
2019-03-08 17:14:00 +00:00
# Block roots
2019-03-08 17:13:05 +00:00
'block_roots': ['bytes32', SLOTS_PER_HISTORICAL_ROOT],
2019-03-08 17:14:00 +00:00
# State roots
2019-03-08 17:13:05 +00:00
'state_roots': ['bytes32', SLOTS_PER_HISTORICAL_ROOT],
}
```
2019-03-07 18:02:13 +00:00
### Beacon transactions
#### `ProposerSlashing`
```python
{
# Proposer index
'proposer_index': 'uint64',
# First block header
'header_1': BeaconBlockHeader,
# Second block header
'header_2': BeaconBlockHeader,
}
```
#### `AttesterSlashing`
```python
{
# First slashable attestation
'slashable_attestation_1': SlashableAttestation,
# Second slashable attestation
'slashable_attestation_2': SlashableAttestation,
}
```
#### `Attestation`
```python
{
# Attester aggregation bitfield
'aggregation_bitfield': 'bytes',
# Attestation data
'data': AttestationData,
# Custody bitfield
'custody_bitfield': 'bytes',
# BLS aggregate signature
'aggregate_signature': 'bytes96',
2018-12-07 01:13:19 +00:00
}
```
2019-03-07 18:02:13 +00:00
#### `Deposit`
2018-12-07 01:13:19 +00:00
2019-03-07 18:02:13 +00:00
```python
{
# Branch in the deposit tree
'proof': ['bytes32', DEPOSIT_CONTRACT_TREE_DEPTH],
# Index in the deposit tree
'index': 'uint64',
# Data
'deposit_data': DepositData,
}
```
#### `VoluntaryExit`
2018-12-07 01:02:23 +00:00
```python
{
2019-01-26 22:27:50 +00:00
# Minimum epoch for processing exit
'epoch': 'uint64',
2018-12-07 01:02:23 +00:00
# Index of the exiting validator
2019-01-27 09:01:11 +00:00
'validator_index': 'uint64',
2018-12-07 01:02:23 +00:00
# Validator signature
2019-01-17 19:19:38 +00:00
'signature': 'bytes96',
2018-12-07 01:02:23 +00:00
}
```
2019-03-07 18:02:13 +00:00
#### `Transfer`
2019-02-12 22:41:38 +00:00
```python
{
# Sender index
2019-03-03 11:59:11 +00:00
'sender': 'uint64',
2019-02-12 22:41:38 +00:00
# Recipient index
2019-03-06 15:55:39 +00:00
'recipient': 'uint64',
2019-02-12 22:41:38 +00:00
# Amount in Gwei
'amount': 'uint64',
# Fee in Gwei for block proposer
'fee': 'uint64',
# Inclusion slot
'slot': 'uint64',
# Sender withdrawal pubkey
'pubkey': 'bytes48',
# Sender signature
'signature': 'bytes96',
}
```
2019-03-07 18:02:13 +00:00
### Beacon blocks
2018-12-07 01:02:23 +00:00
2019-03-07 18:02:13 +00:00
#### `BeaconBlockBody`
2018-11-20 07:40:04 +00:00
```python
{
2019-03-07 18:02:13 +00:00
'randao_reveal': 'bytes96',
'eth1_data': Eth1Data,
'proposer_slashings': [ProposerSlashing],
'attester_slashings': [AttesterSlashing],
'attestations': [Attestation],
'deposits': [Deposit],
'voluntary_exits': [VoluntaryExit],
'transfers': [Transfer],
2019-03-03 11:04:28 +00:00
}
```
2019-03-07 18:02:13 +00:00
#### `BeaconBlock`
2019-03-03 11:04:28 +00:00
```python
{
2019-03-07 18:02:13 +00:00
# Header
2019-03-03 11:04:28 +00:00
'slot': 'uint64',
'previous_block_root': 'bytes32',
'state_root': 'bytes32',
2019-03-07 18:02:13 +00:00
'body': BeaconBlockBody,
2019-02-15 00:23:03 +00:00
'signature': 'bytes96',
2018-11-20 07:40:04 +00:00
}
```
2019-03-07 18:02:13 +00:00
### Beacon state
2018-09-20 05:20:49 +00:00
2018-11-30 14:28:33 +00:00
#### `BeaconState`
2018-09-20 05:20:49 +00:00
```python
2018-10-04 10:09:39 +00:00
{
2018-12-04 21:28:31 +00:00
# Misc
'slot': 'uint64',
'genesis_time': 'uint64',
2019-01-17 11:18:30 +00:00
'fork': Fork, # For versioning hard forks
2018-12-04 21:28:31 +00:00
2018-11-30 14:28:33 +00:00
# Validator registry
2019-01-17 11:01:13 +00:00
'validator_registry': [Validator],
2018-12-14 00:28:59 +00:00
'validator_balances': ['uint64'],
2019-01-26 00:33:15 +00:00
'validator_registry_update_epoch': 'uint64',
2018-11-30 14:28:33 +00:00
# Randomness and committees
2019-03-06 13:46:52 +00:00
'latest_randao_mixes': ['bytes32', LATEST_RANDAO_MIXES_LENGTH],
2019-01-31 16:02:54 +00:00
'previous_shuffling_start_shard': 'uint64',
'current_shuffling_start_shard': 'uint64',
'previous_shuffling_epoch': 'uint64',
'current_shuffling_epoch': 'uint64',
'previous_shuffling_seed': 'bytes32',
'current_shuffling_seed': 'bytes32',
2018-12-20 21:01:00 +00:00
2018-11-30 14:28:33 +00:00
# Finality
2019-03-03 10:28:13 +00:00
'previous_epoch_attestations': [PendingAttestation],
'current_epoch_attestations': [PendingAttestation],
2019-01-26 15:16:32 +00:00
'previous_justified_epoch': 'uint64',
2019-03-12 10:17:34 +00:00
'current_justified_epoch': 'uint64',
2019-03-11 20:38:10 +00:00
'previous_justified_root': 'bytes32',
2019-03-12 10:17:34 +00:00
'current_justified_root': 'bytes32',
2018-12-04 10:57:09 +00:00
'justification_bitfield': 'uint64',
2019-01-26 15:16:32 +00:00
'finalized_epoch': 'uint64',
2019-03-12 10:26:34 +00:00
'finalized_root': 'bytes32',
2018-11-30 14:28:33 +00:00
# Recent state
2019-03-06 13:46:52 +00:00
'latest_crosslinks': [Crosslink, SHARD_COUNT],
'latest_block_roots': ['bytes32', SLOTS_PER_HISTORICAL_ROOT],
2019-03-07 15:56:29 +00:00
'latest_state_roots': ['bytes32', SLOTS_PER_HISTORICAL_ROOT],
2019-03-06 13:46:52 +00:00
'latest_active_index_roots': ['bytes32', LATEST_ACTIVE_INDEX_ROOTS_LENGTH],
'latest_slashed_balances': ['uint64', LATEST_SLASHED_EXIT_LENGTH], # Balances slashed at every withdrawal period
2019-03-03 11:04:28 +00:00
'latest_block_header': BeaconBlockHeader, # `latest_block_header.state_root == ZERO_HASH` temporarily
2019-03-07 16:44:55 +00:00
'historical_roots': ['bytes32'],
2018-11-30 14:28:33 +00:00
2019-01-17 11:43:47 +00:00
# Ethereum 1.0 chain data
'latest_eth1_data': Eth1Data,
'eth1_data_votes': [Eth1DataVote],
2019-03-16 04:16:47 +00:00
'deposit_index': 'uint64',
2018-09-20 05:20:49 +00:00
}
```
2019-01-19 07:58:24 +00:00
## Custom Types
2019-01-02 13:18:35 +00:00
2019-01-19 07:58:24 +00:00
We define the following Python custom types for type hinting and readability:
2019-01-02 13:18:35 +00:00
2019-01-27 09:01:11 +00:00
| Name | SSZ equivalent | Description |
2019-01-19 07:58:24 +00:00
| - | - | - |
2019-01-31 15:58:31 +00:00
| `Slot` | `uint64` | a slot number |
| `Epoch` | `uint64` | an epoch number |
| `Shard` | `uint64` | a shard number |
2019-02-12 12:24:19 +00:00
| `ValidatorIndex` | `uint64` | a validator registry index |
2019-01-27 09:01:11 +00:00
| `Gwei` | `uint64` | an amount in Gwei |
| `Bytes32` | `bytes32` | 32 bytes of binary data |
2019-02-02 04:42:11 +00:00
| `BLSPubkey` | `bytes48` | a BLS12-381 public key |
| `BLSSignature` | `bytes96` | a BLS12-381 signature |
2018-12-04 10:57:09 +00:00
2019-01-28 19:15:43 +00:00
## Helper functions
2018-12-04 11:47:41 +00:00
2018-11-30 14:28:33 +00:00
Note: The definitions below are for specification purposes and are not necessarily optimal implementations.
2018-12-04 11:47:41 +00:00
2019-03-04 22:49:21 +00:00
### `xor`
```python
def xor(bytes1: Bytes32, bytes2: Bytes32) -> Bytes32:
return bytes(a ^ b for a, b in zip(bytes1, bytes2))
```
2019-01-28 19:15:43 +00:00
### `hash`
2018-12-04 11:47:41 +00:00
2018-12-11 20:30:28 +00:00
The hash function is denoted by `hash` . In Phase 0 the beacon chain is deployed with the same hash function as Ethereum 1.0, i.e. Keccak-256 (also incorrectly known as SHA3).
2018-12-04 11:47:41 +00:00
2018-12-11 20:30:28 +00:00
Note: We aim to migrate to a S[T/N]ARK-friendly hash function in a future Ethereum 2.0 deployment phase.
2018-12-04 11:47:41 +00:00
2019-01-28 19:15:43 +00:00
### `hash_tree_root`
2018-12-04 11:47:41 +00:00
2019-01-19 08:06:00 +00:00
`def hash_tree_root(object: SSZSerializable) -> Bytes32` is a function for hashing objects into a single root utilizing a hash tree structure. `hash_tree_root` is defined in the [SimpleSerialize spec ](https://github.com/ethereum/eth2.0-specs/blob/master/specs/simple-serialize.md#tree-hash ).
2018-12-04 11:47:41 +00:00
2019-02-15 00:23:03 +00:00
### `signed_root`
`def signed_root(object: SSZContainer) -> Bytes32` is a function defined in the [SimpleSerialize spec ](https://github.com/ethereum/eth2.0-specs/blob/master/specs/simple-serialize.md#signed-roots ) to compute signed messages.
2019-03-03 11:04:28 +00:00
### `get_temporary_block_header`
```python
def get_temporary_block_header(block: BeaconBlock) -> BeaconBlockHeader:
"""
Return the block header corresponding to a block with ``state_root`` set to ``ZERO_HASH``.
"""
return BeaconBlockHeader(
slot=block.slot,
previous_block_root=block.previous_block_root,
state_root=ZERO_HASH,
block_body_root=hash_tree_root(block.body),
signature=block.signature,
)
```
2019-01-28 19:15:43 +00:00
### `slot_to_epoch`
2018-12-04 10:57:09 +00:00
```python
2019-01-31 15:58:31 +00:00
def slot_to_epoch(slot: Slot) -> Epoch:
2019-01-30 09:25:39 +00:00
"""
2019-01-30 15:01:38 +00:00
Return the epoch number of the given ``slot``.
2019-01-30 09:25:39 +00:00
"""
2019-02-12 22:38:29 +00:00
return slot // SLOTS_PER_EPOCH
2018-12-04 10:57:09 +00:00
```
2019-02-03 09:36:21 +00:00
### `get_previous_epoch`
```python
2019-02-12 12:24:19 +00:00
def get_previous_epoch(state: BeaconState) -> Epoch:
2019-02-03 09:36:21 +00:00
"""`
Return the previous epoch of the given ``state``.
"""
2019-03-05 00:27:53 +00:00
return get_current_epoch(state) - 1
2019-02-03 09:36:21 +00:00
```
2019-01-28 19:15:43 +00:00
### `get_current_epoch`
2018-09-20 05:20:49 +00:00
2019-01-26 14:31:09 +00:00
```python
2019-01-31 15:58:31 +00:00
def get_current_epoch(state: BeaconState) -> Epoch:
2019-01-30 09:25:39 +00:00
"""
2019-01-30 15:01:38 +00:00
Return the current epoch of the given ``state``.
2019-01-30 09:25:39 +00:00
"""
2019-01-26 14:31:09 +00:00
return slot_to_epoch(state.slot)
2018-11-22 13:24:20 +00:00
```
2018-09-20 05:20:49 +00:00
2019-01-28 19:15:43 +00:00
### `get_epoch_start_slot`
2018-12-11 20:30:28 +00:00
2019-01-27 14:54:46 +00:00
```python
2019-01-31 15:58:31 +00:00
def get_epoch_start_slot(epoch: Epoch) -> Slot:
2019-01-30 09:25:39 +00:00
"""
2019-01-30 15:01:38 +00:00
Return the starting slot of the given ``epoch``.
2019-01-30 09:25:39 +00:00
"""
2019-02-12 22:38:29 +00:00
return epoch * SLOTS_PER_EPOCH
2019-01-27 14:54:46 +00:00
```
2018-12-14 15:29:49 +00:00
2019-01-28 19:15:43 +00:00
### `is_active_validator`
2018-12-12 19:00:53 +00:00
```python
2019-01-31 15:58:31 +00:00
def is_active_validator(validator: Validator, epoch: Epoch) -> bool:
2018-12-07 12:18:55 +00:00
"""
2019-01-30 15:01:38 +00:00
Check if ``validator`` is active.
2018-12-07 12:18:55 +00:00
"""
2019-01-26 15:16:32 +00:00
return validator.activation_epoch < = epoch < validator.exit_epoch
2018-12-07 12:18:55 +00:00
```
2019-01-28 19:15:43 +00:00
### `get_active_validator_indices`
2018-09-20 05:20:49 +00:00
```python
2019-01-31 15:58:31 +00:00
def get_active_validator_indices(validators: List[Validator], epoch: Epoch) -> List[ValidatorIndex]:
2018-11-30 14:28:33 +00:00
"""
2019-01-30 15:01:38 +00:00
Get indices of active validators from ``validators``.
2018-11-30 14:28:33 +00:00
"""
2019-01-26 15:16:32 +00:00
return [i for i, v in enumerate(validators) if is_active_validator(v, epoch)]
2018-09-20 05:20:49 +00:00
```
2018-11-04 22:26:24 +00:00
2019-02-07 21:08:25 +00:00
### `get_permuted_index`
2018-09-20 05:20:49 +00:00
```python
2019-02-08 03:55:33 +00:00
def get_permuted_index(index: int, list_size: int, seed: Bytes32) -> int:
2018-10-07 06:21:37 +00:00
"""
2019-02-07 21:08:25 +00:00
Return `p(index)` in a pseudorandom permutation `p` of `0...list_size-1` with ``seed`` as entropy.
2018-10-07 06:21:37 +00:00
2019-02-07 00:33:22 +00:00
Utilizes 'swap or not' shuffling found in
https://link.springer.com/content/pdf/10.1007%2F978-3-642-32009-5_1.pdf
See the 'generalized domain' algorithm on page 3.
2018-10-07 06:21:37 +00:00
"""
2019-02-14 14:14:59 +00:00
assert index < list_size
2019-02-16 06:27:47 +00:00
assert list_size < = 2**40
2019-02-14 14:14:59 +00:00
2019-02-08 03:55:33 +00:00
for round in range(SHUFFLE_ROUND_COUNT):
2019-02-08 03:51:56 +00:00
pivot = bytes_to_int(hash(seed + int_to_bytes1(round))[0:8]) % list_size
2019-02-07 21:08:25 +00:00
flip = (pivot - index) % list_size
position = max(index, flip)
source = hash(seed + int_to_bytes1(round) + int_to_bytes4(position // 256))
byte = source[(position % 256) // 8]
bit = (byte >> (position % 8)) % 2
index = flip if bit else index
2018-10-07 06:21:37 +00:00
2019-02-07 21:08:25 +00:00
return index
2018-09-20 05:20:49 +00:00
```
2019-03-19 17:24:36 +00:00
### `get_split_offset`
2018-09-20 05:20:49 +00:00
```python
2019-03-19 17:24:36 +00:00
def get_split_offset(list_length: int, split_count: int, index: int) -> int:
return (list_length * index) // split_count
2018-09-20 05:20:49 +00:00
```
2019-01-28 19:15:43 +00:00
### `get_epoch_committee_count`
2019-01-08 00:53:33 +00:00
```python
2019-01-27 16:56:26 +00:00
def get_epoch_committee_count(active_validator_count: int) -> int:
2019-01-30 09:25:39 +00:00
"""
2019-01-30 15:01:38 +00:00
Return the number of committees in one epoch.
2019-01-30 09:25:39 +00:00
"""
2019-01-08 00:53:33 +00:00
return max(
1,
min(
2019-02-12 22:38:29 +00:00
SHARD_COUNT // SLOTS_PER_EPOCH,
active_validator_count // SLOTS_PER_EPOCH // TARGET_COMMITTEE_SIZE,
2019-01-08 00:53:33 +00:00
)
2019-02-12 22:38:29 +00:00
) * SLOTS_PER_EPOCH
2019-01-08 00:53:33 +00:00
```
2019-03-15 01:28:44 +00:00
### `compute_committee`
2018-09-20 05:20:49 +00:00
```python
2019-03-15 09:43:38 +00:00
def compute_committee(validator_indices: List[ValidatorIndex],
2019-03-15 01:28:44 +00:00
seed: Bytes32,
index: int,
total_committees: int) -> List[ValidatorIndex]:
2018-11-30 14:28:33 +00:00
"""
2019-03-15 09:45:20 +00:00
Return the ``index``'th shuffled committee out of a total ``total_committees``
using ``validator_indices`` and ``seed``.
2018-11-30 14:28:33 +00:00
"""
2019-03-15 01:28:44 +00:00
start_offset = get_split_offset(len(validator_indices), total_committees, index)
end_offset = get_split_offset(len(validator_indices), total_committees, index + 1)
return [
validator_indices[get_permuted_index(i, len(validator_indices), seed)]
for i in range(start_offset, end_offset)
]
2019-01-08 00:53:33 +00:00
```
2018-10-07 06:21:37 +00:00
2019-03-15 01:28:44 +00:00
**Note**: this definition and the next few definitions are highly inefficient as algorithms as they re-calculate many sub-expressions. Production implementations are expected to appropriately use caching/memoization to avoid redoing work.
2018-10-14 13:30:52 +00:00
2019-01-29 13:17:05 +00:00
### `get_previous_epoch_committee_count`
2018-10-07 06:21:37 +00:00
2019-01-08 00:53:33 +00:00
```python
2019-01-27 16:56:26 +00:00
def get_previous_epoch_committee_count(state: BeaconState) -> int:
2019-01-30 09:25:39 +00:00
"""
2019-01-30 15:01:38 +00:00
Return the number of committees in the previous epoch of the given ``state``.
2019-01-30 09:25:39 +00:00
"""
2019-01-14 13:54:29 +00:00
previous_active_validators = get_active_validator_indices(
state.validator_registry,
2019-01-31 16:02:54 +00:00
state.previous_shuffling_epoch,
2019-01-14 13:54:29 +00:00
)
2019-01-27 16:56:26 +00:00
return get_epoch_committee_count(len(previous_active_validators))
2018-09-20 05:20:49 +00:00
```
2019-01-28 19:15:43 +00:00
### `get_current_epoch_committee_count`
2018-09-20 05:20:49 +00:00
2019-01-08 00:53:33 +00:00
```python
2019-01-27 16:56:26 +00:00
def get_current_epoch_committee_count(state: BeaconState) -> int:
2019-01-30 09:25:39 +00:00
"""
2019-01-30 15:01:38 +00:00
Return the number of committees in the current epoch of the given ``state``.
2019-01-30 09:25:39 +00:00
"""
2019-01-14 13:54:29 +00:00
current_active_validators = get_active_validator_indices(
state.validator_registry,
2019-01-31 16:02:54 +00:00
state.current_shuffling_epoch,
2019-01-14 13:54:29 +00:00
)
2019-01-27 16:56:26 +00:00
return get_epoch_committee_count(len(current_active_validators))
2019-01-08 00:53:33 +00:00
```
2018-09-20 05:20:49 +00:00
2019-01-30 00:29:51 +00:00
### `get_next_epoch_committee_count`
```python
def get_next_epoch_committee_count(state: BeaconState) -> int:
2019-02-02 05:09:45 +00:00
"""
Return the number of committees in the next epoch of the given ``state``.
"""
2019-01-30 00:29:51 +00:00
next_active_validators = get_active_validator_indices(
state.validator_registry,
get_current_epoch(state) + 1,
)
return get_epoch_committee_count(len(next_active_validators))
```
2019-01-28 19:15:43 +00:00
### `get_crosslink_committees_at_slot`
2018-09-20 05:20:49 +00:00
```python
2019-01-15 00:06:33 +00:00
def get_crosslink_committees_at_slot(state: BeaconState,
2019-01-31 15:58:31 +00:00
slot: Slot,
2019-02-12 11:59:05 +00:00
registry_change: bool=False) -> List[Tuple[List[ValidatorIndex], Shard]]:
2018-11-30 14:28:33 +00:00
"""
2019-01-30 15:01:38 +00:00
Return the list of ``(committee, shard)`` tuples for the ``slot``.
2019-01-30 00:29:51 +00:00
2019-01-30 15:07:41 +00:00
Note: There are two possible shufflings for crosslink committees for a
``slot`` in the next epoch -- with and without a `registry_change`
2018-11-30 14:28:33 +00:00
"""
2019-01-26 22:39:57 +00:00
epoch = slot_to_epoch(slot)
current_epoch = get_current_epoch(state)
2019-02-03 09:36:21 +00:00
previous_epoch = get_previous_epoch(state)
2019-01-26 22:39:57 +00:00
next_epoch = current_epoch + 1
2019-01-08 00:53:33 +00:00
2019-01-30 00:29:51 +00:00
assert previous_epoch < = epoch < = next_epoch
2019-01-26 22:39:57 +00:00
2019-02-22 19:51:09 +00:00
if epoch == current_epoch:
2019-01-27 16:56:26 +00:00
committees_per_epoch = get_current_epoch_committee_count(state)
2019-01-31 16:02:54 +00:00
seed = state.current_shuffling_seed
shuffling_epoch = state.current_shuffling_epoch
shuffling_start_shard = state.current_shuffling_start_shard
2019-02-22 19:51:09 +00:00
elif epoch == previous_epoch:
committees_per_epoch = get_previous_epoch_committee_count(state)
seed = state.previous_shuffling_seed
shuffling_epoch = state.previous_shuffling_epoch
shuffling_start_shard = state.previous_shuffling_start_shard
2019-01-30 00:29:51 +00:00
elif epoch == next_epoch:
2019-01-30 01:21:26 +00:00
epochs_since_last_registry_update = current_epoch - state.validator_registry_update_epoch
if registry_change:
2019-02-27 18:37:54 +00:00
committees_per_epoch = get_next_epoch_committee_count(state)
2019-01-30 01:21:26 +00:00
seed = generate_seed(state, next_epoch)
2019-02-28 11:07:37 +00:00
shuffling_epoch = next_epoch
2019-02-27 18:37:54 +00:00
current_committees_per_epoch = get_current_epoch_committee_count(state)
2019-01-31 16:02:54 +00:00
shuffling_start_shard = (state.current_shuffling_start_shard + current_committees_per_epoch) % SHARD_COUNT
2019-01-30 01:21:26 +00:00
elif epochs_since_last_registry_update > 1 and is_power_of_two(epochs_since_last_registry_update):
2019-02-27 18:37:54 +00:00
committees_per_epoch = get_next_epoch_committee_count(state)
2019-01-30 01:21:26 +00:00
seed = generate_seed(state, next_epoch)
2019-02-28 11:07:37 +00:00
shuffling_epoch = next_epoch
2019-01-31 16:02:54 +00:00
shuffling_start_shard = state.current_shuffling_start_shard
2019-01-30 01:21:26 +00:00
else:
2019-02-27 18:37:54 +00:00
committees_per_epoch = get_current_epoch_committee_count(state)
2019-01-31 16:02:54 +00:00
seed = state.current_shuffling_seed
2019-02-28 11:07:37 +00:00
shuffling_epoch = state.current_shuffling_epoch
2019-01-31 16:02:54 +00:00
shuffling_start_shard = state.current_shuffling_start_shard
2019-01-23 21:41:25 +00:00
2019-03-15 01:28:44 +00:00
indices = get_active_validator_indices(state.validator_registry, shuffling_epoch)
2019-02-12 22:38:29 +00:00
committees_per_slot = committees_per_epoch // SLOTS_PER_EPOCH
2019-03-19 17:15:51 +00:00
offset = slot % SLOTS_PER_EPOCH
2019-01-23 21:41:25 +00:00
slot_start_shard = (shuffling_start_shard + committees_per_slot * offset) % SHARD_COUNT
2019-01-08 00:53:33 +00:00
2019-01-10 17:01:19 +00:00
return [
2019-01-14 13:54:29 +00:00
(
2019-03-19 17:40:24 +00:00
compute_committee(indices, seed, committees_per_slot * offset + i, committees_per_epoch),
2019-01-14 13:54:29 +00:00
(slot_start_shard + i) % SHARD_COUNT,
)
2019-01-10 17:01:19 +00:00
for i in range(committees_per_slot)
]
2018-11-30 14:28:33 +00:00
```
2018-09-20 05:20:49 +00:00
2019-01-28 19:15:43 +00:00
### `get_block_root`
2018-11-30 14:28:33 +00:00
```python
2018-12-11 17:53:56 +00:00
def get_block_root(state: BeaconState,
2019-01-31 15:58:31 +00:00
slot: Slot) -> Bytes32:
2018-11-30 14:28:33 +00:00
"""
2019-01-30 15:01:38 +00:00
Return the block root at a recent ``slot``.
2018-11-30 14:28:33 +00:00
"""
2019-03-03 11:04:28 +00:00
assert slot < state.slot < = slot + SLOTS_PER_HISTORICAL_ROOT
return state.latest_block_roots[slot % SLOTS_PER_HISTORICAL_ROOT]
2018-09-20 05:20:49 +00:00
```
2019-01-15 00:06:33 +00:00
`get_block_root(_, s)` should always return `hash_tree_root` of the block in the beacon chain at slot `s` , and `get_crosslink_committees_at_slot(_, s)` should not change unless the [validator ](#dfn-validator ) registry changes.
2018-09-20 05:20:49 +00:00
2019-03-04 18:45:41 +00:00
### `get_state_root`
```python
def get_state_root(state: BeaconState,
slot: Slot) -> Bytes32:
"""
Return the state root at a recent ``slot``.
"""
assert slot < state.slot < = slot + SLOTS_PER_HISTORICAL_ROOT
return state.latest_state_roots[slot % SLOTS_PER_HISTORICAL_ROOT]
```
2019-01-28 19:15:43 +00:00
### `get_randao_mix`
2019-01-10 17:01:19 +00:00
```python
def get_randao_mix(state: BeaconState,
2019-01-31 15:58:31 +00:00
epoch: Epoch) -> Bytes32:
2019-01-10 17:01:19 +00:00
"""
2019-01-30 15:01:38 +00:00
Return the randao mix at a recent ``epoch``.
2019-01-10 17:01:19 +00:00
"""
2019-01-28 05:12:37 +00:00
assert get_current_epoch(state) - LATEST_RANDAO_MIXES_LENGTH < epoch < = get_current_epoch ( state )
2019-01-27 17:22:27 +00:00
return state.latest_randao_mixes[epoch % LATEST_RANDAO_MIXES_LENGTH]
2019-01-10 17:01:19 +00:00
```
2019-01-28 19:15:43 +00:00
### `get_active_index_root`
2019-01-19 03:06:21 +00:00
```python
def get_active_index_root(state: BeaconState,
2019-01-31 15:58:31 +00:00
epoch: Epoch) -> Bytes32:
2019-01-19 03:06:21 +00:00
"""
2019-01-30 15:01:38 +00:00
Return the index root at a recent ``epoch``.
2019-01-19 03:06:21 +00:00
"""
2019-01-31 15:56:48 +00:00
assert get_current_epoch(state) - LATEST_ACTIVE_INDEX_ROOTS_LENGTH + ACTIVATION_EXIT_DELAY < epoch < = get_current_epoch ( state ) + ACTIVATION_EXIT_DELAY
return state.latest_active_index_roots[epoch % LATEST_ACTIVE_INDEX_ROOTS_LENGTH]
2019-01-19 03:06:21 +00:00
```
2019-01-28 19:15:43 +00:00
### `generate_seed`
2019-01-25 23:07:54 +00:00
```python
def generate_seed(state: BeaconState,
2019-01-31 15:58:31 +00:00
epoch: Epoch) -> Bytes32:
2019-01-10 17:01:19 +00:00
"""
2019-01-26 00:33:15 +00:00
Generate a seed for the given ``epoch``.
2019-01-10 17:01:19 +00:00
"""
2019-01-25 23:07:54 +00:00
return hash(
2019-01-31 02:22:25 +00:00
get_randao_mix(state, epoch - MIN_SEED_LOOKAHEAD) +
2019-02-02 05:02:09 +00:00
get_active_index_root(state, epoch) +
int_to_bytes32(epoch)
2019-01-25 23:07:54 +00:00
)
2019-01-10 17:01:19 +00:00
```
2019-01-28 19:15:43 +00:00
### `get_beacon_proposer_index`
2018-11-20 07:40:04 +00:00
```python
2018-12-05 18:49:45 +00:00
def get_beacon_proposer_index(state: BeaconState,
2019-02-26 22:55:27 +00:00
slot: Slot,
2019-02-28 08:30:46 +00:00
registry_change: bool=False) -> ValidatorIndex:
2018-11-30 14:28:33 +00:00
"""
2019-01-30 15:01:38 +00:00
Return the beacon proposer index for the ``slot``.
2018-11-30 14:28:33 +00:00
"""
2019-02-26 22:55:27 +00:00
epoch = slot_to_epoch(slot)
current_epoch = get_current_epoch(state)
previous_epoch = get_previous_epoch(state)
next_epoch = current_epoch + 1
assert previous_epoch < = epoch < = next_epoch
first_committee, _ = get_crosslink_committees_at_slot(state, slot, registry_change)[0]
2019-03-07 22:56:03 +00:00
return first_committee[epoch % len(first_committee)]
2018-11-20 07:40:04 +00:00
```
2019-03-01 03:07:10 +00:00
### `verify_merkle_branch`
```python
2019-03-02 01:01:40 +00:00
def verify_merkle_branch(leaf: Bytes32, proof: List[Bytes32], depth: int, index: int, root: Bytes32) -> bool:
2019-03-01 03:07:10 +00:00
"""
2019-03-02 01:01:40 +00:00
Verify that the given ``leaf`` is on the merkle branch ``proof``
starting with the given ``root``.
2019-03-01 03:07:10 +00:00
"""
value = leaf
for i in range(depth):
if index // (2**i) % 2:
2019-03-02 01:01:40 +00:00
value = hash(proof[i] + value)
2019-03-01 03:07:10 +00:00
else:
2019-03-02 01:01:40 +00:00
value = hash(value + proof[i])
2019-03-01 03:07:10 +00:00
return value == root
```
2019-01-28 19:15:43 +00:00
### `get_attestation_participants`
2018-11-20 21:49:43 +00:00
```python
2018-12-07 12:18:55 +00:00
def get_attestation_participants(state: BeaconState,
2018-11-30 14:28:33 +00:00
attestation_data: AttestationData,
2019-01-26 19:03:46 +00:00
bitfield: bytes) -> List[ValidatorIndex]:
2018-11-30 14:28:33 +00:00
"""
2019-03-16 20:56:10 +00:00
Return the participant indices corresponding to ``attestation_data`` and ``bitfield``.
2018-11-30 14:28:33 +00:00
"""
2019-01-10 17:01:19 +00:00
# Find the committee in the list with the desired shard
2019-01-15 00:06:33 +00:00
crosslink_committees = get_crosslink_committees_at_slot(state, attestation_data.slot)
2019-01-16 19:05:53 +00:00
assert attestation_data.shard in [shard for _, shard in crosslink_committees]
2019-01-15 00:06:33 +00:00
crosslink_committee = [committee for committee, shard in crosslink_committees if shard == attestation_data.shard][0]
2018-12-04 10:57:09 +00:00
2019-01-26 18:59:07 +00:00
assert verify_bitfield(bitfield, len(crosslink_committee))
2018-12-04 10:57:09 +00:00
# Find the participating attesters in the committee
2018-11-26 22:12:39 +00:00
participants = []
2019-01-15 00:06:33 +00:00
for i, validator_index in enumerate(crosslink_committee):
2019-01-23 12:40:59 +00:00
aggregation_bit = get_bitfield_bit(bitfield, i)
2019-01-27 09:01:11 +00:00
if aggregation_bit == 0b1:
2018-11-30 14:28:33 +00:00
participants.append(validator_index)
2018-11-26 22:12:39 +00:00
return participants
2018-11-20 07:40:04 +00:00
```
2019-01-30 15:07:41 +00:00
### `is_power_of_two`
2019-02-01 15:45:09 +00:00
```python
2019-01-30 15:07:41 +00:00
def is_power_of_two(value: int) -> bool:
"""
Check if ``value`` is a power of two integer.
"""
2019-02-22 12:00:29 +00:00
return (value > 0) and (value & (value - 1) == 0)
2019-01-30 15:07:41 +00:00
```
2019-01-28 19:15:43 +00:00
### `int_to_bytes1`, `int_to_bytes2`, ...
2018-11-30 14:28:33 +00:00
2019-02-03 00:41:59 +00:00
`int_to_bytes1(x): return x.to_bytes(1, 'little')` , `int_to_bytes2(x): return x.to_bytes(2, 'little')` , and so on for all integers, particularly 1, 2, 3, 4, 8, 32, 48, 96.
2018-09-20 05:20:49 +00:00
2019-02-07 21:12:58 +00:00
### `bytes_to_int`
```python
def bytes_to_int(data: bytes) -> int:
return int.from_bytes(data, 'little')
```
2018-09-20 05:20:49 +00:00
2019-01-28 19:15:43 +00:00
### `get_effective_balance`
2018-11-25 11:33:05 +00:00
2018-12-01 05:29:19 +00:00
```python
2019-03-04 04:41:23 +00:00
def get_effective_balance(state: BeaconState, index: ValidatorIndex) -> Gwei:
2018-11-30 14:28:33 +00:00
"""
2019-01-31 02:38:12 +00:00
Return the effective balance (also known as "balance at stake") for a validator with the given ``index``.
2018-11-30 14:28:33 +00:00
"""
2019-01-17 10:55:05 +00:00
return min(state.validator_balances[index], MAX_DEPOSIT_AMOUNT)
2018-11-25 11:33:05 +00:00
```
2019-02-03 10:43:33 +00:00
### `get_total_balance`
2019-02-03 10:14:02 +00:00
```python
2019-02-07 21:09:41 +00:00
def get_total_balance(state: BeaconState, validators: List[ValidatorIndex]) -> Gwei:
2019-02-03 10:14:02 +00:00
"""
2019-03-04 14:45:55 +00:00
Return the combined effective balance of an array of ``validators``.
2019-02-03 10:14:02 +00:00
"""
2019-02-04 07:49:16 +00:00
return sum([get_effective_balance(state, i) for i in validators])
2019-02-03 10:14:02 +00:00
```
2019-01-28 19:15:43 +00:00
### `get_fork_version`
2018-12-10 22:14:08 +00:00
```python
2019-01-17 11:18:30 +00:00
def get_fork_version(fork: Fork,
2019-03-12 12:36:09 +00:00
epoch: Epoch) -> bytes:
2019-01-30 09:25:39 +00:00
"""
2019-01-30 15:01:38 +00:00
Return the fork version of the given ``epoch``.
2019-01-30 09:25:39 +00:00
"""
2019-01-26 22:27:50 +00:00
if epoch < fork.epoch:
2019-01-17 11:18:30 +00:00
return fork.previous_version
2018-12-10 22:14:08 +00:00
else:
2019-01-17 11:18:30 +00:00
return fork.current_version
2018-12-10 22:14:08 +00:00
```
2019-01-28 19:15:43 +00:00
### `get_domain`
2018-12-05 14:41:11 +00:00
```python
2019-01-17 11:18:30 +00:00
def get_domain(fork: Fork,
2019-01-31 15:58:31 +00:00
epoch: Epoch,
2018-12-05 14:41:11 +00:00
domain_type: int) -> int:
2019-01-30 09:25:39 +00:00
"""
Get the domain number that represents the fork meta and signature domain.
"""
2019-03-12 12:36:09 +00:00
return bytes_to_int(get_fork_version(fork, epoch) + int_to_bytes4(domain_type))
2018-12-05 14:41:11 +00:00
```
2019-01-28 20:33:50 +00:00
### `get_bitfield_bit`
2019-01-23 12:40:59 +00:00
```python
def get_bitfield_bit(bitfield: bytes, i: int) -> int:
2019-01-23 13:52:52 +00:00
"""
Extract the bit in ``bitfield`` at position ``i``.
"""
2019-02-12 11:52:07 +00:00
return (bitfield[i // 8] >> (i % 8)) % 2
2019-01-23 12:40:59 +00:00
```
2019-01-28 20:33:50 +00:00
### `verify_bitfield`
2019-01-23 12:40:59 +00:00
```python
2019-01-26 18:59:07 +00:00
def verify_bitfield(bitfield: bytes, committee_size: int) -> bool:
2019-01-23 13:52:52 +00:00
"""
2019-01-26 18:59:07 +00:00
Verify ``bitfield`` against the ``committee_size``.
2019-01-23 13:52:52 +00:00
"""
2019-01-26 18:59:07 +00:00
if len(bitfield) != (committee_size + 7) // 8:
2019-01-23 12:40:59 +00:00
return False
2019-02-05 19:51:06 +00:00
# Check `bitfield` is padded with zero bits only
2019-02-05 19:49:52 +00:00
for i in range(committee_size, len(bitfield) * 8):
2019-01-27 09:01:11 +00:00
if get_bitfield_bit(bitfield, i) == 0b1:
2019-01-23 12:40:59 +00:00
return False
return True
2018-12-05 14:41:11 +00:00
```
2019-01-30 13:38:45 +00:00
### `verify_slashable_attestation`
2018-12-07 01:02:23 +00:00
```python
2019-01-30 13:38:45 +00:00
def verify_slashable_attestation(state: BeaconState, slashable_attestation: SlashableAttestation) -> bool:
2019-01-23 13:52:52 +00:00
"""
2019-01-30 13:38:45 +00:00
Verify validity of ``slashable_attestation`` fields.
2019-01-23 13:52:52 +00:00
"""
2019-01-30 13:38:45 +00:00
if slashable_attestation.custody_bitfield != b'\x00' * len(slashable_attestation.custody_bitfield): # [TO BE REMOVED IN PHASE 1]
2018-12-07 20:09:49 +00:00
return False
2019-01-30 13:38:45 +00:00
if len(slashable_attestation.validator_indices) == 0:
2019-01-23 13:24:35 +00:00
return False
2019-01-30 13:38:45 +00:00
for i in range(len(slashable_attestation.validator_indices) - 1):
if slashable_attestation.validator_indices[i] >= slashable_attestation.validator_indices[i + 1]:
2019-01-27 09:01:11 +00:00
return False
2019-01-23 13:24:35 +00:00
2019-01-30 13:38:45 +00:00
if not verify_bitfield(slashable_attestation.custody_bitfield, len(slashable_attestation.validator_indices)):
2019-01-23 12:40:59 +00:00
return False
2019-01-30 13:38:45 +00:00
if len(slashable_attestation.validator_indices) > MAX_INDICES_PER_SLASHABLE_VOTE:
2018-12-07 20:09:49 +00:00
return False
2019-01-23 13:24:35 +00:00
custody_bit_0_indices = []
custody_bit_1_indices = []
2019-01-30 13:38:45 +00:00
for i, validator_index in enumerate(slashable_attestation.validator_indices):
if get_bitfield_bit(slashable_attestation.custody_bitfield, i) == 0b0:
2019-01-23 13:24:35 +00:00
custody_bit_0_indices.append(validator_index)
else:
custody_bit_1_indices.append(validator_index)
2019-02-05 17:11:00 +00:00
return bls_verify_multiple(
2018-12-23 10:48:11 +00:00
pubkeys=[
2019-01-23 13:24:35 +00:00
bls_aggregate_pubkeys([state.validator_registry[i].pubkey for i in custody_bit_0_indices]),
bls_aggregate_pubkeys([state.validator_registry[i].pubkey for i in custody_bit_1_indices]),
2018-12-23 10:48:11 +00:00
],
2019-02-07 21:09:41 +00:00
message_hashes=[
2019-01-30 19:03:13 +00:00
hash_tree_root(AttestationDataAndCustodyBit(data=slashable_attestation.data, custody_bit=0b0)),
hash_tree_root(AttestationDataAndCustodyBit(data=slashable_attestation.data, custody_bit=0b1)),
2018-12-23 10:48:11 +00:00
],
2019-01-30 13:38:45 +00:00
signature=slashable_attestation.aggregate_signature,
2019-02-15 14:48:09 +00:00
domain=get_domain(state.fork, slot_to_epoch(slashable_attestation.data.slot), DOMAIN_ATTESTATION),
2018-12-12 18:55:28 +00:00
)
2018-12-07 01:02:23 +00:00
```
2019-01-28 19:15:43 +00:00
### `is_double_vote`
2018-12-13 18:09:39 +00:00
```python
def is_double_vote(attestation_data_1: AttestationData,
2019-01-30 09:25:39 +00:00
attestation_data_2: AttestationData) -> bool:
2018-12-13 18:17:39 +00:00
"""
2019-01-30 19:04:35 +00:00
Check if ``attestation_data_1`` and ``attestation_data_2`` have the same target.
2018-12-13 18:17:39 +00:00
"""
2019-01-26 00:33:15 +00:00
target_epoch_1 = slot_to_epoch(attestation_data_1.slot)
target_epoch_2 = slot_to_epoch(attestation_data_2.slot)
2018-12-28 17:10:12 +00:00
return target_epoch_1 == target_epoch_2
2018-12-13 18:09:39 +00:00
```
2019-01-28 19:15:43 +00:00
### `is_surround_vote`
2018-12-13 18:09:39 +00:00
```python
def is_surround_vote(attestation_data_1: AttestationData,
2018-12-19 11:47:37 +00:00
attestation_data_2: AttestationData) -> bool:
2018-12-13 18:17:39 +00:00
"""
2019-01-30 19:03:13 +00:00
Check if ``attestation_data_1`` surrounds ``attestation_data_2``.
2018-12-13 18:17:39 +00:00
"""
2019-03-12 10:17:34 +00:00
source_epoch_1 = attestation_data_1.source_epoch
source_epoch_2 = attestation_data_2.source_epoch
2019-01-26 00:33:15 +00:00
target_epoch_1 = slot_to_epoch(attestation_data_1.slot)
target_epoch_2 = slot_to_epoch(attestation_data_2.slot)
2019-01-30 14:46:43 +00:00
return source_epoch_1 < source_epoch_2 and target_epoch_2 < target_epoch_1
2018-12-13 18:09:39 +00:00
```
2019-01-28 19:15:43 +00:00
### `integer_squareroot`
2018-09-30 23:02:09 +00:00
2018-09-30 14:56:43 +00:00
```python
2018-11-30 14:28:33 +00:00
def integer_squareroot(n: int) -> int:
"""
2019-01-23 04:47:07 +00:00
The largest integer ``x`` such that ``x**2`` is less than or equal to ``n``.
2018-11-30 14:28:33 +00:00
"""
2019-01-11 00:09:58 +00:00
assert n >= 0
2018-09-30 23:38:47 +00:00
x = n
y = (x + 1) // 2
while y < x:
x = y
y = (x + n // x) // 2
return x
2018-09-30 14:56:43 +00:00
```
2019-02-20 07:45:19 +00:00
### `get_delayed_activation_exit_epoch`
2019-01-23 04:47:07 +00:00
```python
2019-02-20 07:45:19 +00:00
def get_delayed_activation_exit_epoch(epoch: Epoch) -> Epoch:
2019-01-23 04:47:07 +00:00
"""
2019-02-20 07:45:19 +00:00
Return the epoch at which an activation or exit triggered in ``epoch`` takes effect.
2019-01-23 04:47:07 +00:00
"""
2019-01-31 15:56:48 +00:00
return epoch + 1 + ACTIVATION_EXIT_DELAY
2019-01-23 04:47:07 +00:00
```
2019-01-28 19:15:43 +00:00
### `bls_verify`
2018-12-10 22:14:08 +00:00
2019-01-09 20:47:19 +00:00
`bls_verify` is a function for verifying a BLS signature, defined in the [BLS Signature spec ](https://github.com/ethereum/eth2.0-specs/blob/master/specs/bls_signature.md#bls_verify ).
2018-12-11 21:18:30 +00:00
2019-01-28 19:15:43 +00:00
### `bls_verify_multiple`
2018-12-11 21:18:30 +00:00
2019-01-09 20:47:19 +00:00
`bls_verify_multiple` is a function for verifying a BLS signature constructed from multiple messages, defined in the [BLS Signature spec ](https://github.com/ethereum/eth2.0-specs/blob/master/specs/bls_signature.md#bls_verify_multiple ).
2018-12-14 15:39:14 +00:00
2019-01-28 19:15:43 +00:00
### `bls_aggregate_pubkeys`
2018-12-14 15:39:14 +00:00
2019-01-09 20:47:19 +00:00
`bls_aggregate_pubkeys` is a function for aggregating multiple BLS public keys into a single aggregate key, defined in the [BLS Signature spec ](https://github.com/ethereum/eth2.0-specs/blob/master/specs/bls_signature.md#bls_aggregate_pubkeys ).
2018-12-10 22:14:08 +00:00
2019-02-15 00:23:03 +00:00
### `process_deposit`
Used to add a [validator ](#dfn-validator ) or top up an existing [validator ](#dfn-validator )'s balance by some `deposit` amount:
2018-11-16 16:41:59 +00:00
```python
2019-02-15 00:23:03 +00:00
def process_deposit(state: BeaconState, deposit: Deposit) -> None:
2019-01-30 09:25:39 +00:00
"""
2019-02-15 00:23:03 +00:00
Process a deposit from Ethereum 1.0.
Note that this function mutates ``state``.
2019-01-30 09:25:39 +00:00
"""
2019-02-15 00:23:03 +00:00
deposit_input = deposit.deposit_data.deposit_input
2018-11-16 16:41:59 +00:00
2019-03-01 03:07:10 +00:00
# Should equal 8 bytes for deposit_data.amount +
# 8 bytes for deposit_data.timestamp +
# 176 bytes for deposit_data.deposit_input
# It should match the deposit_data in the eth1.0 deposit contract
2019-03-01 06:12:45 +00:00
serialized_deposit_data = serialize(deposit.deposit_data)
2019-03-01 03:07:10 +00:00
# Deposits must be processed in order
assert deposit.index == state.deposit_index
2019-03-12 17:07:20 +00:00
2019-03-01 03:07:10 +00:00
# Verify the Merkle branch
merkle_branch_is_valid = verify_merkle_branch(
leaf=hash(serialized_deposit_data),
2019-03-02 01:01:40 +00:00
proof=deposit.proof,
2019-03-01 03:07:10 +00:00
depth=DEPOSIT_CONTRACT_TREE_DEPTH,
index=deposit.index,
2019-03-02 00:59:55 +00:00
root=state.latest_eth1_data.deposit_root,
2019-03-01 03:07:10 +00:00
)
2019-03-01 09:58:18 +00:00
assert merkle_branch_is_valid
2019-03-12 17:07:20 +00:00
2019-03-01 03:07:10 +00:00
# Increment the next deposit index we are expecting. Note that this
# needs to be done here because while the deposit contract will never
# create an invalid Merkle branch, it may admit an invalid deposit
# object, and we need to be able to skip over it
state.deposit_index += 1
2019-02-09 15:21:38 +00:00
2019-01-28 19:15:43 +00:00
validator_pubkeys = [v.pubkey for v in state.validator_registry]
2019-02-15 00:23:03 +00:00
pubkey = deposit_input.pubkey
amount = deposit.deposit_data.amount
withdrawal_credentials = deposit_input.withdrawal_credentials
2018-12-10 19:55:11 +00:00
2018-11-27 19:51:12 +00:00
if pubkey not in validator_pubkeys:
2019-03-11 16:28:39 +00:00
# Verify the proof of possession
2019-03-12 17:07:20 +00:00
proof_is_valid = bls_verify(
2019-03-11 16:28:39 +00:00
pubkey=deposit_input.pubkey,
message_hash=signed_root(deposit_input),
signature=deposit_input.proof_of_possession,
domain=get_domain(
state.fork,
get_current_epoch(state),
DOMAIN_DEPOSIT,
)
2019-03-12 17:07:20 +00:00
)
if not proof_is_valid:
2019-03-11 16:28:39 +00:00
return
2018-11-30 14:28:33 +00:00
# Add new validator
2019-01-17 11:01:13 +00:00
validator = Validator(
2018-11-27 19:51:12 +00:00
pubkey=pubkey,
withdrawal_credentials=withdrawal_credentials,
2019-01-26 00:33:15 +00:00
activation_epoch=FAR_FUTURE_EPOCH,
2019-01-26 22:27:50 +00:00
exit_epoch=FAR_FUTURE_EPOCH,
2019-02-14 10:20:53 +00:00
withdrawable_epoch=FAR_FUTURE_EPOCH,
2019-02-20 02:00:46 +00:00
initiated_exit=False,
slashed=False,
2018-11-27 19:51:12 +00:00
)
2019-01-19 00:45:15 +00:00
# Note: In phase 2 registry indices that have been withdrawn for a long time will be recycled.
2018-12-31 15:14:14 +00:00
state.validator_registry.append(validator)
state.validator_balances.append(amount)
2018-11-27 19:51:12 +00:00
else:
2018-12-31 15:14:14 +00:00
# Increase balance by deposit amount
2019-03-10 12:25:57 +00:00
state.validator_balances[validator_pubkeys.index(pubkey)] += amount
2018-11-20 01:13:58 +00:00
```
2018-12-05 18:40:08 +00:00
2018-12-28 18:04:03 +00:00
### Routines for updating validator status
2018-10-01 22:19:16 +00:00
2018-12-31 15:14:14 +00:00
Note: All functions in this section mutate `state` .
2018-12-10 22:42:28 +00:00
2019-01-28 19:15:43 +00:00
#### `activate_validator`
2018-12-10 21:16:06 +00:00
```python
2019-01-30 09:25:39 +00:00
def activate_validator(state: BeaconState, index: ValidatorIndex, is_genesis: bool) -> None:
"""
Activate the validator of the given ``index``.
Note that this function mutates ``state``.
"""
2018-12-13 19:45:08 +00:00
validator = state.validator_registry[index]
2018-12-10 21:16:06 +00:00
2019-02-20 07:45:19 +00:00
validator.activation_epoch = GENESIS_EPOCH if is_genesis else get_delayed_activation_exit_epoch(get_current_epoch(state))
2018-10-01 22:19:16 +00:00
```
2019-01-28 19:15:43 +00:00
#### `initiate_validator_exit`
2018-12-10 21:16:06 +00:00
```python
2019-01-19 07:58:24 +00:00
def initiate_validator_exit(state: BeaconState, index: ValidatorIndex) -> None:
2019-01-30 09:25:39 +00:00
"""
Initiate the validator of the given ``index``.
Note that this function mutates ``state``.
"""
2018-12-13 19:45:08 +00:00
validator = state.validator_registry[index]
2019-02-20 02:00:46 +00:00
validator.initiated_exit = True
2018-12-10 21:16:06 +00:00
```
2018-10-11 18:14:48 +00:00
2019-01-28 19:15:43 +00:00
#### `exit_validator`
2018-10-11 18:14:48 +00:00
```python
2019-01-19 07:58:24 +00:00
def exit_validator(state: BeaconState, index: ValidatorIndex) -> None:
2019-01-30 09:25:39 +00:00
"""
Exit the validator of the given ``index``.
Note that this function mutates ``state``.
"""
2018-11-30 14:28:33 +00:00
validator = state.validator_registry[index]
2019-02-26 09:07:59 +00:00
delayed_activation_exit_epoch = get_delayed_activation_exit_epoch(get_current_epoch(state))
2018-12-11 15:49:50 +00:00
2019-01-04 01:44:39 +00:00
# The following updates only occur if not previous exited
2019-02-26 09:07:59 +00:00
if validator.exit_epoch < = delayed_activation_exit_epoch:
2018-12-13 13:08:51 +00:00
return
2019-02-26 09:07:59 +00:00
else:
validator.exit_epoch = delayed_activation_exit_epoch
2018-10-11 18:14:48 +00:00
```
2019-02-12 12:24:19 +00:00
#### `slash_validator`
2019-01-28 19:15:43 +00:00
2018-12-28 18:04:03 +00:00
```python
2019-02-12 12:24:19 +00:00
def slash_validator(state: BeaconState, index: ValidatorIndex) -> None:
2019-01-30 09:25:39 +00:00
"""
2019-02-12 12:24:19 +00:00
Slash the validator with index ``index``.
2019-01-30 09:25:39 +00:00
Note that this function mutates ``state``.
"""
2018-12-31 02:42:05 +00:00
validator = state.validator_registry[index]
2019-02-15 10:33:22 +00:00
assert state.slot < get_epoch_start_slot ( validator . withdrawable_epoch ) # [ TO BE REMOVED IN PHASE 2 ]
2018-12-28 18:04:03 +00:00
exit_validator(state, index)
2019-01-31 02:22:25 +00:00
state.latest_slashed_balances[get_current_epoch(state) % LATEST_SLASHED_EXIT_LENGTH] += get_effective_balance(state, index)
2018-12-28 18:04:03 +00:00
whistleblower_index = get_beacon_proposer_index(state, state.slot)
whistleblower_reward = get_effective_balance(state, index) // WHISTLEBLOWER_REWARD_QUOTIENT
state.validator_balances[whistleblower_index] += whistleblower_reward
state.validator_balances[index] -= whistleblower_reward
2019-02-20 02:00:46 +00:00
validator.slashed = True
2019-02-19 22:07:30 +00:00
validator.withdrawable_epoch = get_current_epoch(state) + LATEST_SLASHED_EXIT_LENGTH
2018-12-28 18:04:03 +00:00
```
2019-01-28 19:15:43 +00:00
#### `prepare_validator_for_withdrawal`
2018-12-28 18:04:03 +00:00
```python
2019-01-19 07:58:24 +00:00
def prepare_validator_for_withdrawal(state: BeaconState, index: ValidatorIndex) -> None:
2019-01-30 09:25:39 +00:00
"""
2019-02-14 10:20:53 +00:00
Set the validator with the given ``index`` as withdrawable
``MIN_VALIDATOR_WITHDRAWABILITY_DELAY`` after the current epoch.
2019-01-30 09:25:39 +00:00
Note that this function mutates ``state``.
"""
2018-12-31 02:42:05 +00:00
validator = state.validator_registry[index]
2019-02-14 10:20:53 +00:00
validator.withdrawable_epoch = get_current_epoch(state) + MIN_VALIDATOR_WITHDRAWABILITY_DELAY
2018-12-28 18:04:03 +00:00
```
2019-01-28 19:15:43 +00:00
## Ethereum 1.0 deposit contract
The initial deployment phases of Ethereum 2.0 are implemented without consensus changes to Ethereum 1.0. A deposit contract at address `DEPOSIT_CONTRACT_ADDRESS` is added to Ethereum 1.0 for deposits of ETH to the beacon chain. Validator balances will be withdrawable to the shards in phase 2, i.e. when the EVM2.0 is deployed and the shards have state.
### Deposit arguments
The deposit contract has a single `deposit` function which takes as argument a SimpleSerialize'd `DepositInput` .
### Withdrawal credentials
One of the `DepositInput` fields is `withdrawal_credentials` . It is a commitment to credentials for withdrawals to shards. The first byte of `withdrawal_credentials` is a version number. As of now the only expected format is as follows:
* `withdrawal_credentials[:1] == BLS_WITHDRAWAL_PREFIX_BYTE`
* `withdrawal_credentials[1:] == hash(withdrawal_pubkey)[1:]` where `withdrawal_pubkey` is a BLS pubkey
The private key corresponding to `withdrawal_pubkey` will be required to initiate a withdrawal. It can be stored separately until a withdrawal is required, e.g. in cold storage.
### `Deposit` logs
Every Ethereum 1.0 deposit, of size between `MIN_DEPOSIT_AMOUNT` and `MAX_DEPOSIT_AMOUNT` , emits a `Deposit` log for consumption by the beacon chain. The deposit contract does little validation, pushing most of the validator onboarding logic to the beacon chain. In particular, the proof of possession (a BLS12 signature) is not verified by the deposit contract.
2019-01-31 16:23:41 +00:00
### `Eth2Genesis` log
2019-01-28 19:15:43 +00:00
2019-02-12 12:24:19 +00:00
When sufficiently many full deposits have been made the deposit contract emits the `Eth2Genesis` log. The beacon chain state may then be initialized by calling the `get_genesis_beacon_state` function (defined below) where:
2019-01-28 19:15:43 +00:00
2019-01-31 16:23:41 +00:00
* `genesis_time` equals `time` in the `Eth2Genesis` log
2019-02-12 12:24:19 +00:00
* `latest_eth1_data.deposit_root` equals `deposit_root` in the `Eth2Genesis` log
* `latest_eth1_data.block_hash` equals the hash of the block that included the log
* `genesis_validator_deposits` is a list of `Deposit` objects built according to the `Deposit` logs up to the deposit that triggered the `Eth2Genesis` log, processed in the order in which they were emitted (oldest to newest)
2019-01-28 19:15:43 +00:00
### Vyper code
2019-02-03 23:22:03 +00:00
The source for the Vyper contract lives in a [separate repository ](https://github.com/ethereum/deposit_contract ) at [https://github.com/ethereum/deposit_contract/blob/master/deposit_contract/contracts/validator_registration.v.py ](https://github.com/ethereum/deposit_contract/blob/master/deposit_contract/contracts/validator_registration.v.py ).
2019-01-30 19:55:26 +00:00
Note: to save ~10x on gas this contract uses a somewhat unintuitive progressive Merkle root calculation algo that requires only O(log(n)) storage. See https://github.com/ethereum/research/blob/master/beacon_chain_impl/progressive_merkle_tree.py for an implementation of the same algo in python tested for correctness.
2019-02-02 01:06:04 +00:00
For convenience, we provide the interface to the contract here:
2019-01-28 19:15:43 +00:00
2019-02-02 01:06:04 +00:00
* `__init__()` : initializes the contract
* `get_deposit_root() -> bytes32` : returns the current root of the deposit tree
2019-02-03 23:20:49 +00:00
* `deposit(bytes[512])` : adds a deposit instance to the deposit tree, incorporating the input argument and the value transferred in the given call. Note: the amount of value transferred *must* be within `MIN_DEPOSIT_AMOUNT` and `MAX_DEPOSIT_AMOUNT` , inclusive. Each of these constants are specified in units of Gwei.
2019-01-30 19:55:26 +00:00
2019-02-12 12:24:19 +00:00
## On genesis
2018-09-20 05:20:49 +00:00
2019-03-03 11:04:28 +00:00
When enough full deposits have been made to the deposit contract, an `Eth2Genesis` log is emitted. Construct a corresponding `genesis_state` and `genesis_block` as follows:
* Let `genesis_validator_deposits` be the list of deposits, ordered chronologically, up to and including the deposit that triggered the `Eth2Genesis` log.
* Let `genesis_time` be the timestamp specified in the `Eth2Genesis` log.
* Let `genesis_eth1_data` be the `Eth1Data` object where:
* `genesis_eth1_data.deposit_root` is the `deposit_root` contained in the `Eth2Genesis` log.
* `genesis_eth1_data.block_hash` is the hash of the Ethereum 1.0 block that emitted the `Eth2Genesis` log.
* Let `genesis_state = get_genesis_beacon_state(genesis_validator_deposits, genesis_time, genesis_eth1_data)` .
* Let `genesis_block = get_empty_block()` .
* Set `genesis_block.state_root = hash_tree_root(genesis_state)` .
2018-11-16 16:41:59 +00:00
```python
2019-03-03 11:04:28 +00:00
def get_empty_block() -> BeaconBlock:
"""
Get an empty ``BeaconBlock``.
"""
return BeaconBlock(
slot=GENESIS_SLOT,
previous_block_root=ZERO_HASH,
state_root=ZERO_HASH,
body=BeaconBlockBody(
randao_reveal=EMPTY_SIGNATURE,
eth1_data=Eth1Data(
deposit_root=ZERO_HASH,
block_hash=ZERO_HASH,
),
proposer_slashings=[],
attester_slashings=[],
attestations=[],
deposits=[],
2019-03-04 10:49:24 +00:00
voluntary_exits=[],
2019-03-03 11:04:28 +00:00
transfers=[],
),
signature=EMPTY_SIGNATURE,
)
2018-11-16 16:41:59 +00:00
```
2018-10-02 15:20:07 +00:00
```python
2019-02-12 12:24:19 +00:00
def get_genesis_beacon_state(genesis_validator_deposits: List[Deposit],
2018-12-13 13:08:51 +00:00
genesis_time: int,
2019-03-03 11:04:28 +00:00
genesis_eth1_data: Eth1Data) -> BeaconState:
2019-01-30 09:25:39 +00:00
"""
2019-02-12 12:24:19 +00:00
Get the genesis ``BeaconState``.
2019-01-30 09:25:39 +00:00
"""
2018-11-15 13:20:25 +00:00
state = BeaconState(
2018-12-04 21:28:31 +00:00
# Misc
2018-12-30 15:15:23 +00:00
slot=GENESIS_SLOT,
2018-12-04 21:28:31 +00:00
genesis_time=genesis_time,
2019-01-17 11:18:30 +00:00
fork=Fork(
2019-03-17 11:33:42 +00:00
previous_version=GENESIS_FORK_VERSION,
current_version=GENESIS_FORK_VERSION,
2019-01-28 19:15:43 +00:00
epoch=GENESIS_EPOCH,
2018-12-04 21:28:31 +00:00
),
# Validator registry
2018-12-11 16:02:59 +00:00
validator_registry=[],
2018-12-14 00:40:00 +00:00
validator_balances=[],
2019-01-28 19:15:43 +00:00
validator_registry_update_epoch=GENESIS_EPOCH,
2018-12-04 21:28:31 +00:00
2018-11-30 14:28:33 +00:00
# Randomness and committees
2019-03-17 11:33:19 +00:00
latest_randao_mixes=Vector([ZERO_HASH for _ in range(LATEST_RANDAO_MIXES_LENGTH)]),
2019-01-31 16:02:54 +00:00
previous_shuffling_start_shard=GENESIS_START_SHARD,
current_shuffling_start_shard=GENESIS_START_SHARD,
previous_shuffling_epoch=GENESIS_EPOCH,
current_shuffling_epoch=GENESIS_EPOCH,
previous_shuffling_seed=ZERO_HASH,
current_shuffling_seed=ZERO_HASH,
2018-12-21 08:41:48 +00:00
2018-11-30 14:28:33 +00:00
# Finality
2019-03-03 10:28:13 +00:00
previous_epoch_attestations=[],
current_epoch_attestations=[],
2019-01-28 19:15:43 +00:00
previous_justified_epoch=GENESIS_EPOCH,
2019-03-12 10:17:34 +00:00
current_justified_epoch=GENESIS_EPOCH,
2019-03-11 20:38:10 +00:00
previous_justified_root=ZERO_HASH,
2019-03-12 10:17:34 +00:00
current_justified_root=ZERO_HASH,
2018-12-04 10:57:09 +00:00
justification_bitfield=0,
2019-01-28 19:15:43 +00:00
finalized_epoch=GENESIS_EPOCH,
2019-03-12 18:32:11 +00:00
finalized_root=ZERO_HASH,
2018-12-04 21:28:31 +00:00
2018-11-30 14:28:33 +00:00
# Recent state
2019-03-17 11:33:19 +00:00
latest_crosslinks=Vector([Crosslink(epoch=GENESIS_EPOCH, crosslink_data_root=ZERO_HASH) for _ in range(SHARD_COUNT)]),
latest_block_roots=Vector([ZERO_HASH for _ in range(SLOTS_PER_HISTORICAL_ROOT)]),
latest_state_roots=Vector([ZERO_HASH for _ in range(SLOTS_PER_HISTORICAL_ROOT)]),
latest_active_index_roots=Vector([ZERO_HASH for _ in range(LATEST_ACTIVE_INDEX_ROOTS_LENGTH)]),
latest_slashed_balances=Vector([0 for _ in range(LATEST_SLASHED_EXIT_LENGTH)]),
2019-03-03 11:04:28 +00:00
latest_block_header=get_temporary_block_header(get_empty_block()),
historical_roots=[],
2018-12-13 15:36:57 +00:00
2019-01-17 11:43:47 +00:00
# Ethereum 1.0 chain data
2019-03-03 11:04:28 +00:00
latest_eth1_data=genesis_eth1_data,
2019-01-17 11:43:47 +00:00
eth1_data_votes=[],
2019-03-01 03:07:10 +00:00
deposit_index=0,
2018-10-09 07:33:22 +00:00
)
2019-02-12 12:24:19 +00:00
# Process genesis deposits
for deposit in genesis_validator_deposits:
2019-02-15 00:23:03 +00:00
process_deposit(state, deposit)
2018-12-10 21:16:06 +00:00
2019-02-12 12:24:19 +00:00
# Process genesis activations
2018-12-31 15:14:14 +00:00
for validator_index, _ in enumerate(state.validator_registry):
2019-01-17 10:55:05 +00:00
if get_effective_balance(state, validator_index) >= MAX_DEPOSIT_AMOUNT:
2019-01-30 09:25:39 +00:00
activate_validator(state, validator_index, is_genesis=True)
2018-12-10 21:16:06 +00:00
2019-02-01 22:04:17 +00:00
genesis_active_index_root = hash_tree_root(get_active_validator_indices(state.validator_registry, GENESIS_EPOCH))
2019-01-31 15:56:48 +00:00
for index in range(LATEST_ACTIVE_INDEX_ROOTS_LENGTH):
state.latest_active_index_roots[index] = genesis_active_index_root
2019-01-31 16:02:54 +00:00
state.current_shuffling_seed = generate_seed(state, GENESIS_EPOCH)
2018-12-10 21:16:06 +00:00
2018-11-15 13:20:25 +00:00
return state
2018-10-02 15:20:07 +00:00
```
2018-09-20 05:20:49 +00:00
2019-01-28 19:15:43 +00:00
## Beacon chain processing
2018-10-18 02:00:45 +00:00
2019-01-28 19:15:43 +00:00
The beacon chain is the system chain for Ethereum 2.0. The main responsibilities of the beacon chain are:
2018-12-18 17:18:04 +00:00
2019-01-28 19:15:43 +00:00
* Store and maintain the registry of [validators ](#dfn-validator )
* Process crosslinks (see above)
* Process its per-block consensus, as well as the finality gadget
2018-12-18 17:18:04 +00:00
2019-01-28 19:15:43 +00:00
Processing the beacon chain is similar to processing the Ethereum 1.0 chain. Clients download and process blocks, and maintain a view of what is the current "canonical chain", terminating at the current "head". However, because of the beacon chain's relationship with Ethereum 1.0, and because it is a proof-of-stake chain, there are differences.
2018-11-27 03:52:06 +00:00
2019-01-28 19:15:43 +00:00
For a beacon chain block, `block` , to be processed by a node, the following conditions must be met:
2018-12-13 20:03:22 +00:00
2019-03-03 11:04:28 +00:00
* The parent block with root `block.previous_block_root` has been processed and accepted.
2019-01-28 19:15:43 +00:00
* An Ethereum 1.0 block pointed to by the `state.latest_eth1_data.block_hash` has been processed and accepted.
2019-02-15 13:46:47 +00:00
* The node's Unix time is greater than or equal to `state.genesis_time + (block.slot - GENESIS_SLOT) * SECONDS_PER_SLOT` . (Note that leap seconds mean that slots will occasionally last `SECONDS_PER_SLOT + 1` or `SECONDS_PER_SLOT - 1` seconds, possibly several times a year.)
2018-12-10 19:55:11 +00:00
2019-01-28 19:15:43 +00:00
If these conditions are not met, the client should delay processing the beacon block until the conditions are all satisfied.
2018-11-27 19:51:12 +00:00
2019-02-12 22:38:29 +00:00
Beacon block production is significantly different because of the proof of stake mechanism. A client simply checks what it thinks is the canonical chain when it should create a block, and looks up what its slot number is; when the slot arrives, it either proposes or attests to a block as required. Note that this requires each node to have a clock that is roughly (i.e. within `SECONDS_PER_SLOT` seconds) synchronized with the other nodes.
2018-11-30 14:28:33 +00:00
2019-01-28 19:15:43 +00:00
### Beacon chain fork choice rule
2018-12-05 18:40:08 +00:00
2019-01-28 19:15:43 +00:00
The beacon chain fork choice rule is a hybrid that combines justification and finality with Latest Message Driven (LMD) Greediest Heaviest Observed SubTree (GHOST). At any point in time a [validator ](#dfn-validator ) `v` subjectively calculates the beacon chain head as follows.
2018-10-01 22:19:16 +00:00
2019-01-28 19:15:43 +00:00
* Abstractly define `Store` as the type of storage object for the chain data and `store` be the set of attestations and blocks that the [validator ](#dfn-validator ) `v` has observed and verified (in particular, block ancestors must be recursively verified). Attestations not yet included in any chain are still included in `store` .
* Let `finalized_head` be the finalized block with the highest epoch. (A block `B` is finalized if there is a descendant of `B` in `store` the processing of which sets `B` as finalized.)
* Let `justified_head` be the descendant of `finalized_head` with the highest epoch that has been justified for at least 1 epoch. (A block `B` is justified if there is a descendant of `B` in `store` the processing of which sets `B` as justified.) If no such descendant exists set `justified_head` to `finalized_head` .
2019-01-31 15:58:31 +00:00
* Let `get_ancestor(store: Store, block: BeaconBlock, slot: Slot) -> BeaconBlock` be the ancestor of `block` with slot number `slot` . The `get_ancestor` function can be defined recursively as:
2018-12-10 22:42:28 +00:00
2018-12-10 21:16:06 +00:00
```python
2019-01-31 15:58:31 +00:00
def get_ancestor(store: Store, block: BeaconBlock, slot: Slot) -> BeaconBlock:
2019-01-30 09:25:39 +00:00
"""
Get the ancestor of ``block`` with slot number ``slot``; return ``None`` if not found.
"""
2019-01-29 13:17:05 +00:00
if block.slot == slot:
return block
elif block.slot < slot:
return None
else:
return get_ancestor(store, store.get_parent(block), slot)
2018-10-01 22:19:16 +00:00
```
2019-02-06 16:34:19 +00:00
* Let `get_latest_attestation(store: Store, validator_index: ValidatorIndex) -> Attestation` be the attestation with the highest slot number in `store` from the validator with the given `validator_index` . If several such attestations exist, use the one the [validator ](#dfn-validator ) `v` observed first.
* Let `get_latest_attestation_target(store: Store, validator_index: ValidatorIndex) -> BeaconBlock` be the target block in the attestation `get_latest_attestation(store, validator_index)` .
2019-01-28 19:15:43 +00:00
* Let `get_children(store: Store, block: BeaconBlock) -> List[BeaconBlock]` returns the child blocks of the given `block` .
* Let `justified_head_state` be the resulting `BeaconState` object from processing the chain up to the `justified_head` .
* The `head` is `lmd_ghost(store, justified_head_state, justified_head)` where the function `lmd_ghost` is defined below. Note that the implementation below is suboptimal; there are implementations that compute the head in time logarithmic in slot count.
2018-10-11 18:14:48 +00:00
```python
2019-01-28 19:15:43 +00:00
def lmd_ghost(store: Store, start_state: BeaconState, start_block: BeaconBlock) -> BeaconBlock:
2019-01-30 09:25:39 +00:00
"""
Execute the LMD-GHOST algorithm to find the head ``BeaconBlock``.
"""
2019-01-28 19:15:43 +00:00
validators = start_state.validator_registry
2019-02-13 16:38:03 +00:00
active_validator_indices = get_active_validator_indices(validators, slot_to_epoch(start_state.slot))
2019-01-28 19:15:43 +00:00
attestation_targets = [
2019-02-06 16:34:19 +00:00
(validator_index, get_latest_attestation_target(store, validator_index))
for validator_index in active_validator_indices
2019-01-28 19:15:43 +00:00
]
2018-12-11 15:49:50 +00:00
2019-01-28 19:15:43 +00:00
def get_vote_count(block: BeaconBlock) -> int:
2019-02-06 16:34:19 +00:00
return sum(
get_effective_balance(start_state.validator_balances[validator_index]) // FORK_CHOICE_BALANCE_INCREMENT
for validator_index, target in attestation_targets
2019-01-28 19:15:43 +00:00
if get_ancestor(store, target, block.slot) == block
2019-02-06 16:34:19 +00:00
)
2018-12-11 15:49:50 +00:00
2019-01-28 19:15:43 +00:00
head = start_block
while 1:
children = get_children(store, head)
if len(children) == 0:
return head
2019-03-08 08:58:38 +00:00
head = max(children, key=lambda x: (get_vote_count(x), hash_tree_root(x)))
2018-10-11 18:14:48 +00:00
```
2019-01-28 19:15:43 +00:00
## Beacon chain state transition function
2018-12-28 18:04:03 +00:00
2019-03-07 19:05:34 +00:00
We now define the state transition function. At a high level the state transition is made up of four parts:
2018-12-28 18:04:03 +00:00
2019-03-08 16:48:46 +00:00
1. State caching, which happens at the start of every slot.
2019-03-07 19:05:34 +00:00
2. The per-epoch transitions, which happens at the start of the first slot of every epoch.
3. The per-slot transitions, which happens at every slot.
4. The per-block transitions, which happens at every block.
2018-12-28 18:04:03 +00:00
2019-03-07 20:36:22 +00:00
Transition section notes:
2019-03-08 16:48:46 +00:00
* The state caching, caches the state root of the previous slot.
* The per-epoch transitions focus on the [validator ](#dfn-validator ) registry, including adjusting balances and activating and exiting [validators ](#dfn-validator ), as well as processing crosslinks and managing block justification/finalization.
* The per-slot transitions focus on the slot counter and block roots records updates.
2019-03-07 20:36:22 +00:00
* The per-block transitions generally focus on verifying aggregate signatures and saving temporary records relating to the per-block activity in the `BeaconState` .
2018-12-28 18:04:03 +00:00
2019-02-11 21:30:36 +00:00
Beacon blocks that trigger unhandled Python exceptions (e.g. out-of-range list accesses) and failed `assert` s during the state transition are considered invalid.
2019-03-08 16:48:46 +00:00
_Note_: If there are skipped slots between a block and its parent block, run the steps in the [state-root ](#state-caching ), [per-epoch ](#per-epoch-processing ), and [per-slot ](#per-slot-processing ) sections once for each skipped slot and then once for the slot containing the new block.
2018-12-28 18:04:03 +00:00
2019-03-08 16:48:46 +00:00
### State caching
2018-09-20 05:20:49 +00:00
2019-03-03 11:04:28 +00:00
At every `slot > GENESIS_SLOT` run the following function:
2018-12-12 13:02:50 +00:00
2019-03-03 11:04:28 +00:00
```python
2019-03-08 16:48:46 +00:00
def cache_state(state: BeaconState) -> None:
previous_slot_state_root = hash_tree_root(state)
# store the previous slot's post state transition root
state.latest_state_roots[state.slot % SLOTS_PER_HISTORICAL_ROOT] = previous_slot_state_root
# cache state root in stored latest_block_header if empty
if state.latest_block_header.state_root == ZERO_HASH:
state.latest_block_header.state_root = previous_slot_state_root
# store latest known block for previous slot
state.latest_block_roots[state.slot % SLOTS_PER_HISTORICAL_ROOT] = hash_tree_root(state.latest_block_header)
2019-03-03 11:04:28 +00:00
```
2018-09-20 05:20:49 +00:00
2019-03-07 19:05:34 +00:00
### Per-epoch processing
2018-12-10 10:11:41 +00:00
2019-03-07 19:05:34 +00:00
The steps below happen when `state.slot > GENESIS_SLOT and (state.slot + 1) % SLOTS_PER_EPOCH == 0` .
2018-12-10 10:11:41 +00:00
2019-03-07 19:05:34 +00:00
#### Helper functions
We define some helper functions utilized when processing an epoch transition:
2018-09-20 05:20:49 +00:00
2019-03-03 11:04:28 +00:00
```python
2019-03-07 19:05:34 +00:00
def get_current_total_balance(state: BeaconState) -> Gwei:
return get_total_balance(state, get_active_validator_indices(state.validator_registry, get_current_epoch(state)))
2019-03-03 11:04:28 +00:00
```
2018-09-20 05:20:49 +00:00
2019-03-07 19:05:34 +00:00
```python
def get_previous_total_balance(state: BeaconState) -> Gwei:
return get_total_balance(state, get_active_validator_indices(state.validator_registry, get_previous_epoch(state)))
```
2018-10-11 17:57:30 +00:00
2019-03-03 11:04:28 +00:00
```python
2019-03-07 19:05:34 +00:00
def get_attesting_indices(state: BeaconState, attestations: List[PendingAttestation]) -> List[ValidatorIndex]:
output = set()
for a in attestations:
output = output.union(get_attestation_participants(state, a.data, a.aggregation_bitfield))
return sorted(list(output))
2019-03-03 11:04:28 +00:00
```
2018-09-20 05:20:49 +00:00
2019-03-07 19:05:34 +00:00
```python
2019-03-14 00:01:47 +00:00
def get_attesting_balance(state: BeaconState, attestations: List[PendingAttestation]) -> Gwei:
2019-03-07 19:05:34 +00:00
return get_total_balance(state, get_attesting_indices(state, attestations))
```
2018-11-22 23:09:36 +00:00
2019-03-03 11:04:28 +00:00
```python
2019-03-07 19:05:34 +00:00
def get_current_epoch_boundary_attestations(state: BeaconState) -> List[PendingAttestation]:
return [
a for a in state.current_epoch_attestations
2019-03-12 10:17:34 +00:00
if a.data.target_root == get_block_root(state, get_epoch_start_slot(get_current_epoch(state)))
2019-03-07 19:05:34 +00:00
]
2019-03-03 11:04:28 +00:00
```
2018-11-30 14:28:33 +00:00
2019-03-07 19:05:34 +00:00
```python
def get_previous_epoch_boundary_attestations(state: BeaconState) -> List[PendingAttestation]:
return [
a for a in state.previous_epoch_attestations
2019-03-12 10:17:34 +00:00
if a.data.target_root == get_block_root(state, get_epoch_start_slot(get_previous_epoch(state)))
2019-03-07 19:05:34 +00:00
]
```
2018-11-16 12:54:03 +00:00
2019-03-07 19:05:34 +00:00
```python
def get_previous_epoch_matching_head_attestations(state: BeaconState) -> List[PendingAttestation]:
return [
a for a in state.previous_epoch_attestations
if a.data.beacon_block_root == get_block_root(state, a.data.slot)
]
```
2018-11-16 15:48:57 +00:00
2019-03-07 19:05:34 +00:00
**Note**: Total balances computed for the previous epoch might be marginally different than the actual total balances during the previous epoch transition. Due to the tight bound on validator churn each epoch and small per-epoch rewards/penalties, the potential balance difference is very low and only marginally affects consensus safety.
2018-11-16 12:54:03 +00:00
2019-03-07 19:05:34 +00:00
```python
def get_winning_root_and_participants(state: BeaconState, shard: Shard) -> Tuple[Bytes32, List[ValidatorIndex]]:
all_attestations = state.current_epoch_attestations + state.previous_epoch_attestations
valid_attestations = [
2019-03-12 10:17:34 +00:00
a for a in all_attestations if a.data.previous_crosslink == state.latest_crosslinks[shard]
2019-03-07 19:05:34 +00:00
]
all_roots = [a.data.crosslink_data_root for a in valid_attestations]
# handle when no attestations for shard available
if len(all_roots) == 0:
return ZERO_HASH, []
def get_attestations_for(root) -> List[PendingAttestation]:
return [a for a in valid_attestations if a.data.crosslink_data_root == root]
# Winning crosslink root is the root with the most votes for it, ties broken in favor of
# lexicographically higher hash
winning_root = max(all_roots, key=lambda r: (get_attesting_balance(state, get_attestations_for(r)), r))
return winning_root, get_attesting_indices(state, get_attestations_for(winning_root))
```
2018-11-16 12:54:03 +00:00
2019-03-01 02:54:59 +00:00
```python
2019-03-07 19:05:34 +00:00
def earliest_attestation(state: BeaconState, validator_index: ValidatorIndex) -> PendingAttestation:
return min([
a for a in state.previous_epoch_attestations if
validator_index in get_attestation_participants(state, a.data, a.aggregation_bitfield)
], key=lambda a: a.inclusion_slot)
2019-03-01 02:54:59 +00:00
```
2018-11-16 12:54:03 +00:00
2019-03-07 19:05:34 +00:00
```python
def inclusion_slot(state: BeaconState, validator_index: ValidatorIndex) -> Slot:
return earliest_attestation(state, validator_index).inclusion_slot
```
2018-11-16 12:54:03 +00:00
2019-03-07 19:05:34 +00:00
```python
def inclusion_distance(state: BeaconState, validator_index: ValidatorIndex) -> int:
attestation = earliest_attestation(state, validator_index)
return attestation.inclusion_slot - attestation.data.slot
```
2018-11-16 12:54:03 +00:00
2019-03-07 19:05:34 +00:00
#### Justification
Run the following function:
2018-11-16 12:54:03 +00:00
2019-03-01 02:54:59 +00:00
```python
2019-03-07 19:05:34 +00:00
def update_justification_and_finalization(state: BeaconState) -> None:
2019-03-12 10:17:34 +00:00
new_justified_epoch = state.current_justified_epoch
2019-03-12 18:32:11 +00:00
new_finalized_epoch = state.finalized_epoch
2019-03-07 19:05:34 +00:00
# Rotate the justification bitfield up one epoch to make room for the current epoch
state.justification_bitfield < < = 1
# If the previous epoch gets justified, fill the second last bit
previous_boundary_attesting_balance = get_attesting_balance(state, get_previous_epoch_boundary_attestations(state))
if previous_boundary_attesting_balance * 3 >= get_previous_total_balance(state) * 2:
new_justified_epoch = get_current_epoch(state) - 1
state.justification_bitfield |= 2
# If the current epoch gets justified, fill the last bit
current_boundary_attesting_balance = get_attesting_balance(state, get_current_epoch_boundary_attestations(state))
if current_boundary_attesting_balance * 3 >= get_current_total_balance(state) * 2:
new_justified_epoch = get_current_epoch(state)
state.justification_bitfield |= 1
# Process finalizations
bitfield = state.justification_bitfield
current_epoch = get_current_epoch(state)
# The 2nd/3rd/4th most recent epochs are all justified, the 2nd using the 4th as source
if (bitfield >> 1) % 8 == 0b111 and state.previous_justified_epoch == current_epoch - 3:
2019-03-12 18:32:11 +00:00
new_finalized_epoch = state.previous_justified_epoch
2019-03-07 19:05:34 +00:00
# The 2nd/3rd most recent epochs are both justified, the 2nd using the 3rd as source
if (bitfield >> 1) % 4 == 0b11 and state.previous_justified_epoch == current_epoch - 2:
2019-03-12 18:32:11 +00:00
new_finalized_epoch = state.previous_justified_epoch
2019-03-07 19:05:34 +00:00
# The 1st/2nd/3rd most recent epochs are all justified, the 1st using the 3rd as source
2019-03-12 10:17:34 +00:00
if (bitfield >> 0) % 8 == 0b111 and state.current_justified_epoch == current_epoch - 2:
2019-03-12 18:32:11 +00:00
new_finalized_epoch = state.current_justified_epoch
2019-03-07 19:05:34 +00:00
# The 1st/2nd most recent epochs are both justified, the 1st using the 2nd as source
2019-03-12 10:17:34 +00:00
if (bitfield >> 0) % 4 == 0b11 and state.current_justified_epoch == current_epoch - 1:
2019-03-12 18:32:11 +00:00
new_finalized_epoch = state.current_justified_epoch
2019-03-07 19:05:34 +00:00
2019-03-12 18:32:11 +00:00
# Update state jusification/finality fields
2019-03-12 10:17:34 +00:00
state.previous_justified_epoch = state.current_justified_epoch
state.previous_justified_root = state.current_justified_root
if new_justified_epoch != state.current_justified_epoch:
state.current_justified_epoch = new_justified_epoch
state.current_justified_root = get_block_root(state, get_epoch_start_slot(new_justified_epoch))
2019-03-12 18:32:11 +00:00
if new_finalized_epoch != state.finalized_epoch:
state.finalized_epoch = new_finalized_epoch
state.finalized_root = get_block_root(state, get_epoch_start_slot(new_finalized_epoch))
2019-03-01 02:54:59 +00:00
```
2018-09-20 05:20:49 +00:00
2019-03-07 19:05:34 +00:00
#### Crosslinks
2018-11-16 12:54:03 +00:00
2019-03-07 19:05:34 +00:00
Run the following function:
2018-11-20 07:40:04 +00:00
2019-03-07 19:05:34 +00:00
```python
def process_crosslinks(state: BeaconState) -> None:
current_epoch = get_current_epoch(state)
previous_epoch = current_epoch - 1
next_epoch = current_epoch + 1
for slot in range(get_epoch_start_slot(previous_epoch), get_epoch_start_slot(next_epoch)):
for crosslink_committee, shard in get_crosslink_committees_at_slot(state, slot):
winning_root, participants = get_winning_root_and_participants(state, shard)
participating_balance = get_total_balance(state, participants)
total_balance = get_total_balance(state, crosslink_committee)
if 3 * participating_balance >= 2 * total_balance:
state.latest_crosslinks[shard] = Crosslink(
epoch=slot_to_epoch(slot),
crosslink_data_root=winning_root
)
```
#### Eth1 data
Run the following function:
2018-09-20 05:20:49 +00:00
2019-03-01 13:59:52 +00:00
```python
2019-03-02 01:17:07 +00:00
def maybe_reset_eth1_period(state: BeaconState) -> None:
2019-03-01 13:59:52 +00:00
if (get_current_epoch(state) + 1) % EPOCHS_PER_ETH1_VOTING_PERIOD == 0:
for eth1_data_vote in state.eth1_data_votes:
# If a majority of all votes were for a particular eth1_data value,
# then set that as the new canonical value
if eth1_data_vote.vote_count * 2 > EPOCHS_PER_ETH1_VOTING_PERIOD * SLOTS_PER_EPOCH:
state.latest_eth1_data = eth1_data_vote.eth1_data
state.eth1_data_votes = []
```
2018-12-05 11:22:15 +00:00
2019-01-28 19:15:43 +00:00
#### Rewards and penalties
2018-12-12 15:07:44 +00:00
2018-12-12 15:14:44 +00:00
First, we define some additional helpers:
2019-03-01 13:59:52 +00:00
```python
2019-03-02 01:17:07 +00:00
def get_base_reward(state: BeaconState, index: ValidatorIndex) -> Gwei:
2019-03-05 02:05:00 +00:00
if get_previous_total_balance(state) == 0:
return 0
2019-03-01 13:59:52 +00:00
adjusted_quotient = integer_squareroot(get_previous_total_balance(state)) // BASE_REWARD_QUOTIENT
return get_effective_balance(state, index) // adjusted_quotient // 5
```
```python
2019-03-08 19:14:21 +00:00
def get_inactivity_penalty(state: BeaconState, index: ValidatorIndex, epochs_since_finality: int) -> Gwei:
2019-03-01 13:59:52 +00:00
return (
2019-03-02 01:17:07 +00:00
get_base_reward(state, index) +
2019-03-01 13:59:52 +00:00
get_effective_balance(state, index) * epochs_since_finality // INACTIVITY_PENALTY_QUOTIENT // 2
)
```
2018-12-12 15:14:44 +00:00
2019-02-11 01:43:56 +00:00
Note: When applying penalties in the following balance recalculations implementers should make sure the `uint64` does not underflow.
2019-01-28 19:15:43 +00:00
##### Justification and finalization
2018-09-20 05:20:49 +00:00
2019-03-01 13:59:52 +00:00
```python
2019-03-04 16:45:55 +00:00
def get_justification_and_finalization_deltas(state: BeaconState) -> Tuple[List[Gwei], List[Gwei]]:
2019-03-01 13:59:52 +00:00
epochs_since_finality = get_current_epoch(state) + 1 - state.finalized_epoch
2019-03-02 01:34:26 +00:00
if epochs_since_finality < = 4:
return compute_normal_justification_and_finalization_deltas(state)
else:
return compute_inactivity_leak_deltas(state)
```
When blocks are finalizing normally...
```python
2019-03-04 16:45:55 +00:00
def compute_normal_justification_and_finalization_deltas(state: BeaconState) -> Tuple[List[Gwei], List[Gwei]]:
# deltas[0] for rewards
# deltas[1] for penalties
deltas = [
[0 for index in range(len(state.validator_registry))],
[0 for index in range(len(state.validator_registry))]
]
2019-03-01 13:59:52 +00:00
# Some helper variables
boundary_attestations = get_previous_epoch_boundary_attestations(state)
2019-03-05 00:11:38 +00:00
boundary_attesting_balance = get_attesting_balance(state, boundary_attestations)
2019-03-01 13:59:52 +00:00
total_balance = get_previous_total_balance(state)
2019-03-05 01:53:31 +00:00
total_attesting_balance = get_attesting_balance(state, state.previous_epoch_attestations)
2019-03-02 01:34:26 +00:00
matching_head_attestations = get_previous_epoch_matching_head_attestations(state)
2019-03-05 00:11:38 +00:00
matching_head_balance = get_attesting_balance(state, matching_head_attestations)
2019-03-02 01:34:26 +00:00
# Process rewards or penalties for all validators
2019-03-05 01:53:31 +00:00
for index in get_active_validator_indices(state.validator_registry, get_previous_epoch(state)):
2019-03-02 01:34:26 +00:00
# Expected FFG source
2019-03-05 00:17:31 +00:00
if index in get_attesting_indices(state, state.previous_epoch_attestations):
2019-03-04 16:45:55 +00:00
deltas[0][index] += get_base_reward(state, index) * total_attesting_balance // total_balance
2019-03-02 01:34:26 +00:00
# Inclusion speed bonus
2019-03-04 16:45:55 +00:00
deltas[0][index] += (
2019-03-02 01:34:26 +00:00
get_base_reward(state, index) * MIN_ATTESTATION_INCLUSION_DELAY //
inclusion_distance(state, index)
)
else:
2019-03-04 16:45:55 +00:00
deltas[1][index] += get_base_reward(state, index)
2019-03-02 01:34:26 +00:00
# Expected FFG target
2019-03-05 00:17:31 +00:00
if index in get_attesting_indices(state, boundary_attestations):
2019-03-04 16:45:55 +00:00
deltas[0][index] += get_base_reward(state, index) * boundary_attesting_balance // total_balance
2019-03-02 01:34:26 +00:00
else:
2019-03-04 16:45:55 +00:00
deltas[1][index] += get_base_reward(state, index)
2019-03-02 01:34:26 +00:00
# Expected head
2019-03-05 00:17:31 +00:00
if index in get_attesting_indices(state, matching_head_attestations):
2019-03-04 16:45:55 +00:00
deltas[0][index] += get_base_reward(state, index) * matching_head_balance // total_balance
2019-03-02 01:34:26 +00:00
else:
2019-03-04 16:45:55 +00:00
deltas[1][index] += get_base_reward(state, index)
2019-03-02 01:34:26 +00:00
# Proposer bonus
2019-03-08 19:07:57 +00:00
if index in get_attesting_indices(state, state.previous_epoch_attestations):
proposer_index = get_beacon_proposer_index(state, inclusion_slot(state, index))
deltas[0][proposer_index] += get_base_reward(state, index) // ATTESTATION_INCLUSION_REWARD_QUOTIENT
2019-03-05 02:07:24 +00:00
return deltas
2019-03-02 01:34:26 +00:00
```
When blocks are not finalizing normally...
2019-03-07 19:05:34 +00:00
2019-03-02 01:34:26 +00:00
```python
2019-03-04 16:45:55 +00:00
def compute_inactivity_leak_deltas(state: BeaconState) -> Tuple[List[Gwei], List[Gwei]]:
# deltas[0] for rewards
# deltas[1] for penalties
deltas = [
[0 for index in range(len(state.validator_registry))],
[0 for index in range(len(state.validator_registry))]
]
2019-03-02 01:34:26 +00:00
boundary_attestations = get_previous_epoch_boundary_attestations(state)
matching_head_attestations = get_previous_epoch_matching_head_attestations(state)
2019-03-03 09:58:18 +00:00
active_validator_indices = get_active_validator_indices(state.validator_registry, get_previous_epoch(state))
2019-03-02 01:34:26 +00:00
epochs_since_finality = get_current_epoch(state) + 1 - state.finalized_epoch
for index in active_validator_indices:
2019-03-05 01:53:31 +00:00
if index not in get_attesting_indices(state, state.previous_epoch_attestations):
2019-03-04 16:45:55 +00:00
deltas[1][index] += get_inactivity_penalty(state, index, epochs_since_finality)
2019-03-02 01:34:26 +00:00
else:
# If a validator did attest, apply a small penalty for getting attestations included late
2019-03-04 16:45:55 +00:00
deltas[0][index] += (
2019-03-06 14:29:06 +00:00
get_base_reward(state, index) * MIN_ATTESTATION_INCLUSION_DELAY //
2019-03-02 01:34:26 +00:00
inclusion_distance(state, index)
)
2019-03-06 14:29:06 +00:00
deltas[1][index] += get_base_reward(state, index)
2019-03-05 00:17:31 +00:00
if index not in get_attesting_indices(state, boundary_attestations):
2019-03-04 16:45:55 +00:00
deltas[1][index] += get_inactivity_penalty(state, index, epochs_since_finality)
2019-03-05 00:17:31 +00:00
if index not in get_attesting_indices(state, matching_head_attestations):
2019-03-04 16:45:55 +00:00
deltas[1][index] += get_base_reward(state, index)
2019-03-02 01:34:26 +00:00
# Penalize slashed-but-inactive validators as though they were active but offline
for index in range(len(state.validator_registry)):
2019-03-07 07:21:17 +00:00
eligible = (
index not in active_validator_indices and
state.validator_registry[index].slashed and
get_current_epoch(state) < state.validator_registry [ index ] . withdrawable_epoch
)
if eligible:
2019-03-04 16:45:55 +00:00
deltas[1][index] += (
2019-03-02 01:34:26 +00:00
2 * get_inactivity_penalty(state, index, epochs_since_finality) +
get_base_reward(state, index)
)
2019-03-01 13:59:52 +00:00
return deltas
```
2018-09-20 05:20:49 +00:00
2019-03-01 13:59:52 +00:00
##### Crosslinks
2018-12-12 15:07:44 +00:00
2019-03-01 13:59:52 +00:00
```python
2019-03-04 16:45:55 +00:00
def get_crosslink_deltas(state: BeaconState) -> Tuple[List[Gwei], List[Gwei]]:
# deltas[0] for rewards
# deltas[1] for penalties
deltas = [
[0 for index in range(len(state.validator_registry))],
[0 for index in range(len(state.validator_registry))]
]
2019-03-03 09:59:12 +00:00
previous_epoch_start_slot = get_epoch_start_slot(get_previous_epoch(state))
current_epoch_start_slot = get_epoch_start_slot(get_current_epoch(state))
for slot in range(previous_epoch_start_slot, current_epoch_start_slot):
2019-03-01 13:59:52 +00:00
for crosslink_committee, shard in get_crosslink_committees_at_slot(state, slot):
winning_root, participants = get_winning_root_and_participants(state, shard)
participating_balance = get_total_balance(state, participants)
2019-03-05 15:51:34 +00:00
total_balance = get_total_balance(state, crosslink_committee)
2019-03-01 13:59:52 +00:00
for index in crosslink_committee:
if index in participants:
2019-03-04 16:45:55 +00:00
deltas[0][index] += get_base_reward(state, index) * participating_balance // total_balance
2019-03-01 13:59:52 +00:00
else:
2019-03-04 16:45:55 +00:00
deltas[1][index] += get_base_reward(state, index)
2019-03-01 13:59:52 +00:00
return deltas
```
2018-10-01 22:19:16 +00:00
2019-03-01 13:59:52 +00:00
#### Apply rewards
2018-09-20 05:20:49 +00:00
2019-03-01 13:59:52 +00:00
Run the following:
2018-09-20 05:20:49 +00:00
2019-03-01 13:59:52 +00:00
```python
2019-03-02 01:17:07 +00:00
def apply_rewards(state: BeaconState) -> None:
2019-03-01 13:59:52 +00:00
deltas1 = get_justification_and_finalization_deltas(state)
deltas2 = get_crosslink_deltas(state)
for i in range(len(state.validator_registry)):
2019-03-04 16:45:55 +00:00
state.validator_balances[i] = max(
0,
state.validator_balances[i] + deltas1[0][i] + deltas2[0][i] - deltas1[1][i] - deltas2[1][i]
)
2019-03-01 13:59:52 +00:00
```
2018-11-23 04:54:11 +00:00
2019-01-28 19:15:43 +00:00
#### Ejections
2018-12-13 19:45:08 +00:00
2019-03-07 19:05:34 +00:00
Run `process_ejections(state)` .
2018-12-13 19:45:08 +00:00
```python
def process_ejections(state: BeaconState) -> None:
"""
Iterate through the validator registry
and eject active validators with balance below ``EJECTION_BALANCE``.
"""
2019-03-05 02:09:31 +00:00
for index in get_active_validator_indices(state.validator_registry, get_current_epoch(state)):
2019-01-17 10:55:05 +00:00
if state.validator_balances[index] < EJECTION_BALANCE:
2019-03-15 13:05:46 +00:00
initiate_validator_exit(state, index)
2018-12-13 19:45:08 +00:00
```
2019-01-28 19:15:43 +00:00
#### Validator registry and shuffling seed data
2018-09-20 05:20:49 +00:00
2019-03-02 01:49:28 +00:00
```python
def should_update_validator_registry(state: BeaconState) -> bool:
# Must have finalized a new block
if state.finalized_epoch < = state.validator_registry_update_epoch:
return False
# Must have processed new crosslinks on all shards of the current epoch
2019-03-03 12:01:03 +00:00
shards_to_check = [
2019-03-02 01:49:28 +00:00
(state.current_shuffling_start_shard + i) % SHARD_COUNT
for i in range(get_current_epoch_committee_count(state))
]
for shard in shards_to_check:
if state.latest_crosslinks[shard].epoch < = state.validator_registry_update_epoch:
return False
return True
```
2018-12-05 11:22:15 +00:00
```python
2018-12-06 22:12:33 +00:00
def update_validator_registry(state: BeaconState) -> None:
2018-12-05 20:35:58 +00:00
"""
2018-12-06 22:12:33 +00:00
Update validator registry.
2018-12-05 20:35:58 +00:00
Note that this function mutates ``state``.
"""
2019-01-26 22:27:50 +00:00
current_epoch = get_current_epoch(state)
2018-11-30 14:28:33 +00:00
# The active validators
2019-01-26 22:27:50 +00:00
active_validator_indices = get_active_validator_indices(state.validator_registry, current_epoch)
2018-12-04 19:49:26 +00:00
# The total effective balance of active validators
2019-02-03 10:43:33 +00:00
total_balance = get_total_balance(state, active_validator_indices)
2018-12-10 19:55:11 +00:00
2018-12-04 19:49:26 +00:00
# The maximum balance churn in Gwei (for deposits and exits separately)
max_balance_churn = max(
2019-01-17 10:55:05 +00:00
MAX_DEPOSIT_AMOUNT,
2018-12-04 19:49:26 +00:00
total_balance // (2 * MAX_BALANCE_CHURN_QUOTIENT)
2018-10-01 22:19:16 +00:00
)
2018-12-04 19:49:26 +00:00
# Activate validators within the allowable balance churn
balance_churn = 0
2018-12-10 22:30:25 +00:00
for index, validator in enumerate(state.validator_registry):
2019-02-21 21:34:11 +00:00
if validator.activation_epoch == FAR_FUTURE_EPOCH and state.validator_balances[index] >= MAX_DEPOSIT_AMOUNT:
2018-12-04 19:49:26 +00:00
# Check the balance churn would be within the allowance
2018-12-17 14:10:44 +00:00
balance_churn += get_effective_balance(state, index)
2018-12-04 19:49:26 +00:00
if balance_churn > max_balance_churn:
break
# Activate validator
2019-01-30 09:25:39 +00:00
activate_validator(state, index, is_genesis=False)
2018-12-04 19:49:26 +00:00
2018-12-10 19:55:11 +00:00
# Exit validators within the allowable balance churn
2019-03-19 19:25:34 +00:00
if current_epoch < state.validator_registry_update_epoch + LATEST_SLASHED_EXIT_LENGTH:
2019-03-16 11:23:41 +00:00
balance_churn = (
state.latest_slashed_balances[state.validator_registry_update_epoch % LATEST_SLASHED_EXIT_LENGTH] -
state.latest_slashed_balances[current_epoch % LATEST_SLASHED_EXIT_LENGTH]
)
2018-12-04 19:49:26 +00:00
2019-03-16 11:23:41 +00:00
for index, validator in enumerate(state.validator_registry):
if validator.exit_epoch == FAR_FUTURE_EPOCH and validator.initiated_exit:
# Check the balance churn would be within the allowance
balance_churn += get_effective_balance(state, index)
if balance_churn > max_balance_churn:
break
# Exit validator
exit_validator(state, index)
2019-03-07 19:05:34 +00:00
state.validator_registry_update_epoch = current_epoch
```
Run the following function:
```python
def update_registry_and_shuffling_data(state: BeaconState) -> None:
# First set previous shuffling data to current shuffling data
state.previous_shuffling_epoch = state.current_shuffling_epoch
state.previous_shuffling_start_shard = state.current_shuffling_start_shard
state.previous_shuffling_seed = state.current_shuffling_seed
current_epoch = get_current_epoch(state)
next_epoch = current_epoch + 1
# Check if we should update, and if so, update
if should_update_validator_registry(state):
update_validator_registry(state)
# If we update the registry, update the shuffling data and shards as well
state.current_shuffling_epoch = next_epoch
state.current_shuffling_start_shard = (
state.current_shuffling_start_shard +
get_current_epoch_committee_count(state) % SHARD_COUNT
)
state.current_shuffling_seed = generate_seed(state, state.current_shuffling_epoch)
else:
# If processing at least one crosslink keeps failing, then reshuffle every power of two,
# but don't update the current_shuffling_start_shard
epochs_since_last_registry_update = current_epoch - state.validator_registry_update_epoch
if epochs_since_last_registry_update > 1 and is_power_of_two(epochs_since_last_registry_update):
state.current_shuffling_epoch = next_epoch
state.current_shuffling_seed = generate_seed(state, state.current_shuffling_epoch)
```
**Invariant**: the active index root that is hashed into the shuffling seed actually is the `hash_tree_root` of the validator set that is used for that epoch.
#### Slashings and exit queue
Run `process_slashings(state)` and `process_exit_queue(state)` :
```python
def process_slashings(state: BeaconState) -> None:
"""
Process the slashings.
Note that this function mutates ``state``.
"""
current_epoch = get_current_epoch(state)
active_validator_indices = get_active_validator_indices(state.validator_registry, current_epoch)
total_balance = get_total_balance(state, active_validator_indices)
# Compute `total_penalties`
2019-03-15 13:54:33 +00:00
total_at_start = state.latest_slashed_balances[(current_epoch + 1) % LATEST_SLASHED_EXIT_LENGTH]
2019-03-07 22:13:06 +00:00
total_at_end = state.latest_slashed_balances[current_epoch % LATEST_SLASHED_EXIT_LENGTH]
2019-03-07 19:05:34 +00:00
total_penalties = total_at_end - total_at_start
for index, validator in enumerate(state.validator_registry):
if validator.slashed and current_epoch == validator.withdrawable_epoch - LATEST_SLASHED_EXIT_LENGTH // 2:
penalty = max(
get_effective_balance(state, index) * min(total_penalties * 3, total_balance) // total_balance,
get_effective_balance(state, index) // MIN_PENALTY_QUOTIENT
)
state.validator_balances[index] -= penalty
```
```python
def process_exit_queue(state: BeaconState) -> None:
"""
Process the exit queue.
Note that this function mutates ``state``.
"""
def eligible(index):
validator = state.validator_registry[index]
# Filter out dequeued validators
if validator.withdrawable_epoch != FAR_FUTURE_EPOCH:
return False
# Dequeue if the minimum amount of time has passed
else:
return get_current_epoch(state) >= validator.exit_epoch + MIN_VALIDATOR_WITHDRAWABILITY_DELAY
eligible_indices = filter(eligible, list(range(len(state.validator_registry))))
# Sort in order of exit epoch, and validators that exit within the same epoch exit in order of validator index
sorted_indices = sorted(eligible_indices, key=lambda index: state.validator_registry[index].exit_epoch)
for dequeues, index in enumerate(sorted_indices):
if dequeues >= MAX_EXIT_DEQUEUES_PER_EPOCH:
break
prepare_validator_for_withdrawal(state, index)
```
#### Final updates
Run the following function:
```python
def finish_epoch_update(state: BeaconState) -> None:
current_epoch = get_current_epoch(state)
next_epoch = current_epoch + 1
# Set active index root
index_root_position = (next_epoch + ACTIVATION_EXIT_DELAY) % LATEST_ACTIVE_INDEX_ROOTS_LENGTH
state.latest_active_index_roots[index_root_position] = hash_tree_root(
get_active_validator_indices(state.validator_registry, next_epoch + ACTIVATION_EXIT_DELAY)
)
# Set total slashed balances
state.latest_slashed_balances[next_epoch % LATEST_SLASHED_EXIT_LENGTH] = (
state.latest_slashed_balances[current_epoch % LATEST_SLASHED_EXIT_LENGTH]
)
# Set randao mix
state.latest_randao_mixes[next_epoch % LATEST_RANDAO_MIXES_LENGTH] = get_randao_mix(state, current_epoch)
# Set historical root accumulator
if next_epoch % (SLOTS_PER_HISTORICAL_ROOT // SLOTS_PER_EPOCH) == 0:
2019-03-08 17:13:05 +00:00
historical_batch = HistoricalBatch(
block_roots=state.latest_block_roots,
state_roots=state.latest_state_roots,
)
state.historical_roots.append(hash_tree_root(historical_batch))
2019-03-07 19:05:34 +00:00
# Rotate current/previous epoch attestations
state.previous_epoch_attestations = state.current_epoch_attestations
state.current_epoch_attestations = []
```
### Per-slot processing
At every `slot > GENESIS_SLOT` run the following function:
```python
def advance_slot(state: BeaconState) -> None:
2019-03-08 08:08:30 +00:00
state.slot += 1
2019-03-07 19:05:34 +00:00
```
### Per-block processing
For every `block` except the genesis block, run `process_block_header(state, block)` , `process_randao(state, block)` and `process_eth1_data(state, block)` .
#### Block header
```python
def process_block_header(state: BeaconState, block: BeaconBlock) -> None:
# Verify that the slots match
assert block.slot == state.slot
# Verify that the parent matches
assert block.previous_block_root == hash_tree_root(state.latest_block_header)
# Save current block as the new latest block
state.latest_block_header = get_temporary_block_header(block)
# Verify proposer signature
proposer = state.validator_registry[get_beacon_proposer_index(state, state.slot)]
assert bls_verify(
pubkey=proposer.pubkey,
message_hash=signed_root(block),
signature=block.signature,
domain=get_domain(state.fork, get_current_epoch(state), DOMAIN_BEACON_BLOCK)
)
```
#### RANDAO
```python
def process_randao(state: BeaconState, block: BeaconBlock) -> None:
proposer = state.validator_registry[get_beacon_proposer_index(state, state.slot)]
# Verify that the provided randao value is valid
assert bls_verify(
pubkey=proposer.pubkey,
message_hash=hash_tree_root(get_current_epoch(state)),
signature=block.body.randao_reveal,
domain=get_domain(state.fork, get_current_epoch(state), DOMAIN_RANDAO)
)
# Mix it in
state.latest_randao_mixes[get_current_epoch(state) % LATEST_RANDAO_MIXES_LENGTH] = (
xor(get_randao_mix(state, get_current_epoch(state)),
hash(block.body.randao_reveal))
)
```
#### Eth1 data
```python
def process_eth1_data(state: BeaconState, block: BeaconBlock) -> None:
for eth1_data_vote in state.eth1_data_votes:
# If someone else has already voted for the same hash, add to its counter
if eth1_data_vote.eth1_data == block.body.eth1_data:
eth1_data_vote.vote_count += 1
return
# If we're seeing this hash for the first time, make a new counter
state.eth1_data_votes.append(Eth1DataVote(eth1_data=block.body.eth1_data, vote_count=1))
```
#### Transactions
##### Proposer slashings
Verify that `len(block.body.proposer_slashings) <= MAX_PROPOSER_SLASHINGS` .
For each `proposer_slashing` in `block.body.proposer_slashings` , run the following function:
```python
def process_proposer_slashing(state: BeaconState,
proposer_slashing: ProposerSlashing) -> None:
"""
Process ``ProposerSlashing`` transaction.
Note that this function mutates ``state``.
"""
proposer = state.validator_registry[proposer_slashing.proposer_index]
2019-03-12 15:49:04 +00:00
# Verify that the epoch is the same
2019-03-12 12:24:37 +00:00
assert slot_to_epoch(proposer_slashing.header_1.slot) == slot_to_epoch(proposer_slashing.header_2.slot)
2019-03-08 17:34:51 +00:00
# But the headers are different
assert proposer_slashing.header_1 != proposer_slashing.header_2
2019-03-07 19:05:34 +00:00
# Proposer is not yet slashed
assert proposer.slashed is False
# Signatures are valid
for header in (proposer_slashing.header_1, proposer_slashing.header_2):
assert bls_verify(
pubkey=proposer.pubkey,
message_hash=signed_root(header),
signature=header.signature,
domain=get_domain(state.fork, slot_to_epoch(header.slot), DOMAIN_BEACON_BLOCK)
)
slash_validator(state, proposer_slashing.proposer_index)
```
##### Attester slashings
2018-12-10 21:16:06 +00:00
2019-03-07 19:05:34 +00:00
Verify that `len(block.body.attester_slashings) <= MAX_ATTESTER_SLASHINGS` .
2018-10-01 22:19:16 +00:00
2019-03-07 19:05:34 +00:00
For each `attester_slashing` in `block.body.attester_slashings` , run the following function:
2019-01-08 00:53:33 +00:00
2019-03-02 01:49:28 +00:00
```python
2019-03-07 19:05:34 +00:00
def process_attester_slashing(state: BeaconState,
attester_slashing: AttesterSlashing) -> None:
"""
Process ``AttesterSlashing`` transaction.
Note that this function mutates ``state``.
"""
attestation1 = attester_slashing.slashable_attestation_1
attestation2 = attester_slashing.slashable_attestation_2
# Check that the attestations are conflicting
assert attestation1.data != attestation2.data
assert (
is_double_vote(attestation1.data, attestation2.data) or
is_surround_vote(attestation1.data, attestation2.data)
)
assert verify_slashable_attestation(state, attestation1)
assert verify_slashable_attestation(state, attestation2)
slashable_indices = [
index for index in attestation1.validator_indices
if (
index in attestation2.validator_indices and
state.validator_registry[index].slashed is False
2019-03-02 01:49:28 +00:00
)
2019-03-07 19:05:34 +00:00
]
assert len(slashable_indices) >= 1
for index in slashable_indices:
slash_validator(state, index)
2019-03-02 01:49:28 +00:00
```
2019-01-19 03:06:21 +00:00
2019-03-07 19:05:34 +00:00
##### Attestations
2019-01-08 00:53:33 +00:00
2019-03-07 19:05:34 +00:00
Verify that `len(block.body.attestations) <= MAX_ATTESTATIONS` .
2019-03-02 01:49:28 +00:00
2019-03-07 19:05:34 +00:00
For each `attestation` in `block.body.attestations` , run the following function:
2018-11-05 12:37:07 +00:00
2018-12-28 18:04:03 +00:00
```python
2019-03-07 19:05:34 +00:00
def process_attestation(state: BeaconState, attestation: Attestation) -> None:
2019-01-30 09:25:39 +00:00
"""
2019-03-07 19:05:34 +00:00
Process ``Attestation`` transaction.
2019-01-30 09:25:39 +00:00
Note that this function mutates ``state``.
"""
2019-03-15 12:40:52 +00:00
assert max(GENESIS_SLOT, state.slot - SLOTS_PER_EPOCH) < = attestation.data.slot
assert attestation.data.slot < = state.slot - MIN_ATTESTATION_INCLUSION_DELAY
2019-03-15 12:51:46 +00:00
# Check target epoch, source epoch, and source root
target_epoch = slot_to_epoch(attestation.data.slot)
assert (target_epoch, attestation.data.source_epoch, attestation.data.source_root) in {
2019-03-15 12:40:52 +00:00
(get_current_epoch(state), state.current_justified_epoch, state.current_justified_root),
(get_previous_epoch(state), state.previous_justified_epoch, state.previous_justified_root),
}
# Check crosslink data
assert attestation.data.crosslink_data_root == ZERO_HASH # [to be removed in phase 1]
assert state.latest_crosslinks[attestation.data.shard] in {
attestation.data.previous_crosslink, # Case 1: latest crosslink matches previous crosslink
Crosslink( # Case 2: latest crosslink matches current crosslink
2019-03-07 19:05:34 +00:00
crosslink_data_root=attestation.data.crosslink_data_root,
2019-03-15 12:51:46 +00:00
epoch=target_epoch,
2019-03-15 12:40:52 +00:00
),
2019-03-07 19:05:34 +00:00
}
2019-03-15 12:40:52 +00:00
# Check custody bits [to be generalised in phase 1]
2019-03-07 19:05:34 +00:00
assert attestation.custody_bitfield == b'\x00' * len(attestation.custody_bitfield)
2019-03-03 09:58:45 +00:00
2019-03-15 12:40:52 +00:00
# Check aggregate signature [to be generalised in phase 1]
participants = get_attestation_participants(state, attestation.data, attestation.aggregation_bitfield)
assert len(participants) != 0
assert bls_verify(
pubkey=bls_aggregate_pubkeys([state.validator_registry[i].pubkey for i in participants]),
message_hash=hash_tree_root(AttestationDataAndCustodyBit(data=attestation.data, custody_bit=0b0)),
2019-03-07 19:05:34 +00:00
signature=attestation.aggregate_signature,
2019-03-15 12:51:46 +00:00
domain=get_domain(state.fork, target_epoch, DOMAIN_ATTESTATION),
2019-03-07 19:05:34 +00:00
)
2019-03-15 12:40:52 +00:00
# Cache pending attestation
2019-03-07 19:05:34 +00:00
pending_attestation = PendingAttestation(
data=attestation.data,
aggregation_bitfield=attestation.aggregation_bitfield,
custody_bitfield=attestation.custody_bitfield,
inclusion_slot=state.slot
)
2019-03-15 12:51:46 +00:00
if target_epoch == get_current_epoch(state):
2019-03-07 19:05:34 +00:00
state.current_epoch_attestations.append(pending_attestation)
2019-03-15 12:40:52 +00:00
else:
2019-03-07 19:05:34 +00:00
state.previous_epoch_attestations.append(pending_attestation)
2019-02-12 12:24:19 +00:00
```
2019-03-07 19:05:34 +00:00
##### Deposits
Verify that `len(block.body.deposits) <= MAX_DEPOSITS` .
For each `deposit` in `block.body.deposits` , run `process_deposit(state, deposit)` .
##### Voluntary exits
Verify that `len(block.body.voluntary_exits) <= MAX_VOLUNTARY_EXITS` .
For each `exit` in `block.body.voluntary_exits` , run the following function:
2019-02-12 12:24:19 +00:00
```python
2019-03-10 12:50:28 +00:00
def process_voluntary_exit(state: BeaconState, exit: VoluntaryExit) -> None:
2019-02-12 12:24:19 +00:00
"""
2019-03-07 19:05:34 +00:00
Process ``VoluntaryExit`` transaction.
2019-02-12 12:24:19 +00:00
Note that this function mutates ``state``.
"""
2019-03-07 19:05:34 +00:00
validator = state.validator_registry[exit.validator_index]
# Verify the validator has not yet exited
2019-03-10 12:49:37 +00:00
assert validator.exit_epoch == FAR_FUTURE_EPOCH
# Verify the validator has not initiated an exit
assert validator.initiated_exit is False
2019-03-07 19:05:34 +00:00
# Exits must specify an epoch when they become valid; they are not valid before then
assert get_current_epoch(state) >= exit.epoch
2019-03-08 22:16:06 +00:00
# Must have been in the validator set long enough
assert get_current_epoch(state) - validator.activation_epoch >= PERSISTENT_COMMITTEE_PERIOD
2019-03-07 19:05:34 +00:00
# Verify signature
assert bls_verify(
pubkey=validator.pubkey,
message_hash=signed_root(exit),
signature=exit.signature,
domain=get_domain(state.fork, exit.epoch, DOMAIN_VOLUNTARY_EXIT)
)
# Run the exit
initiate_validator_exit(state, exit.validator_index)
2018-10-01 22:19:16 +00:00
```
2018-11-07 16:47:27 +00:00
2019-03-07 19:05:34 +00:00
##### Transfers
2018-09-20 05:20:49 +00:00
2019-03-07 19:05:34 +00:00
Note: Transfers are a temporary functionality for phases 0 and 1, to be removed in phase 2.
Verify that `len(block.body.transfers) <= MAX_TRANSFERS` and that all transfers are distinct.
For each `transfer` in `block.body.transfers` , run the following function:
2019-03-02 01:49:28 +00:00
```python
2019-03-07 19:05:34 +00:00
def process_transfer(state: BeaconState, transfer: Transfer) -> None:
"""
Process ``Transfer`` transaction.
Note that this function mutates ``state``.
"""
# Verify the amount and fee aren't individually too big (for anti-overflow purposes)
assert state.validator_balances[transfer.sender] >= max(transfer.amount, transfer.fee)
# Verify that we have enough ETH to send, and that after the transfer the balance will be either
# exactly zero or at least MIN_DEPOSIT_AMOUNT
assert (
state.validator_balances[transfer.sender] == transfer.amount + transfer.fee or
state.validator_balances[transfer.sender] >= transfer.amount + transfer.fee + MIN_DEPOSIT_AMOUNT
2019-03-02 01:49:28 +00:00
)
2019-03-07 19:05:34 +00:00
# A transfer is valid in only one slot
assert state.slot == transfer.slot
# Only withdrawn or not-yet-deposited accounts can transfer
assert (
get_current_epoch(state) >= state.validator_registry[transfer.sender].withdrawable_epoch or
state.validator_registry[transfer.sender].activation_epoch == FAR_FUTURE_EPOCH
2019-03-02 01:49:28 +00:00
)
2019-03-07 19:05:34 +00:00
# Verify that the pubkey is valid
assert (
state.validator_registry[transfer.sender].withdrawal_credentials ==
BLS_WITHDRAWAL_PREFIX_BYTE + hash(transfer.pubkey)[1:]
)
# Verify that the signature is valid
assert bls_verify(
pubkey=transfer.pubkey,
message_hash=signed_root(transfer),
signature=transfer.signature,
domain=get_domain(state.fork, slot_to_epoch(transfer.slot), DOMAIN_TRANSFER)
)
# Process the transfer
state.validator_balances[transfer.sender] -= transfer.amount + transfer.fee
state.validator_balances[transfer.recipient] += transfer.amount
state.validator_balances[get_beacon_proposer_index(state, state.slot)] += transfer.fee
2019-03-02 01:49:28 +00:00
```
2018-10-18 17:54:57 +00:00
2019-03-07 19:05:34 +00:00
#### State root verification
Verify the block's `state_root` by running the following function:
2018-12-05 19:03:24 +00:00
2019-03-07 19:05:34 +00:00
```python
def verify_block_state_root(state: BeaconState, block: BeaconBlock) -> None:
assert block.state_root == hash_tree_root(state)
```
2018-09-26 15:30:24 +00:00
2018-11-29 16:12:12 +00:00
# References
This section is divided into Normative and Informative references. Normative references are those that must be read in order to implement this specification, while Informative references are merely that, information. An example of the former might be the details of a required consensus algorithm, and an example of the latter might be a pointer to research that demonstrates why a particular consensus algorithm might be better suited for inclusion in the standard than another.
## Normative
## Informative
2019-01-21 19:55:49 +00:00
< a id = "ref-casper-ffg" ></ a > _**casper-ffg**_ </ br > _Casper the Friendly Finality Gadget_ . V. Buterin and V. Griffith. URL: https://arxiv.org/abs/1710.09437
2018-11-29 16:12:12 +00:00
2019-01-21 19:55:49 +00:00
< a id = "ref-python-poc" ></ a > _**python-poc**_ </ br > _Python proof-of-concept implementation_ . Ethereum Foundation. URL: https://github.com/ethereum/beacon_chain
2018-11-29 16:12:12 +00:00
2018-11-28 07:23:37 +00:00
# Copyright
2018-09-22 07:06:53 +00:00
Copyright and related rights waived via [CC0 ](https://creativecommons.org/publicdomain/zero/1.0/ ).