ethereum.forks.arrow_glacier.fork

Ethereum Specification.

.. contents:: Table of Contents :backlinks: none :local:

Introduction

Entry point for the Ethereum specification.

BLOCK_REWARD

72
BLOCK_REWARD = U256(2 * 10**18)

BASE_FEE_MAX_CHANGE_DENOMINATOR

73
BASE_FEE_MAX_CHANGE_DENOMINATOR = Uint(8)

ELASTICITY_MULTIPLIER

74
ELASTICITY_MULTIPLIER = Uint(2)

MINIMUM_DIFFICULTY

75
MINIMUM_DIFFICULTY = Uint(131072)

MAX_OMMER_DEPTH

76
MAX_OMMER_DEPTH = Uint(6)

BOMB_DELAY_BLOCKS

77
BOMB_DELAY_BLOCKS = 10700000

EMPTY_OMMER_HASH

78
EMPTY_OMMER_HASH = keccak256(rlp.encode([]))

BlockChain

History and current state of the block chain.

81
@final
82
@dataclass
class BlockChain:

blocks

88
    blocks: List[Block]

state

89
    state: State

chain_id

90
    chain_id: U64

apply_fork

Transforms the state from the previous hard fork (old) into the block chain object for this hard fork and returns it.

When forks need to implement an irregular state transition, this function is used to handle the irregularity. See the :ref:DAO Fork <dao-fork> for an example.

Parameters

old : Previous block chain object.

Returns

new : BlockChain Upgraded block chain object for this hard fork.

def apply_fork(old: BlockChain) -> BlockChain:
94
    <snip>
113
    return old

get_last_256_block_hashes

Obtain the list of hashes of the previous 256 blocks in order of increasing block number.

This function will return less hashes for the first 256 blocks.

The BLOCKHASH opcode needs to access the latest hashes on the chain, therefore this function retrieves them.

Parameters

chain : History and current state.

Returns

recent_block_hashes : List[Hash32] Hashes of the recent 256 blocks in order of increasing block number.

def get_last_256_block_hashes(chain: BlockChain) -> List[Hash32]:
117
    <snip>
137
    recent_blocks = chain.blocks[-255:]
138
    # TODO: This function has not been tested rigorously
139
    if len(recent_blocks) == 0:
140
        return []
141
142
    recent_block_hashes = []
143
144
    for block in recent_blocks:
145
        prev_block_hash = block.header.parent_hash
146
        recent_block_hashes.append(prev_block_hash)
147
148
    # We are computing the hash only for the most recent block and not for
149
    # the rest of the blocks as they have successors which have the hash of
150
    # the current block as parent hash.
151
    most_recent_block_hash = keccak256(rlp.encode(recent_blocks[-1].header))
152
    recent_block_hashes.append(most_recent_block_hash)
153
154
    return recent_block_hashes

state_transition

Attempts to apply a block to an existing block chain.

All parts of the block's contents need to be verified before being added to the chain. Blocks are verified by ensuring that the contents of the block make logical sense with the contents of the parent block. The information in the block's header must also match the corresponding information in the block.

To implement Ethereum, in theory clients are only required to store the most recent 255 blocks of the chain since as far as execution is concerned, only those blocks are accessed. Practically, however, clients should store more blocks to handle reorgs.

Parameters

chain : History and current state. block : Block to apply to chain.

def state_transition(chain: BlockChain, ​​block: Block) -> None:
158
    <snip>
180
    validate_header(chain, block.header)
181
    validate_ommers(block.ommers, block.header, chain)
182
183
    block_state = BlockState(pre_state=chain.state)
184
185
    block_env = vm.BlockEnvironment(
186
        chain_id=chain.chain_id,
187
        state=block_state,
188
        block_gas_limit=block.header.gas_limit,
189
        block_hashes=get_last_256_block_hashes(chain),
190
        coinbase=block.header.coinbase,
191
        number=block.header.number,
192
        base_fee_per_gas=block.header.base_fee_per_gas,
193
        time=block.header.timestamp,
194
        difficulty=block.header.difficulty,
195
    )
196
197
    block_output = apply_body(
198
        block_env=block_env,
199
        transactions=block.transactions,
200
        ommers=block.ommers,
201
    )
202
    block_diff = extract_block_diff(block_state)
203
    block_state_root = chain.state.compute_state_root(block_diff)
