mirror of
https://github.com/status-im/nimbus-eth1.git
synced 2025-01-28 21:16:29 +00:00
10ad7867e4
* Renaming androgynous sub-object names according to where they belong why: These objects are not explicitly dealt with. They give meaning to some generic wrapper objects. Naming them after their origin may help troubleshooting. * Redefine proof nodes list data type for `snap/1` wire protocol why: The current specification suffered from the fact that the basic data type for a proof node is an RLP encoded hexary node. This slightly confused the encoding/decoding magic. details: This is the second attempt, now wrapping the `seq[Blob]` into a wrapper object of `seq[SnapProof]` for a distinct alias sequence. In the previous attempt, `SnapProof` was a wrapper object holding the `Blob` with magic applied to the `seq[]`. This needed the `append` mixin to strip the outer wrapper that was applied to the `Blob` already when it was passed as argument. * Fix some prototype inconsistency why: For easy reading, `getAccountRange()` handler return code should resemble the `accoundRange()` anruments prototype.
128 lines
4.2 KiB
Nim
128 lines
4.2 KiB
Nim
# Nimbus - Types, data structures and shared utilities used in network sync
|
|
#
|
|
# Copyright (c) 2018-2021 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.
|
|
|
|
## Snap sync components tester and TDD environment
|
|
|
|
import
|
|
std/[random, sequtils],
|
|
eth/common,
|
|
stew/byteutils,
|
|
unittest2,
|
|
../../nimbus/sync/[handlers, protocol],
|
|
../../nimbus/sync/snap/range_desc,
|
|
../../nimbus/sync/snap/worker/db/[hexary_desc, hexary_range],
|
|
./test_helpers
|
|
|
|
const
|
|
accObjRlpMin = 70 # min size of an encoded `Account()` obj
|
|
accObjRlpMax = 110 # max size of an encoded `Account()` obj
|
|
var
|
|
accBlobs: array[accObjRlpMax - accObjRlpMin + 1, Blob]
|
|
brNode = XNodeObj(kind: Branch)
|
|
nodeBlob: Blob
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# Private helpers for `test_calcAccountsListSizes()`
|
|
# ------------------------------------------------------------------------------
|
|
|
|
proc randAccSize(r: var Rand): int =
|
|
## Print random account size
|
|
accObjRlpMin + r.rand(accBlobs.len - 1)
|
|
|
|
proc accBlob(n: int): Blob =
|
|
let inx = n - accObjRlpMin
|
|
if 0 <= inx and inx < accBlobs.len:
|
|
accBlobs[inx]
|
|
else:
|
|
@[]
|
|
|
|
proc initAccBlobs() =
|
|
if accBlobs[0].len == 0:
|
|
let ffAccLen = Account(
|
|
storageRoot: Hash256(data: high(UInt256).toBytesBE),
|
|
codeHash: Hash256(data: high(UInt256).toBytesBE),
|
|
nonce: high(uint64),
|
|
balance: high(UInt256)).encode.len
|
|
|
|
check accObjRlpMin == Account().encode.len
|
|
check accObjRlpMax == ffAccLen
|
|
|
|
# Initialise
|
|
for n in 0 ..< accBlobs.len:
|
|
accBlobs[n] = 5.byte.repeat(accObjRlpMin + n)
|
|
|
|
# Verify
|
|
for n in 0 .. (accObjRlpMax + 2):
|
|
if accObjRlpMin <= n and n <= accObjRlpMax:
|
|
check n == accBlob(n).len
|
|
else:
|
|
check 0 == accBlob(n).len
|
|
|
|
proc accRndChain(r: var Rand; nItems: int): seq[RangeLeaf] =
|
|
for n in 0 ..< nItems:
|
|
result.add RangeLeaf(data: accBlob(r.randAccSize()))
|
|
discard result[^1].key.init (n mod 256).byte.repeat(32)
|
|
|
|
proc accRndChain(seed: int; nItems: int): seq[RangeLeaf] =
|
|
var prng = initRand(seed)
|
|
prng.accRndChain(nItems)
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# Private helpers for `test_calcProofsListSizes()`
|
|
# ------------------------------------------------------------------------------
|
|
|
|
proc initBranchNodeSample() =
|
|
if nodeBlob.len == 0:
|
|
for n in 0 .. 15:
|
|
brNode.bLink[n] = high(NodeTag).to(Blob)
|
|
nodeBlob = brNode.convertTo(Blob)
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# Public test function
|
|
# ------------------------------------------------------------------------------
|
|
|
|
proc test_calcAccountsListSizes*() =
|
|
## Verify accounts size calculation for `hexaryRangeLeafsProof()`.
|
|
initAccBlobs()
|
|
|
|
let chain = 42.accRndChain(123)
|
|
|
|
# Emulate `hexaryRangeLeafsProof()` size calculations
|
|
var sizeAccu = 0
|
|
for n in 0 ..< chain.len:
|
|
let (pairLen,listLen) =
|
|
chain[n].data.len.hexaryRangeRlpLeafListSize(sizeAccu)
|
|
check listLen == chain[0 .. n].encode.len
|
|
sizeAccu += pairLen
|
|
|
|
|
|
proc test_calcProofsListSizes*() =
|
|
## RLP does not allow static check ..
|
|
initBranchNodeSample()
|
|
|
|
for n in [0, 1, 2, 126, 127]:
|
|
let
|
|
nodeSample = nodeBlob.to(SnapProof).repeat(n)
|
|
nodeBlobsEncoded = nodeSample.proofEncode
|
|
nodeBlobsDecoded = nodeBlobsEncoded.proofDecode
|
|
nodeBlobsHex = nodeBlobsEncoded.toHex
|
|
brNodesHex = brNode.repeat(n).convertTo(Blob).toHex
|
|
#echo "+++ ", n, " ", nodeBlobsEncoded.rlpFromBytes.inspect
|
|
#echo ">>> ", n, " ", nodeBlobsHex
|
|
#echo "<<< ", n, " ", brNodesHex
|
|
check nodeBlobsEncoded.len == n.proofNodesSizeMax
|
|
check nodeBlobsDecoded == nodeSample
|
|
check nodeBlobsHex == brNodesHex
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# End
|
|
# ------------------------------------------------------------------------------
|