Core db and aristo updates for destructor and tx logic (#1894)
* Disable `TransactionID` related functions from `state_db.nim`
why:
Functions `getCommittedStorage()` and `updateOriginalRoot()` from
the `state_db` module are nowhere used. The emulation of a legacy
`TransactionID` type functionality is administratively expensive to
provide by `Aristo` (the legacy DB version is only partially
implemented, anyway).
As there is no other place where `TransactionID`s are used, they will
not be provided by the `Aristo` variant of the `CoreDb`. For the
legacy DB API, nothing will change.
* Fix copyright headers in source code
* Get rid of compiler warning
* Update Aristo code, remove unused `merge()` variant, export `hashify()`
why:
Adapt to upcoming `CoreDb` wrapper
* Remove synced tx feature from `Aristo`
why:
+ This feature allowed to synchronise transaction methods like begin,
commit, and rollback for a group of descriptors.
+ The feature is over engineered and not needed for `CoreDb`, neither
is it complete (some convergence features missing.)
* Add debugging helpers to `Kvt`
also:
Update database iterator, add count variable yield argument similar
to `Aristo`.
* Provide optional destructors for `CoreDb` API
why;
For the upcoming Aristo wrapper, this allows to control when certain
smart destruction and update can take place. The auto destructor works
fine in general when the storage/cache strategy is known and acceptable
when creating descriptors.
* Add update option for `CoreDb` API function `hash()`
why;
The hash function is typically used to get the state root of the MPT.
Due to lazy hashing, this might be not available on the `Aristo` DB.
So the `update` function asks for re-hashing the gurrent state changes
if needed.
* Update API tracking log mode: `info` => `debug
* Use shared `Kvt` descriptor in new Ledger API
why:
No need to create a new descriptor all the time
2023-11-16 19:35:03 +00:00
|
|
|
# Nimbus
|
2024-02-01 21:27:48 +00:00
|
|
|
# Copyright (c) 2023-2024 Status Research & Development GmbH
|
2023-05-11 14:25:29 +00:00
|
|
|
# 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 (aka Patricia) DB trancoder test
|
|
|
|
|
|
|
|
import
|
|
|
|
eth/common,
|
2023-08-21 14:58:30 +00:00
|
|
|
results,
|
2023-05-11 14:25:29 +00:00
|
|
|
stew/byteutils,
|
|
|
|
unittest2,
|
2023-08-21 14:58:30 +00:00
|
|
|
../../nimbus/db/aristo,
|
2024-06-04 15:05:13 +00:00
|
|
|
../../nimbus/db/aristo/[aristo_check, aristo_debug, aristo_desc],
|
2023-10-11 19:09:11 +00:00
|
|
|
../replay/xcheck,
|
2023-08-21 14:58:30 +00:00
|
|
|
./test_helpers
|
2023-05-11 14:25:29 +00:00
|
|
|
|
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
# Public test function
|
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
|
2023-11-08 12:18:32 +00:00
|
|
|
proc testShortKeys*(
|
|
|
|
noisy = true;
|
|
|
|
): bool =
|
|
|
|
## Check for some pathological cases
|
|
|
|
func x(s: string): Blob = s.hexToSeqByte
|
|
|
|
func k(s: string): HashKey = HashKey.fromBytes(s.x).value
|
|
|
|
|
|
|
|
let samples = [
|
|
|
|
# From InvalidBlocks/bc4895-withdrawals/twoIdenticalIndex.json
|
|
|
|
[("80".x,
|
|
|
|
"da808094c94f5374fce5edbc8e2a8697c15331677e6ebf0b822710".x,
|
|
|
|
"27f166f1d7c789251299535cb176ba34116e44894476a7886fe5d73d9be5c973".k),
|
|
|
|
("01".x,
|
|
|
|
"da028094c94f5374fce5edbc8e2a8697c15331677e6ebf0b822710".x,
|
|
|
|
"81eac5f476f48feb289af40ee764015f6b49036760438ea45df90d5342b6ae61".k),
|
|
|
|
("02".x,
|
|
|
|
"da018094c94f5374fce5edbc8e2a8697c15331677e6ebf0b822710".x,
|
|
|
|
"463769ae507fcc6d6231c8888425191c5622f330fdd4b78a7b24c4521137b573".k),
|
|
|
|
("03".x,
|
|
|
|
"da028094c94f5374fce5edbc8e2a8697c15331677e6ebf0b822710".x,
|
|
|
|
"a95b9a7b58a6b3cb4001eb0be67951c5517141cb0183a255b5cae027a7b10b36".k)]]
|
|
|
|
|
2023-12-12 17:47:41 +00:00
|
|
|
let gossip = false # or noisy
|
|
|
|
|
2023-11-08 12:18:32 +00:00
|
|
|
for n,sample in samples:
|
|
|
|
let sig = merkleSignBegin()
|
|
|
|
var inx = -1
|
|
|
|
for (k,v,r) in sample:
|
|
|
|
inx.inc
|
|
|
|
sig.merkleSignAdd(k,v)
|
2023-12-12 17:47:41 +00:00
|
|
|
gossip.say "*** testShortkeys (1)", "n=", n, " inx=", inx,
|
2023-11-08 12:18:32 +00:00
|
|
|
"\n k=", k.toHex, " v=", v.toHex,
|
|
|
|
"\n r=", r.pp(sig),
|
|
|
|
"\n ", sig.pp(),
|
|
|
|
"\n"
|
|
|
|
let w = sig.merkleSignCommit().value
|
2023-12-12 17:47:41 +00:00
|
|
|
gossip.say "*** testShortkeys (2)", "n=", n, " inx=", inx,
|
2023-11-08 12:18:32 +00:00
|
|
|
"\n k=", k.toHex, " v=", v.toHex,
|
|
|
|
"\n r=", r.pp(sig),
|
|
|
|
"\n R=", w.pp(sig),
|
|
|
|
"\n ", sig.pp(),
|
|
|
|
"\n ----------------",
|
|
|
|
"\n"
|
|
|
|
let rc = sig.db.check
|
|
|
|
xCheckRc rc.error == (0,0)
|
|
|
|
xCheck r == w
|
|
|
|
|
|
|
|
true
|
|
|
|
|
2023-05-11 14:25:29 +00:00
|
|
|
# ------------------------------------------------------------------------------
|
|
|
|
# End
|
|
|
|
# ------------------------------------------------------------------------------
|