mirror of
https://github.com/status-im/nimbus-eth2.git
synced 2025-01-10 14:26:26 +00:00
125231d321
* implement in-memory block graph * store tail block in database * resolve unknown parents by syncing them from peers * introduce concept of resolved blocks and attestations - those that follow minimal protocol rules * update state head lazily * log more stuff * shortHash -> shortLog * start 9/10 beacon nodes by default, last can be started manually * see also #134 * fix start.sh epoch length
52 lines
1.6 KiB
Nim
52 lines
1.6 KiB
Nim
# Nimbus
|
|
# Copyright (c) 2018 Status Research & Development GmbH
|
|
# Licensed under either of
|
|
# * Apache License, version 2.0, ([LICENSE-APACHE](LICENSE-APACHE) or http://www.apache.org/licenses/LICENSE-2.0)
|
|
# * MIT license ([LICENSE-MIT](LICENSE-MIT) or http://opensource.org/licenses/MIT)
|
|
# at your option. This file may not be copied, modified, or distributed except according to those terms.
|
|
|
|
import options, unittest, sequtils, strutils, eth/trie/[db],
|
|
../beacon_chain/[beacon_chain_db, ssz],
|
|
../beacon_chain/spec/[datatypes, digest, crypto]
|
|
|
|
suite "Beacon chain DB":
|
|
var
|
|
db = init(BeaconChainDB, newMemoryDB())
|
|
|
|
test "empty database":
|
|
check:
|
|
db.getState(Eth2Digest()).isNone
|
|
db.getBlock(Eth2Digest()).isNone
|
|
|
|
test "find ancestors":
|
|
var x: ValidatorSig
|
|
var y = init(ValidatorSig, x.getBytes())
|
|
|
|
check: x == y
|
|
|
|
let
|
|
a0 = BeaconBlock(slot: 0)
|
|
a0r = hash_tree_root_final(a0)
|
|
a1 = BeaconBlock(slot: 1, parent_root: a0r)
|
|
a1r = hash_tree_root_final(a1)
|
|
a2 = BeaconBlock(slot: 2, parent_root: a1r)
|
|
a2r = hash_tree_root_final(a2)
|
|
|
|
doAssert toSeq(db.getAncestors(a0r)) == []
|
|
doAssert toSeq(db.getAncestors(a2r)) == []
|
|
|
|
db.putBlock(a2)
|
|
|
|
doAssert toSeq(db.getAncestors(a0r)) == []
|
|
doAssert toSeq(db.getAncestors(a2r)) == [(a2r, a2)]
|
|
|
|
db.putBlock(a1)
|
|
|
|
doAssert toSeq(db.getAncestors(a0r)) == []
|
|
doAssert toSeq(db.getAncestors(a2r)) == [(a2r, a2), (a1r, a1)]
|
|
|
|
db.putBlock(a0)
|
|
|
|
doAssert toSeq(db.getAncestors(a0r)) == [(a0r, a0)]
|
|
doAssert toSeq(db.getAncestors(a2r)) == [(a2r, a2), (a1r, a1), (a0r, a0)]
|