mirror of
https://github.com/status-im/nimbus-eth1.git
synced 2025-02-21 16:28:25 +00:00
657379f484
* Register paths for added leafs because of trie re-balancing why: While the payload would not change, the prefix in the leaf vertex would. So it needs to be flagged for hash recompilation for the `hashify()` module. also: Make sure that `Hike` paths which might have vertex links into the backend filter are replaced by vertex copies before manipulating. Otherwise the vertices on the immutable filter might be involuntarily changed. * Also check for paths where the leaf vertex is on the backend, already why: A a path can have dome vertices on the top layer cache with the `Leaf` vertex on the backend. * Re-define a void `HashLabel` type. why: A `HashLabel` type is a pair `(root-vertex-ID, Keccak-hash)`. Previously, a valid `HashLabel` consisted of a non-empty hash and a non-zero vertex ID. This definition leads to a non-unique representation of a void `HashLabel` with either root-ID or has void. This has been changed to the unique void `HashLabel` exactly if the hash entry is void. * Update consistency checkers * Re-org `hashify()` procedure why: Syncing against block chain showed serious deficiencies which produced wrong hashes or simply bailed out with error. So all fringe cases (mainly due to deleted entries) could be integrated into the labelling schedule rather than handling separate fringe cases.
50 lines
1.4 KiB
Nim
50 lines
1.4 KiB
Nim
# nimbus-eth1
|
|
# Copyright (c) 2023 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.
|
|
|
|
{.push raises: [].}
|
|
|
|
import
|
|
std/sets,
|
|
eth/[common, trie/nibbles],
|
|
./aristo_desc/desc_identifiers
|
|
|
|
const
|
|
EmptyBlob* = seq[byte].default
|
|
## Useful shortcut (borrowed from `sync/snap/constants.nim`)
|
|
|
|
EmptyNibbleSeq* = EmptyBlob.initNibbleRange
|
|
## Useful shortcut (borrowed from `sync/snap/constants.nim`)
|
|
|
|
EmptyVidSeq* = seq[VertexID].default
|
|
## Useful shortcut
|
|
|
|
EmptyVidSet* = EmptyVidSeq.toHashSet
|
|
## Useful shortcut
|
|
|
|
VOID_CODE_HASH* = EMPTY_CODE_HASH
|
|
## Equivalent of `nil` for `Account` object code hash
|
|
|
|
VOID_HASH_KEY* = HashKey()
|
|
## Void equivalent for Merkle hash value
|
|
|
|
VOID_HASH_LABEL* = HashLabel(key: VOID_HASH_KEY)
|
|
## Void equivalent for Merkle hash value
|
|
|
|
EmptyQidPairSeq* = seq[(QueueID,QueueID)].default
|
|
## Useful shortcut
|
|
|
|
DEFAULT_QID_QUEUES* = [
|
|
(128, 0), ## Consecutive list of 128 filter slots
|
|
( 64, 63), ## Overflow list, 64 filters, skipping 63 filters in-between
|
|
( 64, 127), ## ..
|
|
( 64, 255)]
|
|
|
|
# End
|