mirror of https://github.com/arnaucube/arbo.git synced 2026-01-08 15:01:29 +01:00

Go to file

arnaucube 02b141d12e Start to impl AddBatch efficient algorithm Case A

In case that the tree is empty, build the full tree from bottom to top
(from all the leaf to the root).

2021-04-25 17:54:52 +02:00

.github/workflows

Add GithubActions: lint & test

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

.golangci.yml

Add GithubActions: lint & test

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

addbatch_test.go

Start to impl AddBatch efficient algorithm Case A

2021-04-25 17:54:52 +02:00

addbatch.go

Start to impl AddBatch efficient algorithm Case A

2021-04-25 17:54:52 +02:00

go.mod

Tests migrate from stretchr/testify to frankban/quicktest

2021-04-03 19:40:18 +02:00

go.sum

Tests migrate from stretchr/testify to frankban/quicktest

2021-04-03 19:40:18 +02:00

hash_test.go

Tests migrate from stretchr/testify to frankban/quicktest

2021-04-03 19:40:18 +02:00

hash.go

Add HashFunction interface (w/ Poseidon & Sha256)

2021-03-30 21:59:24 +02:00

LICENSE

Init: README.md & LICENSE

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

README.md

Init: README.md & LICENSE

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

tree_test.go

Add Graphviz generation methods

2021-04-17 09:33:00 +02:00

tree.go

Add Graphviz generation methods

2021-04-17 09:33:00 +02:00

utils.go

Add HashFunction interface (w/ Poseidon & Sha256)

2021-03-30 21:59:24 +02:00

README.md

arbo

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.