status-im
/
nimbus-eth2
mirror of https://github.com/status-im/nimbus-eth2.git
2
0
Fork 0
Code Issues Projects Releases Wiki Activity
nimbus-eth2/beacon_chain/fork_choice.nim

59 lines
2.1 KiB
Nim
Raw Normal View History

Add more flesh to the skeleton :)
2018-11-26 13:33:06 +00:00
import
naive attestation pool, in preparation of fork choice integration (#125) * move attestation pool to separate file * combine attestations lazily when needed * advance state when there's a gap while attesting * compile beacon node with optimizations - it's tooo slow right now * log when unable to keep up
2019-02-19 23:35:02 +00:00
deques, options, sequtils, tables,
chronicles,
./spec/[beaconstate, datatypes, crypto, digest, helpers, validator], extras,
implement fork choice (#175) * keep track of a finalized block * keep track of all justified blocks * use naive spec version of LMD ghost * cache slot number and a few more things in BlockRef * keep track of the latest vote of each validator * depend less on the state of node.state (it's a cache, effectively)
2019-03-13 22:59:20 +00:00
./attestation_pool, ./beacon_node_types, ./beacon_chain_db, ./ssz
switch some proc to func, add some infrastructure, update based on spec name changes (#40) * switch some proc to func, add some infrastructure, update based on spec name changes * typo
2018-12-15 16:32:36 +00:00
implement fork choice (#175) * keep track of a finalized block * keep track of all justified blocks * use naive spec version of LMD ghost * cache slot number and a few more things in BlockRef * keep track of the latest vote of each validator * depend less on the state of node.state (it's a cache, effectively)
2019-03-13 22:59:20 +00:00
proc get_ancestor(blck: BlockRef, slot: Slot): BlockRef =
if blck.slot == slot:
Back the db by rocksdb backend
2019-01-14 12:19:44 +00:00
blck
implement fork choice (#175) * keep track of a finalized block * keep track of all justified blocks * use naive spec version of LMD ghost * cache slot number and a few more things in BlockRef * keep track of the latest vote of each validator * depend less on the state of node.state (it's a cache, effectively)
2019-03-13 22:59:20 +00:00
elif blck.slot < slot:
nil
Fork choice compiles (but untested)
2019-01-08 17:28:21 +00:00
else:
implement fork choice (#175) * keep track of a finalized block * keep track of all justified blocks * use naive spec version of LMD ghost * cache slot number and a few more things in BlockRef * keep track of the latest vote of each validator * depend less on the state of node.state (it's a cache, effectively)
2019-03-13 22:59:20 +00:00
get_ancestor(blck.parent, slot)
Fork choice compiles (but untested)
2019-01-08 17:28:21 +00:00
implement fork choice (#175) * keep track of a finalized block * keep track of all justified blocks * use naive spec version of LMD ghost * cache slot number and a few more things in BlockRef * keep track of the latest vote of each validator * depend less on the state of node.state (it's a cache, effectively)
2019-03-13 22:59:20 +00:00
# https://github.com/ethereum/eth2.0-specs/blob/v0.4.0/specs/core/0_beacon-chain.md#beacon-chain-fork-choice-rule
Back the db by rocksdb backend
2019-01-14 12:19:44 +00:00
proc lmdGhost*(
implement fork choice (#175) * keep track of a finalized block * keep track of all justified blocks * use naive spec version of LMD ghost * cache slot number and a few more things in BlockRef * keep track of the latest vote of each validator * depend less on the state of node.state (it's a cache, effectively)
2019-03-13 22:59:20 +00:00
pool: AttestationPool, start_state: BeaconState,
start_block: BlockRef): BlockRef =
Fork choice compiles (but untested)
2019-01-08 17:28:21 +00:00
# TODO: a Fenwick Tree datastructure to keep track of cumulated votes
# in O(log N) complexity
# https://en.wikipedia.org/wiki/Fenwick_tree
# Nim implementation for cumulative frequencies at
# https://github.com/numforge/laser/blob/990e59fffe50779cdef33aa0b8f22da19e1eb328/benchmarks/random_sampling/fenwicktree.nim
implement fork choice (#175) * keep track of a finalized block * keep track of all justified blocks * use naive spec version of LMD ghost * cache slot number and a few more things in BlockRef * keep track of the latest vote of each validator * depend less on the state of node.state (it's a cache, effectively)
2019-03-13 22:59:20 +00:00
let
active_validator_indices =
get_active_validator_indices(
start_state.validator_registry, slot_to_epoch(start_state.slot))
var attestation_targets: seq[tuple[validator: ValidatorIndex, blck: BlockRef]]
for i in active_validator_indices:
let pubKey = start_state.validator_registry[i].pubkey
if (let vote = pool.latestAttestation(pubKey); not vote.isNil):
attestation_targets.add((i, vote))
template get_vote_count(blck: BlockRef): uint64 =
var res: uint64
for validator_index, target in attestation_targets.items():
if get_ancestor(target, blck.slot) == blck:
state processing fixes (#177) * remove some redundant state updates * when attesting late, use correct state / head * don't send out obsolete attestations * don't propose obsolete blocks * remove some more resundant state updates :) * simplify block logging (experimental) * document fork choice division * fix some Slot / Epoch conversion warnings
2019-03-14 13:33:56 +00:00
# The div on the balance is to chop off the insignification bits that
# fluctuate a lot epoch to epoch to have a more stable fork choice
implement fork choice (#175) * keep track of a finalized block * keep track of all justified blocks * use naive spec version of LMD ghost * cache slot number and a few more things in BlockRef * keep track of the latest vote of each validator * depend less on the state of node.state (it's a cache, effectively)
2019-03-13 22:59:20 +00:00
res += get_effective_balance(start_state, validator_index) div
FORK_CHOICE_BALANCE_INCREMENT
res
var head = start_block
while true:
if head.children.len() == 0:
return head
head = head.children[0]
var
headCount = get_vote_count(head)
for i in 1..<head.children.len:
if (let hc = get_vote_count(head.children[i]); hc > headCount):
head = head.children[i]
headCount = hc