ethereum.forks.byzantium.fork

Ethereum Specification.

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

Introduction

Entry point for the Ethereum specification.

BLOCK_REWARD

57
BLOCK_REWARD = U256(3 * 10**18)

MINIMUM_DIFFICULTY

58
MINIMUM_DIFFICULTY = Uint(131072)

MAX_OMMER_DEPTH

59
MAX_OMMER_DEPTH = Uint(6)

BOMB_DELAY_BLOCKS

60
BOMB_DELAY_BLOCKS = 3000000

EMPTY_OMMER_HASH

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

BlockChain

History and current state of the block chain.

64
@dataclass
class BlockChain:

blocks

70
    blocks: List[Block]

state

71
    state: State

chain_id

72
    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:
76
    """
77
    Transforms the state from the previous hard fork (`old`) into the block
78
    chain object for this hard fork and returns it.
79
80
    When forks need to implement an irregular state transition, this function
81
    is used to handle the irregularity. See the :ref:`DAO Fork <dao-fork>` for
82
    an example.
83
84
    Parameters
85
    ----------
86
    old :
87
        Previous block chain object.
88
89
    Returns
90
    -------
91
    new : `BlockChain`
92
        Upgraded block chain object for this hard fork.
93
94
    """
95
    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]:
99
    """
100
    Obtain the list of hashes of the previous 256 blocks in order of
101
    increasing block number.
102
103
    This function will return less hashes for the first 256 blocks.
104
105
    The ``BLOCKHASH`` opcode needs to access the latest hashes on the chain,
106
    therefore this function retrieves them.
107
108
    Parameters
109
    ----------
110
    chain :
111
        History and current state.
112
113
    Returns
114
    -------
115
    recent_block_hashes : `List[Hash32]`
116
        Hashes of the recent 256 blocks in order of increasing block number.
117
118
    """
119
    recent_blocks = chain.blocks[-255:]
120
    # TODO: This function has not been tested rigorously
121
    if len(recent_blocks) == 0:
122
        return []
123
124
    recent_block_hashes = []
125
126
    for block in recent_blocks:
127
        prev_block_hash = block.header.parent_hash
128
        recent_block_hashes.append(prev_block_hash)
129
130
    # We are computing the hash only for the most recent block and not for
131
    # the rest of the blocks as they have successors which have the hash of
132
    # the current block as parent hash.
133
    most_recent_block_hash = keccak256(rlp.encode(recent_blocks[-1].header))
134
    recent_block_hashes.append(most_recent_block_hash)
135
136
    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:
140
    """
141
    Attempts to apply a block to an existing block chain.
142
143
    All parts of the block's contents need to be verified before being added
144
    to the chain. Blocks are verified by ensuring that the contents of the
145
    block make logical sense with the contents of the parent block. The
146
    information in the block's header must also match the corresponding
147
    information in the block.
148
149
    To implement Ethereum, in theory clients are only required to store the
150
    most recent 255 blocks of the chain since as far as execution is
151
    concerned, only those blocks are accessed. Practically, however, clients
152
    should store more blocks to handle reorgs.
153
154
    Parameters
155
    ----------
156
    chain :
157
        History and current state.
158
    block :
159
        Block to apply to `chain`.
160
161
    """
162
    validate_header(chain, block.header)
163
    validate_ommers(block.ommers, block.header, chain)
164
165
    block_env = vm.BlockEnvironment(
166
        chain_id=chain.chain_id,
167
        state=chain.state,
168
        block_gas_limit=block.header.gas_limit,
169
        block_hashes=get_last_256_block_hashes(chain),
170
        coinbase=block.header.coinbase,
171
        number=block.header.number,
172
        time=block.header.timestamp,
173
        difficulty=block.header.difficulty,
174
    )
175
176
    block_output = apply_body(
177
        block_env=block_env,
178
        transactions=block.transactions,
179
        ommers=block.ommers,
180
    )
181
    block_state_root = state_root(block_env.state)
182
    transactions_root = root(block_output.transactions_trie)
183
    receipt_root = root(block_output.receipts_trie)
184
    block_logs_bloom = logs_bloom(block_output.block_logs)
185
186
    if block_output.block_gas_used != block.header.gas_used:
187
        raise InvalidBlock(
188
            f"{block_output.block_gas_used} != {block.header.gas_used}"
189
        )
190
    if transactions_root != block.header.transactions_root:
