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.
30 Commits
1 Branch
0 Tags
932 KiB
 
 
Tree: 66f6ae14bb
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '66f6ae14bb'
${ noResults }
arnaucube 66f6ae14bb Add computeHashes at virtual tree 3 years ago
.github/workflows Add GithubActions: lint & test 3 years ago
.golangci.yml Simplify cyclomatic complexity of AddBatch 3 years ago
LICENSE Init: README.md & LICENSE 3 years ago
README.md Replace naive AddBatch by optimized AddBatch 3 years ago
addbatch.go Replace naive AddBatch by optimized AddBatch 3 years ago
addbatch_test.go Replace naive AddBatch by optimized AddBatch 3 years ago
go.mod Replace naive AddBatch by optimized AddBatch 3 years ago
go.sum Replace naive AddBatch by optimized AddBatch 3 years ago
hash.go Replace naive AddBatch by optimized AddBatch 3 years ago
hash_test.go Replace naive AddBatch by optimized AddBatch 3 years ago
tree.go Replace naive AddBatch by optimized AddBatch 3 years ago
tree_test.go Replace naive AddBatch by optimized AddBatch 3 years ago
utils.go Add AddBatch CaseC 3 years ago
vt.go Add computeHashes at virtual tree 3 years ago
vt_test.go Add computeHashes at virtual tree 3 years ago

README.md

arbo GoDoc Go Report Card Test

arbo: tree in Esperanto.

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.