Compare
Four documents, the same five questions.
No throughput league table and no yield. The cells are what this library is willing to say about the text.
| Question | Serve historical block hashes from state |
|---|---|
| What the text proposes | EIP 2935, Serve historical block hashes from state. Store last HISTORY_SERVE_WINDOW historical block hashes in the storage of a system contract as part of the block processing logic. |
| Who may write | Vitalik Buterin , Tomasz Stanczak , Guillaume Ballet , Gajinder Singh , Tanishq Jasoria , Ignacio Hagopian , Jochem Brouwer , Sina Mahmoodi |
| What is settled | Store last HISTORY_SERVE_WINDOW historical block hashes in the storage of a system contract as part of the block processing logic. |
| Load-bearing assumption | A gas or opcode change is not a throughput benchmark. It is a relative price and a validity rule. |
| What this library says afterwards | Status in the source: Final. A reading of the public specification, not a copy of it and not a certification. |
| Rights | Official external source only |