PIVX Core  5.6.99
P2P Digital Currency
hash_tests.cpp
Go to the documentation of this file.
1 // Copyright (c) 2013 The Bitcoin Core developers
2 // Distributed under the MIT/X11 software license, see the accompanying
3 // file COPYING or http://www.opensource.org/licenses/mit-license.php.
4 
5 #include "crypto/siphash.h"
6 #include "hash.h"
7 #include "utilstrencodings.h"
8 #include "test/test_pivx.h"
9 
10 #include <vector>
11 
12 #include <boost/test/unit_test.hpp>
13 
14 
16 
18 {
19 
20 #define T(expected, seed, data) BOOST_CHECK_EQUAL(MurmurHash3(seed, ParseHex(data)), expected)
21 
22  // Test MurmurHash3 with various inputs. Of course this is retested in the
23  // bloom filter tests - they would fail if MurmurHash3() had any problems -
24  // but is useful for those trying to implement Bitcoin libraries as a
25  // source of test data for their MurmurHash3() primitive during
26  // development.
27  //
28  // The magic number 0xFBA4C795 comes from CBloomFilter::Hash()
29 
30  T(0x00000000, 0x00000000, "");
31  T(0x6a396f08, 0xFBA4C795, "");
32  T(0x81f16f39, 0xffffffff, "");
33 
34  T(0x514e28b7, 0x00000000, "00");
35  T(0xea3f0b17, 0xFBA4C795, "00");
36  T(0xfd6cf10d, 0x00000000, "ff");
37 
38  T(0x16c6b7ab, 0x00000000, "0011");
39  T(0x8eb51c3d, 0x00000000, "001122");
40  T(0xb4471bf8, 0x00000000, "00112233");
41  T(0xe2301fa8, 0x00000000, "0011223344");
42  T(0xfc2e4a15, 0x00000000, "001122334455");
43  T(0xb074502c, 0x00000000, "00112233445566");
44  T(0x8034d2a0, 0x00000000, "0011223344556677");
45  T(0xb4698def, 0x00000000, "001122334455667788");
46 
47 #undef T
48 }
49 
50 /*
51  SipHash-2-4 output with
52  k = 00 01 02 ...
53  and
54  in = (empty string)
55  in = 00 (1 byte)
56  in = 00 01 (2 bytes)
57  in = 00 01 02 (3 bytes)
58  ...
59  in = 00 01 02 ... 3e (63 bytes)
60 
61  from: https://131002.net/siphash/siphash24.c
62 */
63 uint64_t siphash_4_2_testvec[] = {
64  0x726fdb47dd0e0e31, 0x74f839c593dc67fd, 0x0d6c8009d9a94f5a, 0x85676696d7fb7e2d,
65  0xcf2794e0277187b7, 0x18765564cd99a68d, 0xcbc9466e58fee3ce, 0xab0200f58b01d137,
66  0x93f5f5799a932462, 0x9e0082df0ba9e4b0, 0x7a5dbbc594ddb9f3, 0xf4b32f46226bada7,
67  0x751e8fbc860ee5fb, 0x14ea5627c0843d90, 0xf723ca908e7af2ee, 0xa129ca6149be45e5,
68  0x3f2acc7f57c29bdb, 0x699ae9f52cbe4794, 0x4bc1b3f0968dd39c, 0xbb6dc91da77961bd,
69  0xbed65cf21aa2ee98, 0xd0f2cbb02e3b67c7, 0x93536795e3a33e88, 0xa80c038ccd5ccec8,
70  0xb8ad50c6f649af94, 0xbce192de8a85b8ea, 0x17d835b85bbb15f3, 0x2f2e6163076bcfad,
71  0xde4daaaca71dc9a5, 0xa6a2506687956571, 0xad87a3535c49ef28, 0x32d892fad841c342,
72  0x7127512f72f27cce, 0xa7f32346f95978e3, 0x12e0b01abb051238, 0x15e034d40fa197ae,
73  0x314dffbe0815a3b4, 0x027990f029623981, 0xcadcd4e59ef40c4d, 0x9abfd8766a33735c,
74  0x0e3ea96b5304a7d0, 0xad0c42d6fc585992, 0x187306c89bc215a9, 0xd4a60abcf3792b95,
75  0xf935451de4f21df2, 0xa9538f0419755787, 0xdb9acddff56ca510, 0xd06c98cd5c0975eb,
76  0xe612a3cb9ecba951, 0xc766e62cfcadaf96, 0xee64435a9752fe72, 0xa192d576b245165a,
77  0x0a8787bf8ecb74b2, 0x81b3e73d20b49b6f, 0x7fa8220ba3b2ecea, 0x245731c13ca42499,
78  0xb78dbfaf3a8d83bd, 0xea1ad565322a1a0b, 0x60e61c23a3795013, 0x6606d7e446282b93,
79  0x6ca4ecb15c5f91e1, 0x9f626da15c9625f3, 0xe51b38608ef25f57, 0x958a324ceb064572
80 };
81 
83 {
84  CSipHasher hasher(0x0706050403020100ULL, 0x0F0E0D0C0B0A0908ULL);
85  BOOST_CHECK_EQUAL(hasher.Finalize(), 0x726fdb47dd0e0e31ull);
86  static const unsigned char t0[1] = {0};
87  hasher.Write(t0, 1);
88  BOOST_CHECK_EQUAL(hasher.Finalize(), 0x74f839c593dc67fdull);
89  static const unsigned char t1[7] = {1,2,3,4,5,6,7};
90  hasher.Write(t1, 7);
91  BOOST_CHECK_EQUAL(hasher.Finalize(), 0x93f5f5799a932462ull);
92  hasher.Write(0x0F0E0D0C0B0A0908ULL);
93  BOOST_CHECK_EQUAL(hasher.Finalize(), 0x3f2acc7f57c29bdbull);
94  static const unsigned char t2[2] = {16,17};
95  hasher.Write(t2, 2);
96  BOOST_CHECK_EQUAL(hasher.Finalize(), 0x4bc1b3f0968dd39cull);
97  static const unsigned char t3[9] = {18,19,20,21,22,23,24,25,26};
98  hasher.Write(t3, 9);
99  BOOST_CHECK_EQUAL(hasher.Finalize(), 0x2f2e6163076bcfadull);
100  static const unsigned char t4[5] = {27,28,29,30,31};
101  hasher.Write(t4, 5);
102  BOOST_CHECK_EQUAL(hasher.Finalize(), 0x7127512f72f27cceull);
103  hasher.Write(0x2726252423222120ULL);
104  BOOST_CHECK_EQUAL(hasher.Finalize(), 0x0e3ea96b5304a7d0ull);
105  hasher.Write(0x2F2E2D2C2B2A2928ULL);
106  BOOST_CHECK_EQUAL(hasher.Finalize(), 0xe612a3cb9ecba951ull);
107 
108  BOOST_CHECK_EQUAL(SipHashUint256(0x0706050403020100ULL, 0x0F0E0D0C0B0A0908ULL, uint256S("1f1e1d1c1b1a191817161514131211100f0e0d0c0b0a09080706050403020100")), 0x7127512f72f27cceull);
109 
110  // Check test vectors from spec, one byte at a time
111  CSipHasher hasher2(0x0706050403020100ULL, 0x0F0E0D0C0B0A0908ULL);
112  for (uint8_t x=0; x<ARRAYLEN(siphash_4_2_testvec); ++x)
113  {
115  hasher2.Write(&x, 1);
116  }
117  // Check test vectors from spec, eight bytes at a time
118  CSipHasher hasher3(0x0706050403020100ULL, 0x0F0E0D0C0B0A0908ULL);
119  for (uint8_t x=0; x<ARRAYLEN(siphash_4_2_testvec); x+=8)
120  {
122  hasher3.Write(uint64_t(x)|(uint64_t(x+1)<<8)|(uint64_t(x+2)<<16)|(uint64_t(x+3)<<24)|
123  (uint64_t(x+4)<<32)|(uint64_t(x+5)<<40)|(uint64_t(x+6)<<48)|(uint64_t(x+7)<<56));
124  }
125 
126  CHashWriter ss(SER_DISK, CLIENT_VERSION);
127  ss << CTransaction();
128  BOOST_CHECK_EQUAL(SipHashUint256(1, 2, ss.GetHash()), 0x79751e980c2a0a35ULL);
129 
130  // Check consistency between CSipHasher and SipHashUint256[Extra].
131  FastRandomContext ctx;
132  for (int i = 0; i < 16; ++i) {
133  uint64_t k1 = ctx.rand64();
134  uint64_t k2 = ctx.rand64();
135  uint256 x = GetRandHash();
136  uint32_t n = ctx.rand32();
137  uint8_t nb[4];
138  WriteLE32(nb, n);
139  CSipHasher sip256(k1, k2);
140  sip256.Write(x.begin(), 32);
141  CSipHasher sip288 = sip256;
142  sip288.Write(nb, 4);
143  BOOST_CHECK_EQUAL(SipHashUint256(k1, k2, x), sip256.Finalize());
144  BOOST_CHECK_EQUAL(SipHashUint256Extra(k1, k2, x, n), sip288.Finalize());
145  }
146 }
147 
A writer stream (for serialization) that computes a 256-bit hash.
Definition: hash.h:216
uint256 GetHash()
Definition: hash.h:236
SipHash-2-4.
Definition: siphash.h:14
uint64_t Finalize() const
Compute the 64-bit SipHash-2-4 of the data written so far.
Definition: siphash.cpp:76
CSipHasher & Write(uint64_t data)
Hash a 64-bit integer worth of data It is treated as if this was the little-endian interpretation of ...
Definition: siphash.cpp:28
The basic transaction that is broadcasted on the network and contained in blocks.
Definition: transaction.h:244
Fast randomness source.
Definition: random.h:107
uint32_t rand32() noexcept
Generate a random 32-bit integer.
Definition: random.h:191
uint64_t rand64() noexcept
Generate a random 64-bit integer.
Definition: random.h:150
unsigned char * begin()
Definition: uint256.h:63
256-bit opaque blob.
Definition: uint256.h:138
BOOST_AUTO_TEST_SUITE_END()
BOOST_AUTO_TEST_CASE(murmurhash3)
Definition: hash_tests.cpp:17
uint64_t siphash_4_2_testvec[]
Definition: hash_tests.cpp:63
#define T(expected, seed, data)
#define BOOST_FIXTURE_TEST_SUITE(a, b)
Definition: object.cpp:14
#define BOOST_CHECK_EQUAL(v1, v2)
Definition: object.cpp:18
uint256 GetRandHash() noexcept
Definition: random.cpp:596
@ SER_DISK
Definition: serialize.h:175
uint64_t SipHashUint256Extra(uint64_t k0, uint64_t k1, const uint256 &val, uint32_t extra)
Definition: siphash.cpp:134
uint64_t SipHashUint256(uint64_t k0, uint64_t k1, const uint256 &val)
Optimized SipHash-2-4 implementation for uint256.
Definition: siphash.cpp:94
Basic testing setup.
Definition: test_pivx.h:51
uint256 uint256S(const char *str)
Definition: uint256.h:157
#define ARRAYLEN(array)