trie

Apr 22, 2024

Changes in this version

type ZkTrieImpl

+ func (mt *ZkTrieImpl) Prove(kHash *zkt.Hash, fromLevel uint, writeNode func(*Node) error) error

Apr 21, 2024

Changes in this version

type Node

+ func (n *Node) Copy() *Node

type ZkTrie

+ func (t *ZkTrie) Commit() error

type ZkTrieImpl

+ func (mt *ZkTrieImpl) Commit() error

+ func (mt *ZkTrieImpl) Copy() *ZkTrieImpl

Jul 28, 2023

Changes in this version

type Node

+ func (n *Node) IsTerminal() bool

type NodeType

+ const NodeTypeBranch_0

+ const NodeTypeBranch_1

+ const NodeTypeBranch_2

+ const NodeTypeBranch_3

+ const NodeTypeEmpty_New

+ const NodeTypeLeaf_New

+ func (n NodeType) DeduceDowngradeType(atRight bool) NodeType

+ func (n NodeType) DeduceUpgradeType(goRight bool) NodeType

type Proof

+ NodeInfos []NodeType

+ NodeKey *zkt.Hash

Mar 15, 2023

Changes in this version

type ZkTrie

+ func (t *ZkTrie) ProveWithDeletion(key []byte, fromLevel uint, writeNode func(*Node) error, ...) error

Feb 11, 2023

Changes in this version

+ const NodeKeyValidBytes

+ func LeafHash(k, v *zkt.Hash) (*zkt.Hash, error)

type Node

+ func NewEmptyNode() *Node

+ func NewLeafNode(k *zkt.Hash, valueFlags uint32, valuePreimage []zkt.Byte32) *Node

+ func NewParentNode(childL *zkt.Hash, childR *zkt.Hash) *Node

+ func (n *Node) NodeHash() (*zkt.Hash, error)

+ func (n *Node) ValueHash() (*zkt.Hash, error)

type NodeType

+ const NodeTypeParent

Nov 1, 2022

Changes in this version

type Node

+ func (n *Node) CanonicalValue() []byte

Oct 12, 2022

Changes in this version

type ZkTrieImpl

+ func (mt *ZkTrieImpl) GetLeafNode(key *zkt.Hash) (*Node, error)

Oct 10, 2022

Changes in this version

type Database

+ func (db *Database) Get(key []byte) ([]byte, error)

+ func (db *Database) Put(k, v []byte) error

+ func (db *Database) UpdatePreimage([]byte, *big.Int)

type ZktrieDatabase

+ Get func(key []byte) ([]byte, error)

+ Put func(k, v []byte) error

+ UpdatePreimage func(preimage []byte, hashField *big.Int)

Oct 9, 2022

Changes in this version

+ var ErrEntryIndexAlreadyExists = errors.New("the entry index already exists in the tree")

+ var ErrInvalidField = errors.New("Key not inside the Finite Field")

+ var ErrInvalidNodeFound = errors.New("found an invalid node in the DB")

+ var ErrInvalidProofBytes = errors.New("the serialized proof is invalid")

+ var ErrKeyNotFound = errors.New("key not found in ZkTrieImpl")

+ var ErrNodeBytesBadSize = errors.New("node data has incorrect size in the DB")

+ var ErrNodeKeyAlreadyExists = errors.New("key already exists")

+ var ErrNotWritable = errors.New("merkle Tree not writable")

+ var ErrReachedMaxLevel = errors.New("reached maximum level of the merkle tree")

+ func BuildZkTrieProof(rootKey *zkt.Hash, k *big.Int, lvl int, ...) (*Proof, *Node, error)

+ func LeafKey(k, v *zkt.Hash) (*zkt.Hash, error)

+ func ProofMagicBytes() []byte

+ func VerifyProofZkTrie(rootKey *zkt.Hash, proof *Proof, node *Node) bool

+ type Database struct

+ func NewZkTrieMemoryDb() *Database

