2023-11-01 03:32:09 +00:00
|
|
|
# Nimbus
|
2024-05-30 17:48:38 +00:00
|
|
|
# Copyright (c) 2018-2024 Status Research & Development GmbH
|
2023-11-01 03:32:09 +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.
|
|
|
|
|
2023-11-08 12:18:32 +00:00
|
|
|
{.push raises: [].}
|
|
|
|
|
2020-07-23 07:54:32 +00:00
|
|
|
import
|
2023-09-28 06:20:12 +00:00
|
|
|
std/[math, times, strutils],
|
2023-08-04 11:10:09 +00:00
|
|
|
eth/[rlp, common/eth_types_rlp],
|
|
|
|
stew/byteutils,
|
2023-09-19 04:52:28 +00:00
|
|
|
nimcrypto,
|
2023-11-08 12:18:32 +00:00
|
|
|
results,
|
2024-05-30 17:48:38 +00:00
|
|
|
../db/aristo,
|
2023-10-05 03:04:12 +00:00
|
|
|
../constants
|
2018-12-03 10:54:19 +00:00
|
|
|
|
2022-09-03 18:15:35 +00:00
|
|
|
export eth_types_rlp
|
2019-02-26 11:26:38 +00:00
|
|
|
|
2023-10-05 03:04:12 +00:00
|
|
|
proc calcRootHash[T](items: openArray[T]): Hash256 {.gcsafe.} =
|
2023-11-08 12:18:32 +00:00
|
|
|
let sig = merkleSignBegin()
|
2018-12-03 10:54:19 +00:00
|
|
|
for i, t in items:
|
2024-06-14 07:31:08 +00:00
|
|
|
sig.merkleSignAdd(rlp.encode(i.uint), rlp.encode(t))
|
No ext update (#2494)
* Imported/rebase from `no-ext`, PR #2485
Store extension nodes together with the branch
Extension nodes must be followed by a branch - as such, it makes sense
to store the two together both in the database and in memory:
* fewer reads, writes and updates to traverse the tree
* simpler logic for maintaining the node structure
* less space used, both memory and storage, because there are fewer
nodes overall
There is also a downside: hashes can no longer be cached for an
extension - instead, only the extension+branch hash can be cached - this
seems like a fine tradeoff since computing it should be fast.
TODO: fix commented code
* Fix merge functions and `toNode()`
* Update `merkleSignCommit()` prototype
why:
Result is always a 32bit hash
* Update short Merkle hash key generation
details:
Ethereum reference MPTs use Keccak hashes as node links if the size of
an RLP encoded node is at least 32 bytes. Otherwise, the RLP encoded
node value is used as a pseudo node link (rather than a hash.) This is
specified in the yellow paper, appendix D.
Different to the `Aristo` implementation, the reference MPT would not
store such a node on the key-value database. Rather the RLP encoded node value is stored instead of a node link in a parent node
is stored as a node link on the parent database.
Only for the root hash, the top level node is always referred to by the
hash.
* Fix/update `Extension` sections
why:
Were commented out after removal of a dedicated `Extension` type which
left the system disfunctional.
* Clean up unused error codes
* Update unit tests
* Update docu
---------
Co-authored-by: Jacek Sieka <jacek@status.im>
2024-07-16 19:47:59 +00:00
|
|
|
sig.merkleSignCommit.value
|
2018-12-03 10:54:19 +00:00
|
|
|
|
|
|
|
template calcTxRoot*(transactions: openArray[Transaction]): Hash256 =
|
|
|
|
calcRootHash(transactions)
|
|
|
|
|
2023-03-09 23:40:55 +00:00
|
|
|
template calcWithdrawalsRoot*(withdrawals: openArray[Withdrawal]): Hash256 =
|
|
|
|
calcRootHash(withdrawals)
|
|
|
|
|
2024-06-14 07:31:08 +00:00
|
|
|
template calcReceiptsRoot*(receipts: openArray[Receipt]): Hash256 =
|
2018-12-03 10:54:19 +00:00
|
|
|
calcRootHash(receipts)
|
2019-02-26 07:04:12 +00:00
|
|
|
|
2023-09-19 04:52:28 +00:00
|
|
|
func sumHash*(hashes: varargs[Hash256]): Hash256 =
|
|
|
|
var ctx: sha256
|
|
|
|
ctx.init()
|
|
|
|
for hash in hashes:
|
|
|
|
ctx.update hash.data
|
|
|
|
ctx.finish result.data
|
|
|
|
ctx.clear()
|
|
|
|
|
2023-10-05 03:04:12 +00:00
|
|
|
proc sumHash*(body: BlockBody): Hash256 {.gcsafe, raises: [].} =
|
2023-09-19 04:52:28 +00:00
|
|
|
let txRoot = calcTxRoot(body.transactions)
|
|
|
|
let ommersHash = keccakHash(rlp.encode(body.uncles))
|
|
|
|
let wdRoot =
|
|
|
|
if body.withdrawals.isSome:
|
|
|
|
calcWithdrawalsRoot(body.withdrawals.get)
|
|
|
|
else:
|
|
|
|
EMPTY_ROOT_HASH
|
|
|
|
sumHash(txRoot, ommersHash, wdRoot)
|
|
|
|
|
|
|
|
proc sumHash*(header: BlockHeader): Hash256 =
|
|
|
|
let wdRoot =
|
|
|
|
if header.withdrawalsRoot.isSome: header.withdrawalsRoot.get else: EMPTY_ROOT_HASH
|
|
|
|
sumHash(header.txRoot, header.ommersHash, wdRoot)
|
|
|
|
|
2023-09-28 06:20:12 +00:00
|
|
|
func hasBody*(h: BlockHeader): bool =
|
|
|
|
h.txRoot != EMPTY_ROOT_HASH or h.ommersHash != EMPTY_UNCLE_HASH or
|
|
|
|
h.withdrawalsRoot.get(EMPTY_ROOT_HASH) != EMPTY_ROOT_HASH
|
|
|
|
|
2019-02-26 07:04:12 +00:00
|
|
|
func generateAddress*(address: EthAddress, nonce: AccountNonce): EthAddress =
|
2019-03-07 15:53:09 +00:00
|
|
|
result[0 .. 19] = keccakHash(rlp.encodeList(address, nonce)).data.toOpenArray(12, 31)
|
2019-02-26 07:04:12 +00:00
|
|
|
|
Transaction: EVMC fix, `CREATE2` salt is a 256-bit blob not a number
This changes fixes a bug in `CREATE2` ops when used with EVMC.
Because it changes the salt type, it affects non-EVMC code as well.
The salt was passed through EVMC with the wrong byte order, although this went
unnoticed as the Nimbus host flipped the byte order before using it.
This was found when running Nimbus with third-party EVM,
["evmone"](https://github.com/ethereum/evmone).
There are different ways to remedy this.
If treated as a number, Nimbus EVM would byte-flip the value when calling EVMC,
then Nimbus host would flip the received value. Finally, it would be flipped a
third time when generating the address in `generateSafeAddress`. The first two
flips can be eliminated by negotiation (like other numbers), but there would
always be one flip.
As a bit pattern, Nimbus EVM would flip the same way it does when dealing with
hashes on the stack (e.g. with `getBlockHash`). Nimbus host wouldn't flip at
all - and when using third-party EVMs there would be no flips in Nimbus.
Because this value is not for arithmetic, any bit pattern is valid, and there
shouldn't be any flips when using a third-party EVM, the bit-pattern
interpretation is favoured. The only flip is done in Nimbus EVM (and might be
eliminated in an optimised version).
As suggested, we'll define a new "opaque 256 bits" type to hold this value.
(Similar to `Hash256`, but the salt isn't necessarily a hash.)
Signed-off-by: Jamie Lokier <jamie@shareable.org>
2021-06-09 22:32:42 +00:00
|
|
|
type ContractSalt* = object
|
|
|
|
bytes*: array[32, byte]
|
|
|
|
|
|
|
|
const ZERO_CONTRACTSALT* = default(ContractSalt)
|
|
|
|
|
|
|
|
func generateSafeAddress*(
|
|
|
|
address: EthAddress, salt: ContractSalt, data: openArray[byte]
|
|
|
|
): EthAddress =
|
2019-05-07 03:23:27 +00:00
|
|
|
const prefix = [0xff.byte]
|
2022-09-03 18:15:35 +00:00
|
|
|
let
|
|
|
|
dataHash = keccakHash(data)
|
|
|
|
hashResult = withKeccakHash:
|
|
|
|
h.update(prefix)
|
|
|
|
h.update(address)
|
|
|
|
h.update(salt.bytes)
|
|
|
|
h.update(dataHash.data)
|
2019-05-07 03:23:27 +00:00
|
|
|
|
|
|
|
result[0 .. 19] = hashResult.data.toOpenArray(12, 31)
|
|
|
|
|
2020-07-04 06:23:09 +00:00
|
|
|
proc crc32*(crc: uint32, buf: openArray[byte]): uint32 =
|
|
|
|
const kcrc32 = [
|
|
|
|
0'u32, 0x1db71064, 0x3b6e20c8, 0x26d930ac, 0x76dc4190, 0x6b6b51f4, 0x4db26158,
|
|
|
|
0x5005713c, 0xedb88320'u32, 0xf00f9344'u32, 0xd6d6a3e8'u32, 0xcb61b38c'u32,
|
|
|
|
0x9b64c2b0'u32, 0x86d3d2d4'u32, 0xa00ae278'u32, 0xbdbdf21c'u32,
|
|
|
|
]
|
|
|
|
|
|
|
|
var crcu32 = not crc
|
|
|
|
for b in buf:
|
|
|
|
crcu32 =
|
|
|
|
(crcu32 shr 4) xor kcrc32[int((crcu32 and 0xF) xor (uint32(b) and 0xF'u32))]
|
|
|
|
crcu32 = (crcu32 shr 4) xor kcrc32[int((crcu32 and 0xF) xor (uint32(b) shr 4'u32))]
|
|
|
|
|
|
|
|
result = not crcu32
|
2022-09-15 07:50:16 +00:00
|
|
|
|
|
|
|
proc short*(h: Hash256): string =
|
|
|
|
var bytes: array[6, byte]
|
|
|
|
bytes[0 .. 2] = h.data[0 .. 2]
|
|
|
|
bytes[^3 ..^ 1] = h.data[^3 ..^ 1]
|
|
|
|
bytes.toHex
|
2023-05-30 08:58:41 +00:00
|
|
|
|
2023-09-28 06:20:12 +00:00
|
|
|
func short*(x: Duration): string =
|
|
|
|
let parts = x.toParts
|
|
|
|
if parts[Hours] > 0:
|
|
|
|
result.add $parts[Hours]
|
|
|
|
result.add ':'
|
|
|
|
|
|
|
|
result.add intToStr(parts[Minutes].int, 2)
|
|
|
|
result.add ':'
|
|
|
|
result.add intToStr(parts[Seconds].int, 2)
|
|
|
|
|
2023-08-16 13:05:43 +00:00
|
|
|
proc decompose*(
|
|
|
|
rlp: var Rlp, header: var BlockHeader, body: var BlockBody
|
2023-05-30 08:58:41 +00:00
|
|
|
) {.gcsafe, raises: [RlpError].} =
|
|
|
|
var blk = rlp.read(EthBlock)
|
|
|
|
header = system.move(blk.header)
|
|
|
|
body.transactions = system.move(blk.txs)
|
|
|
|
body.uncles = system.move(blk.uncles)
|
|
|
|
body.withdrawals = system.move(blk.withdrawals)
|
|
|
|
|
2023-08-16 13:05:43 +00:00
|
|
|
proc decompose*(
|
|
|
|
rlpBytes: openArray[byte], header: var BlockHeader, body: var BlockBody
|
2023-05-30 08:58:41 +00:00
|
|
|
) {.gcsafe, raises: [RlpError].} =
|
|
|
|
var rlp = rlpFromBytes(rlpBytes)
|
|
|
|
rlp.decompose(header, body)
|
2023-08-16 13:05:43 +00:00
|
|
|
|
2023-10-04 03:47:18 +00:00
|
|
|
func gwei*(n: uint64): GasInt =
|
|
|
|
GasInt(n * (10'u64 ^ 9'u64))
|
|
|
|
|
|
|
|
# Helper types to convert gwei into wei more easily
|
|
|
|
func weiAmount*(w: Withdrawal): UInt256 =
|
|
|
|
w.amount.u256 * (10'u64 ^ 9'u64).u256
|
2023-10-05 03:04:12 +00:00
|
|
|
|
|
|
|
func isGenesis*(header: BlockHeader): bool =
|
|
|
|
header.number == 0'u64 and header.parentHash == GENESIS_PARENT_HASH
|