204
    transactions_root = root(block_output.transactions_trie)
205
    receipt_root = root(block_output.receipts_trie)
206
    block_logs_bloom = logs_bloom(block_output.block_logs)
207
208
    if block_output.block_gas_used != block.header.gas_used:
209
        raise InvalidBlock(
210
            f"{block_output.block_gas_used} != {block.header.gas_used}"
211
        )
212
    if transactions_root != block.header.transactions_root:
213
        raise InvalidBlock
214
    if block_state_root != block.header.state_root:
215
        raise InvalidBlock
216
    if receipt_root != block.header.receipt_root:
217
        raise InvalidBlock
218
    if block_logs_bloom != block.header.bloom:
219
        raise InvalidBlock
220
221
    apply_changes_to_state(chain.state, block_diff)
222
    chain.blocks.append(block)
223
    if len(chain.blocks) > 255:
224
        # Real clients have to store more blocks to deal with reorgs, but the
225
        # protocol only requires the last 255
226
        chain.blocks = chain.blocks[-255:]

calculate_base_fee_per_gas

Calculates the base fee per gas for the block.

Parameters

block_gas_limit : Gas limit of the block for which the base fee is being calculated. parent_gas_limit : Gas limit of the parent block. parent_gas_used : Gas used in the parent block. parent_base_fee_per_gas : Base fee per gas of the parent block.

Returns

base_fee_per_gas : Uint Base fee per gas for the block.

def calculate_base_fee_per_gas(block_gas_limit: Uint, ​​parent_gas_limit: Uint, ​​parent_gas_used: Uint, ​​parent_base_fee_per_gas: Uint) -> Uint:
235
    <snip>
255
    parent_gas_target = parent_gas_limit // ELASTICITY_MULTIPLIER
256
    if not check_gas_limit(block_gas_limit, parent_gas_limit):
257
        raise InvalidBlock
258
259
    if parent_gas_used == parent_gas_target:
260
        expected_base_fee_per_gas = parent_base_fee_per_gas
261
    elif parent_gas_used > parent_gas_target:
262
        gas_used_delta = parent_gas_used - parent_gas_target
263
264
        parent_fee_gas_delta = parent_base_fee_per_gas * gas_used_delta
265
        target_fee_gas_delta = parent_fee_gas_delta // parent_gas_target
266
267
        base_fee_per_gas_delta = max(
268
            target_fee_gas_delta // BASE_FEE_MAX_CHANGE_DENOMINATOR,
269
            Uint(1),
270
        )
271
272
        expected_base_fee_per_gas = (
273
            parent_base_fee_per_gas + base_fee_per_gas_delta
274
        )
275
    else:
276
        gas_used_delta = parent_gas_target - parent_gas_used
277
278
        parent_fee_gas_delta = parent_base_fee_per_gas * gas_used_delta
279
        target_fee_gas_delta = parent_fee_gas_delta // parent_gas_target
280
281
        base_fee_per_gas_delta = (
282
            target_fee_gas_delta // BASE_FEE_MAX_CHANGE_DENOMINATOR
283
        )
284
285
        expected_base_fee_per_gas = (
286
            parent_base_fee_per_gas - base_fee_per_gas_delta
287
        )
288
289
    return Uint(expected_base_fee_per_gas)

validate_header

Verifies a block header.

In order to consider a block's header valid, the logic for the quantities in the header should match the logic for the block itself. For example the header timestamp should be greater than the block's parent timestamp because the block was created after the parent block. Additionally, the block's number should be directly following the parent block's number since it is the next block in the sequence.

Parameters

chain : History and current state. header : Header to check for correctness.

def validate_header(chain: BlockChain, ​​header: Header) -> None:
293
    <snip>
311
    if header.number < Uint(1):
312
        raise InvalidBlock
313
    parent_header_number = header.number - Uint(1)
314
    first_block_number = chain.blocks[0].header.number
315
    last_block_number = chain.blocks[-1].header.number
316
317
    if (
318
        parent_header_number < first_block_number
319
        or parent_header_number > last_block_number
320
    ):
321
        raise InvalidBlock
322
323
    parent_header = chain.blocks[
324
        parent_header_number - first_block_number
325
    ].header
326
327
    if header.gas_used > header.gas_limit:
328
        raise InvalidBlock
