|
| 1 | +package secp256k1 |
| 2 | + |
| 3 | +import ( |
| 4 | + "encoding/hex" |
| 5 | + "fmt" |
| 6 | + "github.com/pkg/errors" |
| 7 | + "math/rand" |
| 8 | + "os" |
| 9 | + "testing" |
| 10 | +) |
| 11 | + |
| 12 | +type testVector struct { |
| 13 | + dataElement []byte |
| 14 | + ecmhHash Hash |
| 15 | + cumulativeHash Hash |
| 16 | +} |
| 17 | + |
| 18 | +var testVectors []testVector |
| 19 | + |
| 20 | +var testVectorsStrings = []struct { |
| 21 | + dataElementHex string |
| 22 | + point [2]string |
| 23 | + ecmhHash string |
| 24 | + cumulativeHash string |
| 25 | +}{ |
| 26 | + { |
| 27 | + "982051fd1e4ba744bbbe680e1fee14677ba1a3c3540bf7b1cdb606e857233e0e00000000010000000100f2052a0100000043410496b538e853519c726a2c91e61ec11600ae1390813a627c66fb8be7947be63c52da7589379515d4e0a604f8141781e62294721166bf621e73a82cbf2342c858eeac", |
| 28 | + [2]string{"4f9a5dce69067bf28603e73a7af4c3650b16539b95bad05eee95dfc94d1efe2c", "346d5b777881f2729e7f89b2de4e8e79c7f2f42d1a0b25a8f10becb66e2d0f98"}, |
| 29 | + "f883195933a687170c34fa1adec66fe2861889279fb12c03a3fb0ca68ad87893", |
| 30 | + "f883195933a687170c34fa1adec66fe2861889279fb12c03a3fb0ca68ad87893", |
| 31 | + }, |
| 32 | + { |
| 33 | + "d5fdcc541e25de1c7a5addedf24858b8bb665c9f36ef744ee42c316022c90f9b00000000020000000100f2052a010000004341047211a824f55b505228e4c3d5194c1fcfaa15a456abdf37f9b9d97a4040afc073dee6c89064984f03385237d92167c13e236446b417ab79a0fcae412ae3316b77ac", |
| 34 | + [2]string{"68cf91eb2388a0287c13d46011c73fb8efb6be89c0867a47feccb2d11c390d2d", "f42ba72b1079d3d941881836f88b5dcd7c207a6a4839f129272c77ebb7194d42"}, |
| 35 | + "ef85d123a15da95d8aff92623ad1e1c9fcda3baa801bd40bc567a83a6fdcf3e2", |
| 36 | + "fabafd38d07370982a34547daf5b57b8a4398696d6fd2294788abda07b1faaaf", |
| 37 | + }, |
| 38 | + { |
| 39 | + "44f672226090d85db9a9f2fbfe5f0f9609b387af7be5b7fbb7a1767c831c9e9900000000030000000100f2052a0100000043410494b9d3e76c5b1629ecf97fff95d7a4bbdac87cc26099ada28066c6ff1eb9191223cd897194a08d0c2726c5747f1db49e8cf90e75dc3e3550ae9b30086f3cd5aaac", |
| 40 | + [2]string{"359c6f59859d1d5af8e7081905cb6bb734c010be8680c14b5a89ee315694fc2b", "fb6ba531d4bd83b14c970ad1bec332a8ae9a05706cd5df7fd91a2f2cc32482fe"}, |
| 41 | + "cfadf40fc017faff5e04ccc0a2fae0fd616e4226dd7c03b1334a7a610468edff", |
| 42 | + "1cbccda23d7ce8c5a8b008008e1738e6bf9cffb1d5b86a92a4e62b5394a636e2", |
| 43 | + }, |
| 44 | +} |
| 45 | + |
| 46 | +func TestMain(m *testing.M) { |
| 47 | + for _, vector := range testVectorsStrings { |
| 48 | + res := testVector{} |
| 49 | + err := errors.New("") |
| 50 | + res.dataElement, err = hex.DecodeString(vector.dataElementHex) |
| 51 | + if err != nil { |
| 52 | + panic(fmt.Sprintf("failed parsing the hex: '%s', err: '%s'", vector.dataElementHex, err)) |
| 53 | + } |
| 54 | + data, err := hex.DecodeString(vector.ecmhHash) |
| 55 | + if err != nil { |
| 56 | + panic(fmt.Sprintf("failed parsing the hex: '%s', err: '%s'", vector.ecmhHash, err)) |
| 57 | + } |
| 58 | + err = res.ecmhHash.SetBytes(data) |
| 59 | + if err != nil { |
| 60 | + panic(fmt.Sprintf("failed setting the hash: '%x', err: '%s'", data, err)) |
| 61 | + } |
| 62 | + data, err = hex.DecodeString(vector.cumulativeHash) |
| 63 | + if err != nil { |
| 64 | + panic(fmt.Sprintf("failed parsing the hex: '%s', err: '%s'", vector.cumulativeHash, err)) |
| 65 | + } |
| 66 | + err = res.cumulativeHash.SetBytes(data) |
| 67 | + if err != nil { |
| 68 | + panic(fmt.Sprintf("failed setting the hash: '%x', err: '%s'", data, err)) |
| 69 | + } |
| 70 | + testVectors = append(testVectors, res) |
| 71 | + } |
| 72 | + |
| 73 | + os.Exit(m.Run()) |
| 74 | +} |
| 75 | + |
| 76 | +func TestVectorsMultiset_Hash(t *testing.T) { |
| 77 | + for _, test := range testVectors { |
| 78 | + m := NewMultiset() |
| 79 | + m.Add(test.dataElement) |
| 80 | + mFinal := m.Finalize() |
| 81 | + if !m.Finalize().IsEqual(&test.ecmhHash) { |
| 82 | + t.Fatalf("Multiset-Hash returned incorrect hash serialization, expected: '%s', found: '%s'", mFinal, test.ecmhHash) |
| 83 | + } |
| 84 | + } |
| 85 | + m := NewMultiset() |
| 86 | + if !m.Finalize().IsEqual(&Hash{}) { |
| 87 | + t.Fatalf("Empty set did not return zero hash, got: '%s' instead", m.Finalize()) |
| 88 | + } |
| 89 | +} |
| 90 | + |
| 91 | +func TestVectorsMultiset_AddRemove(t *testing.T) { |
| 92 | + m := NewMultiset() |
| 93 | + for i, test := range testVectors { |
| 94 | + m.Add(test.dataElement) |
| 95 | + mFinal := m.Finalize() |
| 96 | + if !mFinal.IsEqual(&test.cumulativeHash) { |
| 97 | + t.Fatalf("Test #%d: Multiset-Add returned incorrect hash. Expected '%s' but got '%s'", i, test.cumulativeHash, mFinal) |
| 98 | + } |
| 99 | + } |
| 100 | + |
| 101 | + for i := len(testVectors) - 1; i > 0; i-- { |
| 102 | + m.Remove(testVectors[i].dataElement) |
| 103 | + mFinal := m.Finalize() |
| 104 | + if !mFinal.IsEqual(&testVectors[i-1].cumulativeHash) { |
| 105 | + t.Fatalf("Test #%d: Multiset-Remove returned incorrect hash. Expected '%s' but got '%s'", i, testVectors[i].cumulativeHash, mFinal) |
| 106 | + } |
| 107 | + } |
| 108 | +} |
| 109 | + |
| 110 | +func TestVectorsMultiset_CombineSubtract(t *testing.T) { |
| 111 | + m1 := NewMultiset() |
| 112 | + zeroHash := m1.Finalize() |
| 113 | + |
| 114 | + for _, test := range testVectors { |
| 115 | + m1.Add(test.dataElement) |
| 116 | + } |
| 117 | + |
| 118 | + m2 := NewMultiset() |
| 119 | + for _, test := range testVectors { |
| 120 | + m2.Remove(test.dataElement) |
| 121 | + } |
| 122 | + m1.Combine(m2) |
| 123 | + if !m1.Finalize().IsEqual(zeroHash) { |
| 124 | + t.Fatalf("m1 was expected to have a zero hash, but was '%s' instead", m1.Finalize()) |
| 125 | + } |
| 126 | +} |
| 127 | + |
| 128 | +func TestVectorsMultiset_Commutativity(t *testing.T) { |
| 129 | + m := NewMultiset() |
| 130 | + zeroHash := m.Finalize() |
| 131 | + |
| 132 | + // Check that if we subtract values from zero and then re-add them, we return to zero. |
| 133 | + for _, test := range testVectors { |
| 134 | + m.Remove(test.dataElement) |
| 135 | + } |
| 136 | + |
| 137 | + for _, test := range testVectors { |
| 138 | + m.Add(test.dataElement) |
| 139 | + } |
| 140 | + if !m.Finalize().IsEqual(zeroHash) { |
| 141 | + t.Fatalf("m was expected to be zero hash, but was '%s' instead", m.Finalize()) |
| 142 | + } |
| 143 | + |
| 144 | + // Here we first remove an element from an empty multiset, and then add some other |
| 145 | + // elements, and then we create a new empty multiset, then we add the same elements |
| 146 | + // we added to the previous multiset, and then we remove the same element we remove |
| 147 | + // the same element we removed from the previous multiset. According to commutativity |
| 148 | + // laws, the result should be the same. |
| 149 | + removeIndex := 0 |
| 150 | + removeData := testVectors[removeIndex].dataElement |
| 151 | + |
| 152 | + m1 := NewMultiset() |
| 153 | + m1.Remove(removeData) |
| 154 | + |
| 155 | + for i, test := range testVectors { |
| 156 | + if i != removeIndex { |
| 157 | + m1.Add(test.dataElement) |
| 158 | + } |
| 159 | + } |
| 160 | + |
| 161 | + m2 := NewMultiset() |
| 162 | + for i, test := range testVectors { |
| 163 | + if i != removeIndex { |
| 164 | + m2.Add(test.dataElement) |
| 165 | + } |
| 166 | + } |
| 167 | + m2.Remove(removeData) |
| 168 | + |
| 169 | + if !m1.Finalize().IsEqual(m2.Finalize()) { |
| 170 | + t.Fatalf("m1 and m2 was exepcted to have the same hash, but got instead m1 '%s' and m2 '%s'", m1.Finalize(), m2.Finalize()) |
| 171 | + } |
| 172 | +} |
| 173 | + |
| 174 | +func TestParseMultiSetFail(t *testing.T) { |
| 175 | + data := [64]byte{} |
| 176 | + copy(data[:], Secp256k1Order.Bytes()) |
| 177 | + _, err := DeserializeMultiSet(data) |
| 178 | + if err == nil { |
| 179 | + t.Errorf("shouldn't be able to parse a multiset bigger with x bigger than the field size: '%s'", err) |
| 180 | + } |
| 181 | + data = [64]byte{} |
| 182 | + copy(data[32:], Secp256k1Order.Bytes()) |
| 183 | + _, err = DeserializeMultiSet(data) |
| 184 | + if err == nil { |
| 185 | + t.Errorf("shouldn't be able to parse a multiset bigger with y bigger than the field size: '%s'", err) |
| 186 | + } |
| 187 | + set := NewMultiset() |
| 188 | + n, err := rand.Read(data[:]) |
| 189 | + if err != nil || n != len(data) { |
| 190 | + t.Fatalf("failed generating random data '%s' '%d' ", err, n) |
| 191 | + } |
| 192 | + set.Add(data[:]) |
| 193 | + |
| 194 | +} |
| 195 | + |
| 196 | +func TestMultiSet_Reset(t *testing.T) { |
| 197 | + set := NewMultiset() |
| 198 | + emptySet := NewMultiset() |
| 199 | + data := [100]byte{} |
| 200 | + n, err := rand.Read(data[:]) |
| 201 | + if err != nil || n != len(data) { |
| 202 | + t.Fatalf("failed generating random data '%s' '%d' ", err, n) |
| 203 | + } |
| 204 | + set.Add(data[:]) |
| 205 | + if set.Finalize().IsEqual(emptySet.Finalize()) { |
| 206 | + t.Errorf("expected set to be empty. found: '%s'", set.Finalize()) |
| 207 | + } |
| 208 | + set.Reset() |
| 209 | + if !set.Finalize().IsEqual(emptySet.Finalize()) { |
| 210 | + t.Errorf("expected set to be empty. found: '%s'", set.Finalize()) |
| 211 | + } |
| 212 | +} |
| 213 | + |
| 214 | +func TestMultiSetAddRemove(t *testing.T) { |
| 215 | + list := [loopsN][100]byte{} |
| 216 | + set := NewMultiset() |
| 217 | + set2 := *set |
| 218 | + serializedEmpty := set.Serialize() |
| 219 | + for i := 0; i < loopsN; i++ { |
| 220 | + data := [100]byte{} |
| 221 | + n, err := rand.Read(data[:]) |
| 222 | + if err != nil || n != len(data) { |
| 223 | + t.Fatalf("Failed generating random data '%d' '%s' ", n, err) |
| 224 | + } |
| 225 | + set.Add(data[:]) |
| 226 | + list[i] = data |
| 227 | + } |
| 228 | + if set.Finalize().IsEqual(set2.Finalize()) { |
| 229 | + t.Errorf("sets are the same when they should be different: set '%s'\n", set.Finalize()) |
| 230 | + } |
| 231 | + |
| 232 | + for i := 0; i < loopsN; i++ { |
| 233 | + set.Remove(list[i][:]) |
| 234 | + } |
| 235 | + if !set.Finalize().IsEqual(set2.Finalize()) { |
| 236 | + t.Errorf("sets are different when they should be the same: set1: '%s', set2: '%s'\n", set.Finalize(), set2.Finalize()) |
| 237 | + } |
| 238 | + if set.Serialize() != serializedEmpty { |
| 239 | + t.Errorf("serialized sets are different when they should be the same: set1: '%x', set2: '%x'\n", set.Serialize(), serializedEmpty) |
| 240 | + } |
| 241 | + parsedSet, err := DeserializeMultiSet(serializedEmpty) |
| 242 | + if err != nil { |
| 243 | + t.Errorf("error: '%s' happened when parsing: '%x'", err, serializedEmpty) |
| 244 | + } else if !parsedSet.Finalize().IsEqual(set.Finalize()) { |
| 245 | + t.Errorf("sets are different when they should be the same: set1: '%s', parsedSet: '%s'\n", set.Finalize(), parsedSet.Finalize()) |
| 246 | + } |
| 247 | +} |
| 248 | + |
| 249 | +func BenchmarkMultiSet_Add(b *testing.B) { |
| 250 | + b.ReportAllocs() |
| 251 | + list := make([][100]byte, b.N) |
| 252 | + for i := 0; i < b.N; i++ { |
| 253 | + n, err := rand.Read(list[i][:]) |
| 254 | + if err != nil || n != len(list[i]) { |
| 255 | + b.Fatalf("Failed generating random data '%d' '%s' ", n, err) |
| 256 | + } |
| 257 | + } |
| 258 | + set := NewMultiset() |
| 259 | + b.ResetTimer() |
| 260 | + for i := 0; i < b.N; i++ { |
| 261 | + set.Add(list[i][:]) |
| 262 | + tmpSer := set.Serialize() |
| 263 | + tmpSet, err := DeserializeMultiSet(tmpSer) |
| 264 | + if err != nil || tmpSet.Finalize() != set.Finalize() { |
| 265 | + panic("bad benchmark") |
| 266 | + } |
| 267 | + } |
| 268 | + if set == NewMultiset() { // To prevent optimizing out the loop |
| 269 | + panic("bad benchmark") |
| 270 | + } |
| 271 | +} |
| 272 | + |
| 273 | +func BenchmarkMultiSet_Remove(b *testing.B) { |
| 274 | + b.ReportAllocs() |
| 275 | + list := make([][100]byte, b.N) |
| 276 | + for i := 0; i < b.N; i++ { |
| 277 | + n, err := rand.Read(list[i][:]) |
| 278 | + if err != nil || n != len(list[i]) { |
| 279 | + b.Fatalf("Failed generating random data '%d' '%s' ", n, err) |
| 280 | + } |
| 281 | + } |
| 282 | + set := NewMultiset() |
| 283 | + b.ResetTimer() |
| 284 | + for i := 0; i < b.N; i++ { |
| 285 | + set.Remove(list[i][:]) |
| 286 | + } |
| 287 | + if set == NewMultiset() { // To prevent optimizing out the loop |
| 288 | + panic("bad benchmark") |
| 289 | + } |
| 290 | +} |
| 291 | + |
| 292 | +func BenchmarkMultiSet_Combine(b *testing.B) { |
| 293 | + b.ReportAllocs() |
| 294 | + set := NewMultiset() |
| 295 | + sets := make([]MultiSet, b.N) |
| 296 | + for i := 0; i < b.N; i++ { |
| 297 | + data := [100]byte{} |
| 298 | + n, err := rand.Read(data[:]) |
| 299 | + if err != nil || n != len(data) { |
| 300 | + b.Fatalf("Failed generating random data '%d' '%s' ", n, err) |
| 301 | + } |
| 302 | + set.Add(data[:]) |
| 303 | + sets[i] = *set |
| 304 | + } |
| 305 | + set.Reset() |
| 306 | + b.ResetTimer() |
| 307 | + for i := 0; i < b.N; i++ { |
| 308 | + set.Combine(&sets[i]) |
| 309 | + } |
| 310 | +} |
0 commit comments