+ func (db *Database) Init(k, v []byte)

+ type Node struct

+ ChildL *zkt.Hash

+ ChildR *zkt.Hash

+ CompressedFlags uint32

+ KeyPreimage *zkt.Byte32

+ NodeKey *zkt.Hash

+ Type NodeType

+ ValuePreimage []zkt.Byte32

+ func DecodeSMTProof(data []byte) (*Node, error)

+ func NewNodeEmpty() *Node

+ func NewNodeFromBytes(b []byte) (*Node, error)

+ func NewNodeLeaf(k *zkt.Hash, valueFlags uint32, valuePreimage []zkt.Byte32) *Node

+ func NewNodeMiddle(childL *zkt.Hash, childR *zkt.Hash) *Node

+ func (n *Node) Data() []byte

+ func (n *Node) Key() (*zkt.Hash, error)

+ func (n *Node) String() string

+ func (n *Node) Value() []byte

+ func (n *Node) ValueKey() (*zkt.Hash, error)

+ type NodeAux struct

+ Key *zkt.Hash

+ Value *zkt.Hash

+ type NodeType byte

+ const DBEntryTypeRoot

+ const NodeTypeEmpty

+ const NodeTypeLeaf

+ const NodeTypeMiddle

+ type Proof struct

+ Existence bool

+ Key *zkt.Hash

+ NodeAux *NodeAux

+ Siblings []*zkt.Hash

+ func (proof *Proof) Verify(key, kHash *zkt.Hash) (*zkt.Hash, error)

+ type ZkTrie struct

+ func NewZkTrie(root zkt.Byte32, db ZktrieDatabase) (*ZkTrie, error)

+ func (t *ZkTrie) Copy() *ZkTrie

+ func (t *ZkTrie) Hash() []byte

+ func (t *ZkTrie) Prove(key []byte, fromLevel uint, writeNode func(*Node) error) error

+ func (t *ZkTrie) Tree() *ZkTrieImpl

+ func (t *ZkTrie) TryDelete(key []byte) error

+ func (t *ZkTrie) TryGet(key []byte) ([]byte, error)

+ func (t *ZkTrie) TryGetNode(path []byte) ([]byte, int, error)

+ func (t *ZkTrie) TryUpdate(key []byte, vFlag uint32, vPreimage []zkt.Byte32) error

+ type ZkTrieImpl struct

+ Debug bool

+ func NewZkTrieImpl(storage ZktrieDatabase, maxLevels int) (*ZkTrieImpl, error)

+ func NewZkTrieImplWithRoot(storage ZktrieDatabase, root *zkt.Hash, maxLevels int) (*ZkTrieImpl, error)

+ func (mt *ZkTrieImpl) DeleteWord(kPreimage *zkt.Byte32) error

+ func (mt *ZkTrieImpl) GetLeafNodeByWord(kPreimage *zkt.Byte32) (*Node, error)

+ func (mt *ZkTrieImpl) GetNode(key *zkt.Hash) (*Node, error)

+ func (mt *ZkTrieImpl) GraphViz(w io.Writer, rootKey *zkt.Hash) error

+ func (mt *ZkTrieImpl) MaxLevels() int

+ func (mt *ZkTrieImpl) PrintGraphViz(rootKey *zkt.Hash) error

+ func (mt *ZkTrieImpl) Root() *zkt.Hash

+ func (mt *ZkTrieImpl) TryDelete(kHash *zkt.Hash) error

+ func (mt *ZkTrieImpl) TryGet(kHash *zkt.Hash) ([]byte, error)

+ func (mt *ZkTrieImpl) TryUpdate(kHash *zkt.Hash, vFlag uint32, vPreimage []zkt.Byte32) error

+ func (mt *ZkTrieImpl) UpdateWord(kPreimage, vPreimage *zkt.Byte32) error

+ func (mt *ZkTrieImpl) Walk(rootKey *zkt.Hash, f func(*Node)) error

+ type ZktrieDatabase interface