Closed mkalinin closed 5 years ago
Update fork choice rule with IMD GHOST algorithm.
New ScoreFunction should be implemented that uses IMD GHOST algorithm combined with finality.
Beacon chain fork choice rule is outlined in the spec. IMD GHOST is well described by following posts:
As finality is not yet implemented, there is a suggestion to use block with a highest slot number that satisfies condition <= head.slotNumber - CYCLE_LENGTH as highestSlotNumberJustifiedBlock
<= head.slotNumber - CYCLE_LENGTH
highestSlotNumberJustifiedBlock
resolved with #1219
zilm13
commented
5 years ago
Abstract
Update fork choice rule with IMD GHOST algorithm.
Proposed implementation
New ScoreFunction should be implemented that uses IMD GHOST algorithm combined with finality.
Beacon chain fork choice rule is outlined in the spec. IMD GHOST is well described by following posts:
As finality is not yet implemented, there is a suggestion to use block with a highest slot number that satisfies condition
<= head.slotNumber - CYCLE_LENGTHashighestSlotNumberJustifiedBlock