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

Go to file

arnaucube 2a57e223ef Add TestAddBatchBench

TestAddBatchBench
	nCPU: 4, nLeafs: 50000, hash: Blake2b, db: leveldb
		Add loop:	9.304195479s
		AddBatch:	817.590526ms

2021-05-20 12:04:54 +02:00

.github/workflows

Add TestAddBatchBench

2021-05-20 12:04:54 +02:00

.golangci.yml

Simplify cyclomatic complexity of AddBatch

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

addbatch_test.go

Add TestAddBatchBench

2021-05-20 12:04:54 +02:00

addbatch.go

Add TestAddBatchBench

2021-05-20 12:04:54 +02:00

go.mod

Replace naive AddBatch by optimized AddBatch

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

go.sum

Add TestAddBatchBench

2021-05-20 12:04:54 +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

Add TestAddBatchBench

2021-05-20 12:04:54 +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.