MPT - Modified Merkle Patricia Tries

Simple implementation of Modified Merkle Patricia Tries on GoLang.

Usage

1. Create the Trie:

   • With empty root node:

     trie := mpt.NewEmptyTrie()

   • With branch root node:

     nd := node.NewBranchNode()
     trie := mpt.NewTrie(nd)

   • With extension root node:

     nd := node.NewExtensionNode(nil, nil)
     trie := mpt.NewTrie(nd)

2. Add key/value pair:

key := []byte("key")
val := []byte("val")
// create new trie and try add key/value pair
trie := mpt.NewEmptyTrie()
if ok := trie.Put(key, val); !ok {
    // key/pair not added
}

1. Get data by key:

key := []byte("key")
val := []byte("val")
// create new trie and try add key/value pair
trie := mpt.NewEmptyTrie()
if ok := trie.Put(key, val); !ok {
    // key/pair not added
}
// some logic...
// try to get data by key
getVal, ok := trie.Get(key)
if !ok {
    // key/pair not added
}

1. Update data by key:

// initialize data
key := []byte("key")
val := []byte("val")
// create new trie and try add key/value pair
trie := mpt.NewEmptyTrie()
if ok := trie.Put(key, val); !ok {
    // key/pair not added
}
// some logic...
// try to update value by key
newVal := []byte("updated value")
if ok := trie.Update(key, newVal); !ok {
    // data not updated
}

1. Delete data by key:

// initialize data
key := []byte("key")
val := []byte("val")
// create new trie and try add key/value pair
trie := mpt.NewEmptyTrie()
if ok := trie.Put(key, val); !ok {
    // key/pair not added
}
// some logic...
// try to delete data by key
if ok := trie.Delete(key, newVal); !ok {
    // data not deleted
}

1. Get hash of the trie:

// initialize data
key := []byte("key")
val := []byte("val")
// create new trie and try add key/value pair
trie := mpt.NewEmptyTrie()
if ok := trie.Put(key, val); !ok {
    // key/pair not added
}
// some logic...
// try to get hash of the trie
h, err := trie.Hash()
if err != nil {
    // error while hash calculation
}
fmt.Println("hash of the trie:", h)

Benchmarks

Backlog

• Implement Database layer - need for store tree