2022-01-18 14:40:02 +00:00
|
|
|
# Nimbus
|
2025-01-05 15:05:29 +07:00
|
|
|
# Copyright (c) 2018-2025 Status Research & Development GmbH
|
2022-01-18 14:40:02 +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.
|
|
|
|
|
|
|
|
import
|
2025-01-05 15:05:29 +07:00
|
|
|
std/math,
|
2024-12-26 17:07:25 +07:00
|
|
|
eth/common/keys,
|
|
|
|
results,
|
|
|
|
unittest2,
|
|
|
|
../hive_integration/nodocker/engine/tx_sender,
|
|
|
|
../hive_integration/nodocker/engine/cancun/blobs,
|
2025-02-11 22:28:42 +00:00
|
|
|
../execution_chain/db/ledger,
|
|
|
|
../execution_chain/core/chain,
|
|
|
|
../execution_chain/core/eip4844,
|
|
|
|
../execution_chain/[config, transaction, constants],
|
|
|
|
../execution_chain/core/tx_pool,
|
|
|
|
../execution_chain/core/tx_pool/tx_desc,
|
|
|
|
../execution_chain/common/common,
|
|
|
|
../execution_chain/utils/utils,
|
2025-01-05 15:05:29 +07:00
|
|
|
./macro_assembler
|
2022-01-18 14:40:02 +00:00
|
|
|
|
|
|
|
const
|
2024-12-26 17:07:25 +07:00
|
|
|
genesisFile = "tests/customgenesis/merge.json"
|
|
|
|
feeRecipient = address"0000000000000000000000000000000000000212"
|
|
|
|
recipient = address"0000000000000000000000000000000000000213"
|
2025-01-05 15:05:29 +07:00
|
|
|
recipient214 = address"0000000000000000000000000000000000000214"
|
2024-12-26 17:07:25 +07:00
|
|
|
prevRandao = Bytes32 EMPTY_UNCLE_HASH
|
2025-01-05 15:05:29 +07:00
|
|
|
contractCode = evmByteCode:
|
|
|
|
PrevRandao # VAL
|
|
|
|
Push1 "0x11" # KEY
|
|
|
|
Sstore # OP
|
|
|
|
Stop
|
|
|
|
slot = 0x11.u256
|
|
|
|
amount = 1000.u256
|
2024-12-26 17:07:25 +07:00
|
|
|
|
|
|
|
type
|
|
|
|
TestEnv = object
|
|
|
|
conf : NimbusConf
|
|
|
|
com : CommonRef
|
|
|
|
chain : ForkedChainRef
|
|
|
|
xp : TxPoolRef
|
|
|
|
sender: TxSender
|
|
|
|
|
|
|
|
CustomTx = CustomTransactionData
|
|
|
|
|
|
|
|
proc initEnv(envFork: HardFork): TestEnv =
|
|
|
|
var conf = makeConfig(
|
|
|
|
@["--custom-network:" & genesisFile]
|
|
|
|
)
|
|
|
|
|
|
|
|
doAssert envFork >= MergeFork
|
|
|
|
|
2025-01-16 12:10:52 +07:00
|
|
|
let cc = conf.networkParams.config
|
2024-12-26 17:07:25 +07:00
|
|
|
if envFork >= MergeFork:
|
2025-01-16 12:10:52 +07:00
|
|
|
cc.mergeNetsplitBlock = Opt.some(0'u64)
|
2024-12-26 17:07:25 +07:00
|
|
|
|
|
|
|
if envFork >= Shanghai:
|
2025-01-16 12:10:52 +07:00
|
|
|
cc.shanghaiTime = Opt.some(0.EthTime)
|
2024-12-26 17:07:25 +07:00
|
|
|
|
|
|
|
if envFork >= Cancun:
|
2025-01-16 12:10:52 +07:00
|
|
|
cc.cancunTime = Opt.some(0.EthTime)
|
2024-12-26 17:07:25 +07:00
|
|
|
|
|
|
|
if envFork >= Prague:
|
2025-01-16 12:10:52 +07:00
|
|
|
cc.pragueTime = Opt.some(0.EthTime)
|
|
|
|
|
|
|
|
if envFork >= Osaka:
|
|
|
|
cc.osakaTime = Opt.some(0.EthTime)
|
2024-12-26 17:07:25 +07:00
|
|
|
|
2025-01-05 15:05:29 +07:00
|
|
|
conf.networkParams.genesis.alloc[recipient] = GenesisAccount(code: contractCode)
|
|
|
|
|
2024-12-26 17:07:25 +07:00
|
|
|
let
|
|
|
|
# create the sender first, because it will modify networkParams
|
|
|
|
sender = TxSender.new(conf.networkParams, 30)
|
|
|
|
com = CommonRef.new(newCoreDbRef DefaultDbMemory,
|
|
|
|
nil, conf.networkId, conf.networkParams)
|
|
|
|
chain = ForkedChainRef.init(com)
|
|
|
|
|
|
|
|
TestEnv(
|
|
|
|
conf : conf,
|
|
|
|
com : com,
|
|
|
|
chain : chain,
|
|
|
|
xp : TxPoolRef.new(chain),
|
|
|
|
sender: sender
|
|
|
|
)
|
|
|
|
|
|
|
|
template checkAddTx(xp, tx, errorCode) =
|
|
|
|
let prevCount = xp.len
|
|
|
|
let rc = xp.addTx(tx)
|
|
|
|
check rc.isErr == true
|
|
|
|
if rc.isErr:
|
|
|
|
check rc.error == errorCode
|
|
|
|
check xp.len == prevCount
|
|
|
|
|
|
|
|
template checkAddTx(xp, tx) =
|
|
|
|
let expCount = xp.len + 1
|
|
|
|
let rc = xp.addTx(tx)
|
|
|
|
check rc.isOk == true
|
|
|
|
if rc.isErr:
|
|
|
|
debugEcho "ADD TX: ", rc.error
|
|
|
|
check xp.len == expCount
|
|
|
|
|
|
|
|
template checkAddTxSupersede(xp, tx) =
|
|
|
|
let prevCount = xp.len
|
|
|
|
let rc = xp.addTx(tx)
|
|
|
|
check rc.isOk == true
|
|
|
|
if rc.isErr:
|
|
|
|
debugEcho "ADD TX SUPERSEDE: ", rc.error
|
|
|
|
check xp.len == prevCount
|
|
|
|
|
|
|
|
template checkAssembleBlock(xp, expCount): auto =
|
2025-01-14 20:30:56 +07:00
|
|
|
xp.timestamp = xp.timestamp + 1
|
2024-12-26 17:07:25 +07:00
|
|
|
let rc = xp.assembleBlock()
|
|
|
|
check rc.isOk == true
|
|
|
|
if rc.isErr:
|
|
|
|
debugEcho "ASSEMBLE BLOCK: ", rc.error
|
|
|
|
if rc.isOk:
|
|
|
|
check rc.value.blk.transactions.len == expCount
|
|
|
|
rc.get
|
|
|
|
|
|
|
|
template checkImportBlock(xp: TxPoolRef, bundle: AssembledBlock) =
|
|
|
|
let rc = xp.chain.importBlock(bundle.blk)
|
|
|
|
check rc.isOk == true
|
|
|
|
if rc.isErr:
|
|
|
|
debugEcho "IMPORT BLOCK: ", rc.error
|
|
|
|
|
|
|
|
template checkImportBlock(xp: TxPoolRef, expCount: int, expRem: int) =
|
|
|
|
let bundle = checkAssembleBlock(xp, expCount)
|
|
|
|
checkImportBlock(xp, bundle)
|
|
|
|
xp.removeNewBlockTxs(bundle.blk)
|
|
|
|
check xp.len == expRem
|
|
|
|
|
|
|
|
template checkImportBlock(xp: TxPoolRef, expCount: int) =
|
|
|
|
let bundle = checkAssembleBlock(xp, expCount)
|
|
|
|
checkImportBlock(xp, bundle)
|
|
|
|
|
|
|
|
template checkImportBlock(xp: TxPoolRef, bundle: AssembledBlock, expRem: int) =
|
|
|
|
checkImportBlock(xp, bundle)
|
|
|
|
xp.removeNewBlockTxs(bundle.blk)
|
|
|
|
check xp.len == expRem
|
2022-01-18 14:40:02 +00:00
|
|
|
|
2025-01-05 15:05:29 +07:00
|
|
|
proc createPooledTransactionWithBlob(
|
|
|
|
mx: TxSender,
|
|
|
|
acc: TestAccount,
|
|
|
|
recipient: Address,
|
|
|
|
amount: UInt256,
|
|
|
|
nonce: AccountNonce
|
|
|
|
): PooledTransaction =
|
|
|
|
# Create the transaction
|
|
|
|
let
|
|
|
|
tc = BlobTx(
|
|
|
|
recipient: Opt.some(recipient),
|
|
|
|
gasLimit: 100000.GasInt,
|
|
|
|
gasTip: GasInt(10 ^ 9),
|
|
|
|
gasFee: GasInt(10 ^ 9),
|
|
|
|
blobGasFee: u256(1),
|
|
|
|
blobCount: 1,
|
|
|
|
blobID: 1,
|
|
|
|
)
|
|
|
|
|
|
|
|
mx.makeTx(tc, acc, nonce)
|
|
|
|
|
|
|
|
proc makeTx(
|
|
|
|
mx: TxSender,
|
|
|
|
acc: TestAccount,
|
|
|
|
recipient: Address,
|
|
|
|
amount: UInt256,
|
|
|
|
nonce: AccountNonce): PooledTransaction =
|
|
|
|
let
|
|
|
|
tc = BaseTx(
|
|
|
|
gasLimit: 75000,
|
|
|
|
recipient: Opt.some(recipient),
|
|
|
|
amount: amount,
|
|
|
|
)
|
|
|
|
mx.makeTx(tc, acc, nonce)
|
|
|
|
|
2024-12-26 17:07:25 +07:00
|
|
|
proc txPoolMain*() =
|
|
|
|
suite "TxPool test suite":
|
|
|
|
loadKzgTrustedSetup().expect("KZG trusted setup loaded")
|
|
|
|
let
|
|
|
|
env = initEnv(Cancun)
|
|
|
|
xp = env.xp
|
|
|
|
mx = env.sender
|
|
|
|
chain = env.chain
|
|
|
|
com = env.com
|
|
|
|
|
2025-01-14 20:30:56 +07:00
|
|
|
xp.prevRandao = prevRandao
|
|
|
|
xp.feeRecipient = feeRecipient
|
|
|
|
xp.timestamp = EthTime.now()
|
2024-12-26 17:07:25 +07:00
|
|
|
|
|
|
|
test "Bad blob tx":
|
|
|
|
let acc = mx.getAccount(7)
|
|
|
|
let tc = BlobTx(
|
|
|
|
txType: Opt.some(TxEip4844),
|
|
|
|
gasLimit: 75000,
|
|
|
|
recipient: Opt.some(acc.address),
|
|
|
|
blobID: 0.BlobID
|
|
|
|
)
|
|
|
|
var ptx = mx.makeTx(tc, 0)
|
|
|
|
var z = ptx.networkPayload.blobs[0]
|
|
|
|
z[0] = not z[0]
|
|
|
|
ptx.networkPayload.blobs[0] = z
|
|
|
|
xp.checkAddTx(ptx, txErrorInvalidBlob)
|
|
|
|
|
|
|
|
test "Bad chainId":
|
|
|
|
let acc = mx.getAccount(1)
|
|
|
|
let tc = BaseTx(
|
|
|
|
gasLimit: 75000
|
|
|
|
)
|
|
|
|
var ptx = mx.makeTx(tc, 0)
|
|
|
|
let ccid = ptx.tx.chainId.uint64
|
|
|
|
let cid = Opt.some(ChainId(ccid.not))
|
|
|
|
ptx.tx = mx.customizeTransaction(acc, ptx.tx, CustomTx(chainId: cid))
|
|
|
|
xp.checkAddTx(ptx, txErrorChainIdMismatch)
|
|
|
|
|
|
|
|
test "Basic validation error, gas limit too low":
|
|
|
|
let tc = BaseTx(
|
|
|
|
gasLimit: 18000
|
|
|
|
)
|
|
|
|
let ptx = mx.makeTx(tc, 0)
|
|
|
|
xp.checkAddTx(ptx, txErrorBasicValidation)
|
|
|
|
|
|
|
|
test "Known tx":
|
|
|
|
let tc = BaseTx(
|
|
|
|
gasLimit: 75000
|
|
|
|
)
|
|
|
|
let ptx = mx.makeNextTx(tc)
|
|
|
|
xp.checkAddTx(ptx)
|
|
|
|
xp.checkAddTx(ptx, txErrorAlreadyKnown)
|
|
|
|
xp.checkImportBlock(1, 0)
|
|
|
|
|
|
|
|
test "nonce too small":
|
|
|
|
let tc = BaseTx(
|
|
|
|
gasLimit: 75000
|
|
|
|
)
|
|
|
|
let ptx = mx.makeNextTx(tc)
|
|
|
|
xp.checkAddTx(ptx)
|
|
|
|
xp.checkImportBlock(1, 0)
|
|
|
|
xp.checkAddTx(ptx, txErrorNonceTooSmall)
|
|
|
|
|
|
|
|
test "nonce gap after account nonce":
|
|
|
|
let acc = mx.getAccount(13)
|
|
|
|
let tc = BaseTx(
|
|
|
|
gasLimit: 75000
|
|
|
|
)
|
|
|
|
let ptx1 = mx.makeTx(tc, acc, 1)
|
|
|
|
xp.checkAddTx(ptx1)
|
|
|
|
|
|
|
|
xp.checkImportBlock(0)
|
|
|
|
|
|
|
|
let ptx0 = mx.makeTx(tc, acc, 0)
|
|
|
|
xp.checkAddTx(ptx0)
|
|
|
|
|
|
|
|
xp.checkImportBlock(2, 0)
|
|
|
|
|
|
|
|
test "nonce gap in the middle of nonces":
|
|
|
|
let acc = mx.getAccount(14)
|
|
|
|
let tc = BaseTx(
|
|
|
|
gasLimit: 75000
|
|
|
|
)
|
|
|
|
|
|
|
|
let ptx0 = mx.makeTx(tc, acc, 0)
|
|
|
|
xp.checkAddTx(ptx0)
|
|
|
|
|
|
|
|
let ptx2 = mx.makeTx(tc, acc, 2)
|
|
|
|
xp.checkAddTx(ptx2)
|
|
|
|
|
|
|
|
xp.checkImportBlock(1, 1)
|
|
|
|
|
|
|
|
let ptx1 = mx.makeTx(tc, acc, 1)
|
|
|
|
xp.checkAddTx(ptx1)
|
|
|
|
|
|
|
|
xp.checkImportBlock(2, 0)
|
|
|
|
|
|
|
|
test "supersede existing tx":
|
|
|
|
let acc = mx.getAccount(15)
|
|
|
|
let tc = BaseTx(
|
|
|
|
txType: Opt.some(TxLegacy),
|
|
|
|
gasLimit: 75000
|
|
|
|
)
|
|
|
|
|
|
|
|
var ptx = mx.makeTx(tc, acc, 0)
|
|
|
|
xp.checkAddTx(ptx)
|
|
|
|
|
|
|
|
let oldPrice = ptx.tx.gasPrice
|
|
|
|
ptx.tx = mx.customizeTransaction(acc, ptx.tx,
|
|
|
|
CustomTx(gasPriceOrGasFeeCap: Opt.some(oldPrice*2)))
|
|
|
|
xp.checkAddTxSupersede(ptx)
|
|
|
|
|
|
|
|
let bundle = xp.checkAssembleBlock(1)
|
|
|
|
check bundle.blk.transactions[0].gasPrice == oldPrice*2
|
|
|
|
xp.checkImportBlock(bundle, 0)
|
|
|
|
|
|
|
|
test "removeNewBlockTxs after two blocks":
|
|
|
|
let tc = BaseTx(
|
|
|
|
gasLimit: 75000
|
|
|
|
)
|
|
|
|
|
|
|
|
var ptx = mx.makeNextTx(tc)
|
|
|
|
xp.checkAddTx(ptx)
|
|
|
|
|
|
|
|
xp.checkImportBlock(1)
|
|
|
|
|
|
|
|
ptx = mx.makeNextTx(tc)
|
|
|
|
xp.checkAddTx(ptx)
|
|
|
|
|
|
|
|
xp.checkImportBlock(1, 0)
|
|
|
|
|
|
|
|
test "max transactions per account":
|
|
|
|
let acc = mx.getAccount(16)
|
|
|
|
let tc = BaseTx(
|
|
|
|
txType: Opt.some(TxLegacy),
|
|
|
|
gasLimit: 75000
|
|
|
|
)
|
|
|
|
|
|
|
|
const MAX_TXS_GENERATED = 100
|
|
|
|
for i in 0..MAX_TXS_GENERATED-2:
|
|
|
|
let ptx = mx.makeTx(tc, acc, i.AccountNonce)
|
|
|
|
xp.checkAddTx(ptx)
|
|
|
|
|
|
|
|
var ptx = mx.makeTx(tc, acc, MAX_TXS_GENERATED-1)
|
|
|
|
xp.checkAddTx(ptx)
|
|
|
|
|
|
|
|
let ptxMax = mx.makeTx(tc, acc, MAX_TXS_GENERATED)
|
|
|
|
xp.checkAddTx(ptxMax, txErrorSenderMaxTxs)
|
|
|
|
|
|
|
|
# superseding not hit sender max txs
|
|
|
|
let oldPrice = ptx.tx.gasPrice
|
|
|
|
ptx.tx = mx.customizeTransaction(acc, ptx.tx,
|
|
|
|
CustomTx(gasPriceOrGasFeeCap: Opt.some(oldPrice*2)))
|
|
|
|
xp.checkAddTxSupersede(ptx)
|
|
|
|
|
|
|
|
var numTxsPacked = 0
|
|
|
|
while numTxsPacked < MAX_TXS_GENERATED:
|
2025-01-14 20:30:56 +07:00
|
|
|
xp.timestamp = xp.timestamp + 1
|
2024-12-26 17:07:25 +07:00
|
|
|
let bundle = xp.assembleBlock().valueOr:
|
|
|
|
debugEcho error
|
|
|
|
check false
|
|
|
|
return
|
2022-01-18 14:40:02 +00:00
|
|
|
|
2024-12-26 17:07:25 +07:00
|
|
|
numTxsPacked += bundle.blk.transactions.len
|
2022-01-18 14:40:02 +00:00
|
|
|
|
2024-12-26 17:07:25 +07:00
|
|
|
chain.importBlock(bundle.blk).isOkOr:
|
|
|
|
check false
|
|
|
|
debugEcho error
|
|
|
|
return
|
2022-03-31 17:17:22 +01:00
|
|
|
|
2024-12-26 17:07:25 +07:00
|
|
|
xp.removeNewBlockTxs(bundle.blk)
|
2022-01-18 14:40:02 +00:00
|
|
|
|
2024-12-26 17:07:25 +07:00
|
|
|
check xp.len == 0
|
2022-01-18 14:40:02 +00:00
|
|
|
|
2024-12-26 17:07:25 +07:00
|
|
|
test "auto remove lower nonces":
|
|
|
|
let xp2 = TxPoolRef.new(chain)
|
|
|
|
let acc = mx.getAccount(17)
|
|
|
|
let tc = BaseTx(
|
|
|
|
gasLimit: 75000
|
|
|
|
)
|
2022-01-18 14:40:02 +00:00
|
|
|
|
2024-12-26 17:07:25 +07:00
|
|
|
let ptx0 = mx.makeTx(tc, acc, 0)
|
|
|
|
xp.checkAddTx(ptx0)
|
|
|
|
xp2.checkAddTx(ptx0)
|
2022-01-18 14:40:02 +00:00
|
|
|
|
2024-12-26 17:07:25 +07:00
|
|
|
let ptx1 = mx.makeTx(tc, acc, 1)
|
|
|
|
xp.checkAddTx(ptx1)
|
|
|
|
xp2.checkAddTx(ptx1)
|
2022-01-18 14:40:02 +00:00
|
|
|
|
2024-12-26 17:07:25 +07:00
|
|
|
let ptx2 = mx.makeTx(tc, acc, 2)
|
|
|
|
xp.checkAddTx(ptx2)
|
2022-03-31 17:17:22 +01:00
|
|
|
|
2024-12-26 17:07:25 +07:00
|
|
|
xp2.checkImportBlock(2, 0)
|
2025-01-14 20:30:56 +07:00
|
|
|
|
|
|
|
xp.timestamp = xp2.timestamp + 1
|
2024-12-26 17:07:25 +07:00
|
|
|
xp.checkImportBlock(1, 0)
|
2022-01-18 14:40:02 +00:00
|
|
|
|
2024-12-26 17:07:25 +07:00
|
|
|
test "mixed type of transactions":
|
|
|
|
let acc = mx.getAccount(18)
|
2022-03-31 17:17:22 +01:00
|
|
|
let
|
2024-12-26 17:07:25 +07:00
|
|
|
tc1 = BaseTx(
|
|
|
|
txType: Opt.some(TxLegacy),
|
|
|
|
gasLimit: 75000
|
|
|
|
)
|
|
|
|
tc2 = BaseTx(
|
|
|
|
txType: Opt.some(TxEip1559),
|
|
|
|
gasLimit: 75000
|
|
|
|
)
|
|
|
|
tc3 = BaseTx(
|
|
|
|
txType: Opt.some(TxEip4844),
|
|
|
|
recipient: Opt.some(recipient),
|
|
|
|
gasLimit: 75000
|
|
|
|
)
|
|
|
|
|
|
|
|
let ptx0 = mx.makeTx(tc1, acc, 0)
|
|
|
|
let ptx1 = mx.makeTx(tc2, acc, 1)
|
|
|
|
let ptx2 = mx.makeTx(tc3, acc, 2)
|
|
|
|
|
|
|
|
xp.checkAddTx(ptx0)
|
|
|
|
xp.checkAddTx(ptx1)
|
|
|
|
xp.checkAddTx(ptx2)
|
|
|
|
xp.checkImportBlock(3, 0)
|
|
|
|
|
|
|
|
test "replacement gas too low":
|
|
|
|
let acc = mx.getAccount(19)
|
2022-01-18 14:40:02 +00:00
|
|
|
let
|
2024-12-26 17:07:25 +07:00
|
|
|
tc1 = BaseTx(
|
|
|
|
txType: Opt.some(TxLegacy),
|
|
|
|
gasLimit: 75000
|
|
|
|
)
|
|
|
|
tc2 = BaseTx(
|
|
|
|
txType: Opt.some(TxEip4844),
|
|
|
|
recipient: Opt.some(recipient),
|
|
|
|
gasLimit: 75000
|
|
|
|
)
|
|
|
|
|
|
|
|
var ptx0 = mx.makeTx(tc1, acc, 0)
|
|
|
|
var ptx1 = mx.makeTx(tc2, acc, 1)
|
|
|
|
|
|
|
|
xp.checkAddTx(ptx0)
|
|
|
|
xp.checkAddTx(ptx1)
|
|
|
|
|
|
|
|
var oldPrice = ptx0.tx.gasPrice
|
|
|
|
ptx0.tx = mx.customizeTransaction(acc, ptx0.tx,
|
|
|
|
CustomTx(gasPriceOrGasFeeCap: Opt.some(oldPrice+1)
|
|
|
|
))
|
|
|
|
xp.checkAddTx(ptx0, txErrorReplacementGasTooLow)
|
|
|
|
|
|
|
|
let oldGas = ptx1.tx.maxFeePerBlobGas
|
|
|
|
let oldTip = ptx1.tx.maxPriorityFeePerGas
|
|
|
|
oldPrice = ptx1.tx.maxFeePerGas
|
|
|
|
ptx1.tx = mx.customizeTransaction(acc, ptx1.tx,
|
|
|
|
CustomTx(blobGas: Opt.some(oldGas+1),
|
|
|
|
gasTipCap: Opt.some(oldTip*2),
|
|
|
|
gasPriceOrGasFeeCap: Opt.some(oldPrice*2)
|
|
|
|
))
|
|
|
|
xp.checkAddTx(ptx1, txErrorReplacementBlobGasTooLow)
|
2025-01-05 15:05:29 +07:00
|
|
|
xp.checkImportBlock(2, 0)
|
|
|
|
|
|
|
|
test "Test TxPool with PoS block":
|
|
|
|
let
|
|
|
|
acc = mx.getAccount(20)
|
|
|
|
tc = BaseTx(
|
|
|
|
txType: Opt.some(TxLegacy),
|
|
|
|
recipient: Opt.some(recipient),
|
|
|
|
gasLimit: 75000,
|
|
|
|
amount: amount,
|
|
|
|
)
|
|
|
|
ptx = mx.makeTx(tc, acc, 0)
|
|
|
|
|
|
|
|
xp.checkAddTx(ptx)
|
|
|
|
let bundle = xp.checkAssembleBlock(1)
|
|
|
|
xp.checkImportBlock(bundle, 0)
|
|
|
|
|
|
|
|
let
|
aristo: fork support via layers/txframes (#2960)
* aristo: fork support via layers/txframes
This change reorganises how the database is accessed: instead holding a
"current frame" in the database object, a dag of frames is created based
on the "base frame" held in `AristoDbRef` and all database access
happens through this frame, which can be thought of as a consistent
point-in-time snapshot of the database based on a particular fork of the
chain.
In the code, "frame", "transaction" and "layer" is used to denote more
or less the same thing: a dag of stacked changes backed by the on-disk
database.
Although this is not a requirement, in practice each frame holds the
change set of a single block - as such, the frame and its ancestors
leading up to the on-disk state represents the state of the database
after that block has been applied.
"committing" means merging the changes to its parent frame so that the
difference between them is lost and only the cumulative changes remain -
this facility enables frames to be combined arbitrarily wherever they
are in the dag.
In particular, it becomes possible to consolidate a set of changes near
the base of the dag and commit those to disk without having to re-do the
in-memory frames built on top of them - this is useful for "flattening"
a set of changes during a base update and sending those to storage
without having to perform a block replay on top.
Looking at abstractions, a side effect of this change is that the KVT
and Aristo are brought closer together by considering them to be part of
the "same" atomic transaction set - the way the code gets organised,
applying a block and saving it to the kvt happens in the same "logical"
frame - therefore, discarding the frame discards both the aristo and kvt
changes at the same time - likewise, they are persisted to disk together
- this makes reasoning about the database somewhat easier but has the
downside of increased memory usage, something that perhaps will need
addressing in the future.
Because the code reasons more strictly about frames and the state of the
persisted database, it also makes it more visible where ForkedChain
should be used and where it is still missing - in particular, frames
represent a single branch of history while forkedchain manages multiple
parallel forks - user-facing services such as the RPC should use the
latter, ie until it has been finalized, a getBlock request should
consider all forks and not just the blocks in the canonical head branch.
Another advantage of this approach is that `AristoDbRef` conceptually
becomes more simple - removing its tracking of the "current" transaction
stack simplifies reasoning about what can go wrong since this state now
has to be passed around in the form of `AristoTxRef` - as such, many of
the tests and facilities in the code that were dealing with "stack
inconsistency" are now structurally prevented from happening. The test
suite will need significant refactoring after this change.
Once this change has been merged, there are several follow-ups to do:
* there's no mechanism for keeping frames up to date as they get
committed or rolled back - TODO
* naming is confused - many names for the same thing for legacy reason
* forkedchain support is still missing in lots of code
* clean up redundant logic based on previous designs - in particular the
debug and introspection code no longer makes sense
* the way change sets are stored will probably need revisiting - because
it's a stack of changes where each frame must be interrogated to find an
on-disk value, with a base distance of 128 we'll at minimum have to
perform 128 frame lookups for *every* database interaction - regardless,
the "dag-like" nature will stay
* dispose and commit are poorly defined and perhaps redundant - in
theory, one could simply let the GC collect abandoned frames etc, though
it's likely an explicit mechanism will remain useful, so they stay for
now
More about the changes:
* `AristoDbRef` gains a `txRef` field (todo: rename) that "more or less"
corresponds to the old `balancer` field
* `AristoDbRef.stack` is gone - instead, there's a chain of
`AristoTxRef` objects that hold their respective "layer" which has the
actual changes
* No more reasoning about "top" and "stack" - instead, each
`AristoTxRef` can be a "head" that "more or less" corresponds to the old
single-history `top` notion and its stack
* `level` still represents "distance to base" - it's computed from the
parent chain instead of being stored
* one has to be careful not to use frames where forkedchain was intended
- layers are only for a single branch of history!
* fix layer vtop after rollback
* engine fix
* Fix test_txpool
* Fix test_rpc
* Fix copyright year
* fix simulator
* Fix copyright year
* Fix copyright year
* Fix tracer
* Fix infinite recursion bug
* Remove aristo and kvt empty files
* Fic copyright year
* Fix fc chain_kvt
* ForkedChain refactoring
* Fix merge master conflict
* Fix copyright year
* Reparent txFrame
* Fix test
* Fix txFrame reparent again
* Cleanup and fix test
* UpdateBase bugfix and fix test
* Fixe newPayload bug discovered by hive
* Fix engine api fcu
* Clean up call template, chain_kvt, andn txguid
* Fix copyright year
* work around base block loading issue
* Add test
* Fix updateHead bug
* Fix updateBase bug
* Change func commitBase to proc commitBase
* Touch up and fix debug mode crash
---------
Co-authored-by: jangko <jangko128@gmail.com>
2025-02-06 08:04:50 +01:00
|
|
|
sdb = LedgerRef.init(chain.latestTxFrame)
|
2025-01-05 15:05:29 +07:00
|
|
|
val = sdb.getStorage(recipient, slot)
|
|
|
|
randao = Bytes32(val.toBytesBE)
|
|
|
|
fee = sdb.getBalance(feeRecipient)
|
|
|
|
bal = sdb.getBalance(recipient)
|
|
|
|
|
|
|
|
check randao == prevRandao
|
|
|
|
check bundle.blk.header.coinbase == feeRecipient
|
|
|
|
check not fee.isZero
|
|
|
|
check bal >= 1000.u256
|
|
|
|
|
|
|
|
test "Test TxPool with blobhash block":
|
|
|
|
let
|
|
|
|
acc = mx.getAccount(21)
|
|
|
|
tx1 = mx.createPooledTransactionWithBlob(acc, recipient, amount, 0)
|
|
|
|
tx2 = mx.createPooledTransactionWithBlob(acc, recipient, amount, 1)
|
|
|
|
|
|
|
|
xp.checkAddTx(tx1)
|
|
|
|
xp.checkAddTx(tx2)
|
|
|
|
|
|
|
|
template header(): Header =
|
|
|
|
bundle.blk.header
|
|
|
|
|
|
|
|
let
|
|
|
|
bundle = xp.checkAssembleBlock(2)
|
|
|
|
gasUsed1 = xp.vmState.receipts[0].cumulativeGasUsed
|
|
|
|
gasUsed2 = xp.vmState.receipts[1].cumulativeGasUsed - gasUsed1
|
|
|
|
totalBlobGasUsed = tx1.tx.getTotalBlobGas + tx2.tx.getTotalBlobGas
|
|
|
|
blockValue =
|
|
|
|
gasUsed1.u256 * tx1.tx.effectiveGasTip(header.baseFeePerGas).u256 +
|
|
|
|
gasUsed2.u256 * tx2.tx.effectiveGasTip(header.baseFeePerGas).u256
|
|
|
|
|
|
|
|
check blockValue == bundle.blockValue
|
|
|
|
check totalBlobGasUsed == header.blobGasUsed.get()
|
|
|
|
|
|
|
|
xp.checkImportBlock(bundle, 0)
|
|
|
|
|
|
|
|
let
|
aristo: fork support via layers/txframes (#2960)
* aristo: fork support via layers/txframes
This change reorganises how the database is accessed: instead holding a
"current frame" in the database object, a dag of frames is created based
on the "base frame" held in `AristoDbRef` and all database access
happens through this frame, which can be thought of as a consistent
point-in-time snapshot of the database based on a particular fork of the
chain.
In the code, "frame", "transaction" and "layer" is used to denote more
or less the same thing: a dag of stacked changes backed by the on-disk
database.
Although this is not a requirement, in practice each frame holds the
change set of a single block - as such, the frame and its ancestors
leading up to the on-disk state represents the state of the database
after that block has been applied.
"committing" means merging the changes to its parent frame so that the
difference between them is lost and only the cumulative changes remain -
this facility enables frames to be combined arbitrarily wherever they
are in the dag.
In particular, it becomes possible to consolidate a set of changes near
the base of the dag and commit those to disk without having to re-do the
in-memory frames built on top of them - this is useful for "flattening"
a set of changes during a base update and sending those to storage
without having to perform a block replay on top.
Looking at abstractions, a side effect of this change is that the KVT
and Aristo are brought closer together by considering them to be part of
the "same" atomic transaction set - the way the code gets organised,
applying a block and saving it to the kvt happens in the same "logical"
frame - therefore, discarding the frame discards both the aristo and kvt
changes at the same time - likewise, they are persisted to disk together
- this makes reasoning about the database somewhat easier but has the
downside of increased memory usage, something that perhaps will need
addressing in the future.
Because the code reasons more strictly about frames and the state of the
persisted database, it also makes it more visible where ForkedChain
should be used and where it is still missing - in particular, frames
represent a single branch of history while forkedchain manages multiple
parallel forks - user-facing services such as the RPC should use the
latter, ie until it has been finalized, a getBlock request should
consider all forks and not just the blocks in the canonical head branch.
Another advantage of this approach is that `AristoDbRef` conceptually
becomes more simple - removing its tracking of the "current" transaction
stack simplifies reasoning about what can go wrong since this state now
has to be passed around in the form of `AristoTxRef` - as such, many of
the tests and facilities in the code that were dealing with "stack
inconsistency" are now structurally prevented from happening. The test
suite will need significant refactoring after this change.
Once this change has been merged, there are several follow-ups to do:
* there's no mechanism for keeping frames up to date as they get
committed or rolled back - TODO
* naming is confused - many names for the same thing for legacy reason
* forkedchain support is still missing in lots of code
* clean up redundant logic based on previous designs - in particular the
debug and introspection code no longer makes sense
* the way change sets are stored will probably need revisiting - because
it's a stack of changes where each frame must be interrogated to find an
on-disk value, with a base distance of 128 we'll at minimum have to
perform 128 frame lookups for *every* database interaction - regardless,
the "dag-like" nature will stay
* dispose and commit are poorly defined and perhaps redundant - in
theory, one could simply let the GC collect abandoned frames etc, though
it's likely an explicit mechanism will remain useful, so they stay for
now
More about the changes:
* `AristoDbRef` gains a `txRef` field (todo: rename) that "more or less"
corresponds to the old `balancer` field
* `AristoDbRef.stack` is gone - instead, there's a chain of
`AristoTxRef` objects that hold their respective "layer" which has the
actual changes
* No more reasoning about "top" and "stack" - instead, each
`AristoTxRef` can be a "head" that "more or less" corresponds to the old
single-history `top` notion and its stack
* `level` still represents "distance to base" - it's computed from the
parent chain instead of being stored
* one has to be careful not to use frames where forkedchain was intended
- layers are only for a single branch of history!
* fix layer vtop after rollback
* engine fix
* Fix test_txpool
* Fix test_rpc
* Fix copyright year
* fix simulator
* Fix copyright year
* Fix copyright year
* Fix tracer
* Fix infinite recursion bug
* Remove aristo and kvt empty files
* Fic copyright year
* Fix fc chain_kvt
* ForkedChain refactoring
* Fix merge master conflict
* Fix copyright year
* Reparent txFrame
* Fix test
* Fix txFrame reparent again
* Cleanup and fix test
* UpdateBase bugfix and fix test
* Fixe newPayload bug discovered by hive
* Fix engine api fcu
* Clean up call template, chain_kvt, andn txguid
* Fix copyright year
* work around base block loading issue
* Add test
* Fix updateHead bug
* Fix updateBase bug
* Change func commitBase to proc commitBase
* Touch up and fix debug mode crash
---------
Co-authored-by: jangko <jangko128@gmail.com>
2025-02-06 08:04:50 +01:00
|
|
|
sdb = LedgerRef.init(chain.latestTxFrame)
|
2025-01-05 15:05:29 +07:00
|
|
|
val = sdb.getStorage(recipient, slot)
|
|
|
|
randao = Bytes32(val.toBytesBE)
|
|
|
|
bal = sdb.getBalance(feeRecipient)
|
|
|
|
|
|
|
|
check randao == prevRandao
|
|
|
|
check header.coinbase == feeRecipient
|
|
|
|
check not bal.isZero
|
|
|
|
|
|
|
|
## see github.com/status-im/nimbus-eth1/issues/1031
|
|
|
|
test "TxPool: Synthesising blocks (covers issue #1031)":
|
|
|
|
const
|
|
|
|
txPerblock = 20
|
|
|
|
numBlocks = 10
|
|
|
|
|
|
|
|
let
|
|
|
|
lastNumber = chain.latestNumber
|
|
|
|
tc = BaseTx(
|
|
|
|
gasLimit: 75000,
|
|
|
|
recipient: Opt.some(recipient214),
|
|
|
|
amount: amount,
|
|
|
|
)
|
|
|
|
|
|
|
|
for n in 0 ..< numBlocks:
|
|
|
|
for tn in 0 ..< txPerblock:
|
|
|
|
let tx = mx.makeNextTx(tc)
|
|
|
|
xp.checkAddTx(tx)
|
|
|
|
|
|
|
|
xp.checkImportBlock(txPerblock, 0)
|
|
|
|
|
|
|
|
check com.syncCurrent == lastNumber + numBlocks
|
|
|
|
let
|
|
|
|
head = chain.headerByNumber(com.syncCurrent).expect("block header exists")
|
aristo: fork support via layers/txframes (#2960)
* aristo: fork support via layers/txframes
This change reorganises how the database is accessed: instead holding a
"current frame" in the database object, a dag of frames is created based
on the "base frame" held in `AristoDbRef` and all database access
happens through this frame, which can be thought of as a consistent
point-in-time snapshot of the database based on a particular fork of the
chain.
In the code, "frame", "transaction" and "layer" is used to denote more
or less the same thing: a dag of stacked changes backed by the on-disk
database.
Although this is not a requirement, in practice each frame holds the
change set of a single block - as such, the frame and its ancestors
leading up to the on-disk state represents the state of the database
after that block has been applied.
"committing" means merging the changes to its parent frame so that the
difference between them is lost and only the cumulative changes remain -
this facility enables frames to be combined arbitrarily wherever they
are in the dag.
In particular, it becomes possible to consolidate a set of changes near
the base of the dag and commit those to disk without having to re-do the
in-memory frames built on top of them - this is useful for "flattening"
a set of changes during a base update and sending those to storage
without having to perform a block replay on top.
Looking at abstractions, a side effect of this change is that the KVT
and Aristo are brought closer together by considering them to be part of
the "same" atomic transaction set - the way the code gets organised,
applying a block and saving it to the kvt happens in the same "logical"
frame - therefore, discarding the frame discards both the aristo and kvt
changes at the same time - likewise, they are persisted to disk together
- this makes reasoning about the database somewhat easier but has the
downside of increased memory usage, something that perhaps will need
addressing in the future.
Because the code reasons more strictly about frames and the state of the
persisted database, it also makes it more visible where ForkedChain
should be used and where it is still missing - in particular, frames
represent a single branch of history while forkedchain manages multiple
parallel forks - user-facing services such as the RPC should use the
latter, ie until it has been finalized, a getBlock request should
consider all forks and not just the blocks in the canonical head branch.
Another advantage of this approach is that `AristoDbRef` conceptually
becomes more simple - removing its tracking of the "current" transaction
stack simplifies reasoning about what can go wrong since this state now
has to be passed around in the form of `AristoTxRef` - as such, many of
the tests and facilities in the code that were dealing with "stack
inconsistency" are now structurally prevented from happening. The test
suite will need significant refactoring after this change.
Once this change has been merged, there are several follow-ups to do:
* there's no mechanism for keeping frames up to date as they get
committed or rolled back - TODO
* naming is confused - many names for the same thing for legacy reason
* forkedchain support is still missing in lots of code
* clean up redundant logic based on previous designs - in particular the
debug and introspection code no longer makes sense
* the way change sets are stored will probably need revisiting - because
it's a stack of changes where each frame must be interrogated to find an
on-disk value, with a base distance of 128 we'll at minimum have to
perform 128 frame lookups for *every* database interaction - regardless,
the "dag-like" nature will stay
* dispose and commit are poorly defined and perhaps redundant - in
theory, one could simply let the GC collect abandoned frames etc, though
it's likely an explicit mechanism will remain useful, so they stay for
now
More about the changes:
* `AristoDbRef` gains a `txRef` field (todo: rename) that "more or less"
corresponds to the old `balancer` field
* `AristoDbRef.stack` is gone - instead, there's a chain of
`AristoTxRef` objects that hold their respective "layer" which has the
actual changes
* No more reasoning about "top" and "stack" - instead, each
`AristoTxRef` can be a "head" that "more or less" corresponds to the old
single-history `top` notion and its stack
* `level` still represents "distance to base" - it's computed from the
parent chain instead of being stored
* one has to be careful not to use frames where forkedchain was intended
- layers are only for a single branch of history!
* fix layer vtop after rollback
* engine fix
* Fix test_txpool
* Fix test_rpc
* Fix copyright year
* fix simulator
* Fix copyright year
* Fix copyright year
* Fix tracer
* Fix infinite recursion bug
* Remove aristo and kvt empty files
* Fic copyright year
* Fix fc chain_kvt
* ForkedChain refactoring
* Fix merge master conflict
* Fix copyright year
* Reparent txFrame
* Fix test
* Fix txFrame reparent again
* Cleanup and fix test
* UpdateBase bugfix and fix test
* Fixe newPayload bug discovered by hive
* Fix engine api fcu
* Clean up call template, chain_kvt, andn txguid
* Fix copyright year
* work around base block loading issue
* Add test
* Fix updateHead bug
* Fix updateBase bug
* Change func commitBase to proc commitBase
* Touch up and fix debug mode crash
---------
Co-authored-by: jangko <jangko128@gmail.com>
2025-02-06 08:04:50 +01:00
|
|
|
sdb = LedgerRef.init(chain.latestTxFrame)
|
2025-01-05 15:05:29 +07:00
|
|
|
expected = u256(txPerblock * numBlocks) * amount
|
|
|
|
balance = sdb.getBalance(recipient214)
|
|
|
|
check balance == expected
|
|
|
|
discard head
|
|
|
|
|
|
|
|
test "Test get parent transactions after persistBlock":
|
|
|
|
let
|
|
|
|
acc = mx.getAccount(22)
|
|
|
|
tx1 = mx.makeTx(acc, recipient, 1.u256, 0)
|
|
|
|
tx2 = mx.makeTx(acc, recipient, 2.u256, 1)
|
|
|
|
|
|
|
|
xp.checkAddTx(tx1)
|
|
|
|
xp.checkAddTx(tx2)
|
|
|
|
|
|
|
|
xp.checkImportBlock(2, 0)
|
|
|
|
|
|
|
|
let
|
|
|
|
tx3 = mx.makeTx(acc, recipient, 3.u256, 2)
|
|
|
|
tx4 = mx.makeTx(acc, recipient, 4.u256, 3)
|
|
|
|
tx5 = mx.makeTx(acc, recipient, 5.u256, 4)
|
|
|
|
|
|
|
|
xp.checkAddTx(tx3)
|
|
|
|
xp.checkAddTx(tx4)
|
|
|
|
xp.checkAddTx(tx5)
|
|
|
|
|
|
|
|
xp.checkImportBlock(3, 0)
|
|
|
|
let latestHash = chain.latestHash
|
|
|
|
check env.chain.forkChoice(latestHash, latestHash).isOk
|
|
|
|
|
|
|
|
let hs = [
|
|
|
|
rlpHash(tx1),
|
|
|
|
rlpHash(tx2),
|
|
|
|
rlpHash(tx3),
|
|
|
|
rlpHash(tx4),
|
|
|
|
rlpHash(tx5),
|
|
|
|
]
|
|
|
|
|
|
|
|
let res = chain.blockByNumber(chain.latestHeader.number - 1)
|
|
|
|
if res.isErr:
|
|
|
|
debugEcho res.error
|
|
|
|
check false
|
|
|
|
|
|
|
|
let parent = res.get
|
|
|
|
var count = 0
|
|
|
|
for txh in chain.txHashInRange(latestHash, parent.header.parentHash):
|
|
|
|
check txh in hs
|
|
|
|
inc count
|
|
|
|
check count == hs.len
|
2022-01-18 14:40:02 +00:00
|
|
|
|
2025-01-15 09:18:25 +07:00
|
|
|
test "EIP-7702 transaction before Prague":
|
|
|
|
let
|
|
|
|
acc = mx.getAccount(24)
|
|
|
|
auth = mx.makeAuth(acc, 0)
|
|
|
|
tc = BaseTx(
|
|
|
|
txType: Opt.some(TxEip7702),
|
|
|
|
gasLimit: 75000,
|
|
|
|
recipient: Opt.some(recipient214),
|
|
|
|
amount: amount,
|
|
|
|
authorizationList: @[auth],
|
|
|
|
)
|
|
|
|
tx = mx.makeTx(tc, 0)
|
|
|
|
|
|
|
|
xp.checkAddTx(tx, txErrorBasicValidation)
|
|
|
|
|
|
|
|
test "EIP-7702 transaction invalid auth signature":
|
|
|
|
let
|
|
|
|
env = initEnv(Prague)
|
|
|
|
xp = env.xp
|
|
|
|
mx = env.sender
|
|
|
|
acc = mx.getAccount(25)
|
|
|
|
auth = mx.makeAuth(acc, 0)
|
|
|
|
tc = BaseTx(
|
|
|
|
txType: Opt.some(TxEip7702),
|
|
|
|
gasLimit: 75000,
|
|
|
|
recipient: Opt.some(recipient214),
|
|
|
|
amount: amount,
|
|
|
|
authorizationList: @[auth],
|
|
|
|
)
|
|
|
|
ptx = mx.makeTx(tc, 0)
|
|
|
|
|
|
|
|
# invalid auth
|
|
|
|
var invauth = auth
|
|
|
|
invauth.v = 3.uint64
|
|
|
|
let
|
|
|
|
ctx = CustomTx(auth: Opt.some(invauth))
|
|
|
|
tx = mx.customizeTransaction(acc, ptx.tx, ctx)
|
|
|
|
|
|
|
|
xp.checkAddTx(tx)
|
|
|
|
# invalid auth, but the tx itself still valid
|
|
|
|
xp.checkImportBlock(1, 0)
|
|
|
|
|
2025-01-16 12:10:52 +07:00
|
|
|
test "Blobschedule":
|
|
|
|
let
|
|
|
|
cc = env.conf.networkParams.config
|
|
|
|
acc = mx.getAccount(26)
|
|
|
|
tc = BlobTx(
|
|
|
|
txType: Opt.some(TxEip4844),
|
|
|
|
gasLimit: 75000,
|
|
|
|
recipient: Opt.some(acc.address),
|
|
|
|
blobID: 0.BlobID,
|
|
|
|
blobCount: 1
|
|
|
|
)
|
|
|
|
tx1 = mx.makeTx(tc, acc, 0)
|
|
|
|
tx2 = mx.makeTx(tc, acc, 1)
|
|
|
|
tx3 = mx.makeTx(tc, acc, 2)
|
|
|
|
tx4 = mx.makeTx(tc, acc, 3)
|
|
|
|
|
|
|
|
xp.checkAddTx(tx1)
|
|
|
|
xp.checkAddTx(tx2)
|
|
|
|
xp.checkAddTx(tx3)
|
|
|
|
xp.checkAddTx(tx4)
|
|
|
|
|
|
|
|
# override current blobSchedule
|
|
|
|
let bs = cc.blobSchedule[Cancun]
|
|
|
|
cc.blobSchedule[Cancun] = Opt.some(
|
2025-01-27 23:20:39 +07:00
|
|
|
BlobSchedule(target: 2, max: 3, baseFeeUpdateFraction: 3338477)
|
2025-01-16 12:10:52 +07:00
|
|
|
)
|
|
|
|
|
|
|
|
# allow 3 blobs
|
|
|
|
xp.checkImportBlock(3, 1)
|
|
|
|
|
|
|
|
# consume the rest of blobs
|
|
|
|
xp.checkImportBlock(1, 0)
|
|
|
|
|
|
|
|
# restore blobSchedule
|
|
|
|
cc.blobSchedule[Cancun] = bs
|
|
|
|
|
2022-01-18 14:40:02 +00:00
|
|
|
when isMainModule:
|
2024-06-28 11:53:25 +07:00
|
|
|
txPoolMain()
|