191
        raise InvalidBlock
192
    if block_state_root != block.header.state_root:
193
        raise InvalidBlock
194
    if receipt_root != block.header.receipt_root:
195
        raise InvalidBlock
196
    if block_logs_bloom != block.header.bloom:
197
        raise InvalidBlock
198
199
    chain.blocks.append(block)
200
    if len(chain.blocks) > 255:
201
        # Real clients have to store more blocks to deal with reorgs, but the
202
        # protocol only requires the last 255
203
        chain.blocks = chain.blocks[-255:]

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:
207
    """
208
    Verifies a block header.
209
210
    In order to consider a block's header valid, the logic for the
211
    quantities in the header should match the logic for the block itself.
212
    For example the header timestamp should be greater than the block's parent
213
    timestamp because the block was created *after* the parent block.
214
    Additionally, the block's number should be directly following the parent
215
    block's number since it is the next block in the sequence.
216
217
    Parameters
218
    ----------
219
    chain :
220
        History and current state.
221
    header :
222
        Header to check for correctness.
223
224
    """
225
    if header.number < Uint(1):
226
        raise InvalidBlock
227
    parent_header_number = header.number - Uint(1)
228
    first_block_number = chain.blocks[0].header.number
229
    last_block_number = chain.blocks[-1].header.number
230
231
    if (
232
        parent_header_number < first_block_number
233
        or parent_header_number > last_block_number
234
    ):
235
        raise InvalidBlock
236
237
    parent_header = chain.blocks[
238
        parent_header_number - first_block_number
239
    ].header
240
241
    if header.gas_used > header.gas_limit:
242
        raise InvalidBlock
243
244
    parent_has_ommers = parent_header.ommers_hash != EMPTY_OMMER_HASH
245
    if header.timestamp <= parent_header.timestamp:
246
        raise InvalidBlock
247
    if header.number != parent_header.number + Uint(1):
248
        raise InvalidBlock
249
    if not check_gas_limit(header.gas_limit, parent_header.gas_limit):
250
        raise InvalidBlock
251
    if len(header.extra_data) > 32:
252
        raise InvalidBlock
253
254
    block_difficulty = calculate_block_difficulty(
255
        header.number,
256
        header.timestamp,
257
        parent_header.timestamp,
258
        parent_header.difficulty,
259
        parent_has_ommers,
260
    )
261
    if header.difficulty != block_difficulty:
262
        raise InvalidBlock
263
264
    block_parent_hash = keccak256(rlp.encode(parent_header))
265
    if header.parent_hash != block_parent_hash:
266
        raise InvalidBlock
267
268
    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:
272
    """
273
    Generate rlp hash of the header which is to be used for Proof-of-Work
274
    verification.
275
276
    In other words, the PoW artefacts `mix_digest` and `nonce` are ignored
277
    while calculating this hash.
278
279
    A particular PoW is valid for a single hash, that hash is computed by
280
    this function. The `nonce` and `mix_digest` are omitted from this hash
281
    because they are being changed by miners in their search for a sufficient
282
    proof-of-work.
283
284
    Parameters
285
    ----------
286
    header :
287
        The header object for which the hash is to be generated.
288
289
    Returns
290
    -------
291
    hash : `Hash32`
292
        The PoW valid rlp hash of the passed in header.
293
294
    """
295
    header_data_without_pow_artefacts = (
296
        header.parent_hash,
297
        header.ommers_hash,
298
        header.coinbase,
299
        header.state_root,
300
        header.transactions_root,
301
        header.receipt_root,
302
        header.bloom,
303
        header.difficulty,
304
        header.number,
305
        header.gas_limit,
306
        header.gas_used,
307
        header.timestamp,
308
        header.extra_data,
309
    )
310
311
    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:
315
    """
316
    Validates the Proof of Work constraints.
317
318
    In order to verify that a miner's proof-of-work is valid for a block, a
319
    ``mix-digest`` and ``result`` are calculated using the ``hashimoto_light``
320
    hash function. The mix digest is a hash of the header and the nonce that
321
    is passed through and it confirms whether or not proof-of-work was done
322
    on the correct block. The result is the actual hash value of the block.
323
324
    Parameters
325
    ----------
326
    header :
327
        Header of interest.
328
329
    """
330
    header_hash = generate_header_hash_for_pow(header)
331
    # TODO: Memoize this somewhere and read from that data instead of
