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.
42 Commits
1 Branch
0 Tags
8.9 MiB
 
 
Tree: 2c62f31446
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '2c62f31446'
${ noResults }
arnaucube 2c62f31446 Update upFromNodes function for unbalanced tree 3 years ago
.github/workflows Add TestAddBatchBench 3 years ago
.gitignore Update upFromNodes function for unbalanced tree 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_test.go Update upFromNodes function for unbalanced tree 3 years ago
dbg.go Add dbgStats metrics 3 years ago
go.mod Migrate kv db to go.vocdoni.io/dvote/db interface 3 years ago
go.sum Migrate kv db to go.vocdoni.io/dvote/db interface 3 years ago
hash.go Update public methods signatures 3 years ago
hash_test.go Update public methods signatures 3 years ago
helpers_test.go Update upFromNodes function for unbalanced tree 3 years ago
tree.go Migrate kv db to go.vocdoni.io/dvote/db interface 3 years ago
tree_test.go Migrate kv db to go.vocdoni.io/dvote/db interface 3 years ago
utils.go Update public methods signatures 3 years ago
vt.go Update upFromNodes function for unbalanced tree 3 years ago
vt_test.go Migrate kv db to go.vocdoni.io/dvote/db interface 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.