AlertSourceDiscuss
Skip to content

EIP-2935: Save historical block hashes in state

🚧 StagnantCore

Stagnant

This EIP has had no recent activity for at least 6 months, and has automatically been marked as stagnant. This EIP should not be used in production.

If you are interested in helping move this EIP to final, create a PR to move this EIP back to Draft and add yourself as an author, and an EIP editor will help guide you through the process. Thank you!

AuthorsVitalik Buterin (@vbuterin), Tomasz Stanczak (@tkstanczak)
Created2020-09-03

Simple Summary ​

Store historical block hashes in a contract, and modify the BLOCKHASH (0x40) opcode to read this contract.

Motivation ​

There is increasingly a desire to remove the need for most clients to store history older than some relatively short duration (often between 1 week and 1 year) to save disk space. This requires some form of layer-2 network to help clients access historical information. These protocols can be made much simpler if blocks contained a quick Merkle path to historical blocks.

Additional secondary motivations include:

  • The protocol can be used to make more secure efficient light clients with flyclient-like technology (while the "optimal" flyclient protocol is fairly complex, large security gains over the status quo (trusted "canonical hash trees") can be made cheaply)
  • Improving cleanness of the protocol, as the BLOCKHASH opcode would then access state and not history.

Specification ​

ParameterValue
FORK_BLKNUMTBD
HISTORY_STORAGE_ADDRESS0xfffffffffffffffffffffffffffffffffffffffe

At the start of processing any block where block.number > FORK_BLKNUM (ie. before processing any transactions), run sstore(HISTORY_STORAGE_ADDRESS, block.number - 1, block.prevhash).

When block.number > FORK_BLKNUM + 256, change the logic of the BLOCKHASH opcode as follows: if FORK_BLKNUM <= arg < block.number, return sload(HISTORY_STORAGE_ADDRESS, arg). Otherwise return 0.

Rationale ​

Very similar ideas were proposed before in EIP-98 and EIP-210. This EIP is a simplification, removing two sources of needless complexity:

  1. Having a tree-like structure with multiple layers as opposed to a single list
  2. Writing the EIP in EVM code

The former was intended to save space. Since then, however, storage usage has increased massively, to the point where even eg. 5 million new storage slots are fairly negligible compared to existing usage. The latter was intended as a first step toward "writing the Ethereum protocol in EVM" as much as possible, but this goal has since been de-facto abandoned.

Backwards Compatibility ​

The range of BLOCKHASH is increased by this opcode, but behavior within the previous 256-block range remains unchanged.

Test Cases ​

TBD

Implementation ​

TBD

Security Considerations ​

Adding ~2.5 million storage slots per year bloats the state somewhat (but not much relative to the hundreds of millions of existing state objects). However, this EIP is not intended to be permanent; when eth1 is merged into eth2, the BLOCKHASH opcode would likely be repurposed to use eth2's built-in history accumulator structure (see phase 0 spec).

Copyright and related rights waived via CC0.

Citation

Please cite this document as:

Vitalik Buterin, Tomasz Stanczak, "EIP-2935: Save historical block hashes in state[DRAFT]," Ethereum Improvement Proposals, no. 2935, 2020. [Online serial]. Available: https://eips.ethereum.org/EIPS/eip-2935.