hash_tests.cpp raw

   1  // Copyright (c) 2013-2021 The Limenka developers
   2  // Distributed under the MIT software license, see the accompanying
   3  // file COPYING or http://www.opensource.org/licenses/mit-license.php.
   4  
   5  #include <clientversion.h>
   6  #include <crypto/siphash.h>
   7  #include <hash.h>
   8  #include <test/util/random.h>
   9  #include <test/util/setup_common.h>
  10  #include <util/hasher.h>
  11  #include <util/strencodings.h>
  12  
  13  #ifdef __GLIBCXX__
  14  #include <bits/functional_hash.h>
  15  #endif
  16  
  17  #include <type_traits>
  18  
  19  #include <boost/test/unit_test.hpp>
  20  
  21  BOOST_FIXTURE_TEST_SUITE(hash_tests, BasicTestingSetup)
  22  
  23  BOOST_AUTO_TEST_CASE(murmurhash3)
  24  {
  25  
  26  #define T(expected, seed, data) BOOST_CHECK_EQUAL(MurmurHash3(seed, ParseHex(data)), expected)
  27  
  28      // Test MurmurHash3 with various inputs. Of course this is retested in the
  29      // bloom filter tests - they would fail if MurmurHash3() had any problems -
  30      // but is useful for those trying to implement Limenka libraries as a
  31      // source of test data for their MurmurHash3() primitive during
  32      // development.
  33      //
  34      // The magic number 0xFBA4C795 comes from CBloomFilter::Hash()
  35  
  36      T(0x00000000U, 0x00000000, "");
  37      T(0x6a396f08U, 0xFBA4C795, "");
  38      T(0x81f16f39U, 0xffffffff, "");
  39  
  40      T(0x514e28b7U, 0x00000000, "00");
  41      T(0xea3f0b17U, 0xFBA4C795, "00");
  42      T(0xfd6cf10dU, 0x00000000, "ff");
  43  
  44      T(0x16c6b7abU, 0x00000000, "0011");
  45      T(0x8eb51c3dU, 0x00000000, "001122");
  46      T(0xb4471bf8U, 0x00000000, "00112233");
  47      T(0xe2301fa8U, 0x00000000, "0011223344");
  48      T(0xfc2e4a15U, 0x00000000, "001122334455");
  49      T(0xb074502cU, 0x00000000, "00112233445566");
  50      T(0x8034d2a0U, 0x00000000, "0011223344556677");
  51      T(0xb4698defU, 0x00000000, "001122334455667788");
  52  
  53  #undef T
  54  }
  55  
  56  BOOST_AUTO_TEST_CASE(salted_outpoint_hasher_cache_policy)
  57  {
  58      constexpr bool nothrow_invocable{std::is_nothrow_invocable_v<const SaltedOutpointHasher&, const COutPoint&>};
  59      BOOST_CHECK(!nothrow_invocable);
  60  #ifdef __GLIBCXX__
  61      // With a fast hasher, the may-throw contract above selects cached hash nodes on libstdc++.
  62      BOOST_CHECK(std::__is_fast_hash<SaltedOutpointHasher>::value);
  63  #endif
  64  }
  65  
  66  /*
  67     SipHash-2-4 output with
  68     k = 00 01 02 ...
  69     and
  70     in = (empty string)
  71     in = 00 (1 byte)
  72     in = 00 01 (2 bytes)
  73     in = 00 01 02 (3 bytes)
  74     ...
  75     in = 00 01 02 ... 3e (63 bytes)
  76  
  77     from: https://131002.net/siphash/siphash24.c
  78  */
  79  uint64_t siphash_4_2_testvec[] = {
  80      0x726fdb47dd0e0e31, 0x74f839c593dc67fd, 0x0d6c8009d9a94f5a, 0x85676696d7fb7e2d,
  81      0xcf2794e0277187b7, 0x18765564cd99a68d, 0xcbc9466e58fee3ce, 0xab0200f58b01d137,
  82      0x93f5f5799a932462, 0x9e0082df0ba9e4b0, 0x7a5dbbc594ddb9f3, 0xf4b32f46226bada7,
  83      0x751e8fbc860ee5fb, 0x14ea5627c0843d90, 0xf723ca908e7af2ee, 0xa129ca6149be45e5,
  84      0x3f2acc7f57c29bdb, 0x699ae9f52cbe4794, 0x4bc1b3f0968dd39c, 0xbb6dc91da77961bd,
  85      0xbed65cf21aa2ee98, 0xd0f2cbb02e3b67c7, 0x93536795e3a33e88, 0xa80c038ccd5ccec8,
  86      0xb8ad50c6f649af94, 0xbce192de8a85b8ea, 0x17d835b85bbb15f3, 0x2f2e6163076bcfad,
  87      0xde4daaaca71dc9a5, 0xa6a2506687956571, 0xad87a3535c49ef28, 0x32d892fad841c342,
  88      0x7127512f72f27cce, 0xa7f32346f95978e3, 0x12e0b01abb051238, 0x15e034d40fa197ae,
  89      0x314dffbe0815a3b4, 0x027990f029623981, 0xcadcd4e59ef40c4d, 0x9abfd8766a33735c,
  90      0x0e3ea96b5304a7d0, 0xad0c42d6fc585992, 0x187306c89bc215a9, 0xd4a60abcf3792b95,
  91      0xf935451de4f21df2, 0xa9538f0419755787, 0xdb9acddff56ca510, 0xd06c98cd5c0975eb,
  92      0xe612a3cb9ecba951, 0xc766e62cfcadaf96, 0xee64435a9752fe72, 0xa192d576b245165a,
  93      0x0a8787bf8ecb74b2, 0x81b3e73d20b49b6f, 0x7fa8220ba3b2ecea, 0x245731c13ca42499,
  94      0xb78dbfaf3a8d83bd, 0xea1ad565322a1a0b, 0x60e61c23a3795013, 0x6606d7e446282b93,
  95      0x6ca4ecb15c5f91e1, 0x9f626da15c9625f3, 0xe51b38608ef25f57, 0x958a324ceb064572
  96  };
  97  
  98  BOOST_AUTO_TEST_CASE(siphash)
  99  {
 100      CSipHasher hasher(0x0706050403020100ULL, 0x0F0E0D0C0B0A0908ULL);
 101      BOOST_CHECK_EQUAL(hasher.Finalize(),  0x726fdb47dd0e0e31ull);
 102      static const unsigned char t0[1] = {0};
 103      hasher.Write(t0);
 104      BOOST_CHECK_EQUAL(hasher.Finalize(),  0x74f839c593dc67fdull);
 105      static const unsigned char t1[7] = {1,2,3,4,5,6,7};
 106      hasher.Write(t1);
 107      BOOST_CHECK_EQUAL(hasher.Finalize(),  0x93f5f5799a932462ull);
 108      hasher.Write(0x0F0E0D0C0B0A0908ULL);
 109      BOOST_CHECK_EQUAL(hasher.Finalize(),  0x3f2acc7f57c29bdbull);
 110      static const unsigned char t2[2] = {16,17};
 111      hasher.Write(t2);
 112      BOOST_CHECK_EQUAL(hasher.Finalize(),  0x4bc1b3f0968dd39cull);
 113      static const unsigned char t3[9] = {18,19,20,21,22,23,24,25,26};
 114      hasher.Write(t3);
 115      BOOST_CHECK_EQUAL(hasher.Finalize(),  0x2f2e6163076bcfadull);
 116      static const unsigned char t4[5] = {27,28,29,30,31};
 117      hasher.Write(t4);
 118      BOOST_CHECK_EQUAL(hasher.Finalize(),  0x7127512f72f27cceull);
 119      hasher.Write(0x2726252423222120ULL);
 120      BOOST_CHECK_EQUAL(hasher.Finalize(),  0x0e3ea96b5304a7d0ull);
 121      hasher.Write(0x2F2E2D2C2B2A2928ULL);
 122      BOOST_CHECK_EQUAL(hasher.Finalize(),  0xe612a3cb9ecba951ull);
 123  
 124      BOOST_CHECK_EQUAL(SipHashUint256(0x0706050403020100ULL, 0x0F0E0D0C0B0A0908ULL, uint256{"1f1e1d1c1b1a191817161514131211100f0e0d0c0b0a09080706050403020100"}), 0x7127512f72f27cceull);
 125  
 126      // Check test vectors from spec, one byte at a time
 127      CSipHasher hasher2(0x0706050403020100ULL, 0x0F0E0D0C0B0A0908ULL);
 128      for (uint8_t x=0; x<std::size(siphash_4_2_testvec); ++x)
 129      {
 130          BOOST_CHECK_EQUAL(hasher2.Finalize(), siphash_4_2_testvec[x]);
 131          hasher2.Write(Span{&x, 1});
 132      }
 133      // Check test vectors from spec, eight bytes at a time
 134      CSipHasher hasher3(0x0706050403020100ULL, 0x0F0E0D0C0B0A0908ULL);
 135      for (uint8_t x=0; x<std::size(siphash_4_2_testvec); x+=8)
 136      {
 137          BOOST_CHECK_EQUAL(hasher3.Finalize(), siphash_4_2_testvec[x]);
 138          hasher3.Write(uint64_t(x)|(uint64_t(x+1)<<8)|(uint64_t(x+2)<<16)|(uint64_t(x+3)<<24)|
 139                       (uint64_t(x+4)<<32)|(uint64_t(x+5)<<40)|(uint64_t(x+6)<<48)|(uint64_t(x+7)<<56));
 140      }
 141  
 142      HashWriter ss{};
 143      CMutableTransaction tx;
 144      // Note these tests were originally written with tx.version=1
 145      // and the test would be affected by default tx version bumps if not fixed.
 146      tx.version = 1;
 147      ss << TX_WITH_WITNESS(tx);
 148      BOOST_CHECK_EQUAL(SipHashUint256(1, 2, ss.GetHash()), 0x79751e980c2a0a35ULL);
 149  
 150      // Check consistency between CSipHasher and SipHashUint256[Extra].
 151      FastRandomContext ctx;
 152      for (int i = 0; i < 16; ++i) {
 153          uint64_t k1 = ctx.rand64();
 154          uint64_t k2 = ctx.rand64();
 155          uint256 x = m_rng.rand256();
 156          uint32_t n = ctx.rand32();
 157          uint8_t nb[4];
 158          WriteLE32(nb, n);
 159          CSipHasher sip256(k1, k2);
 160          sip256.Write(x);
 161          CSipHasher sip288 = sip256;
 162          sip288.Write(nb);
 163          BOOST_CHECK_EQUAL(SipHashUint256(k1, k2, x), sip256.Finalize());
 164          BOOST_CHECK_EQUAL(SipHashUint256Extra(k1, k2, x, n), sip288.Finalize());
 165      }
 166  }
 167  
 168  BOOST_AUTO_TEST_SUITE_END()
 169