arnaucube/hermez-node
1
0
Fork 0
mirror of https://github.com/arnaucube/hermez-node.git synced 2026-02-08 03:46:52 +01:00
Code Issues Packages Projects Releases Wiki Activity

Update ExitProofs-Siblings padding

Browse Source
This commit is contained in:
arnaucube
2020-12-29 17:45:59 +01:00
parent 8c6dc6e3f8
commit ca5870e3ba
6 changed files with 81 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

51
common/utils_test.go
View File

@@ -4,7 +4,9 @@ import (
"encoding/hex"
"testing"
"github.com/iden3/go-merkletree"
"github.com/stretchr/testify/assert"
"github.com/stretchr/testify/require"
)
func TestBJJFromStringWithChecksum(t *testing.T) {
@@ -22,3 +24,52 @@ func TestBJJFromStringWithChecksum(t *testing.T) {
assert.Equal(t, "2492816973395423007340226948038371729989170225696553239457870892535792679622", pk.X.String())
assert.Equal(t, "15238403086306505038849621710779816852318505119327426213168494964113886299863", pk.Y.String())
}
func TestRmEndingZeroes(t *testing.T) {
s0, err := merkletree.NewHashFromHex("0x0000000000000000000000000000000000000000000000000000000000000000")
require.NoError(t, err)
s1, err := merkletree.NewHashFromHex("0x0000000000000000000000000000000000000000000000000000000000000001")
require.NoError(t, err)
s2, err := merkletree.NewHashFromHex("0x0000000000000000000000000000000000000000000000000000000000000002")
require.NoError(t, err)
// expect cropped last zeroes
circomSiblings := []*merkletree.Hash{s0, s1, s0, s1, s1, s1, s2, s0, s0, s0, s0}
siblings := RmEndingZeroes(circomSiblings)
expected := []*merkletree.Hash{s0, s1, s0, s1, s1, s1, s2}
assert.Equal(t, expected, siblings)
// expect empty array when input is an empty array
siblings = RmEndingZeroes([]*merkletree.Hash{})
assert.Equal(t, []*merkletree.Hash{}, siblings)
// expect nil when input is nil
siblings = RmEndingZeroes(nil)
assert.Nil(t, siblings)
// cases when inputs are [x], [x,0], [0,x]
circomSiblings = []*merkletree.Hash{s1}
siblings = RmEndingZeroes(circomSiblings)
assert.Equal(t, []*merkletree.Hash{s1}, siblings)
circomSiblings = []*merkletree.Hash{s1, s0}
siblings = RmEndingZeroes(circomSiblings)
assert.Equal(t, []*merkletree.Hash{s1}, siblings)
circomSiblings = []*merkletree.Hash{s0, s1}
siblings = RmEndingZeroes(circomSiblings)
assert.Equal(t, []*merkletree.Hash{s0, s1}, siblings)
// expect empty array when input is all zeroes
circomSiblings = []*merkletree.Hash{s0}
siblings = RmEndingZeroes(circomSiblings)
assert.Equal(t, []*merkletree.Hash{}, siblings)
circomSiblings = []*merkletree.Hash{s0, s0}
siblings = RmEndingZeroes(circomSiblings)
assert.Equal(t, []*merkletree.Hash{}, siblings)
circomSiblings = []*merkletree.Hash{s0, s0, s0, s0, s0}
siblings = RmEndingZeroes(circomSiblings)
assert.Equal(t, []*merkletree.Hash{}, siblings)
// expect input equal to output when last element!=0
circomSiblings = []*merkletree.Hash{s0, s1, s0, s1, s1, s1, s2, s0, s0, s0, s0, s2}
siblings = RmEndingZeroes(circomSiblings)
assert.Equal(t, circomSiblings, siblings)
}