329
330
    expected_base_fee_per_gas = calculate_base_fee_per_gas(
331
        header.gas_limit,
332
        parent_header.gas_limit,
333
        parent_header.gas_used,
334
        parent_header.base_fee_per_gas,
335
    )
336
    if expected_base_fee_per_gas != header.base_fee_per_gas:
337
        raise InvalidBlock
338
339
    parent_has_ommers = parent_header.ommers_hash != EMPTY_OMMER_HASH
340
    if header.timestamp <= parent_header.timestamp:
341
        raise InvalidBlock
342
    if header.number != parent_header.number + Uint(1):
343
        raise InvalidBlock
344
    if len(header.extra_data) > 32:
345
        raise InvalidBlock
346
347
    block_difficulty = calculate_block_difficulty(
348
        header.number,
349
        header.timestamp,
350
        parent_header.timestamp,
351
        parent_header.difficulty,
352
        parent_has_ommers,
353
    )
354
    if header.difficulty != block_difficulty:
355
        raise InvalidBlock
356
357
    block_parent_hash = keccak256(rlp.encode(parent_header))
358
    if header.parent_hash != block_parent_hash:
359
        raise InvalidBlock
360
361
    validate_proof_of_work(header)

generate_header_hash_for_pow

Generate rlp hash of the header which is to be used for Proof-of-Work verification.

In other words, the PoW artefacts mix_digest and nonce are ignored while calculating this hash.

A particular PoW is valid for a single hash, that hash is computed by this function. The nonce and mix_digest are omitted from this hash because they are being changed by miners in their search for a sufficient proof-of-work.

Parameters

header : The header object for which the hash is to be generated.

Returns

hash : Hash32 The PoW valid rlp hash of the passed in header.

def generate_header_hash_for_pow(header: Header) -> Hash32:
365
    <snip>
388
    header_data_without_pow_artefacts = (
389
        header.parent_hash,
390
        header.ommers_hash,
391
        header.coinbase,
392
        header.state_root,
393
        header.transactions_root,
394
        header.receipt_root,
395
        header.bloom,
396
        header.difficulty,
397
        header.number,
398
        header.gas_limit,
399
        header.gas_used,
400
        header.timestamp,
401
        header.extra_data,
402
        header.base_fee_per_gas,
403
    )
404
405
    return keccak256(rlp.encode(header_data_without_pow_artefacts))

validate_proof_of_work

Validates the Proof of Work constraints.

In order to verify that a miner's proof-of-work is valid for a block, a mix-digest and result are calculated using the hashimoto_light hash function. The mix digest is a hash of the header and the nonce that is passed through and it confirms whether or not proof-of-work was done on the correct block. The result is the actual hash value of the block.

Parameters

header : Header of interest.

def validate_proof_of_work(header: Header) -> None:
409
    <snip>
424
    header_hash = generate_header_hash_for_pow(header)
425
    # TODO: Memoize this somewhere and read from that data instead of
426
    # calculating cache for every block validation.
427
    cache = generate_cache(header.number)
428
    mix_digest, result = hashimoto_light(
429
        header_hash, header.nonce, cache, dataset_size(header.number)
430
    )
431
    if mix_digest != header.mix_digest:
432
        raise InvalidBlock
433
434
    limit = Uint(U256.MAX_VALUE) + Uint(1)
