ethereum.forks.muir_glacier.forkethereum.forks.berlin.fork

Ethereum Specification.

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

Introduction

Entry point for the Ethereum specification.

BLOCK_REWARD

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

MINIMUM_DIFFICULTY

72
MINIMUM_DIFFICULTY = Uint(131072)

MAX_OMMER_DEPTH

73
MAX_OMMER_DEPTH = Uint(6)

BOMB_DELAY_BLOCKS

74
BOMB_DELAY_BLOCKS = 9000000

EMPTY_OMMER_HASH

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

BlockChain

History and current state of the block chain.

78
@final
79
@dataclass
class BlockChain:

blocks

85
    blocks: List[Block]

state

86
    state: State

chain_id

87
    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:
91
    <snip>
110
    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]:
114
    <snip>
134
    recent_blocks = chain.blocks[-255:]
135
    # TODO: This function has not been tested rigorously
136
    if len(recent_blocks) == 0:
137
        return []
138
139
    recent_block_hashes = []
140
141
    for block in recent_blocks:
142
        prev_block_hash = block.header.parent_hash
143
        recent_block_hashes.append(prev_block_hash)
144
145
    # We are computing the hash only for the most recent block and not for
146
    # the rest of the blocks as they have successors which have the hash of
147
    # the current block as parent hash.
148
    most_recent_block_hash = keccak256(rlp.encode(recent_blocks[-1].header))
149
    recent_block_hashes.append(most_recent_block_hash)
150
151
    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:
155
    <snip>
177
    validate_header(chain, block.header)
178
    validate_ommers(block.ommers, block.header, chain)
179
180
    block_state = BlockState(pre_state=chain.state)
181
182
    block_env = vm.BlockEnvironment(
183
        chain_id=chain.chain_id,
184
        state=block_state,
185
        block_gas_limit=block.header.gas_limit,
186
        block_hashes=get_last_256_block_hashes(chain),
187
        coinbase=block.header.coinbase,
188
        number=block.header.number,
189
        time=block.header.timestamp,
190
        difficulty=block.header.difficulty,
191
    )
192
193
    block_output = apply_body(
194
        block_env=block_env,
195
        transactions=block.transactions,
196
        ommers=block.ommers,
197
    )
198
    block_diff = extract_block_diff(block_state)
199
    block_state_root, _ = chain.state.compute_state_root_and_trie_changes(
200
        block_diff.account_changes,
201
        block_diff.storage_changes,
202
        block_diff.storage_clears,
203
    )
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:]

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:
230
    <snip>
248
    if header.number < Uint(1):
249
        raise InvalidBlock
250
    parent_header_number = header.number - Uint(1)
251
    first_block_number = chain.blocks[0].header.number
252
    last_block_number = chain.blocks[-1].header.number
253
254
    if (
255
        parent_header_number < first_block_number
256
        or parent_header_number > last_block_number
257
    ):
258
        raise InvalidBlock
259
260
    parent_header = chain.blocks[
261
        parent_header_number - first_block_number
262
    ].header
263
264
    if header.gas_used > header.gas_limit:
265
        raise InvalidBlock
266
267
    parent_has_ommers = parent_header.ommers_hash != EMPTY_OMMER_HASH
268
    if header.timestamp <= parent_header.timestamp:
269
        raise InvalidBlock
270
    if header.number != parent_header.number + Uint(1):
271
        raise InvalidBlock
272
    if not check_gas_limit(header.gas_limit, parent_header.gas_limit):
273
        raise InvalidBlock
274
    if len(header.extra_data) > 32:
275
        raise InvalidBlock
276
277
    block_difficulty = calculate_block_difficulty(
278
        header.number,
279
        header.timestamp,
280
        parent_header.timestamp,
281
        parent_header.difficulty,
282
        parent_has_ommers,
283
    )
284
    if header.difficulty != block_difficulty:
285
        raise InvalidBlock
286
287
    block_parent_hash = keccak256(rlp.encode(parent_header))
288
    if header.parent_hash != block_parent_hash:
289
        raise InvalidBlock
290
291
    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:
295
    <snip>
