arnaucube
/
arbo
mirror of https://github.com/arnaucube/arbo.git
1
1
Fork 0
Code Issues Projects Releases Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
14 Commits
1 Branch
0 Tags
932 KiB
 
 
Tree: 02b141d12e
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '02b141d12e'
${ noResults }
arnaucube 02b141d12e Start to impl AddBatch efficient algorithm Case A 3 years ago
.github/workflows Add GithubActions: lint & test 3 years ago
.golangci.yml Add GithubActions: lint & test 3 years ago
LICENSE Init: README.md & LICENSE 3 years ago
README.md Init: README.md & LICENSE 3 years ago
addbatch.go Start to impl AddBatch efficient algorithm Case A 3 years ago
addbatch_test.go Start to impl AddBatch efficient algorithm Case A 3 years ago
go.mod Tests migrate from stretchr/testify to frankban/quicktest 3 years ago
go.sum Tests migrate from stretchr/testify to frankban/quicktest 3 years ago
hash.go Add HashFunction interface (w/ Poseidon & Sha256) 3 years ago
hash_test.go Tests migrate from stretchr/testify to frankban/quicktest 3 years ago
tree.go Add Graphviz generation methods 3 years ago
tree_test.go Add Graphviz generation methods 3 years ago
utils.go Add HashFunction interface (w/ Poseidon & Sha256) 3 years ago

README.md

arbo GoDoc Go Report Card Test

MerkleTree implementation in Go. Compatible with the circomlib implementation of the MerkleTree (when using the Poseidon hash function), following the specification from https://docs.iden3.io/publications/pdfs/Merkle-Tree.pdf and https://eprint.iacr.org/2018/955.

Allows to define which hash function to use. So for example, when working with zkSnarks the Poseidon hash function can be used, but when not, it can be used the Blake3 hash function, which improves the computation time.