arnaucube/arbo
1
1
Fork 0
mirror of https://github.com/arnaucube/arbo.git synced 2026-01-09 23:41:29 +01:00
Code Issues Projects Releases Wiki Activity

Update db usage to new dvote.db interface version

Browse Source
This commit is contained in:
arnaucube
2021-08-02 13:26:14 +02:00
parent abc04a5868
commit 2514b3188f
13 changed files with 605 additions and 273 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
circomproofs.go
View File

@@ -46,7 +46,9 @@ func siblingsToStringArray(s [][]byte) []string {
return r
}
func (t *Tree) fillMissingEmptySiblings(s [][]byte) [][]byte {
// FillMissingEmptySiblings adds the empty values to the array of siblings for
// the Tree number of max levels
func (t *Tree) FillMissingEmptySiblings(s [][]byte) [][]byte {
for i := len(s); i < t.maxLevels; i++ {
s = append(s, emptyValue)
}
@@ -66,7 +68,7 @@ func (t *Tree) GenerateCircomVerifierProof(k []byte) (*CircomVerifierProof, erro
if err != nil {
return nil, err
}
cp.Siblings = t.fillMissingEmptySiblings(s)
cp.Siblings = t.FillMissingEmptySiblings(s)
if !existence {
cp.OldKey = kAux
cp.OldValue = v