332
    # calculating cache for every block validation.
333
    cache = generate_cache(header.number)
334
    mix_digest, result = hashimoto_light(
335
        header_hash, header.nonce, cache, dataset_size(header.number)
336
    )
337
    if mix_digest != header.mix_digest:
338
        raise InvalidBlock
339
340
    limit = Uint(U256.MAX_VALUE) + Uint(1)
341
    if Uint.from_be_bytes(result) > (limit // header.difficulty):
342
        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.

Returns

sender_address : The sender of the transaction.

Raises

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.

def check_transaction(block_env: ethereum.forks.byzantium.vm.BlockEnvironment, ​​block_output: ethereum.forks.byzantium.vm.BlockOutput, ​​tx: Transaction) -> Address:
350
    """
351
    Check if the transaction is includable in the block.
352
353
    Parameters
354
    ----------
355
    block_env :
356
        The block scoped environment.
357
    block_output :
358
        The block output for the current block.
359
    tx :
360
        The transaction.
361
362
    Returns
363
    -------
364
    sender_address :
365
        The sender of the transaction.
366
367
    Raises
368
    ------
369
    GasUsedExceedsLimitError :
370
        If the gas used by the transaction exceeds the block's gas limit.
371
    NonceMismatchError :
372
        If the nonce of the transaction is not equal to the sender's nonce.
373
    InsufficientBalanceError :
374
        If the sender's balance is not enough to pay for the transaction.
375
    InvalidSenderError :
376
        If the transaction is from an address that does not exist anymore.
377
378
    """
379
    gas_available = block_env.block_gas_limit - block_output.block_gas_used
380
    if tx.gas > gas_available:
381
        raise GasUsedExceedsLimitError("gas used exceeds limit")
382
    sender_address = recover_sender(block_env.chain_id, tx)
383
    sender_account = get_account(block_env.state, sender_address)
384
385
    max_gas_fee = tx.gas * tx.gas_price
386
387
    if sender_account.nonce > Uint(tx.nonce):
388
        raise NonceMismatchError("nonce too low")
389
    elif sender_account.nonce < Uint(tx.nonce):
390
        raise NonceMismatchError("nonce too high")
391
    if Uint(sender_account.balance) < max_gas_fee + Uint(tx.value):
392
        raise InsufficientBalanceError("insufficient sender balance")
393
    if sender_account.code_hash != EMPTY_CODE_HASH:
394
        raise InvalidSenderError("not EOA")
395
396
    return sender_address

make_receipt

Make the receipt for a transaction that was executed.

Parameters

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(error: Optional[EthereumException], ​​cumulative_gas_used: Uint, ​​logs: Tuple[Log, ...]) -> Receipt:
404
    """
405
    Make the receipt for a transaction that was executed.
406
407
    Parameters
408
    ----------
409
    error :
410
        Error in the top level frame of the transaction, if any.
411
    cumulative_gas_used :
412
        The total gas used so far in the block after the transaction was
413
        executed.
414
    logs :
415
        The logs produced by the transaction.
416
417
    Returns
418
    -------
419
    receipt :
420
        The receipt for the transaction.
421
422
    """
423
    receipt = Receipt(
424
        succeeded=error is None,
425
        cumulative_gas_used=cumulative_gas_used,
426
        bloom=logs_bloom(logs),
427
        logs=logs,
428
    )
429
430
    return 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.byzantium.vm.BlockEnvironment, ​​transactions: Tuple[Transaction, ...], ​​ommers: Tuple[Header, ...]) -> ethereum.forks.byzantium.vm.BlockOutput:
438
    """
439
    Executes a block.
440
441
    Many of the contents of a block are stored in data structures called
442
    tries. There is a transactions trie which is similar to a ledger of the
443
    transactions stored in the current block. There is also a receipts trie
444
    which stores the results of executing a transaction, like the post state
445
    and gas used. This function creates and executes the block that is to be
446
    added to the chain.
447
448
    Parameters
449
    ----------
450
    block_env :
451
        The block scoped environment.
452
    transactions :
453
        Transactions included in the block.
454
    ommers :
455
        Headers of ancestor blocks which are not direct parents (formerly
456
        uncles.)
457
458
    Returns
459
    -------
460
    block_output :
461
        The block output for the current block.
462
463
    """
464
    block_output = vm.BlockOutput()
465
466
    for i, tx in enumerate(transactions):
