mirror of https://github.com/arnaucube/arbo.git synced 2026-01-09 07:21:28 +01:00

Go to file

arnaucube 13378d338e Remove cropping on pow of two the kvs for AddBatch

- Remove cropping on power of two the kvs for AddBatch
  - As not needed to be power of two length with the Virtual Tree
- Fix keyValuesToKvs keyPath

2021-05-19 12:58:11 +02:00

.github/workflows

Add GithubActions: lint & test

2021-03-30 22:03:26 +02:00

.golangci.yml

Simplify cyclomatic complexity of AddBatch

2021-05-01 17:30:12 +02:00

addbatch_test.go

Remove cropping on pow of two the kvs for AddBatch

2021-05-19 12:58:11 +02:00

addbatch.go

Remove cropping on pow of two the kvs for AddBatch

2021-05-19 12:58:11 +02:00

go.mod

Replace naive AddBatch by optimized AddBatch

2021-05-08 17:08:07 +02:00

go.sum

Replace naive AddBatch by optimized AddBatch

2021-05-08 17:08:07 +02:00

hash_test.go

Replace naive AddBatch by optimized AddBatch

2021-05-08 17:08:07 +02:00

hash.go

Replace naive AddBatch by optimized AddBatch

2021-05-08 17:08:07 +02:00

LICENSE

Init: README.md & LICENSE

2021-03-30 21:56:05 +02:00

README.md

Replace naive AddBatch by optimized AddBatch

2021-05-08 17:08:07 +02:00

tree_test.go

Remove cropping on pow of two the kvs for AddBatch

2021-05-19 12:58:11 +02:00

tree.go

AddBatch use Virtual Tree for empty trees/subtrees

2021-05-18 10:57:06 +02:00

utils.go

Add AddBatch CaseC

2021-04-25 17:55:46 +02:00

vt_test.go

Remove cropping on pow of two the kvs for AddBatch

2021-05-19 12:58:11 +02:00

vt.go

AddBatch use Virtual Tree for empty trees/subtrees

2021-05-18 10:57:06 +02:00

README.md

arbo

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.