3 Commits

Author	SHA1	Message	Date
arnaucube	30d8b42fd3	Add checks that len(key)<=maxKeyLen ... Add checks that the key is not bigger than maximum key length for the tree maxLevels size, where maximum key len = ceil(maxLevels/8). This is because if the key bits length is bigger than the maxLevels of the tree, two different keys that their difference is at the end, will collision in the same leaf of the tree (at the max depth).	2021-10-04 14:33:49 +02:00
arnaucube	2514b3188f	Update db usage to new dvote.db interface version	2021-08-06 18:41:13 +02:00
arnaucube	43cad713b0	Add Tree Circom Verifier Proofs ... Circom Verifier Proofs allow to verify through a zkSNARK proof the inclusion/exclusion of a leaf in a tree. This commit adds the needed code in go to generate the circuit inputs for a CircomVerifierProof.	2021-06-16 08:59:02 +02:00