467
        process_transaction(block_env, block_output, tx, Uint(i))
468
469
    pay_rewards(block_env.state, block_env.number, block_env.coinbase, ommers)
470
471
    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:
477
    """
478
    Validates the ommers mentioned in the block.
479
480
    An ommer block is a block that wasn't canonically added to the
481
    blockchain because it wasn't validated as fast as the canonical block
482
    but was mined at the same time.
483
484
    To be considered valid, the ommers must adhere to the rules defined in
485
    the Ethereum protocol. The maximum amount of ommers is 2 per block and
486
    there cannot be duplicate ommers in a block. Many of the other ommer
487
    constraints are listed in the in-line comments of this function.
488
489
    Parameters
490
    ----------
491
    ommers :
492
        List of ommers mentioned in the current block.
493
    block_header:
494
        The header of current block.
495
    chain :
496
        History and current state.
497
498
    """
499
    block_hash = keccak256(rlp.encode(block_header))
500
    if keccak256(rlp.encode(ommers)) != block_header.ommers_hash:
501
        raise InvalidBlock
502
503
    if len(ommers) == 0:
504
        # Nothing to validate
505
        return
506
507
    # Check that each ommer satisfies the constraints of a header
508
    for ommer in ommers:
509
        if Uint(1) > ommer.number or ommer.number >= block_header.number:
510
            raise InvalidBlock
511
        validate_header(chain, ommer)
512
    if len(ommers) > 2:
513
        raise InvalidBlock
514
515
    ommers_hashes = [keccak256(rlp.encode(ommer)) for ommer in ommers]
516
    if len(ommers_hashes) != len(set(ommers_hashes)):
517
        raise InvalidBlock
518
519
    recent_canonical_blocks = chain.blocks[-(MAX_OMMER_DEPTH + Uint(1)) :]
520
    recent_canonical_block_hashes = {
521
        keccak256(rlp.encode(block.header))
522
        for block in recent_canonical_blocks
523
    }
524
    recent_ommers_hashes: Set[Hash32] = set()
525
    for block in recent_canonical_blocks:
526
        recent_ommers_hashes = recent_ommers_hashes.union(
527
            {keccak256(rlp.encode(ommer)) for ommer in block.ommers}
528
        )
529
530
    for ommer_index, ommer in enumerate(ommers):
531
        ommer_hash = ommers_hashes[ommer_index]
532
        if ommer_hash == block_hash:
533
            raise InvalidBlock
534
        if ommer_hash in recent_canonical_block_hashes:
535
            raise InvalidBlock
536
        if ommer_hash in recent_ommers_hashes:
537
            raise InvalidBlock
538
539
        # Ommer age with respect to the current block. For example, an age of
540
        # 1 indicates that the ommer is a sibling of previous block.
541
        ommer_age = block_header.number - ommer.number
542
        if Uint(1) > ommer_age or ommer_age > MAX_OMMER_DEPTH:
543
            raise InvalidBlock
544
        if ommer.parent_hash not in recent_canonical_block_hashes:
545
            raise InvalidBlock
546
        if ommer.parent_hash == block_header.parent_hash:
547
            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

state : Current account state. block_number : Position of the block within the chain. coinbase : Address of account which receives block reward and transaction fees. ommers : List of ommers mentioned in the current block.

def pay_rewards(state: State, ​​block_number: Uint, ​​coinbase: Address, ​​ommers: Tuple[Header, ...]) -> None:
556
    """
557
    Pay rewards to the block miner as well as the ommers miners.
558
559
    The miner of the canonical block is rewarded with the predetermined
560
    block reward, ``BLOCK_REWARD``, plus a variable award based off of the
561
    number of ommer blocks that were mined around the same time, and included
562
    in the canonical block's header. An ommer block is a block that wasn't
563
    added to the canonical blockchain because it wasn't validated as fast as
564
    the accepted block but was mined at the same time. Although not all blocks
565
    that are mined are added to the canonical chain, miners are still paid a
566
    reward for their efforts. This reward is called an ommer reward and is
567
    calculated based on the number associated with the ommer block that they
568
    mined.
569
570
    Parameters
571
    ----------
572
    state :
573
        Current account state.
574
    block_number :
575
        Position of the block within the chain.
576
    coinbase :
577
        Address of account which receives block reward and transaction fees.
578
    ommers :
579
        List of ommers mentioned in the current block.
580
581
    """
