mirror of
https://github.com/status-im/nimbus-eth1.git
synced 2025-01-10 12:26:02 +00:00
8e18e85288
* Aristo: Reorg `hashify()` using different schedule algorithm why: Directly calculating the search tree top down from the roots turns out to be faster than using the cached structures left over by `merge()` and `delete()`. Time gains is short of 20% * Aristo: Remove `lTab[]` leaf entry object type why: Not used anymore. It was previously needed to build the schedule for `hashify()`. * Aristo: Avoid unnecessary re-org of the vertex ID recycling list why: This list can become quite large so a heuristic is employed whether it makes sense to re-org. Also, re-org check is only done by `delete()` functions. * Aristo: Remove key/reverse lookup table from tx layers why: It is ignored except for handling proof nodes and costs unnecessary run time resources. This feature was originally needed to accommodate the mental transition from the legacy MPT to the `Aristo` trie :). * Fix copyright year
68 lines
2.0 KiB
Nim
68 lines
2.0 KiB
Nim
# nimbus-eth1
|
|
# Copyright (c) 2023-2024 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.
|
|
|
|
## Aristo DB -- Sign Helper
|
|
## ========================
|
|
##
|
|
{.push raises: [].}
|
|
|
|
import
|
|
eth/common,
|
|
results,
|
|
"."/[aristo_constants, aristo_desc, aristo_get, aristo_hashify, aristo_init,
|
|
aristo_merge]
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# Public functions, signature generator
|
|
# ------------------------------------------------------------------------------
|
|
|
|
proc merkleSignBegin*(): MerkleSignRef =
|
|
## Start signature calculator for a list of key-value items.
|
|
let
|
|
db = AristoDbRef.init VoidBackendRef
|
|
vid = VertexID(2)
|
|
MerkleSignRef(
|
|
root: vid,
|
|
db: db)
|
|
|
|
proc merkleSignAdd*(
|
|
sdb: MerkleSignRef;
|
|
key: openArray[byte];
|
|
val: openArray[byte];
|
|
) =
|
|
## Add key-value item to the signature list. The order of the items to add
|
|
## is irrelevant.
|
|
if sdb.error == AristoError(0):
|
|
sdb.count.inc
|
|
discard sdb.db.merge(sdb.root, key, val, VOID_PATH_ID).valueOr:
|
|
sdb.`error` = error
|
|
sdb.errKey = @key
|
|
return
|
|
|
|
proc merkleSignCommit*(
|
|
sdb: MerkleSignRef;
|
|
): Result[HashKey,(Blob,AristoError)] =
|
|
## Finish with the list, calculate signature and return it.
|
|
if sdb.count == 0:
|
|
return ok VOID_HASH_KEY
|
|
if sdb.error != AristoError(0):
|
|
return err((sdb.errKey, sdb.error))
|
|
sdb.db.hashify().isOkOr:
|
|
let w = (EmptyBlob, error[1])
|
|
return err(w)
|
|
let hash = sdb.db.getKeyRc(sdb.root).valueOr:
|
|
let w = (EmptyBlob, error)
|
|
return err(w)
|
|
ok hash
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# End
|
|
# ------------------------------------------------------------------------------
|