318
    header_data_without_pow_artefacts = (
319
        header.parent_hash,
320
        header.ommers_hash,
321
        header.coinbase,
322
        header.state_root,
323
        header.transactions_root,
324
        header.receipt_root,
325
        header.bloom,
326
        header.difficulty,
327
        header.number,
328
        header.gas_limit,
329
        header.gas_used,
330
        header.timestamp,
331
        header.extra_data,
332
    )
333
334
    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:
338
    <snip>
353
    header_hash = generate_header_hash_for_pow(header)
354
    # TODO: Memoize this somewhere and read from that data instead of
355
    # calculating cache for every block validation.
356
    cache = generate_cache(header.number)
357
    mix_digest, result = hashimoto_light(
358
        header_hash, header.nonce, cache, dataset_size(header.number)
359
    )
360
    if mix_digest != header.mix_digest:
361
        raise InvalidBlock
362
363
    limit = Uint(U256.MAX_VALUE) + Uint(1)
364
    if Uint.from_be_bytes(result) > (limit // header.difficulty):
365
        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.

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.muir_glacier.vm.BlockEnvironmentethereum.forks.berlin.vm.BlockEnvironment, ​​block_output: ethereum.forks.muir_glacier.vm.BlockOutputethereum.forks.berlin.vm.BlockOutput, ​​tx: Transaction, ​​tx_state: TransactionState) -> Address:
374
    <snip>
405
    gas_available = block_env.block_gas_limit - block_output.block_gas_used
406
    if tx.gas > gas_available:
407
        raise GasUsedExceedsLimitError("gas used exceeds limit")
408
    tx_chain_id = chain_id(tx)
409
    if tx_chain_id is not None and tx_chain_id != block_env.chain_id:
410
        raise WrongChainIdError(
411
            expected=block_env.chain_id,
412
            actual=tx_chain_id,
413
        )
414
415
    sender_address = recover_sender(tx)
416
    sender_account = get_account(tx_state, sender_address)
417
418
    max_gas_fee = tx.gas * tx.gas_price
419
420
    if sender_account.nonce > Uint(tx.nonce):
421
        raise NonceMismatchError("nonce too low")
422
    elif sender_account.nonce < Uint(tx.nonce):
423
        raise NonceMismatchError("nonce too high")
424
    if Uint(sender_account.balance) < max_gas_fee + Uint(tx.value):
425
        raise InsufficientBalanceError("insufficient sender balance")
426
    if sender_account.code_hash != EMPTY_CODE_HASH:
427
        raise InvalidSenderError("not EOA")
428
429
    return sender_address

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, ...]) -> ReceiptBytes | Receipt:
438
    <snip>
459
    receipt = Receipt(
460
        succeeded=error is None,
461
        cumulative_gas_used=cumulative_gas_used,
462
        bloom=logs_bloom(logs),
463
        logs=logs,
464
    )
465
460
    return receipt
466
    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.muir_glacier.vm.BlockEnvironmentethereum.forks.berlin.vm.BlockEnvironment, ​​transactions: Tuple[TransactionLegacyTransaction | Bytes, ...], ​​ommers: Tuple[Header, ...]) -> ethereum.forks.muir_glacier.vm.BlockOutputethereum.forks.berlin.vm.BlockOutput:
474
    <snip>
500
    block_output = vm.BlockOutput()
501
496
    for i, tx in enumerate(transactions):
502
    for i, tx in enumerate(map(decode_transaction, transactions)):
503
        process_transaction(block_env, block_output, tx, Uint(i))
504
505
    pay_rewards(block_env, ommers)
506
507
    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:
513
    <snip>
535
    block_hash = keccak256(rlp.encode(block_header))
536
    if keccak256(rlp.encode(ommers)) != block_header.ommers_hash:
537
        raise InvalidBlock
538
539
    if len(ommers) == 0:
540
        # Nothing to validate
541
        return
542
543
    # Check that each ommer satisfies the constraints of a header
544
    for ommer in ommers:
545
        if Uint(1) > ommer.number or ommer.number >= block_header.number:
546
            raise InvalidBlock
547
        validate_header(chain, ommer)
548
    if len(ommers) > 2:
549
        raise InvalidBlock
