mirror of
https://github.com/ethereum/go-ethereum.git
synced 2026-08-20 02:42:27 +00:00
Squash the main verkle PR ahead of rebase don't call Bytes() in GetTreeKey (#137) trie: avoid endianness conversion in GetTreeKey (#140) * trie/utils: add concrete expected value in trie key generation test Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> * mod: update to latest go-verkle Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> * trie/utils: avoid endianness conversions Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> * apply review changes & update to official go-verkle version Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> upgrade go-verkle to CoW version and get TestProcessVerkle to build (#138) updating ci to use self-hosted machine (#143) fix: storage offset in non-header group + reuse of value buffer (#145) dedup call to ChunkifyCode, same as replay branch (#156) * dedup call to ChunkifyCode, same as replay branch * fix some linter issues fix code offset in tree update (#157) fix REVERT in state processor test execution (#158) * fix code offset in tree update * fix REVERT in test execution save on key hashing: lump code size update with first code chunk group (#159) fix code chunk key calculation and storage key calculation (#161) * fix codeKey calculation * Remove * fix storageOffset * fix the fix to the fix to the offset fix * Remove copy/pasted, unused code in test * fix linter --------- Co-authored-by: Guillaume Ballet <3272758+gballet@users.noreply.github.com> fix: infinite loop when calling extcodecopy on empty code (#151) upgrade to latest go-verkle fix: only update code in the tree if it's dirty (#174) fix: read-touch the code size and Keccak of the origin (#175) List of changes for converting a sepolia database (#182) * naive conversion rebased on top of beverly hills * changes for the sepolia shadow fork conversion * fixes to please the linter * fixes to please the linter Unified point cache (#180) * Unified point cache * Use cache for Try*Account * alter Trie interface to use caching for slots (#181) * alter Trie interface to use caching for slots * fix: use a lock to protect the point cache (#185) * use fastest non-master go-verkle version & pull trie/Verkle.go changes to use new api (#184) * mod: update to fastest go-verkle version today Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> * trie/verkle: use new batch serialization api Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> --------- Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> --------- Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> Co-authored-by: Ignacio Hagopian <jsign.uy@gmail.com> * fix: TryDelete signature in unit tests --------- Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> Co-authored-by: Ignacio Hagopian <jsign.uy@gmail.com> trie/utils: fix potential overflow (#191) * trie/utils: fix potential overflow Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> * trie/utils: receive storage key as a byte slice Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> * revert formatter changes Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> * trie/utils: fix mod 256 Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> --------- Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> trie/utils: fix incorrect bigint assignment (#193) Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> upgrade precomp link to fix CI fix: add missing code size&keccak leaves in empty accounts (#192) fixes to use the latest go-verkle@master (#197) * fixes to use the latest go-verkle@master * linter fixes * linter fixes for tests * fix: use jsign's go-verkle fix refactor: remove unused (*StateDB).GetXLittleEndian methods (#204) fix gas accounting issue in state_processor_test.go (#207) update go-verkle not to use StatelessNode anymore (#206) * update go-verkle not to use StatelessNode anymore * update go-verkle to latest refactor: move verkle gas accounting to its own block in TransitionDB (#208) fix a panic in deserializeVerkleProof if GetProofItems returns a nil ProofElements use the cachingDB instead of a custom VerkleDB (#209) * use the cachingDB instead of a custom VerkleDB * fix stack trace in LES remove holiman from CODEOWNERS as he gets too many emails read from tree in state object if the snapshot is nil (#205) add missing error checks for the root node type (#214) implement OpenStorageTrie for verkle trees (#210) * implement OpenStorageTrie for verkle trees * add a few comments for future maintenance * fix linter issue fix: copy balance leaf to new buffer in TryGetAccount (#217) implement some heretofore unimplemented iterator methods (#219) params: move verkle params to their own file (#228) fix: proper number of chunk evals (#215) overlay transition (#244) * overlay transition Fix some bugs identified in the code review Co-authored-by: Ignacio Hagopian <jsign.uy@gmail.com> Include base -> overlay key-values migration logic (#199) * mod: add go-verkle version with key-value migration new apis Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> * core/stateprocessor: use constant for max number of migrated key-values Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> * core: add base->overlay key-values migration logic Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> * core: fix some compiler errors Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> * trie: consider removing transition trie api in the future Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> * mod: use latest go-verkle Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> --------- Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> fix some unit tests errors get convresion block from file fix compilation issues fix initialization issue in migrator fix: changes needed to run the first 28 blocks important sutff: fix the banner fix: use nonce instead of balance in nonce leaf (#202) fixes for performing the overlay transition (#203) * fixes for performing the overlay transition * fixes for the full replay * fix: deletion-and-recreation of EoA * fixes to replay 2M+ blocks * upgrade to go-verkle@master * fix: proper number of chunk evals * rewrite conversion loop to fix known issues changes to make replay work with the overlay method (#216) * fixes for performing the overlay transition fixes for the full replay fix: deletion-and-recreation of EoA fixes to replay 2M+ blocks upgrade to go-verkle@master fix: proper number of chunk evals rewrite conversion loop to fix known issues changes to make replay work with the overlay method fixes to replay 2M+ blocks update to latest go-verkle@master * use a PBSS-like scheme for internal nodes (#221) * use a PBSS-like scheme for internal nodes * a couple of fixes coming from debugging replay * fix: use an error to notify the transition tree that a deleted account was found in the overlay tree (#222) * fixes for pbss replay (#227) * fixes for pbss replay * trie/verkle: use capped batch size (#229) * trie/verkle: use capped batch size Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> * trie/verkle: avoid path variable allocation per db.Put Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> * don't keep more than 32 state root conversions in RAM (#230) --------- Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> Co-authored-by: Guillaume Ballet <3272758+gballet@users.noreply.github.com> * cleanup some code * mod: update go-verkle Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> * re-enable snapshot (#231) * re-enable cancun block / snapshot (#226) * clear storage conversion key upon translating account (#234) * clear storage conversion key upon translating account * mod: use latest go-verkle Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> --------- Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> Co-authored-by: Ignacio Hagopian <jsign.uy@gmail.com> * fix: self-deadlock with translated root map mutex (#236) * return compressed commitment as root commitment (#237) --------- Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> Co-authored-by: Ignacio Hagopian <jsign.uy@gmail.com> --------- Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> Co-authored-by: Ignacio Hagopian <jsign.uy@gmail.com> --------- Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> Co-authored-by: Ignacio Hagopian <jsign.uy@gmail.com> fix first panic in *TransitionTrie.Copy() upgrade go-verkle to latest master mod: update go-verkle (#239) Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> core: print state root every 100 blocks (#240) Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> fix: only Commit the account trie (#242) fixes to get TestProcessVerkle to work with the overlay branch (#238) * fixes to get TestProcessVerkle to work with the overlay branch * fix all panics in verkle state processor test * fix proof verification move transition management to cachingDB * fix: mark the verkle transition as started if it's ended without being started * fix the verkle state processing test * fix linter errors * Add a function to clear verkle params for replay * fix: handle TransitionTrie in OpenStorageTrie * fix linter issue * fix the deleted account error (#247) * code cleanup (#248) * fix: don't error on a missing conversion.txt (#249) * Overlay Tree preimages exporting and usage (#246) * export overlay preimages tool Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> * use preimages flat file in overlay tree migration logic Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> * cmd/geth: add --roothash to overlay tree preimage exporting command Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> * cleanup Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> * review feedback Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> --------- Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> * fix: reduce the PR footprint (#250) * fix: don't fail when preimages.bin is missing (#251) * fix: don't fail when preimages.bin is missing * fix: don't open the preimages file when outside of transition --------- Signed-off-by: Ignacio Hagopian <jsign.uy@gmail.com> Co-authored-by: Ignacio Hagopian <jsign.uy@gmail.com> review changes remove replay-specific code
410 lines
12 KiB
Go
410 lines
12 KiB
Go
// Copyright 2021 The go-ethereum Authors
|
|
// This file is part of the go-ethereum library.
|
|
//
|
|
// The go-ethereum library is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU Lesser General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// The go-ethereum library is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU Lesser General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU Lesser General Public License
|
|
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
package state
|
|
|
|
import (
|
|
"github.com/ethereum/go-ethereum/common"
|
|
"github.com/ethereum/go-ethereum/params"
|
|
"github.com/ethereum/go-ethereum/trie/utils"
|
|
)
|
|
|
|
type VerkleStem [31]byte
|
|
|
|
// Mode specifies how a tree location has been accessed
|
|
// for the byte value:
|
|
// * the first bit is set if the branch has been edited
|
|
// * the second bit is set if the branch has been read
|
|
type Mode byte
|
|
|
|
const (
|
|
AccessWitnessReadFlag = Mode(1)
|
|
AccessWitnessWriteFlag = Mode(2)
|
|
)
|
|
|
|
// AccessWitness lists the locations of the state that are being accessed
|
|
// during the production of a block.
|
|
type AccessWitness struct {
|
|
// Branches flags if a given branch has been loaded
|
|
Branches map[VerkleStem]Mode
|
|
|
|
// Chunks contains the initial value of each address
|
|
Chunks map[common.Hash]Mode
|
|
|
|
// InitialValue contains either `nil` if the location
|
|
// didn't exist before it was accessed, or the value
|
|
// that a location had before the execution of this
|
|
// block.
|
|
InitialValue map[string][]byte
|
|
|
|
// Caches which code chunks have been accessed, in order
|
|
// to reduce the number of times that GetTreeKeyCodeChunk
|
|
// is called.
|
|
CodeLocations map[string]map[uint64]struct{}
|
|
|
|
statedb *StateDB
|
|
}
|
|
|
|
func NewAccessWitness(statedb *StateDB) *AccessWitness {
|
|
return &AccessWitness{
|
|
Branches: make(map[VerkleStem]Mode),
|
|
Chunks: make(map[common.Hash]Mode),
|
|
InitialValue: make(map[string][]byte),
|
|
CodeLocations: make(map[string]map[uint64]struct{}),
|
|
statedb: statedb,
|
|
}
|
|
}
|
|
|
|
func (aw *AccessWitness) HasCodeChunk(addr []byte, chunknr uint64) bool {
|
|
if locs, ok := aw.CodeLocations[string(addr)]; ok {
|
|
if _, ok = locs[chunknr]; ok {
|
|
return true
|
|
}
|
|
}
|
|
|
|
return false
|
|
}
|
|
|
|
// SetCodeLeafValue does the same thing as SetLeafValue, but for code chunks. It
|
|
// maintains a cache of which (address, chunk) were calculated, in order to avoid
|
|
// calling GetTreeKey more than once per chunk.
|
|
func (aw *AccessWitness) SetCachedCodeChunk(addr []byte, chunknr uint64) {
|
|
if locs, ok := aw.CodeLocations[string(addr)]; ok {
|
|
if _, ok = locs[chunknr]; ok {
|
|
return
|
|
}
|
|
} else {
|
|
aw.CodeLocations[string(addr)] = map[uint64]struct{}{}
|
|
}
|
|
|
|
aw.CodeLocations[string(addr)][chunknr] = struct{}{}
|
|
}
|
|
|
|
func (aw *AccessWitness) touchAddressOnWrite(addr []byte) (bool, bool, bool) {
|
|
var stem VerkleStem
|
|
var stemWrite, chunkWrite, chunkFill bool
|
|
copy(stem[:], addr[:31])
|
|
|
|
// NOTE: stem, selector access flags already exist in their
|
|
// respective maps because this function is called at the end of
|
|
// processing a read access event
|
|
|
|
if (aw.Branches[stem] & AccessWitnessWriteFlag) == 0 {
|
|
stemWrite = true
|
|
aw.Branches[stem] |= AccessWitnessWriteFlag
|
|
}
|
|
|
|
chunkValue := aw.Chunks[common.BytesToHash(addr)]
|
|
// if chunkValue.mode XOR AccessWitnessWriteFlag
|
|
if ((chunkValue & AccessWitnessWriteFlag) == 0) && ((chunkValue | AccessWitnessWriteFlag) != 0) {
|
|
chunkWrite = true
|
|
chunkValue |= AccessWitnessWriteFlag
|
|
aw.Chunks[common.BytesToHash(addr)] = chunkValue
|
|
}
|
|
|
|
// TODO charge chunk filling costs if the leaf was previously empty in the state
|
|
/*
|
|
if chunkWrite {
|
|
if _, err := verkleDb.TryGet(addr); err != nil {
|
|
chunkFill = true
|
|
}
|
|
}
|
|
*/
|
|
|
|
return stemWrite, chunkWrite, chunkFill
|
|
}
|
|
|
|
// TouchAddress adds any missing addr to the witness and returns respectively
|
|
// true if the stem or the stub weren't arleady present.
|
|
func (aw *AccessWitness) touchAddress(addr []byte, isWrite bool) (bool, bool, bool, bool, bool) {
|
|
var (
|
|
stem [31]byte
|
|
stemRead, selectorRead bool
|
|
stemWrite, selectorWrite, chunkFill bool
|
|
)
|
|
copy(stem[:], addr[:31])
|
|
|
|
// Check for the presence of the stem
|
|
if _, hasStem := aw.Branches[stem]; !hasStem {
|
|
stemRead = true
|
|
aw.Branches[stem] = AccessWitnessReadFlag
|
|
}
|
|
|
|
// Check for the presence of the leaf selector
|
|
if _, hasSelector := aw.Chunks[common.BytesToHash(addr)]; !hasSelector {
|
|
selectorRead = true
|
|
aw.Chunks[common.BytesToHash(addr)] = AccessWitnessReadFlag
|
|
}
|
|
|
|
if isWrite {
|
|
stemWrite, selectorWrite, chunkFill = aw.touchAddressOnWrite(addr)
|
|
}
|
|
|
|
return stemRead, selectorRead, stemWrite, selectorWrite, chunkFill
|
|
}
|
|
|
|
func (aw *AccessWitness) touchAddressAndChargeGas(addr []byte, isWrite bool) uint64 {
|
|
var gas uint64
|
|
|
|
stemRead, selectorRead, stemWrite, selectorWrite, selectorFill := aw.touchAddress(addr, isWrite)
|
|
|
|
if stemRead {
|
|
gas += params.WitnessBranchReadCost
|
|
}
|
|
if selectorRead {
|
|
gas += params.WitnessChunkReadCost
|
|
}
|
|
if stemWrite {
|
|
gas += params.WitnessBranchWriteCost
|
|
}
|
|
if selectorWrite {
|
|
gas += params.WitnessChunkWriteCost
|
|
}
|
|
if selectorFill {
|
|
gas += params.WitnessChunkFillCost
|
|
}
|
|
|
|
return gas
|
|
}
|
|
|
|
func (aw *AccessWitness) TouchAddressOnWriteAndComputeGas(addr []byte) uint64 {
|
|
return aw.touchAddressAndChargeGas(addr, true)
|
|
}
|
|
|
|
func (aw *AccessWitness) TouchAddressOnReadAndComputeGas(addr []byte) uint64 {
|
|
return aw.touchAddressAndChargeGas(addr, false)
|
|
}
|
|
|
|
// Merge is used to merge the witness that got generated during the execution
|
|
// of a tx, with the accumulation of witnesses that were generated during the
|
|
// execution of all the txs preceding this one in a given block.
|
|
func (aw *AccessWitness) Merge(other *AccessWitness) {
|
|
for k := range other.Branches {
|
|
if _, ok := aw.Branches[k]; !ok {
|
|
aw.Branches[k] = other.Branches[k]
|
|
}
|
|
}
|
|
|
|
for k, chunk := range other.Chunks {
|
|
if _, ok := aw.Chunks[k]; !ok {
|
|
aw.Chunks[k] = chunk
|
|
}
|
|
}
|
|
|
|
for k, v := range other.InitialValue {
|
|
if _, ok := aw.InitialValue[k]; !ok {
|
|
aw.InitialValue[k] = v
|
|
}
|
|
}
|
|
|
|
// TODO see if merging improves performance
|
|
//for k, v := range other.addrToPoint {
|
|
//if _, ok := aw.addrToPoint[k]; !ok {
|
|
//aw.addrToPoint[k] = v
|
|
//}
|
|
//}
|
|
}
|
|
|
|
// Key returns, predictably, the list of keys that were touched during the
|
|
// buildup of the access witness.
|
|
func (aw *AccessWitness) Keys() [][]byte {
|
|
keys := make([][]byte, 0, len(aw.Chunks))
|
|
for key := range aw.Chunks {
|
|
var k [32]byte
|
|
copy(k[:], key[:])
|
|
keys = append(keys, k[:])
|
|
}
|
|
return keys
|
|
}
|
|
|
|
func (aw *AccessWitness) KeyVals() map[string][]byte {
|
|
result := make(map[string][]byte)
|
|
for k, v := range aw.InitialValue {
|
|
result[k] = v
|
|
}
|
|
return result
|
|
}
|
|
|
|
func (aw *AccessWitness) Copy() *AccessWitness {
|
|
naw := &AccessWitness{
|
|
Branches: make(map[VerkleStem]Mode),
|
|
Chunks: make(map[common.Hash]Mode),
|
|
InitialValue: make(map[string][]byte),
|
|
}
|
|
|
|
naw.Merge(aw)
|
|
|
|
return naw
|
|
}
|
|
|
|
func (aw *AccessWitness) GetTreeKeyVersionCached(addr []byte) []byte {
|
|
return aw.statedb.db.(*cachingDB).addrToPoint.GetTreeKeyVersionCached(addr)
|
|
}
|
|
|
|
func (aw *AccessWitness) TouchAndChargeProofOfAbsence(addr []byte) uint64 {
|
|
var (
|
|
balancekey, cskey, ckkey, noncekey [32]byte
|
|
gas uint64
|
|
)
|
|
|
|
// Only evaluate the polynomial once
|
|
versionkey := aw.GetTreeKeyVersionCached(addr[:])
|
|
copy(balancekey[:], versionkey)
|
|
balancekey[31] = utils.BalanceLeafKey
|
|
copy(noncekey[:], versionkey)
|
|
noncekey[31] = utils.NonceLeafKey
|
|
copy(cskey[:], versionkey)
|
|
cskey[31] = utils.CodeSizeLeafKey
|
|
copy(ckkey[:], versionkey)
|
|
ckkey[31] = utils.CodeKeccakLeafKey
|
|
|
|
gas += aw.TouchAddressOnReadAndComputeGas(versionkey)
|
|
gas += aw.TouchAddressOnReadAndComputeGas(balancekey[:])
|
|
gas += aw.TouchAddressOnReadAndComputeGas(cskey[:])
|
|
gas += aw.TouchAddressOnReadAndComputeGas(ckkey[:])
|
|
gas += aw.TouchAddressOnReadAndComputeGas(noncekey[:])
|
|
return gas
|
|
}
|
|
|
|
func (aw *AccessWitness) TouchAndChargeMessageCall(addr []byte) uint64 {
|
|
var (
|
|
gas uint64
|
|
cskey [32]byte
|
|
)
|
|
// Only evaluate the polynomial once
|
|
versionkey := aw.GetTreeKeyVersionCached(addr[:])
|
|
copy(cskey[:], versionkey)
|
|
cskey[31] = utils.CodeSizeLeafKey
|
|
gas += aw.TouchAddressOnReadAndComputeGas(versionkey)
|
|
gas += aw.TouchAddressOnReadAndComputeGas(cskey[:])
|
|
return gas
|
|
}
|
|
|
|
func (aw *AccessWitness) TouchAndChargeValueTransfer(callerAddr, targetAddr []byte) uint64 {
|
|
var gas uint64
|
|
gas += aw.TouchAddressOnWriteAndComputeGas(utils.GetTreeKeyBalance(callerAddr[:]))
|
|
gas += aw.TouchAddressOnWriteAndComputeGas(utils.GetTreeKeyBalance(targetAddr[:]))
|
|
return gas
|
|
}
|
|
|
|
// TouchAndChargeContractCreateInit charges access costs to initiate
|
|
// a contract creation
|
|
func (aw *AccessWitness) TouchAndChargeContractCreateInit(addr []byte, createSendsValue bool) uint64 {
|
|
var (
|
|
balancekey, ckkey, noncekey [32]byte
|
|
gas uint64
|
|
)
|
|
|
|
// Only evaluate the polynomial once
|
|
versionkey := aw.GetTreeKeyVersionCached(addr[:])
|
|
copy(balancekey[:], versionkey)
|
|
balancekey[31] = utils.BalanceLeafKey
|
|
copy(noncekey[:], versionkey)
|
|
noncekey[31] = utils.NonceLeafKey
|
|
copy(ckkey[:], versionkey)
|
|
ckkey[31] = utils.CodeKeccakLeafKey
|
|
|
|
gas += aw.TouchAddressOnWriteAndComputeGas(versionkey)
|
|
gas += aw.TouchAddressOnWriteAndComputeGas(noncekey[:])
|
|
if createSendsValue {
|
|
gas += aw.TouchAddressOnWriteAndComputeGas(balancekey[:])
|
|
}
|
|
gas += aw.TouchAddressOnWriteAndComputeGas(ckkey[:])
|
|
return gas
|
|
}
|
|
|
|
// TouchAndChargeContractCreateCompleted charges access access costs after
|
|
// the completion of a contract creation to populate the created account in
|
|
// the tree
|
|
func (aw *AccessWitness) TouchAndChargeContractCreateCompleted(addr []byte, withValue bool) uint64 {
|
|
var (
|
|
balancekey, cskey, ckkey, noncekey [32]byte
|
|
gas uint64
|
|
)
|
|
|
|
// Only evaluate the polynomial once
|
|
versionkey := aw.GetTreeKeyVersionCached(addr[:])
|
|
copy(balancekey[:], versionkey)
|
|
balancekey[31] = utils.BalanceLeafKey
|
|
copy(noncekey[:], versionkey)
|
|
noncekey[31] = utils.NonceLeafKey
|
|
copy(cskey[:], versionkey)
|
|
cskey[31] = utils.CodeSizeLeafKey
|
|
copy(ckkey[:], versionkey)
|
|
ckkey[31] = utils.CodeKeccakLeafKey
|
|
|
|
gas += aw.TouchAddressOnWriteAndComputeGas(versionkey)
|
|
gas += aw.TouchAddressOnWriteAndComputeGas(balancekey[:])
|
|
gas += aw.TouchAddressOnWriteAndComputeGas(cskey[:])
|
|
gas += aw.TouchAddressOnWriteAndComputeGas(ckkey[:])
|
|
gas += aw.TouchAddressOnWriteAndComputeGas(noncekey[:])
|
|
return gas
|
|
}
|
|
|
|
func (aw *AccessWitness) TouchTxOriginAndComputeGas(originAddr []byte) uint64 {
|
|
var (
|
|
balancekey, cskey, ckkey, noncekey [32]byte
|
|
gas uint64
|
|
)
|
|
|
|
// Only evaluate the polynomial once
|
|
versionkey := aw.GetTreeKeyVersionCached(originAddr[:])
|
|
copy(balancekey[:], versionkey)
|
|
balancekey[31] = utils.BalanceLeafKey
|
|
copy(noncekey[:], versionkey)
|
|
noncekey[31] = utils.NonceLeafKey
|
|
copy(cskey[:], versionkey)
|
|
cskey[31] = utils.CodeSizeLeafKey
|
|
copy(ckkey[:], versionkey)
|
|
ckkey[31] = utils.CodeKeccakLeafKey
|
|
|
|
gas += aw.TouchAddressOnReadAndComputeGas(versionkey)
|
|
gas += aw.TouchAddressOnReadAndComputeGas(cskey[:])
|
|
gas += aw.TouchAddressOnReadAndComputeGas(ckkey[:])
|
|
gas += aw.TouchAddressOnWriteAndComputeGas(noncekey[:])
|
|
gas += aw.TouchAddressOnWriteAndComputeGas(balancekey[:])
|
|
|
|
return gas
|
|
}
|
|
|
|
func (aw *AccessWitness) TouchTxExistingAndComputeGas(targetAddr []byte, sendsValue bool) uint64 {
|
|
var (
|
|
balancekey, cskey, ckkey, noncekey [32]byte
|
|
gas uint64
|
|
)
|
|
|
|
// Only evaluate the polynomial once
|
|
versionkey := aw.GetTreeKeyVersionCached(targetAddr[:])
|
|
copy(balancekey[:], versionkey)
|
|
balancekey[31] = utils.BalanceLeafKey
|
|
copy(noncekey[:], versionkey)
|
|
noncekey[31] = utils.NonceLeafKey
|
|
copy(cskey[:], versionkey)
|
|
cskey[31] = utils.CodeSizeLeafKey
|
|
copy(ckkey[:], versionkey)
|
|
ckkey[31] = utils.CodeKeccakLeafKey
|
|
|
|
gas += aw.TouchAddressOnReadAndComputeGas(versionkey)
|
|
gas += aw.TouchAddressOnReadAndComputeGas(cskey[:])
|
|
gas += aw.TouchAddressOnReadAndComputeGas(ckkey[:])
|
|
gas += aw.TouchAddressOnReadAndComputeGas(noncekey[:])
|
|
gas += aw.TouchAddressOnReadAndComputeGas(balancekey[:])
|
|
|
|
if sendsValue {
|
|
gas += aw.TouchAddressOnWriteAndComputeGas(balancekey[:])
|
|
}
|
|
return gas
|
|
}
|