1package merkletree
  2
  3/*
  4This is just an example of basic tests for the (old) iden3-merkletree-specification.
  5The methods and variables names can be different.
  6*/
  7
  8import (
  9	"strconv"
 10	"testing"
 11
 12	"github.com/stretchr/testify/assert"
 13)
 14
 15type testBytesLeaf struct {
 16	data        []byte
 17	indexLength uint32
 18}
 19
 20func (c testBytesLeaf) Bytes() (b []byte) {
 21	return c.data
 22}
 23func (c testBytesLeaf) IndexLength() uint32 {
 24	return c.indexLength
 25}
 26func (c testBytesLeaf) Hi() Hash {
 27	h := HashBytes(c.Bytes()[:c.IndexLength()])
 28	return h
 29}
 30func newTestBytesLeaf(data string, indexLength uint32) testBytesLeaf {
 31	return testBytesLeaf{
 32		data:        []byte(data),
 33		indexLength: indexLength,
 34	}
 35}
 36
 37// Test to check the iden3-merkletree-specification
 38func TestIden3MerkletreeSpecification(t *testing.T) {
 39	h := HashBytes([]byte("test")).Hex()
 40	assert.Equal(t, "0x9c22ff5f21f0b81b113e63f7db6da94fedef11b2119b4088b89664fb9a3cb658", h)
 41
 42	h = HashBytes([]byte("authorizeksign")).Hex()
 43	assert.Equal(t, "0x353f867ef725411de05e3d4b0a01c37cf7ad24bcc213141a05ed7726d7932a1f", h)
 44
 45	mt := newTestingMerkle(t, 140)
 46	defer mt.storage.Close()
 47
 48	// empty tree
 49	assert.Equal(t, "0x0000000000000000000000000000000000000000000000000000000000000000", mt.Root().Hex())
 50
 51	leafN := testBytesLeaf{
 52		data:        []byte{1, 2, 3, 4, 5},
 53		indexLength: 3,
 54	}
 55	assert.Nil(t, mt.Add(leafN))
 56	assert.Equal(t, "0xa0e72cc948119fcb71b413cf5ada12b2b825d5133299b20a6d9325ffc3e2fbf1", mt.Root().Hex())
 57
 58	mt = newTestingMerkle(t, 140)
 59	defer mt.storage.Close()
 60
 61	// add leaf
 62	leaf := testBytesLeaf{
 63		data:        []byte("this is a test leaf"),
 64		indexLength: 15,
 65	}
 66	assert.Nil(t, mt.Add(leaf))
 67	assert.Equal(t, "0xb4fdf8a653198f0e179ccb3af7e4fc09d76247f479d6cfc95cd92d6fda589f27", mt.Root().Hex())
 68
 69	// proof with only one leaf in the MerkleTree
 70	proof, err := mt.GenerateProof(leaf.Hi())
 71	assert.Nil(t, err)
 72	assert.Equal(t, "0x0000000000000000000000000000000000000000000000000000000000000000", BytesToHex(proof))
 73
 74	// add a second leaf
 75	leaf2 := testBytesLeaf{
 76		data:        []byte("this is a second test leaf"),
 77		indexLength: 15,
 78	}
 79	err = mt.Add(leaf2)
 80	assert.Nil(t, err)
 81	assert.Equal(t, "0x8ac95e9c8a6fbd40bb21de7895ee35f9c8f30ca029dbb0972c02344f49462e82", mt.Root().Hex())
 82
 83	// proof of the second leaf, with two leafs in the MerkleTree
 84	proof2, err := mt.GenerateProof(leaf2.Hi())
 85	assert.Nil(t, err)
 86	assert.Equal(t, "0x0000000000000000000000000000000000000000000000000000000000000001fd8e1a60cdb23c0c7b2cf8462c99fafd905054dccb0ed75e7c8a7d6806749b6b", BytesToHex(proof2))
 87
 88	// proof of emptyLeaf
 89	leaf3 := testBytesLeaf{
 90		data:        []byte("this is a third test leaf"),
 91		indexLength: 15,
 92	}
 93	proof3, err := mt.GenerateProof(leaf3.Hi())
 94	assert.Nil(t, err)
 95	assert.Equal(t, "0x000000000000000000000000000000000000000000000000000000000000000389741fa23da77c259781ad8f4331a5a7d793eef1db7e5200ddfc8e5f5ca7ce2bfd8e1a60cdb23c0c7b2cf8462c99fafd905054dccb0ed75e7c8a7d6806749b6b", BytesToHex(proof3))
 96
 97	// getLeafByHi/GetValueInPos
 98	bytesInHi, err := mt.GetValueInPos(leaf2.Hi())
 99	assert.Nil(t, err)
100	assert.Equal(t, leaf2.Bytes(), bytesInHi)
101
102	// check proof
103	rootBytes, err := HexToBytes("0x7d7c5e8f4b3bf434f3d9d223359c4415e2764dd38de2e025fbf986e976a7ed3d")
104	assert.Nil(t, err)
105	mp, err := HexToBytes("0x0000000000000000000000000000000000000000000000000000000000000002d45aada6eec346222eaa6b5d3a9260e08c9b62fcf63c72bc05df284de07e6a52")
106	assert.Nil(t, err)
107	hiBytes, err := HexToBytes("0x786677808ba77bdd9090a969f1ef2cbd1ac5aecd9e654f340500159219106878")
108	assert.Nil(t, err)
109	htBytes, err := HexToBytes("0x786677808ba77bdd9090a969f1ef2cbd1ac5aecd9e654f340500159219106878")
110	assert.Nil(t, err)
111	var root, hi, ht Hash
112	copy(root[:], rootBytes)
113	copy(hi[:], hiBytes)
114	copy(ht[:], htBytes)
115	verified := CheckProof(root, mp, hi, ht, 140)
116	assert.True(t, verified)
117
118	// check proof of empty
119	rootBytes, err = HexToBytes("0x8f021d00c39dcd768974ddfe0d21f5d13f7215bea28db1f1cb29842b111332e7")
120	assert.Nil(t, err)
121	mp, err = HexToBytes("0x0000000000000000000000000000000000000000000000000000000000000004bf8e980d2ed328ae97f65c30c25520aeb53ff837579e392ea1464934c7c1feb9")
122	assert.Nil(t, err)
123	hiBytes, err = HexToBytes("0xa69792a4cff51f40b7a1f7ae596c6ded4aba241646a47538898f17f2a8dff647")
124	assert.Nil(t, err)
125	htBytes, err = HexToBytes("0x0000000000000000000000000000000000000000000000000000000000000000")
126	assert.Nil(t, err)
127	copy(root[:], rootBytes)
128	copy(hi[:], hiBytes)
129	copy(ht[:], htBytes)
130	verified = CheckProof(root, mp, hi, ht, 140)
131	assert.True(t, verified)
132
133	// check the proof generated in the previous steps
134	verified = CheckProof(mt.Root(), proof2, leaf2.Hi(), HashBytes(leaf2.Bytes()), 140)
135	assert.True(t, verified)
136	// check proof of no existence (emptyLeaf), as we are prooving an empty leaf, the Ht is an empty value (0x000...0)
137	verified = CheckProof(mt.Root(), proof3, leaf3.Hi(), EmptyNodeValue, 140)
138	assert.True(t, verified)
139
140	// add leafs in different orders
141	mt1 := newTestingMerkle(t, 140)
142	defer mt1.storage.Close()
143
144	mt1.Add(newTestBytesLeaf("0 this is a test leaf", 15))
145	mt1.Add(newTestBytesLeaf("1 this is a test leaf", 15))
146	mt1.Add(newTestBytesLeaf("2 this is a test leaf", 15))
147	mt1.Add(newTestBytesLeaf("3 this is a test leaf", 15))
148	mt1.Add(newTestBytesLeaf("4 this is a test leaf", 15))
149	mt1.Add(newTestBytesLeaf("5 this is a test leaf", 15))
150	// mt1.PrintFullMT()
151
152	mt2 := newTestingMerkle(t, 140)
153	defer mt2.storage.Close()
154
155	mt2.Add(newTestBytesLeaf("2 this is a test leaf", 15))
156	mt2.Add(newTestBytesLeaf("1 this is a test leaf", 15))
157	mt2.Add(newTestBytesLeaf("0 this is a test leaf", 15))
158	mt2.Add(newTestBytesLeaf("5 this is a test leaf", 15))
159	mt2.Add(newTestBytesLeaf("3 this is a test leaf", 15))
160	mt2.Add(newTestBytesLeaf("4 this is a test leaf", 15))
161
162	assert.Equal(t, mt1.Root().Hex(), mt2.Root().Hex())
163	assert.Equal(t, mt1.Root().Hex(), "0x264397f84da141b3134dcde1d7540d27a2bf0d787bbe8365d9ad5c9c18d3c621")
164
165	// adding 1000 leafs
166	mt1000 := newTestingMerkle(t, 140)
167	defer mt.storage.Close()
168
169	numToAdd := 1000
170	for i := 0; i < numToAdd; i++ {
171		leaf := newTestBytesLeaf(strconv.Itoa(i)+" this is a test leaf", 15)
172		mt1000.Add(leaf)
173	}
174	assert.Equal(t, "0x6e2da580b2920cd78ed8d4e4bf41e209dfc99ef28bc19560042f0ac803e0d6f7", mt1000.Root().Hex())
175}