550
551
    ommers_hashes = [keccak256(rlp.encode(ommer)) for ommer in ommers]
552
    if len(ommers_hashes) != len(set(ommers_hashes)):
553
        raise InvalidBlock
554
555
    recent_canonical_blocks = chain.blocks[-(MAX_OMMER_DEPTH + Uint(1)) :]
556
    recent_canonical_block_hashes = {
557
        keccak256(rlp.encode(block.header))
558
        for block in recent_canonical_blocks
559
    }
560
    recent_ommers_hashes: Set[Hash32] = set()
561
    for block in recent_canonical_blocks:
562
        recent_ommers_hashes = recent_ommers_hashes.union(
563
            {keccak256(rlp.encode(ommer)) for ommer in block.ommers}
564
        )
565
566
    for ommer_index, ommer in enumerate(ommers):
567
        ommer_hash = ommers_hashes[ommer_index]
568
        if ommer_hash == block_hash:
569
            raise InvalidBlock
570
        if ommer_hash in recent_canonical_block_hashes:
571
            raise InvalidBlock
572
        if ommer_hash in recent_ommers_hashes:
573
            raise InvalidBlock
574
575
        # Ommer age with respect to the current block. For example, an age of
576
        # 1 indicates that the ommer is a sibling of previous block.
577
        ommer_age = block_header.number - ommer.number
578
        if Uint(1) > ommer_age or ommer_age > MAX_OMMER_DEPTH:
579
            raise InvalidBlock
580
        if ommer.parent_hash not in recent_canonical_block_hashes:
581
            raise InvalidBlock
582
        if ommer.parent_hash == block_header.parent_hash:
583
            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.muir_glacier.vm.BlockEnvironmentethereum.forks.berlin.vm.BlockEnvironment, ​​ommers: Tuple[Header, ...]) -> None:
590
    <snip>
612
    rewards_state = TransactionState(parent=block_env.state)
613
    ommer_count = U256(len(ommers))
