status-im/eth2.0-specs
2
0
Fork 0
mirror of https://github.com/status-im/eth2.0-specs.git synced 2025-02-12 10:36:32 +00:00
Code Issues Projects Releases Wiki Activity

Advance best child with empty until it is higher than every children

Browse Source
This commit is contained in:
Potuz 2024-07-23 13:06:54 -03:00
parent b7461ac174
commit d0fad1f380
1 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
specs/_features/eip7732/fork-choice.md
View File

@ -343,13 +343,14 @@ def get_head(store: Store) -> ChildNode:
while True:
children = [
ChildNode(root=root, slot=block.slot, is_payload_present=present) for (root, block) in blocks.items()
if block.parent_root == best_child.root and
if block.parent_root == best_child.root and block.slot > best_child.slot and
(best_child.root == justified_root or is_parent_node_full(store, block) == best_child.is_payload_present)
for present in (True, False) if root in store.execution_payload_states or not present
]
if len(children) == 0:
return best_child
# if we have children we consider the current head advanced as a possible head
highest_child_slot = max(child.slot for child in children)
children += [
ChildNode(root=best_child.root, slot=best_child.slot + 1, is_payload_present=best_child.is_payload_present)
]
@ -366,7 +367,7 @@ def get_head(store: Store) -> ChildNode:
child.root
)
)
if new_best_child.root == best_child.root:
if new_best_child.root == best_child.root and new_best_child.slot >= highest_child_slot:
return new_best_child
best_child = new_best_child
```