582
    ommer_count = U256(len(ommers))
583
    miner_reward = BLOCK_REWARD + (ommer_count * (BLOCK_REWARD // U256(32)))
584
    create_ether(state, coinbase, miner_reward)
585
586
    for ommer in ommers:
587
        # Ommer age with respect to the current block.
588
        ommer_age = U256(block_number - ommer.number)
589
        ommer_miner_reward = ((U256(8) - ommer_age) * BLOCK_REWARD) // U256(8)
590
        create_ether(state, ommer.coinbase, ommer_miner_reward)

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.byzantium.vm.BlockEnvironment, ​​block_output: ethereum.forks.byzantium.vm.BlockOutput, ​​tx: Transaction, ​​index: Uint) -> None:
599
    """
600
    Execute a transaction against the provided environment.
601
602
    This function processes the actions needed to execute a transaction.
603
    It decrements the sender's account balance after calculating the gas fee
604
    and refunds them the proper amount after execution. Calling contracts,
605
    deploying code, and incrementing nonces are all examples of actions that
606
    happen within this function or from a call made within this function.
607
608
    Accounts that are marked for deletion are processed and destroyed after
609
    execution.
610
611
    Parameters
612
    ----------
613
    block_env :
614
        Environment for the Ethereum Virtual Machine.
615
    block_output :
616
        The block output for the current block.
617
    tx :
618
        Transaction to execute.
619
    index:
620
        Index of the transaction in the block.
621
622
    """
623
    trie_set(block_output.transactions_trie, rlp.encode(Uint(index)), tx)
624
    intrinsic_gas = validate_transaction(tx)
625
626
    sender = check_transaction(
627
        block_env=block_env,
628
        block_output=block_output,
629
        tx=tx,
630
    )
631
632
    sender_account = get_account(block_env.state, sender)
633
634
    gas = tx.gas - intrinsic_gas
635
    increment_nonce(block_env.state, sender)
636
637
    gas_fee = tx.gas * tx.gas_price
638
    sender_balance_after_gas_fee = Uint(sender_account.balance) - gas_fee
639
    set_account_balance(
640
        block_env.state, sender, U256(sender_balance_after_gas_fee)
641
    )
642
643
    tx_env = vm.TransactionEnvironment(
644
        origin=sender,
645
        gas_price=tx.gas_price,
646
        gas=gas,
647
        index_in_block=index,
648
        tx_hash=get_transaction_hash(tx),
649
    )
650
651
    message = prepare_message(block_env, tx_env, tx)
652
653
    tx_output = process_message_call(message)
654
655
    tx_gas_used_before_refund = tx.gas - tx_output.gas_left
656
    tx_gas_refund = min(
657
        tx_gas_used_before_refund // Uint(2), Uint(tx_output.refund_counter)
658
    )
659
    tx_gas_used_after_refund = tx_gas_used_before_refund - tx_gas_refund
660
    tx_gas_left = tx.gas - tx_gas_used_after_refund
661
    gas_refund_amount = tx_gas_left * tx.gas_price
662
663
    transaction_fee = tx_gas_used_after_refund * tx.gas_price
664
665
    # refund gas
666
    sender_balance_after_refund = get_account(
667
        block_env.state, sender
668
    ).balance + U256(gas_refund_amount)
669
    set_account_balance(block_env.state, sender, sender_balance_after_refund)
670
671
    # transfer miner fees
672
    coinbase_balance_after_mining_fee = get_account(
673
        block_env.state, block_env.coinbase
674
    ).balance + U256(transaction_fee)
675
    if coinbase_balance_after_mining_fee != 0:
676
        set_account_balance(
677
            block_env.state,
678
            block_env.coinbase,
679
            coinbase_balance_after_mining_fee,
680
        )
681
    elif account_exists_and_is_empty(block_env.state, block_env.coinbase):
682
        destroy_account(block_env.state, block_env.coinbase)
683
684
    for address in tx_output.accounts_to_delete:
685
        destroy_account(block_env.state, address)
686
687
    destroy_touched_empty_accounts(block_env.state, tx_output.touched_accounts)
688
689
    block_output.block_gas_used += tx_gas_used_after_refund
690
691
    receipt = make_receipt(
692
        tx_output.error, block_output.block_gas_used, tx_output.logs
693
    )
694
695
    receipt_key = rlp.encode(Uint(index))
696
    block_output.receipt_keys += (receipt_key,)
697
698
    trie_set(
699
        block_output.receipts_trie,
700
        receipt_key,
701
        receipt,
702
    )
703
704
    block_output.block_logs += tx_output.logs

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:
708
    """
709
    Validates the gas limit for a block.
710
711
    The bounds of the gas limit, ``max_adjustment_delta``, is set as the
712
    quotient of the parent block's gas limit and the
713
    ``LIMIT_ADJUSTMENT_FACTOR``. Therefore, if the gas limit that is
714
    passed through as a parameter is greater than or equal to the *sum* of
715
    the parent's gas and the adjustment delta then the limit for gas is too
716
    high and fails this function's check. Similarly, if the limit is less
717
    than or equal to the *difference* of the parent's gas and the adjustment
718
    delta *or* the predefined ``LIMIT_MINIMUM`` then this function's
719
    check fails because the gas limit doesn't allow for a sufficient or
720
    reasonable amount of gas to be used on a block.
721
722
    Parameters
723
    ----------
724
    gas_limit :
725
        Gas limit to validate.
726
727
    parent_gas_limit :
728
        Gas limit of the parent block.
729
730
    Returns
731
    -------
732
    check : `bool`
733
        True if gas limit constraints are satisfied, False otherwise.
734
735
    """
736
    max_adjustment_delta = parent_gas_limit // GasCosts.LIMIT_ADJUSTMENT_FACTOR
737
    if gas_limit >= parent_gas_limit + max_adjustment_delta:
738
        return False
739
    if gas_limit <= parent_gas_limit - max_adjustment_delta:
740
        return False
741
    if gas_limit < GasCosts.LIMIT_MINIMUM:
742
        return False
743
744
    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:
754
    """
755
    Computes difficulty of a block using its header and parent header.
756
757
    The difficulty is determined by the time the block was created after its
758
    parent. The ``offset`` is calculated using the parent block's difficulty,
759
    ``parent_difficulty``, and the timestamp between blocks. This offset is
760
    then added to the parent difficulty and is stored as the ``difficulty``
761
    variable. If the time between the block and its parent is too short, the
762
    offset will result in a positive number thus making the sum of
763
    ``parent_difficulty`` and ``offset`` to be a greater value in order to
764
    avoid mass forking. But, if the time is long enough, then the offset
765
    results in a negative value making the block less difficult than
766
    its parent.
767
768
    The base standard for a block's difficulty is the predefined value
769
    set for the genesis block since it has no parent. So, a block
770
    can't be less difficult than the genesis block, therefore each block's
771
    difficulty is set to the maximum value between the calculated
772
    difficulty and the ``MINIMUM_DIFFICULTY``.
773
774
    Parameters
775
    ----------
776
    block_number :
777
        Block number of the block.
778
    block_timestamp :
779
        Timestamp of the block.
780
    parent_timestamp :
781
        Timestamp of the parent block.
782
    parent_difficulty :
783
        difficulty of the parent block.
784
    parent_has_ommers:
785
        does the parent have ommers.
786
787
    Returns
788
    -------
789
    difficulty : `ethereum.base_types.Uint`
790
        Computed difficulty for a block.
791
792
    """
793
    offset = (
794
        int(parent_difficulty)
795
        // 2048
796
        * max(
797
            (2 if parent_has_ommers else 1)
798
            - int(block_timestamp - parent_timestamp) // 9,
799
            -99,
800
        )
801
    )
802
    difficulty = int(parent_difficulty) + offset
803
    # Historical Note: The difficulty bomb was not present in Ethereum at the
804
    # start of Frontier, but was added shortly after launch. However since the
805
    # bomb has no effect prior to block 200000 we pretend it existed from
806
    # genesis.
807
    # See https://github.com/ethereum/go-ethereum/pull/1588
808
    num_bomb_periods = ((int(block_number) - BOMB_DELAY_BLOCKS) // 100000) - 2
809
    if num_bomb_periods >= 0:
810
        difficulty += 2**num_bomb_periods
811
812
    # Some clients raise the difficulty to `MINIMUM_DIFFICULTY` prior to adding
813
    # the bomb. This bug does not matter because the difficulty is always much
814
    # greater than `MINIMUM_DIFFICULTY` on Mainnet.
815
    return Uint(max(difficulty, int(MINIMUM_DIFFICULTY)))