314 lines
9.9 KiB
Nim
314 lines
9.9 KiB
Nim
import
|
|
stew/[byteutils, endians2], json, strutils,
|
|
nimcrypto/[keccak, hash], eth/[common, rlp],
|
|
eth/trie/[trie_defs, nibbles, db],
|
|
./witness_types, ../nimbus/constants,
|
|
../nimbus/db/storage_types, ./multi_keys
|
|
|
|
type
|
|
DB = TrieDatabaseRef
|
|
|
|
WitnessBuilder* = object
|
|
db*: DB
|
|
root: KeccakHash
|
|
flags: WitnessFlags
|
|
node: JsonNode
|
|
jStack: seq[JsonNode]
|
|
|
|
StackElem = object
|
|
node: seq[byte]
|
|
parentGroup: Group
|
|
keys: MultikeysRef
|
|
depth: int
|
|
storageMode: bool
|
|
|
|
proc initWitnessBuilder*(db: DB, rootHash: KeccakHash, flags: WitnessFlags = {}): WitnessBuilder =
|
|
result.db = db
|
|
result.root = rootHash
|
|
result.flags = flags
|
|
result.node = newJObject()
|
|
result.jStack = @[]
|
|
|
|
template extensionNodeKey(r: Rlp): auto =
|
|
hexPrefixDecode r.listElem(0).toBytes
|
|
|
|
proc expectHash(r: Rlp): seq[byte] =
|
|
result = r.toBytes
|
|
if result.len != 32:
|
|
raise newException(RlpTypeMismatch,
|
|
"RLP expected to be a Keccak hash value, but has an incorrect length")
|
|
|
|
template getNode(elem: untyped): untyped =
|
|
if elem.isList: @(elem.rawData)
|
|
else: @(get(wb.db, elem.expectHash))
|
|
|
|
proc rlpListToBitmask(r: var Rlp): uint =
|
|
var i = 0
|
|
for branch in r:
|
|
if not branch.isEmpty:
|
|
result.setBranchMaskBit(i)
|
|
inc i
|
|
r.position = 0
|
|
|
|
proc writeByte(wb: var WitnessBuilder, x: byte, name: string) =
|
|
wb.node[name] = newJString("0x" & toHex(x.int, 2))
|
|
|
|
proc write(wb: var WitnessBuilder, x: openArray[byte], name: string) =
|
|
wb.node[name] = newJString("0x" & toHex(x))
|
|
|
|
proc write(wb: var WitnessBuilder, a, b: byte, name: string) =
|
|
wb.node[name] = newJString("0x" & toHex(a.int, 2) & toHex(b.int, 2))
|
|
|
|
proc write(wb: var WitnessBuilder, x: bool, name: string) =
|
|
wb.node[name] = newJBool(x)
|
|
|
|
proc pushArray(wb: var WitnessBuilder, name: string) =
|
|
var node = newJArray()
|
|
wb.node[name] = node
|
|
wb.jStack.add wb.node
|
|
wb.node = node
|
|
|
|
proc pushObject(wb: var WitnessBuilder, name: string) =
|
|
var node = newJObject()
|
|
wb.node[name] = node
|
|
wb.jStack.add wb.node
|
|
wb.node = node
|
|
|
|
proc addObject(wb: var WitnessBuilder) =
|
|
var node = newJObject()
|
|
wb.node.add node
|
|
wb.jStack.add wb.node
|
|
wb.node = node
|
|
|
|
proc pop(wb: var WitnessBuilder) =
|
|
wb.node = wb.jStack.pop()
|
|
|
|
proc writeU32Impl(wb: var WitnessBuilder, x: uint32, name: string) =
|
|
let y = toBE(x)
|
|
wb.node[name] = newJString("0x0" & toHex(y.int, 8))
|
|
|
|
template writeU32(wb: var WitnessBuilder, x: untyped, name: string) =
|
|
wb.writeU32Impl(uint32(x), name)
|
|
|
|
template writeByte(wb: var WitnessBuilder, x: untyped, name: string) =
|
|
writeByte(wb, byte(x), name)
|
|
|
|
proc writeNibbles(wb: var WitnessBuilder; n: NibblesSeq) =
|
|
# convert the NibblesSeq into left aligned byte seq
|
|
# perhaps we can optimize it if the NibblesSeq already left aligned
|
|
let nibblesLen = n.len
|
|
let numBytes = nibblesLen div 2 + nibblesLen mod 2
|
|
var bytes: array[32, byte]
|
|
doAssert(nibblesLen >= 1)
|
|
doAssert(numBytes >= 0 and numBytes <= 64)
|
|
for pos in 0..<n.len:
|
|
if (pos and 1) != 0:
|
|
bytes[pos div 2] = bytes[pos div 2] or n[pos]
|
|
else:
|
|
bytes[pos div 2] = bytes[pos div 2] or (n[pos] shl 4)
|
|
|
|
wb.writeByte(nibblesLen, "nibblesLen")
|
|
wb.write(bytes.toOpenArray(0, numBytes-1), "nibbles")
|
|
|
|
proc writeExtensionNode(wb: var WitnessBuilder, n: NibblesSeq, depth: int, node: openArray[byte]) =
|
|
wb.addObject()
|
|
wb.writeByte(ExtensionNodeType, "nodeType")
|
|
wb.writeNibbles(n)
|
|
wb.writeByte(depth, "debugDepth")
|
|
wb.write(keccak(node).data, "debugHash")
|
|
wb.pop()
|
|
|
|
proc writeBranchNode(wb: var WitnessBuilder, mask: uint, depth: int, node: openArray[byte]) =
|
|
doAssert mask.branchMaskBitIsSet(16) == false
|
|
|
|
wb.addObject()
|
|
wb.writeByte(BranchNodeType, "nodeType")
|
|
wb.write(byte((mask shr 8) and 0xFF), byte(mask and 0xFF), "mask")
|
|
wb.writeByte(depth, "debugDepth")
|
|
wb.write(keccak(node).data, "debugHash")
|
|
wb.pop()
|
|
|
|
proc writeHashNode(wb: var WitnessBuilder, node: openArray[byte]) =
|
|
wb.addObject()
|
|
wb.writeByte(HashNodeType, "nodeType")
|
|
wb.write(node, "data")
|
|
wb.pop()
|
|
|
|
proc writeHashNode(wb: var WitnessBuilder, node: openArray[byte], name: string) =
|
|
wb.pushObject(name)
|
|
wb.writeByte(HashNodeType, "nodeType")
|
|
wb.write(node, "data")
|
|
wb.pop()
|
|
|
|
proc getBranchRecurse(wb: var WitnessBuilder, z: var StackElem)
|
|
|
|
proc writeAccountNode(wb: var WitnessBuilder, kd: KeyData, acc: Account, nibbles: NibblesSeq, node: openArray[byte], depth: int) =
|
|
|
|
wb.addObject()
|
|
wb.writeByte(AccountNodeType, "nodeType")
|
|
|
|
doAssert(nibbles.len == 64 - depth)
|
|
var accountType = if acc.codeHash == blankStringHash and acc.storageRoot == emptyRlpHash: SimpleAccountType
|
|
else: ExtendedAccountType
|
|
|
|
if not kd.codeTouched:
|
|
accountType = CodeUntouched
|
|
|
|
wb.writeByte(accountType, "accountType")
|
|
wb.writeNibbles(nibbles)
|
|
wb.write(kd.address, "address")
|
|
wb.write(acc.balance.toBytesBE, "balance")
|
|
wb.write(acc.nonce.u256.toBytesBE, "nonce")
|
|
|
|
if accountType != SimpleAccountType:
|
|
if not kd.codeTouched:
|
|
wb.writeHashNode(acc.codeHash.data, "codeHash")
|
|
let code = get(wb.db, contractHashKey(acc.codeHash).toOpenArray)
|
|
if wfEIP170 in wb.flags and code.len > EIP170_CODE_SIZE_LIMIT:
|
|
raise newException(ContractCodeError, "code len exceed EIP170 code size limit")
|
|
wb.writeU32(code.len, "codeLen")
|
|
elif acc.codeHash != blankStringHash:
|
|
let code = get(wb.db, contractHashKey(acc.codeHash).toOpenArray)
|
|
if wfEIP170 in wb.flags and code.len > EIP170_CODE_SIZE_LIMIT:
|
|
raise newException(ContractCodeError, "code len exceed EIP170 code size limit")
|
|
wb.writeU32(code.len, "codeLen")
|
|
wb.write(code, "code")
|
|
else:
|
|
wb.writeU32(0'u32, "codeLen")
|
|
|
|
if kd.storageKeys.isNil:
|
|
wb.writeHashNode(acc.storageRoot.data, "storageRoot")
|
|
elif acc.storageRoot != emptyRlpHash:
|
|
var zz = StackElem(
|
|
node: wb.db.get(acc.storageRoot.data),
|
|
parentGroup: kd.storageKeys.initGroup(),
|
|
keys: kd.storageKeys,
|
|
depth: 0, # reset depth
|
|
storageMode: true # switch to storage mode
|
|
)
|
|
wb.pushArray("storage")
|
|
getBranchRecurse(wb, zz)
|
|
wb.pop()
|
|
else:
|
|
wb.writeHashNode(emptyRlpHash.data, "storageRoot")
|
|
|
|
wb.writeByte(depth, "debugDepth")
|
|
wb.write(keccak(node).data, "debugHash")
|
|
wb.pop()
|
|
|
|
proc writeAccountStorageLeafNode(wb: var WitnessBuilder, key: openArray[byte], val: UInt256, nibbles: NibblesSeq, node: openArray[byte], depth: int) =
|
|
doAssert(nibbles.len == 64 - depth)
|
|
|
|
wb.addObject()
|
|
wb.writeByte(StorageLeafNodeType, "nodeType")
|
|
wb.writeNibbles(nibbles)
|
|
wb.write(key, "key")
|
|
wb.write(val.toBytesBE, "value")
|
|
wb.writeByte(depth, "debugDepth")
|
|
wb.write(keccak(node).data, "debugHash")
|
|
wb.pop()
|
|
|
|
proc getBranchRecurse(wb: var WitnessBuilder, z: var StackElem) =
|
|
if z.node.len == 0: return
|
|
var nodeRlp = rlpFromBytes z.node
|
|
|
|
case nodeRlp.listLen
|
|
of 2:
|
|
let (isLeaf, k) = nodeRlp.extensionNodeKey
|
|
var match = false
|
|
# only zero or one group can match the path
|
|
# but if there is a match, it can be in any position
|
|
# 1st, 2nd, or max 3rd position
|
|
# recursion will go deeper depend on the common-prefix length nibbles
|
|
for mg in groups(z.keys, z.depth, k, z.parentGroup):
|
|
if not mg.match: continue
|
|
doAssert(match == false) # should be only one match
|
|
match = true
|
|
let value = nodeRlp.listElem(1)
|
|
if not isLeaf:
|
|
# ExtensionNodeType
|
|
writeExtensionNode(wb, k, z.depth, z.node)
|
|
var zz = StackElem(
|
|
node: value.getNode,
|
|
parentGroup: mg.group,
|
|
keys: z.keys,
|
|
depth: z.depth + k.len,
|
|
storageMode: z.storageMode
|
|
)
|
|
getBranchRecurse(wb, zz)
|
|
else:
|
|
# this should be only one match
|
|
# if there is more than one match
|
|
# it means we encounter an invalid address
|
|
for kd in keyDatas(z.keys, mg.group):
|
|
if not match(kd, k, z.depth): continue # skip the invalid address
|
|
kd.visited = true
|
|
if z.storageMode:
|
|
doAssert(kd.storageMode)
|
|
writeAccountStorageLeafNode(wb, kd.storageSlot, value.toBytes.decode(UInt256), k, z.node, z.depth)
|
|
else:
|
|
doAssert(not kd.storageMode)
|
|
writeAccountNode(wb, kd, value.toBytes.decode(Account), k, z.node, z.depth)
|
|
if not match:
|
|
writeHashNode(wb, keccak(z.node).data)
|
|
of 17:
|
|
let branchMask = rlpListToBitmask(nodeRlp)
|
|
writeBranchNode(wb, branchMask, z.depth, z.node)
|
|
let path = groups(z.keys, z.parentGroup, z.depth)
|
|
|
|
# if there is a match in any branch elem
|
|
# 1st to 16th, the recursion will go deeper
|
|
# by one nibble
|
|
let notLeaf = z.depth != 63 # path.len == 0
|
|
for i in 0..<16:
|
|
if not branchMask.branchMaskBitIsSet(i): continue
|
|
var branch = nodeRlp.listElem(i)
|
|
if notLeaf and branchMaskBitIsSet(path.mask, i):
|
|
var zz = StackElem(
|
|
node: branch.getNode,
|
|
parentGroup: path.groups[i],
|
|
keys: z.keys,
|
|
depth: z.depth + 1,
|
|
storageMode: z.storageMode
|
|
)
|
|
getBranchRecurse(wb, zz)
|
|
else:
|
|
if branch.isList:
|
|
doAssert(false, "Short node should not exist in block witness")
|
|
else:
|
|
# this is a potential branch for multiproof
|
|
writeHashNode(wb, branch.expectHash)
|
|
|
|
# 17th elem should always empty
|
|
doAssert branchMask.branchMaskBitIsSet(16) == false
|
|
else:
|
|
raise newException(CorruptedTrieDatabase,
|
|
"HexaryTrie node with an unexpected number of children")
|
|
|
|
proc buildWitness*(wb: var WitnessBuilder, keys: MultikeysRef): string =
|
|
|
|
# witness version
|
|
wb.writeByte(BlockWitnessVersion, "version")
|
|
|
|
# one or more trees
|
|
|
|
# we only output one tree
|
|
wb.writeByte(MetadataNothing, "metadata")
|
|
|
|
wb.write(wb.root.data, "rootHash")
|
|
wb.write(false, "error")
|
|
|
|
wb.pushArray("tree")
|
|
|
|
var z = StackElem(
|
|
node: @(wb.db.get(wb.root.data)),
|
|
parentGroup: keys.initGroup(),
|
|
keys: keys,
|
|
depth: 0,
|
|
storageMode: false
|
|
)
|
|
getBranchRecurse(wb, z)
|
|
|
|
wb.pop()
|
|
result = wb.node.pretty()
|