435
    if Uint.from_be_bytes(result) > (limit // header.difficulty):
436
        raise InvalidBlock

check_transaction

Check if the transaction is includable in the block.

Parameters

block_env : The block scoped environment. block_output : The block output for the current block. tx : The transaction. tx_state : The transaction state tracker.

Returns

sender_address : The sender of the transaction. effective_gas_price : The price to charge for gas when the transaction is executed.

Raises

InvalidBlock : If the transaction is not includable. GasUsedExceedsLimitError : If the gas used by the transaction exceeds the block's gas limit. NonceMismatchError : If the nonce of the transaction is not equal to the sender's nonce. InsufficientBalanceError : If the sender's balance is not enough to pay for the transaction. InvalidSenderError : If the transaction is from an address that does not exist anymore. PriorityFeeGreaterThanMaxFeeError : If the priority fee is greater than the maximum fee per gas. InsufficientMaxFeePerGasError : If the maximum fee per gas is insufficient for the transaction.

def check_transaction(block_env: ethereum.forks.arrow_glacier.vm.BlockEnvironment, ​​block_output: ethereum.forks.arrow_glacier.vm.BlockOutput, ​​tx: Transaction, ​​tx_state: TransactionState) -> Tuple[Address, Uint]:
445
    <snip>
484
    gas_available = block_env.block_gas_limit - block_output.block_gas_used
485
    if tx.gas > gas_available:
486
        raise GasUsedExceedsLimitError("gas used exceeds limit")
487
    tx_chain_id = chain_id(tx)
488
    if tx_chain_id is not None and tx_chain_id != block_env.chain_id:
489
        raise WrongChainIdError(
490
            expected=block_env.chain_id,
491
            actual=tx_chain_id,
492
        )
493
494
    sender_address = recover_sender(tx)
495
    sender_account = get_account(tx_state, sender_address)
496
497
    if isinstance(tx, FeeMarketTransaction):
498
        if tx.max_fee_per_gas < tx.max_priority_fee_per_gas:
499
            raise PriorityFeeGreaterThanMaxFeeError(
500
                "priority fee greater than max fee"
501
            )
502
        if tx.max_fee_per_gas < block_env.base_fee_per_gas:
503
            raise InsufficientMaxFeePerGasError(
504
                tx.max_fee_per_gas, block_env.base_fee_per_gas
505
            )
506
507
        priority_fee_per_gas = min(
508
            tx.max_priority_fee_per_gas,
509
            tx.max_fee_per_gas - block_env.base_fee_per_gas,
510
        )
511
        effective_gas_price = priority_fee_per_gas + block_env.base_fee_per_gas
512
        max_gas_fee = tx.gas * tx.max_fee_per_gas
513
    else:
514
        if tx.gas_price < block_env.base_fee_per_gas:
515
            raise InvalidBlock
516
        effective_gas_price = tx.gas_price
517
        max_gas_fee = tx.gas * tx.gas_price
518
519
    if sender_account.nonce > Uint(tx.nonce):
520
        raise NonceMismatchError("nonce too low")
521
    elif sender_account.nonce < Uint(tx.nonce):
522
        raise NonceMismatchError("nonce too high")
523
    if Uint(sender_account.balance) < max_gas_fee + Uint(tx.value):
524
        raise InsufficientBalanceError("insufficient sender balance")
525
    if sender_account.code_hash != EMPTY_CODE_HASH:
526
        raise InvalidSenderError("not EOA")
527
528
    return sender_address, effective_gas_price

make_receipt

Make the receipt for a transaction that was executed.

Parameters

tx : The executed transaction. error : Error in the top level frame of the transaction, if any. cumulative_gas_used : The total gas used so far in the block after the transaction was executed. logs : The logs produced by the transaction.

Returns

receipt : The receipt for the transaction.

def make_receipt(tx: Transaction, ​​error: Optional[EthereumException], ​​cumulative_gas_used: Uint, ​​logs: Tuple[Log, ...]) -> Bytes | Receipt:
537
    <snip>
558
    receipt = Receipt(
559
        succeeded=error is None,
560
        cumulative_gas_used=cumulative_gas_used,
561
        bloom=logs_bloom(logs),
562
        logs=logs,
563
    )
564
565
    return encode_receipt(tx, receipt)

apply_body

Executes a block.

Many of the contents of a block are stored in data structures called tries. There is a transactions trie which is similar to a ledger of the transactions stored in the current block. There is also a receipts trie which stores the results of executing a transaction, like the post state and gas used. This function creates and executes the block that is to be added to the chain.

Parameters

block_env : The block scoped environment. transactions : Transactions included in the block. ommers : Headers of ancestor blocks which are not direct parents (formerly uncles.)

Returns

block_output : The block output for the current block.

def apply_body(block_env: ethereum.forks.arrow_glacier.vm.BlockEnvironment, ​​transactions: Tuple[LegacyTransaction | Bytes, ...], ​​ommers: Tuple[Header, ...]) -> ethereum.forks.arrow_glacier.vm.BlockOutput:
573
    <snip>
599
    block_output = vm.BlockOutput()
600
601
    for i, tx in enumerate(map(decode_transaction, transactions)):
602
        process_transaction(block_env, block_output, tx, Uint(i))
603
604
    pay_rewards(block_env, ommers)
605
606
    return block_output

validate_ommers

Validates the ommers mentioned in the block.

An ommer block is a block that wasn't canonically added to the blockchain because it wasn't validated as fast as the canonical block but was mined at the same time.

To be considered valid, the ommers must adhere to the rules defined in the Ethereum protocol. The maximum amount of ommers is 2 per block and there cannot be duplicate ommers in a block. Many of the other ommer constraints are listed in the in-line comments of this function.

Parameters

ommers : List of ommers mentioned in the current block. block_header: The header of current block. chain : History and current state.

def validate_ommers(ommers: Tuple[Header, ...], ​​block_header: Header, ​​chain: BlockChain) -> None:
612
    <snip>
634
    block_hash = keccak256(rlp.encode(block_header))
635
    if keccak256(rlp.encode(ommers)) != block_header.ommers_hash:
636
        raise InvalidBlock
637
638
    if len(ommers) == 0:
639
        # Nothing to validate
640
        return
641
642
    # Check that each ommer satisfies the constraints of a header
643
    for ommer in ommers:
644
        if Uint(1) > ommer.number or ommer.number >= block_header.number:
645
            raise InvalidBlock
646
        validate_header(chain, ommer)
647
    if len(ommers) > 2:
648
        raise InvalidBlock
649
650
    ommers_hashes = [keccak256(rlp.encode(ommer)) for ommer in ommers]
651
    if len(ommers_hashes) != len(set(ommers_hashes)):
652
        raise InvalidBlock
653
654
    recent_canonical_blocks = chain.blocks[-(MAX_OMMER_DEPTH + Uint(1)) :]
655
    recent_canonical_block_hashes = {
656
        keccak256(rlp.encode(block.header))
657
        for block in recent_canonical_blocks
658
    }
659
    recent_ommers_hashes: Set[Hash32] = set()
660
    for block in recent_canonical_blocks:
661
        recent_ommers_hashes = recent_ommers_hashes.union(
662
            {keccak256(rlp.encode(ommer)) for ommer in block.ommers}
663
        )
664
665
    for ommer_index, ommer in enumerate(ommers):
666
        ommer_hash = ommers_hashes[ommer_index]
667
        if ommer_hash == block_hash:
668
            raise InvalidBlock
669
        if ommer_hash in recent_canonical_block_hashes:
670
            raise InvalidBlock
671
        if ommer_hash in recent_ommers_hashes:
672
            raise InvalidBlock
673
674
        # Ommer age with respect to the current block. For example, an age of
675
        # 1 indicates that the ommer is a sibling of previous block.
676
        ommer_age = block_header.number - ommer.number
677
        if Uint(1) > ommer_age or ommer_age > MAX_OMMER_DEPTH:
678
            raise InvalidBlock
679
        if ommer.parent_hash not in recent_canonical_block_hashes:
680
            raise InvalidBlock
681
        if ommer.parent_hash == block_header.parent_hash:
682
            raise InvalidBlock

pay_rewards

Pay rewards to the block miner as well as the ommers miners.

The miner of the canonical block is rewarded with the predetermined block reward, BLOCK_REWARD, plus a variable award based off of the number of ommer blocks that were mined around the same time, and included in the canonical block's header. An ommer block is a block that wasn't added to the canonical blockchain because it wasn't validated as fast as the accepted block but was mined at the same time. Although not all blocks that are mined are added to the canonical chain, miners are still paid a reward for their efforts. This reward is called an ommer reward and is calculated based on the number associated with the ommer block that they mined.

Parameters

block_env : The block scoped environment. ommers : List of ommers mentioned in the current block.

def pay_rewards(block_env: ethereum.forks.arrow_glacier.vm.BlockEnvironment, ​​ommers: Tuple[Header, ...]) -> None:
689
    <snip>
711
    rewards_state = TransactionState(parent=block_env.state)
712
    ommer_count = U256(len(ommers))
713
    miner_reward = BLOCK_REWARD + (ommer_count * (BLOCK_REWARD // U256(32)))
714
    create_ether(rewards_state, block_env.coinbase, miner_reward)
715
716
    for ommer in ommers:
717
        # Ommer age with respect to the current block.
718
        ommer_age = U256(block_env.number - ommer.number)
719
        ommer_miner_reward = ((U256(8) - ommer_age) * BLOCK_REWARD) // U256(8)
720
        create_ether(rewards_state, ommer.coinbase, ommer_miner_reward)
721
722
    incorporate_tx_into_block(rewards_state)

process_transaction

Execute a transaction against the provided environment.

This function processes the actions needed to execute a transaction. It decrements the sender's account balance after calculating the gas fee and refunds them the proper amount after execution. Calling contracts, deploying code, and incrementing nonces are all examples of actions that happen within this function or from a call made within this function.

Accounts that are marked for deletion are processed and destroyed after execution.

Parameters

block_env : Environment for the Ethereum Virtual Machine. block_output : The block output for the current block. tx : Transaction to execute. index: Index of the transaction in the block.

def process_transaction(block_env: ethereum.forks.arrow_glacier.vm.BlockEnvironment, ​​block_output: ethereum.forks.arrow_glacier.vm.BlockOutput, ​​tx: Transaction, ​​index: Uint) -> None:
731
    <snip>
755
    tx_state = TransactionState(parent=block_env.state)
756
757
    trie_set(
758
        block_output.transactions_trie,
759
        rlp.encode(index),
760
        encode_transaction(tx),
761
    )
762
763
    intrinsic_gas = validate_transaction(tx)
764
765
    (
766
        sender,
767
        effective_gas_price,
768
    ) = check_transaction(
769
        block_env=block_env,
770
        block_output=block_output,
771
        tx=tx,
772
        tx_state=tx_state,
773
    )
774
775
    sender_account = get_account(tx_state, sender)
776
777
    effective_gas_fee = tx.gas * effective_gas_price
778
779
    gas = tx.gas - intrinsic_gas
780
    increment_nonce(tx_state, sender)
781
782
    sender_balance_after_gas_fee = (
783
        Uint(sender_account.balance) - effective_gas_fee
784
    )
785
    set_account_balance(tx_state, sender, U256(sender_balance_after_gas_fee))
786
787
    access_list_addresses = set()
788
    access_list_storage_keys = set()
789
    if isinstance(tx, (AccessListTransaction, FeeMarketTransaction)):
790
        for access in tx.access_list:
791
            access_list_addresses.add(access.account)
792
            for slot in access.slots:
793
                access_list_storage_keys.add((access.account, slot))
794
795
    tx_env = vm.TransactionEnvironment(
796
        origin=sender,
797
        gas_price=effective_gas_price,
798
        gas=gas,
799
        access_list_addresses=access_list_addresses,
800
        access_list_storage_keys=access_list_storage_keys,
801
        state=tx_state,
802
        index_in_block=index,
803
        tx_hash=get_transaction_hash(encode_transaction(tx)),
804
    )
805
806
    message = prepare_message(block_env, tx_env, tx)
807
808
    tx_output = process_message_call(message)
809
810
    tx_gas_used_before_refund = tx.gas - tx_output.gas_left
811
    tx_gas_refund = min(
812
        tx_gas_used_before_refund // Uint(5), Uint(tx_output.refund_counter)
813
    )
814
    tx_gas_used_after_refund = tx_gas_used_before_refund - tx_gas_refund
815
    tx_gas_left = tx.gas - tx_gas_used_after_refund
816
    gas_refund_amount = tx_gas_left * effective_gas_price
817
818
    # For non-1559 transactions effective_gas_price == tx.gas_price
819
    priority_fee_per_gas = effective_gas_price - block_env.base_fee_per_gas
820
    transaction_fee = tx_gas_used_after_refund * priority_fee_per_gas
821
822
    # refund gas
823
    create_ether(tx_state, sender, U256(gas_refund_amount))
824
825
    # transfer miner fees
826
    coinbase_balance_after_mining_fee = get_account(
827
        tx_state, block_env.coinbase
828
    ).balance + U256(transaction_fee)
829
    if coinbase_balance_after_mining_fee != 0:
830
        set_account_balance(
831
            tx_state,
832
            block_env.coinbase,
833
            coinbase_balance_after_mining_fee,
834
        )
835
    elif account_exists_and_is_empty(tx_state, block_env.coinbase):
836
        destroy_account(tx_state, block_env.coinbase)
837
838
    for address in tx_output.accounts_to_delete:
839
        destroy_account(tx_state, address)
840
841
    destroy_touched_empty_accounts(tx_state, tx_output.touched_accounts)
842
843
    block_output.block_gas_used += tx_gas_used_after_refund
844
845
    receipt = make_receipt(
846
        tx, tx_output.error, block_output.block_gas_used, tx_output.logs
847
    )
848
849
    receipt_key = rlp.encode(Uint(index))
850
    block_output.receipt_keys += (receipt_key,)
851
852
    trie_set(
853
        block_output.receipts_trie,
854
        receipt_key,
855
        receipt,
856
    )
857
858
    block_output.block_logs += tx_output.logs
859
860
    incorporate_tx_into_block(tx_state)

check_gas_limit

Validates the gas limit for a block.

The bounds of the gas limit, max_adjustment_delta, is set as the quotient of the parent block's gas limit and the LIMIT_ADJUSTMENT_FACTOR. Therefore, if the gas limit that is passed through as a parameter is greater than or equal to the sum of the parent's gas and the adjustment delta then the limit for gas is too high and fails this function's check. Similarly, if the limit is less than or equal to the difference of the parent's gas and the adjustment delta or the predefined LIMIT_MINIMUM then this function's check fails because the gas limit doesn't allow for a sufficient or reasonable amount of gas to be used on a block.

Parameters

gas_limit : Gas limit to validate.

parent_gas_limit : Gas limit of the parent block.

Returns

check : bool True if gas limit constraints are satisfied, False otherwise.

def check_gas_limit(gas_limit: Uint, ​​parent_gas_limit: Uint) -> bool:
864
    <snip>
892
    max_adjustment_delta = parent_gas_limit // GasCosts.LIMIT_ADJUSTMENT_FACTOR
893
    if gas_limit >= parent_gas_limit + max_adjustment_delta:
894
        return False
895
    if gas_limit <= parent_gas_limit - max_adjustment_delta:
896
        return False
897
    if gas_limit < GasCosts.LIMIT_MINIMUM:
898
        return False
899
900
    return True

calculate_block_difficulty

Computes difficulty of a block using its header and parent header.

The difficulty is determined by the time the block was created after its parent. The offset is calculated using the parent block's difficulty, parent_difficulty, and the timestamp between blocks. This offset is then added to the parent difficulty and is stored as the difficulty variable. If the time between the block and its parent is too short, the offset will result in a positive number thus making the sum of parent_difficulty and offset to be a greater value in order to avoid mass forking. But, if the time is long enough, then the offset results in a negative value making the block less difficult than its parent.

The base standard for a block's difficulty is the predefined value set for the genesis block since it has no parent. So, a block can't be less difficult than the genesis block, therefore each block's difficulty is set to the maximum value between the calculated difficulty and the MINIMUM_DIFFICULTY.

Parameters

block_number : Block number of the block. block_timestamp : Timestamp of the block. parent_timestamp : Timestamp of the parent block. parent_difficulty : difficulty of the parent block. parent_has_ommers: does the parent have ommers.

Returns

difficulty : ethereum.base_types.Uint Computed difficulty for a block.

def calculate_block_difficulty(block_number: Uint, ​​block_timestamp: U256, ​​parent_timestamp: U256, ​​parent_difficulty: Uint, ​​parent_has_ommers: bool) -> Uint:
910
    <snip>
949
    offset = (
950
        int(parent_difficulty)
951
        // 2048
952
        * max(
953
            (2 if parent_has_ommers else 1)
954
            - int(block_timestamp - parent_timestamp) // 9,
955
            -99,
956
        )
957
    )
958
    difficulty = int(parent_difficulty) + offset
959
    # Historical Note: The difficulty bomb was not present in Ethereum at the
960
    # start of Frontier, but was added shortly after launch. However since the
961
    # bomb has no effect prior to block 200000 we pretend it existed from
962
    # genesis.
963
    # See https://github.com/ethereum/go-ethereum/pull/1588
964
    num_bomb_periods = ((int(block_number) - BOMB_DELAY_BLOCKS) // 100000) - 2
965
    if num_bomb_periods >= 0:
966
        difficulty += 2**num_bomb_periods
967
968
    # Some clients raise the difficulty to `MINIMUM_DIFFICULTY` prior to adding
969
    # the bomb. This bug does not matter because the difficulty is always much
970
    # greater than `MINIMUM_DIFFICULTY` on Mainnet.
971
    return Uint(max(difficulty, int(MINIMUM_DIFFICULTY)))