614
    miner_reward = BLOCK_REWARD + (ommer_count * (BLOCK_REWARD // U256(32)))
615
    create_ether(rewards_state, block_env.coinbase, miner_reward)
616
617
    for ommer in ommers:
618
        # Ommer age with respect to the current block.
619
        ommer_age = U256(block_env.number - ommer.number)
620
        ommer_miner_reward = ((U256(8) - ommer_age) * BLOCK_REWARD) // U256(8)
621
        create_ether(rewards_state, ommer.coinbase, ommer_miner_reward)
622
623
    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.muir_glacier.vm.BlockEnvironmentethereum.forks.berlin.vm.BlockEnvironment, ​​block_output: ethereum.forks.muir_glacier.vm.BlockOutputethereum.forks.berlin.vm.BlockOutput, ​​tx: Transaction, ​​index: Uint) -> None:
632
    <snip>
656
    tx_state = TransactionState(parent=block_env.state)
657
652
    trie_set(block_output.transactions_trie, rlp.encode(Uint(index)), tx)
658
    trie_set(
659
        block_output.transactions_trie,
660
        rlp.encode(index),
661
        encode_transaction(tx),
662
    )
663
664
    intrinsic_gas = validate_transaction(tx)
665
666
    sender = check_transaction(
667
        block_env=block_env,
668
        block_output=block_output,
669
        tx=tx,
670
        tx_state=tx_state,
671
    )
672
673
    sender_account = get_account(tx_state, sender)
674
675
    gas = tx.gas - intrinsic_gas
676
    increment_nonce(tx_state, sender)
677
678
    gas_fee = tx.gas * tx.gas_price
679
    sender_balance_after_gas_fee = Uint(sender_account.balance) - gas_fee
680
    set_account_balance(tx_state, sender, U256(sender_balance_after_gas_fee))
681
682
    access_list_addresses = set()
683
    access_list_storage_keys = set()
684
    if isinstance(tx, AccessListTransaction):
685
        for access in tx.access_list:
686
            access_list_addresses.add(access.account)
687
            for slot in access.slots:
688
                access_list_storage_keys.add((access.account, slot))
689
690
    tx_env = vm.TransactionEnvironment(
691
        origin=sender,
692
        gas_price=tx.gas_price,
693
        gas=gas,
694
        access_list_addresses=access_list_addresses,
695
        access_list_storage_keys=access_list_storage_keys,
696
        state=tx_state,
697
        index_in_block=index,
677
        tx_hash=get_transaction_hash(tx),
698
        tx_hash=get_transaction_hash(encode_transaction(tx)),
699
    )
700
701
    message = prepare_message(block_env, tx_env, tx)
702
703
    tx_output = process_message_call(message)
704
705
    tx_gas_used_before_refund = tx.gas - tx_output.gas_left
706
    tx_gas_refund = min(
707
        tx_gas_used_before_refund // Uint(2), Uint(tx_output.refund_counter)
708
    )
709
    tx_gas_used_after_refund = tx_gas_used_before_refund - tx_gas_refund
710
    tx_gas_left = tx.gas - tx_gas_used_after_refund
711
    gas_refund_amount = tx_gas_left * tx.gas_price
712
713
    transaction_fee = tx_gas_used_after_refund * tx.gas_price
714
715
    # refund gas
716
    create_ether(tx_state, sender, U256(gas_refund_amount))
717
718
    # transfer miner fees
719
    coinbase_balance_after_mining_fee = get_account(
720
        tx_state, block_env.coinbase
721
    ).balance + U256(transaction_fee)
722
    if coinbase_balance_after_mining_fee != 0:
723
        set_account_balance(
724
            tx_state,
725
            block_env.coinbase,
726
            coinbase_balance_after_mining_fee,
727
        )
728
    elif account_exists_and_is_empty(tx_state, block_env.coinbase):
729
        destroy_account(tx_state, block_env.coinbase)
730
731
    for address in tx_output.accounts_to_delete:
732
        destroy_account(tx_state, address)
733
734
    destroy_touched_empty_accounts(tx_state, tx_output.touched_accounts)
735
736
    block_output.block_gas_used += tx_gas_used_after_refund
737
738
    receipt = make_receipt(
718
        tx_output.error, block_output.block_gas_used, tx_output.logs
739
        tx, tx_output.error, block_output.block_gas_used, tx_output.logs
740
    )
741
742
    receipt_key = rlp.encode(Uint(index))
743
    block_output.receipt_keys += (receipt_key,)
744
745
    trie_set(
746
        block_output.receipts_trie,
747
        receipt_key,
748
        receipt,
749
    )
750
751
    block_output.block_logs += tx_output.logs
752
753
    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:
757
    <snip>
785
    max_adjustment_delta = parent_gas_limit // GasCosts.LIMIT_ADJUSTMENT_FACTOR
786
    if gas_limit >= parent_gas_limit + max_adjustment_delta:
787
        return False
788
    if gas_limit <= parent_gas_limit - max_adjustment_delta:
789
        return False
790
    if gas_limit < GasCosts.LIMIT_MINIMUM:
791
        return False
792
793
    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:
803
    <snip>
842
    offset = (
843
        int(parent_difficulty)
844
        // 2048
845
        * max(
846
            (2 if parent_has_ommers else 1)
847
            - int(block_timestamp - parent_timestamp) // 9,
848
            -99,
849
        )
850
    )
851
    difficulty = int(parent_difficulty) + offset
852
    # Historical Note: The difficulty bomb was not present in Ethereum at the
853
    # start of Frontier, but was added shortly after launch. However since the
854
    # bomb has no effect prior to block 200000 we pretend it existed from
855
    # genesis.
856
    # See https://github.com/ethereum/go-ethereum/pull/1588
857
    num_bomb_periods = ((int(block_number) - BOMB_DELAY_BLOCKS) // 100000) - 2
858
    if num_bomb_periods >= 0:
859
        difficulty += 2**num_bomb_periods
860
861
    # Some clients raise the difficulty to `MINIMUM_DIFFICULTY` prior to adding
862
    # the bomb. This bug does not matter because the difficulty is always much
863
    # greater than `MINIMUM_DIFFICULTY` on Mainnet.
864
    return Uint(max(difficulty, int(MINIMUM_DIFFICULTY)))