Documentation
¶
Index ¶
- Constants
- Variables
- func ChunkifyCode(code []byte) []byte
- func GetTreeKey(address []byte, treeIndex *uint256.Int, subIndex byte) []byte
- func GetTreeKeyAccountLeaf(address []byte, leaf byte) []byte
- func GetTreeKeyBalance(address []byte) []byte
- func GetTreeKeyCodeChunk(address []byte, chunk *uint256.Int) []byte
- func GetTreeKeyCodeKeccak(address []byte) []byte
- func GetTreeKeyCodeSize(address []byte) []byte
- func GetTreeKeyNonce(address []byte) []byte
- func GetTreeKeyStorageSlot(address []byte, storageKey *uint256.Int) []byte
- func GetTreeKeyVersion(address []byte) []byte
- func PointToHash(evaluated *verkle.Point, suffix byte) []byte
Constants ¶
View Source
const ( VersionLeafKey = 0 BalanceLeafKey = 1 NonceLeafKey = 2 CodeKeccakLeafKey = 3 CodeSizeLeafKey = 4 )
Variables ¶
Functions ¶
func ChunkifyCode ¶
ChunkifyCode generates the chunked version of an array representing EVM bytecode
func GetTreeKey ¶
GetTreeKey performs both the work of the spec's get_tree_key function, and that of pedersen_hash: it builds the polynomial in pedersen_hash without having to create a mostly zero-filled buffer and "type cast" it to a 128-long 16-byte array. Since at most the first 5 coefficients of the polynomial will be non-zero, these 5 coefficients are created directly.
func GetTreeKeyAccountLeaf ¶
func GetTreeKeyBalance ¶
func GetTreeKeyCodeKeccak ¶
func GetTreeKeyCodeSize ¶
func GetTreeKeyNonce ¶
func GetTreeKeyStorageSlot ¶
func GetTreeKeyVersion ¶
func PointToHash ¶
Types ¶
This section is empty.
Click to show internal directories.
Click to hide internal directories.