Implementation of an array mapped trie using go and ipld
Use Git or checkout with SVN using the web URL.
Work fast with our official CLI. Learn more about the CLI.
Please sign in to use Codespaces.
If nothing happens, download GitHub Desktop and try again.
If nothing happens, download GitHub Desktop and try again.
If nothing happens, download Xcode and try again.
Your codespace will open once ready.
There was a problem preparing your codespace, please try again.
Array Mapped Trie (Persistent Vector) implementation using go-ipld
This package is a reference implementation of the IPLD AMT used in the Filecoin blockchain.
AMT is an array mapped trie, suitable for storing large arrays, including sparse arrays.
**See https://godoc.org/github.com/filecoin-project/go-amt-ipld for more information and API details
Dual MIT and Apache 2
Implementation of an array mapped trie using go and ipld