API tools faq
paste
Advertisement
Guest User

Untitled

a guest
May 26th, 2014
530
0
Never
Add comment
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 27.42 KB | None | 0 0
raw download clone embed print report
  1. /*
  2. * X13 kernel implementation.
  3. *
  4. * ==========================(LICENSE BEGIN)============================
  5. *
  6. * Copyright (c) 2014 phm
  7. *
  8. * Permission is hereby granted, free of charge, to any person obtaining
  9. * a copy of this software and associated documentation files (the
  10. * "Software"), to deal in the Software without restriction, including
  11. * without limitation the rights to use, copy, modify, merge, publish,
  12. * distribute, sublicense, and/or sell copies of the Software, and to
  13. * permit persons to whom the Software is furnished to do so, subject to
  14. * the following conditions:
  15. *
  16. * The above copyright notice and this permission notice shall be
  17. * included in all copies or substantial portions of the Software.
  18. *
  19. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  20. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  21. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
  22. * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
  23. * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
  24. * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
  25. * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
  26. *
  27. * ===========================(LICENSE END)=============================
  28. *
  29. * @author phm <phm@inbox.com>
  30. */
  31.  
  32. #ifndef MARUCOIN_CL
  33. #define MARUCOIN_CL
  34.  
  35. #if __ENDIAN_LITTLE__
  36. #define SPH_LITTLE_ENDIAN 1
  37. #else
  38. #define SPH_BIG_ENDIAN 1
  39. #endif
  40.  
  41. #define SPH_UPTR sph_u64
  42.  
  43. typedef unsigned int sph_u32;
  44. typedef int sph_s32;
  45. #ifndef __OPENCL_VERSION__
  46. typedef unsigned long long sph_u64;
  47. typedef long long sph_s64;
  48. #else
  49. typedef unsigned long sph_u64;
  50. typedef long sph_s64;
  51. #endif
  52.  
  53. #define SPH_64 1
  54. #define SPH_64_TRUE 1
  55.  
  56. #define SPH_C32(x) ((sph_u32)(x ## U))
  57. #define SPH_T32(x) ((x) & SPH_C32(0xFFFFFFFF))
  58. #define SPH_ROTL32(x, n) SPH_T32(((x) << (n)) | ((x) >> (32 - (n))))
  59. #define SPH_ROTR32(x, n) SPH_ROTL32(x, (32 - (n)))
  60.  
  61. #define SPH_C64(x) ((sph_u64)(x ## UL))
  62. #define SPH_T64(x) ((x) & SPH_C64(0xFFFFFFFFFFFFFFFF))
  63. #define SPH_ROTL64(x, n) SPH_T64(((x) << (n)) | ((x) >> (64 - (n))))
  64. #define SPH_ROTR64(x, n) SPH_ROTL64(x, (64 - (n)))
  65.  
  66. #define SPH_ECHO_64 1
  67. #define SPH_KECCAK_64 1
  68. #define SPH_JH_64 1
  69. #define SPH_SIMD_NOCOPY 0
  70. #define SPH_KECCAK_NOCOPY 0
  71. #define SPH_COMPACT_BLAKE_64 0
  72. #define SPH_LUFFA_PARALLEL 0
  73. #define SPH_SMALL_FOOTPRINT_GROESTL 0
  74. #define SPH_GROESTL_BIG_ENDIAN 0
  75. #define SPH_CUBEHASH_UNROLL 0
  76. #define SPH_KECCAK_UNROLL 0
  77. #define SPH_HAMSI_EXPAND_BIG 1
  78.  
  79. #include "blake.cl"
  80. #include "bmw.cl"
  81. #include "groestl.cl"
  82. #include "jh.cl"
  83. #include "keccak.cl"
  84. #include "skein.cl"
  85. #include "luffa.cl"
  86. #include "cubehash.cl"
  87. #include "shavite.cl"
  88. #include "simd.cl"
  89. #include "echo.cl"
  90. #include "hamsi.cl"
  91. #include "fugue.cl"
  92.  
  93. #define SWAP4(x) as_uint(as_uchar4(x).wzyx)
  94. #define SWAP8(x) as_ulong(as_uchar8(x).s76543210)
  95.  
  96. #if SPH_BIG_ENDIAN
  97. #define DEC64E(x) (x)
  98. #define DEC64BE(x) (*(const __global sph_u64 *) (x));
  99. #else
  100. #define DEC64E(x) SWAP8(x)
  101. #define DEC64BE(x) SWAP8(*(const __global sph_u64 *) (x));
  102. #endif
  103.  
  104. __attribute__((reqd_work_group_size(WORKSIZE, 1, 1)))
  105. __kernel void search(__global unsigned char* block, volatile __global uint* output, const ulong target)
  106. {
  107. uint gid = get_global_id(0);
  108. union {
  109. unsigned char h1[64];
  110. uint h4[16];
  111. ulong h8[8];
  112. } hash;
  113.  
  114. __local sph_u32 AES0[256], AES1[256], AES2[256], AES3[256];
  115. int init = get_local_id(0);
  116. int step = get_local_size(0);
  117. for (int i = init; i < 256; i += step)
  118. {
  119. AES0[i] = AES0_C[i];
  120. AES1[i] = AES1_C[i];
  121. AES2[i] = AES2_C[i];
  122. AES3[i] = AES3_C[i];
  123. }
  124. barrier(CLK_LOCAL_MEM_FENCE);
  125.  
  126. // blake
  127. {
  128. sph_u64 H0 = SPH_C64(0x6A09E667F3BCC908), H1 = SPH_C64(0xBB67AE8584CAA73B);
  129. sph_u64 H2 = SPH_C64(0x3C6EF372FE94F82B), H3 = SPH_C64(0xA54FF53A5F1D36F1);
  130. sph_u64 H4 = SPH_C64(0x510E527FADE682D1), H5 = SPH_C64(0x9B05688C2B3E6C1F);
  131. sph_u64 H6 = SPH_C64(0x1F83D9ABFB41BD6B), H7 = SPH_C64(0x5BE0CD19137E2179);
  132. sph_u64 S0 = 0, S1 = 0, S2 = 0, S3 = 0;
  133. sph_u64 T0 = SPH_C64(0xFFFFFFFFFFFFFC00) + (80 << 3), T1 = 0xFFFFFFFFFFFFFFFF;;
  134.  
  135. if ((T0 = SPH_T64(T0 + 1024)) < 1024)
  136. {
  137. T1 = SPH_T64(T1 + 1);
  138. }
  139. sph_u64 M0, M1, M2, M3, M4, M5, M6, M7;
  140. sph_u64 M8, M9, MA, MB, MC, MD, ME, MF;
  141. sph_u64 V0, V1, V2, V3, V4, V5, V6, V7;
  142. sph_u64 V8, V9, VA, VB, VC, VD, VE, VF;
  143. M0 = DEC64BE(block + 0);
  144. M1 = DEC64BE(block + 8);
  145. M2 = DEC64BE(block + 16);
  146. M3 = DEC64BE(block + 24);
  147. M4 = DEC64BE(block + 32);
  148. M5 = DEC64BE(block + 40);
  149. M6 = DEC64BE(block + 48);
  150. M7 = DEC64BE(block + 56);
  151. M8 = DEC64BE(block + 64);
  152. M9 = DEC64BE(block + 72);
  153. M9 &= 0xFFFFFFFF00000000;
  154. M9 ^= SWAP4(gid);
  155. MA = 0x8000000000000000;
  156. MB = 0;
  157. MC = 0;
  158. MD = 1;
  159. ME = 0;
  160. MF = 0x280;
  161.  
  162. COMPRESS64;
  163.  
  164. hash.h8[0] = H0;
  165. hash.h8[1] = H1;
  166. hash.h8[2] = H2;
  167. hash.h8[3] = H3;
  168. hash.h8[4] = H4;
  169. hash.h8[5] = H5;
  170. hash.h8[6] = H6;
  171. hash.h8[7] = H7;
  172. }
  173.  
  174. // bmw
  175. sph_u64 BMW_H[16];
  176. for(unsigned u = 0; u < 16; u++)
  177. BMW_H[u] = BMW_IV512[u];
  178.  
  179. sph_u64 BMW_h1[16], BMW_h2[16];
  180. sph_u64 mv[16];
  181.  
  182. mv[ 0] = SWAP8(hash.h8[0]);
  183. mv[ 1] = SWAP8(hash.h8[1]);
  184. mv[ 2] = SWAP8(hash.h8[2]);
  185. mv[ 3] = SWAP8(hash.h8[3]);
  186. mv[ 4] = SWAP8(hash.h8[4]);
  187. mv[ 5] = SWAP8(hash.h8[5]);
  188. mv[ 6] = SWAP8(hash.h8[6]);
  189. mv[ 7] = SWAP8(hash.h8[7]);
  190. mv[ 8] = 0x80;
  191. mv[ 9] = 0;
  192. mv[10] = 0;
  193. mv[11] = 0;
  194. mv[12] = 0;
  195. mv[13] = 0;
  196. mv[14] = 0;
  197. mv[15] = 0x200;
  198. #define M(x) (mv[x])
  199. #define H(x) (BMW_H[x])
  200. #define dH(x) (BMW_h2[x])
  201.  
  202. FOLDb;
  203.  
  204. #undef M
  205. #undef H
  206. #undef dH
  207.  
  208. #define M(x) (BMW_h2[x])
  209. #define H(x) (final_b[x])
  210. #define dH(x) (BMW_h1[x])
  211.  
  212. FOLDb;
  213.  
  214. #undef M
  215. #undef H
  216. #undef dH
  217.  
  218. hash.h8[0] = SWAP8(BMW_h1[8]);
  219. hash.h8[1] = SWAP8(BMW_h1[9]);
  220. hash.h8[2] = SWAP8(BMW_h1[10]);
  221. hash.h8[3] = SWAP8(BMW_h1[11]);
  222. hash.h8[4] = SWAP8(BMW_h1[12]);
  223. hash.h8[5] = SWAP8(BMW_h1[13]);
  224. hash.h8[6] = SWAP8(BMW_h1[14]);
  225. hash.h8[7] = SWAP8(BMW_h1[15]);
  226.  
  227. // groestl
  228.  
  229. sph_u64 H[16];
  230. for (unsigned int u = 0; u < 15; u ++)
  231. H[u] = 0;
  232. #if USE_LE
  233. H[15] = ((sph_u64)(512 & 0xFF) << 56) | ((sph_u64)(512 & 0xFF00) << 40);
  234. #else
  235. H[15] = (sph_u64)512;
  236. #endif
  237.  
  238. sph_u64 g[16], m[16];
  239. m[0] = DEC64E(hash.h8[0]);
  240. m[1] = DEC64E(hash.h8[1]);
  241. m[2] = DEC64E(hash.h8[2]);
  242. m[3] = DEC64E(hash.h8[3]);
  243. m[4] = DEC64E(hash.h8[4]);
  244. m[5] = DEC64E(hash.h8[5]);
  245. m[6] = DEC64E(hash.h8[6]);
  246. m[7] = DEC64E(hash.h8[7]);
  247. for (unsigned int u = 0; u < 16; u ++)
  248. g[u] = m[u] ^ H[u];
  249. m[8] = 0x80; g[8] = m[8] ^ H[8];
  250. m[9] = 0; g[9] = m[9] ^ H[9];
  251. m[10] = 0; g[10] = m[10] ^ H[10];
  252. m[11] = 0; g[11] = m[11] ^ H[11];
  253. m[12] = 0; g[12] = m[12] ^ H[12];
  254. m[13] = 0; g[13] = m[13] ^ H[13];
  255. m[14] = 0; g[14] = m[14] ^ H[14];
  256. m[15] = 0x100000000000000; g[15] = m[15] ^ H[15];
  257. PERM_BIG_P(g);
  258. PERM_BIG_Q(m);
  259. for (unsigned int u = 0; u < 16; u ++)
  260. H[u] ^= g[u] ^ m[u];
  261. sph_u64 xH[16];
  262. for (unsigned int u = 0; u < 16; u ++)
  263. xH[u] = H[u];
  264. PERM_BIG_P(xH);
  265. for (unsigned int u = 0; u < 16; u ++)
  266. H[u] ^= xH[u];
  267. for (unsigned int u = 0; u < 8; u ++)
  268. hash.h8[u] = DEC64E(H[u + 8]);
  269.  
  270. // skein
  271.  
  272. sph_u64 h0 = SPH_C64(0x4903ADFF749C51CE), h1 = SPH_C64(0x0D95DE399746DF03), h2 = SPH_C64(0x8FD1934127C79BCE), h3 = SPH_C64(0x9A255629FF352CB1), h4 = SPH_C64(0x5DB62599DF6CA7B0), h5 = SPH_C64(0xEABE394CA9D5C3F4), h6 = SPH_C64(0x991112C71A75B523), h7 = SPH_C64(0xAE18A40B660FCC33);
  273. sph_u64 m0, m1, m2, m3, m4, m5, m6, m7;
  274. sph_u64 bcount = 0;
  275.  
  276. m0 = SWAP8(hash.h8[0]);
  277. m1 = SWAP8(hash.h8[1]);
  278. m2 = SWAP8(hash.h8[2]);
  279. m3 = SWAP8(hash.h8[3]);
  280. m4 = SWAP8(hash.h8[4]);
  281. m5 = SWAP8(hash.h8[5]);
  282. m6 = SWAP8(hash.h8[6]);
  283. m7 = SWAP8(hash.h8[7]);
  284. UBI_BIG(480, 64);
  285. bcount = 0;
  286. m0 = m1 = m2 = m3 = m4 = m5 = m6 = m7 = 0;
  287. UBI_BIG(510, 8);
  288. hash.h8[0] = SWAP8(h0);
  289. hash.h8[1] = SWAP8(h1);
  290. hash.h8[2] = SWAP8(h2);
  291. hash.h8[3] = SWAP8(h3);
  292. hash.h8[4] = SWAP8(h4);
  293. hash.h8[5] = SWAP8(h5);
  294. hash.h8[6] = SWAP8(h6);
  295. hash.h8[7] = SWAP8(h7);
  296.  
  297. // jh
  298.  
  299. sph_u64 h0h = C64e(0x6fd14b963e00aa17), h0l = C64e(0x636a2e057a15d543), h1h = C64e(0x8a225e8d0c97ef0b), h1l = C64e(0xe9341259f2b3c361), h2h = C64e(0x891da0c1536f801e), h2l = C64e(0x2aa9056bea2b6d80), h3h = C64e(0x588eccdb2075baa6), h3l = C64e(0xa90f3a76baf83bf7);
  300. sph_u64 h4h = C64e(0x0169e60541e34a69), h4l = C64e(0x46b58a8e2e6fe65a), h5h = C64e(0x1047a7d0c1843c24), h5l = C64e(0x3b6e71b12d5ac199), h6h = C64e(0xcf57f6ec9db1f856), h6l = C64e(0xa706887c5716b156), h7h = C64e(0xe3c2fcdfe68517fb), h7l = C64e(0x545a4678cc8cdd4b);
  301. sph_u64 tmp;
  302.  
  303. for(int i = 0; i < 2; i++)
  304. {
  305. if (i == 0) {
  306. h0h ^= DEC64E(hash.h8[0]);
  307. h0l ^= DEC64E(hash.h8[1]);
  308. h1h ^= DEC64E(hash.h8[2]);
  309. h1l ^= DEC64E(hash.h8[3]);
  310. h2h ^= DEC64E(hash.h8[4]);
  311. h2l ^= DEC64E(hash.h8[5]);
  312. h3h ^= DEC64E(hash.h8[6]);
  313. h3l ^= DEC64E(hash.h8[7]);
  314. } else if(i == 1) {
  315. h4h ^= DEC64E(hash.h8[0]);
  316. h4l ^= DEC64E(hash.h8[1]);
  317. h5h ^= DEC64E(hash.h8[2]);
  318. h5l ^= DEC64E(hash.h8[3]);
  319. h6h ^= DEC64E(hash.h8[4]);
  320. h6l ^= DEC64E(hash.h8[5]);
  321. h7h ^= DEC64E(hash.h8[6]);
  322. h7l ^= DEC64E(hash.h8[7]);
  323.  
  324. h0h ^= 0x80;
  325. h3l ^= 0x2000000000000;
  326. }
  327. E8;
  328. }
  329. h4h ^= 0x80;
  330. h7l ^= 0x2000000000000;
  331.  
  332. hash.h8[0] = DEC64E(h4h);
  333. hash.h8[1] = DEC64E(h4l);
  334. hash.h8[2] = DEC64E(h5h);
  335. hash.h8[3] = DEC64E(h5l);
  336. hash.h8[4] = DEC64E(h6h);
  337. hash.h8[5] = DEC64E(h6l);
  338. hash.h8[6] = DEC64E(h7h);
  339. hash.h8[7] = DEC64E(h7l);
  340.  
  341. // keccak
  342.  
  343. sph_u64 a00 = 0, a01 = 0, a02 = 0, a03 = 0, a04 = 0;
  344. sph_u64 a10 = 0, a11 = 0, a12 = 0, a13 = 0, a14 = 0;
  345. sph_u64 a20 = 0, a21 = 0, a22 = 0, a23 = 0, a24 = 0;
  346. sph_u64 a30 = 0, a31 = 0, a32 = 0, a33 = 0, a34 = 0;
  347. sph_u64 a40 = 0, a41 = 0, a42 = 0, a43 = 0, a44 = 0;
  348.  
  349. a10 = SPH_C64(0xFFFFFFFFFFFFFFFF);
  350. a20 = SPH_C64(0xFFFFFFFFFFFFFFFF);
  351. a31 = SPH_C64(0xFFFFFFFFFFFFFFFF);
  352. a22 = SPH_C64(0xFFFFFFFFFFFFFFFF);
  353. a23 = SPH_C64(0xFFFFFFFFFFFFFFFF);
  354. a04 = SPH_C64(0xFFFFFFFFFFFFFFFF);
  355.  
  356. a00 ^= SWAP8(hash.h8[0]);
  357. a10 ^= SWAP8(hash.h8[1]);
  358. a20 ^= SWAP8(hash.h8[2]);
  359. a30 ^= SWAP8(hash.h8[3]);
  360. a40 ^= SWAP8(hash.h8[4]);
  361. a01 ^= SWAP8(hash.h8[5]);
  362. a11 ^= SWAP8(hash.h8[6]);
  363. a21 ^= SWAP8(hash.h8[7]);
  364. a31 ^= 0x8000000000000001;
  365. KECCAK_F_1600;
  366. // Finalize the "lane complement"
  367. a10 = ~a10;
  368. a20 = ~a20;
  369.  
  370. hash.h8[0] = SWAP8(a00);
  371. hash.h8[1] = SWAP8(a10);
  372. hash.h8[2] = SWAP8(a20);
  373. hash.h8[3] = SWAP8(a30);
  374. hash.h8[4] = SWAP8(a40);
  375. hash.h8[5] = SWAP8(a01);
  376. hash.h8[6] = SWAP8(a11);
  377. hash.h8[7] = SWAP8(a21);
  378.  
  379. // luffa
  380.  
  381. sph_u32 V00 = SPH_C32(0x6d251e69), V01 = SPH_C32(0x44b051e0), V02 = SPH_C32(0x4eaa6fb4), V03 = SPH_C32(0xdbf78465), V04 = SPH_C32(0x6e292011), V05 = SPH_C32(0x90152df4), V06 = SPH_C32(0xee058139), V07 = SPH_C32(0xdef610bb);
  382. sph_u32 V10 = SPH_C32(0xc3b44b95), V11 = SPH_C32(0xd9d2f256), V12 = SPH_C32(0x70eee9a0), V13 = SPH_C32(0xde099fa3), V14 = SPH_C32(0x5d9b0557), V15 = SPH_C32(0x8fc944b3), V16 = SPH_C32(0xcf1ccf0e), V17 = SPH_C32(0x746cd581);
  383. sph_u32 V20 = SPH_C32(0xf7efc89d), V21 = SPH_C32(0x5dba5781), V22 = SPH_C32(0x04016ce5), V23 = SPH_C32(0xad659c05), V24 = SPH_C32(0x0306194f), V25 = SPH_C32(0x666d1836), V26 = SPH_C32(0x24aa230a), V27 = SPH_C32(0x8b264ae7);
  384. sph_u32 V30 = SPH_C32(0x858075d5), V31 = SPH_C32(0x36d79cce), V32 = SPH_C32(0xe571f7d7), V33 = SPH_C32(0x204b1f67), V34 = SPH_C32(0x35870c6a), V35 = SPH_C32(0x57e9e923), V36 = SPH_C32(0x14bcb808), V37 = SPH_C32(0x7cde72ce);
  385. sph_u32 V40 = SPH_C32(0x6c68e9be), V41 = SPH_C32(0x5ec41e22), V42 = SPH_C32(0xc825b7c7), V43 = SPH_C32(0xaffb4363), V44 = SPH_C32(0xf5df3999), V45 = SPH_C32(0x0fc688f1), V46 = SPH_C32(0xb07224cc), V47 = SPH_C32(0x03e86cea);
  386.  
  387. DECL_TMP8(M);
  388.  
  389. M0 = hash.h4[1];
  390. M1 = hash.h4[0];
  391. M2 = hash.h4[3];
  392. M3 = hash.h4[2];
  393. M4 = hash.h4[5];
  394. M5 = hash.h4[4];
  395. M6 = hash.h4[7];
  396. M7 = hash.h4[6];
  397.  
  398. for(uint i = 0; i < 5; i++)
  399. {
  400. MI5;
  401. LUFFA_P5;
  402.  
  403. if(i == 0) {
  404. M0 = hash.h4[9];
  405. M1 = hash.h4[8];
  406. M2 = hash.h4[11];
  407. M3 = hash.h4[10];
  408. M4 = hash.h4[13];
  409. M5 = hash.h4[12];
  410. M6 = hash.h4[15];
  411. M7 = hash.h4[14];
  412. } else if(i == 1) {
  413. M0 = 0x80000000;
  414. M1 = M2 = M3 = M4 = M5 = M6 = M7 = 0;
  415. } else if(i == 2) {
  416. M0 = M1 = M2 = M3 = M4 = M5 = M6 = M7 = 0;
  417. } else if(i == 3) {
  418. hash.h4[1] = V00 ^ V10 ^ V20 ^ V30 ^ V40;
  419. hash.h4[0] = V01 ^ V11 ^ V21 ^ V31 ^ V41;
  420. hash.h4[3] = V02 ^ V12 ^ V22 ^ V32 ^ V42;
  421. hash.h4[2] = V03 ^ V13 ^ V23 ^ V33 ^ V43;
  422. hash.h4[5] = V04 ^ V14 ^ V24 ^ V34 ^ V44;
  423. hash.h4[4] = V05 ^ V15 ^ V25 ^ V35 ^ V45;
  424. hash.h4[7] = V06 ^ V16 ^ V26 ^ V36 ^ V46;
  425. hash.h4[6] = V07 ^ V17 ^ V27 ^ V37 ^ V47;
  426. }
  427. }
  428. hash.h4[9] = V00 ^ V10 ^ V20 ^ V30 ^ V40;
  429. hash.h4[8] = V01 ^ V11 ^ V21 ^ V31 ^ V41;
  430. hash.h4[11] = V02 ^ V12 ^ V22 ^ V32 ^ V42;
  431. hash.h4[10] = V03 ^ V13 ^ V23 ^ V33 ^ V43;
  432. hash.h4[13] = V04 ^ V14 ^ V24 ^ V34 ^ V44;
  433. hash.h4[12] = V05 ^ V15 ^ V25 ^ V35 ^ V45;
  434. hash.h4[15] = V06 ^ V16 ^ V26 ^ V36 ^ V46;
  435. hash.h4[14] = V07 ^ V17 ^ V27 ^ V37 ^ V47;
  436.  
  437. // cubehash.h1
  438.  
  439. sph_u32 x0 = SPH_C32(0x2AEA2A61), x1 = SPH_C32(0x50F494D4), x2 = SPH_C32(0x2D538B8B), x3 = SPH_C32(0x4167D83E);
  440. sph_u32 x4 = SPH_C32(0x3FEE2313), x5 = SPH_C32(0xC701CF8C), x6 = SPH_C32(0xCC39968E), x7 = SPH_C32(0x50AC5695);
  441. sph_u32 x8 = SPH_C32(0x4D42C787), x9 = SPH_C32(0xA647A8B3), xa = SPH_C32(0x97CF0BEF), xb = SPH_C32(0x825B4537);
  442. sph_u32 xc = SPH_C32(0xEEF864D2), xd = SPH_C32(0xF22090C4), xe = SPH_C32(0xD0E5CD33), xf = SPH_C32(0xA23911AE);
  443. sph_u32 xg = SPH_C32(0xFCD398D9), xh = SPH_C32(0x148FE485), xi = SPH_C32(0x1B017BEF), xj = SPH_C32(0xB6444532);
  444. sph_u32 xk = SPH_C32(0x6A536159), xl = SPH_C32(0x2FF5781C), xm = SPH_C32(0x91FA7934), xn = SPH_C32(0x0DBADEA9);
  445. sph_u32 xo = SPH_C32(0xD65C8A2B), xp = SPH_C32(0xA5A70E75), xq = SPH_C32(0xB1C62456), xr = SPH_C32(0xBC796576);
  446. sph_u32 xs = SPH_C32(0x1921C8F7), xt = SPH_C32(0xE7989AF1), xu = SPH_C32(0x7795D246), xv = SPH_C32(0xD43E3B44);
  447.  
  448. x0 ^= SWAP4(hash.h4[1]);
  449. x1 ^= SWAP4(hash.h4[0]);
  450. x2 ^= SWAP4(hash.h4[3]);
  451. x3 ^= SWAP4(hash.h4[2]);
  452. x4 ^= SWAP4(hash.h4[5]);
  453. x5 ^= SWAP4(hash.h4[4]);
  454. x6 ^= SWAP4(hash.h4[7]);
  455. x7 ^= SWAP4(hash.h4[6]);
  456.  
  457. for (int i = 0; i < 13; i ++) {
  458. SIXTEEN_ROUNDS;
  459.  
  460. if (i == 0) {
  461. x0 ^= SWAP4(hash.h4[9]);
  462. x1 ^= SWAP4(hash.h4[8]);
  463. x2 ^= SWAP4(hash.h4[11]);
  464. x3 ^= SWAP4(hash.h4[10]);
  465. x4 ^= SWAP4(hash.h4[13]);
  466. x5 ^= SWAP4(hash.h4[12]);
  467. x6 ^= SWAP4(hash.h4[15]);
  468. x7 ^= SWAP4(hash.h4[14]);
  469. } else if(i == 1) {
  470. x0 ^= 0x80;
  471. } else if (i == 2) {
  472. xv ^= SPH_C32(1);
  473. }
  474. }
  475.  
  476. hash.h4[0] = x0;
  477. hash.h4[1] = x1;
  478. hash.h4[2] = x2;
  479. hash.h4[3] = x3;
  480. hash.h4[4] = x4;
  481. hash.h4[5] = x5;
  482. hash.h4[6] = x6;
  483. hash.h4[7] = x7;
  484. hash.h4[8] = x8;
  485. hash.h4[9] = x9;
  486. hash.h4[10] = xa;
  487. hash.h4[11] = xb;
  488. hash.h4[12] = xc;
  489. hash.h4[13] = xd;
  490. hash.h4[14] = xe;
  491. hash.h4[15] = xf;
  492.  
  493. // shavite
  494. {
  495. // IV
  496. sph_u32 h0 = SPH_C32(0x72FCCDD8), h1 = SPH_C32(0x79CA4727), h2 = SPH_C32(0x128A077B), h3 = SPH_C32(0x40D55AEC);
  497. sph_u32 h4 = SPH_C32(0xD1901A06), h5 = SPH_C32(0x430AE307), h6 = SPH_C32(0xB29F5CD1), h7 = SPH_C32(0xDF07FBFC);
  498. sph_u32 h8 = SPH_C32(0x8E45D73D), h9 = SPH_C32(0x681AB538), hA = SPH_C32(0xBDE86578), hB = SPH_C32(0xDD577E47);
  499. sph_u32 hC = SPH_C32(0xE275EADE), hD = SPH_C32(0x502D9FCD), hE = SPH_C32(0xB9357178), hF = SPH_C32(0x022A4B9A);
  500.  
  501. // state
  502. sph_u32 rk00, rk01, rk02, rk03, rk04, rk05, rk06, rk07;
  503. sph_u32 rk08, rk09, rk0A, rk0B, rk0C, rk0D, rk0E, rk0F;
  504. sph_u32 rk10, rk11, rk12, rk13, rk14, rk15, rk16, rk17;
  505. sph_u32 rk18, rk19, rk1A, rk1B, rk1C, rk1D, rk1E, rk1F;
  506.  
  507. sph_u32 sc_count0 = (64 << 3), sc_count1 = 0, sc_count2 = 0, sc_count3 = 0;
  508.  
  509. rk00 = hash.h4[0];
  510. rk01 = hash.h4[1];
  511. rk02 = hash.h4[2];
  512. rk03 = hash.h4[3];
  513. rk04 = hash.h4[4];
  514. rk05 = hash.h4[5];
  515. rk06 = hash.h4[6];
  516. rk07 = hash.h4[7];
  517. rk08 = hash.h4[8];
  518. rk09 = hash.h4[9];
  519. rk0A = hash.h4[10];
  520. rk0B = hash.h4[11];
  521. rk0C = hash.h4[12];
  522. rk0D = hash.h4[13];
  523. rk0E = hash.h4[14];
  524. rk0F = hash.h4[15];
  525. rk10 = 0x80;
  526. rk11 = rk12 = rk13 = rk14 = rk15 = rk16 = rk17 = rk18 = rk19 = rk1A = 0;
  527. rk1B = 0x2000000;
  528. rk1C = rk1D = rk1E = 0;
  529. rk1F = 0x2000000;
  530.  
  531. c512(buf);
  532.  
  533. hash.h4[0] = h0;
  534. hash.h4[1] = h1;
  535. hash.h4[2] = h2;
  536. hash.h4[3] = h3;
  537. hash.h4[4] = h4;
  538. hash.h4[5] = h5;
  539. hash.h4[6] = h6;
  540. hash.h4[7] = h7;
  541. hash.h4[8] = h8;
  542. hash.h4[9] = h9;
  543. hash.h4[10] = hA;
  544. hash.h4[11] = hB;
  545. hash.h4[12] = hC;
  546. hash.h4[13] = hD;
  547. hash.h4[14] = hE;
  548. hash.h4[15] = hF;
  549. }
  550.  
  551. // simd
  552. {
  553. s32 q[256];
  554. unsigned char x[128];
  555. for(unsigned int i = 0; i < 64; i++)
  556. x[i] = hash.h1[i];
  557. for(unsigned int i = 64; i < 128; i++)
  558. x[i] = 0;
  559.  
  560. u32 A0 = C32(0x0BA16B95), A1 = C32(0x72F999AD), A2 = C32(0x9FECC2AE), A3 = C32(0xBA3264FC), A4 = C32(0x5E894929), A5 = C32(0x8E9F30E5), A6 = C32(0x2F1DAA37), A7 = C32(0xF0F2C558);
  561. u32 B0 = C32(0xAC506643), B1 = C32(0xA90635A5), B2 = C32(0xE25B878B), B3 = C32(0xAAB7878F), B4 = C32(0x88817F7A), B5 = C32(0x0A02892B), B6 = C32(0x559A7550), B7 = C32(0x598F657E);
  562. u32 C0 = C32(0x7EEF60A1), C1 = C32(0x6B70E3E8), C2 = C32(0x9C1714D1), C3 = C32(0xB958E2A8), C4 = C32(0xAB02675E), C5 = C32(0xED1C014F), C6 = C32(0xCD8D65BB), C7 = C32(0xFDB7A257);
  563. u32 D0 = C32(0x09254899), D1 = C32(0xD699C7BC), D2 = C32(0x9019B6DC), D3 = C32(0x2B9022E4), D4 = C32(0x8FA14956), D5 = C32(0x21BF9BD3), D6 = C32(0xB94D0943), D7 = C32(0x6FFDDC22);
  564.  
  565. FFT256(0, 1, 0, ll1);
  566. for (int i = 0; i < 256; i ++) {
  567. s32 tq;
  568.  
  569. tq = q[i] + yoff_b_n[i];
  570. tq = REDS2(tq);
  571. tq = REDS1(tq);
  572. tq = REDS1(tq);
  573. q[i] = (tq <= 128 ? tq : tq - 257);
  574. }
  575.  
  576. A0 ^= hash.h4[0];
  577. A1 ^= hash.h4[1];
  578. A2 ^= hash.h4[2];
  579. A3 ^= hash.h4[3];
  580. A4 ^= hash.h4[4];
  581. A5 ^= hash.h4[5];
  582. A6 ^= hash.h4[6];
  583. A7 ^= hash.h4[7];
  584. B0 ^= hash.h4[8];
  585. B1 ^= hash.h4[9];
  586. B2 ^= hash.h4[10];
  587. B3 ^= hash.h4[11];
  588. B4 ^= hash.h4[12];
  589. B5 ^= hash.h4[13];
  590. B6 ^= hash.h4[14];
  591. B7 ^= hash.h4[15];
  592.  
  593. ONE_ROUND_BIG(0_, 0, 3, 23, 17, 27);
  594. ONE_ROUND_BIG(1_, 1, 28, 19, 22, 7);
  595. ONE_ROUND_BIG(2_, 2, 29, 9, 15, 5);
  596. ONE_ROUND_BIG(3_, 3, 4, 13, 10, 25);
  597.  
  598. STEP_BIG(
  599. C32(0x0BA16B95), C32(0x72F999AD), C32(0x9FECC2AE), C32(0xBA3264FC),
  600. C32(0x5E894929), C32(0x8E9F30E5), C32(0x2F1DAA37), C32(0xF0F2C558),
  601. IF, 4, 13, PP8_4_);
  602. STEP_BIG(
  603. C32(0xAC506643), C32(0xA90635A5), C32(0xE25B878B), C32(0xAAB7878F),
  604. C32(0x88817F7A), C32(0x0A02892B), C32(0x559A7550), C32(0x598F657E),
  605. IF, 13, 10, PP8_5_);
  606. STEP_BIG(
  607. C32(0x7EEF60A1), C32(0x6B70E3E8), C32(0x9C1714D1), C32(0xB958E2A8),
  608. C32(0xAB02675E), C32(0xED1C014F), C32(0xCD8D65BB), C32(0xFDB7A257),
  609. IF, 10, 25, PP8_6_);
  610. STEP_BIG(
  611. C32(0x09254899), C32(0xD699C7BC), C32(0x9019B6DC), C32(0x2B9022E4),
  612. C32(0x8FA14956), C32(0x21BF9BD3), C32(0xB94D0943), C32(0x6FFDDC22),
  613. IF, 25, 4, PP8_0_);
  614.  
  615. u32 COPY_A0 = A0, COPY_A1 = A1, COPY_A2 = A2, COPY_A3 = A3, COPY_A4 = A4, COPY_A5 = A5, COPY_A6 = A6, COPY_A7 = A7;
  616. u32 COPY_B0 = B0, COPY_B1 = B1, COPY_B2 = B2, COPY_B3 = B3, COPY_B4 = B4, COPY_B5 = B5, COPY_B6 = B6, COPY_B7 = B7;
  617. u32 COPY_C0 = C0, COPY_C1 = C1, COPY_C2 = C2, COPY_C3 = C3, COPY_C4 = C4, COPY_C5 = C5, COPY_C6 = C6, COPY_C7 = C7;
  618. u32 COPY_D0 = D0, COPY_D1 = D1, COPY_D2 = D2, COPY_D3 = D3, COPY_D4 = D4, COPY_D5 = D5, COPY_D6 = D6, COPY_D7 = D7;
  619.  
  620. #define q SIMD_Q
  621.  
  622. A0 ^= 0x200;
  623.  
  624. ONE_ROUND_BIG(0_, 0, 3, 23, 17, 27);
  625. ONE_ROUND_BIG(1_, 1, 28, 19, 22, 7);
  626. ONE_ROUND_BIG(2_, 2, 29, 9, 15, 5);
  627. ONE_ROUND_BIG(3_, 3, 4, 13, 10, 25);
  628. STEP_BIG(
  629. COPY_A0, COPY_A1, COPY_A2, COPY_A3,
  630. COPY_A4, COPY_A5, COPY_A6, COPY_A7,
  631. IF, 4, 13, PP8_4_);
  632. STEP_BIG(
  633. COPY_B0, COPY_B1, COPY_B2, COPY_B3,
  634. COPY_B4, COPY_B5, COPY_B6, COPY_B7,
  635. IF, 13, 10, PP8_5_);
  636. STEP_BIG(
  637. COPY_C0, COPY_C1, COPY_C2, COPY_C3,
  638. COPY_C4, COPY_C5, COPY_C6, COPY_C7,
  639. IF, 10, 25, PP8_6_);
  640. STEP_BIG(
  641. COPY_D0, COPY_D1, COPY_D2, COPY_D3,
  642. COPY_D4, COPY_D5, COPY_D6, COPY_D7,
  643. IF, 25, 4, PP8_0_);
  644. #undef q
  645.  
  646. hash.h4[0] = A0;
  647. hash.h4[1] = A1;
  648. hash.h4[2] = A2;
  649. hash.h4[3] = A3;
  650. hash.h4[4] = A4;
  651. hash.h4[5] = A5;
  652. hash.h4[6] = A6;
  653. hash.h4[7] = A7;
  654. hash.h4[8] = B0;
  655. hash.h4[9] = B1;
  656. hash.h4[10] = B2;
  657. hash.h4[11] = B3;
  658. hash.h4[12] = B4;
  659. hash.h4[13] = B5;
  660. hash.h4[14] = B6;
  661. hash.h4[15] = B7;
  662. }
  663.  
  664. // echo
  665. sph_u64 W00, W01, W10, W11, W20, W21, W30, W31, W40, W41, W50, W51, W60, W61, W70, W71, W80, W81, W90, W91, WA0, WA1, WB0, WB1, WC0, WC1, WD0, WD1, WE0, WE1, WF0, WF1;
  666. sph_u64 Vb00, Vb01, Vb10, Vb11, Vb20, Vb21, Vb30, Vb31, Vb40, Vb41, Vb50, Vb51, Vb60, Vb61, Vb70, Vb71;
  667. Vb00 = Vb10 = Vb20 = Vb30 = Vb40 = Vb50 = Vb60 = Vb70 = 512UL;
  668. Vb01 = Vb11 = Vb21 = Vb31 = Vb41 = Vb51 = Vb61 = Vb71 = 0;
  669.  
  670. sph_u32 K0 = 512;
  671. sph_u32 K1 = 0;
  672. sph_u32 K2 = 0;
  673. sph_u32 K3 = 0;
  674.  
  675. W00 = Vb00;
  676. W01 = Vb01;
  677. W10 = Vb10;
  678. W11 = Vb11;
  679. W20 = Vb20;
  680. W21 = Vb21;
  681. W30 = Vb30;
  682. W31 = Vb31;
  683. W40 = Vb40;
  684. W41 = Vb41;
  685. W50 = Vb50;
  686. W51 = Vb51;
  687. W60 = Vb60;
  688. W61 = Vb61;
  689. W70 = Vb70;
  690. W71 = Vb71;
  691. W80 = hash.h8[0];
  692. W81 = hash.h8[1];
  693. W90 = hash.h8[2];
  694. W91 = hash.h8[3];
  695. WA0 = hash.h8[4];
  696. WA1 = hash.h8[5];
  697. WB0 = hash.h8[6];
  698. WB1 = hash.h8[7];
  699. WC0 = 0x80;
  700. WC1 = 0;
  701. WD0 = 0;
  702. WD1 = 0;
  703. WE0 = 0;
  704. WE1 = 0x200000000000000;
  705. WF0 = 0x200;
  706. WF1 = 0;
  707.  
  708. for (unsigned u = 0; u < 10; u ++) {
  709. BIG_ROUND;
  710. }
  711.  
  712. Vb00 ^= hash.h8[0] ^ W00 ^ W80;
  713. Vb01 ^= hash.h8[1] ^ W01 ^ W81;
  714. Vb10 ^= hash.h8[2] ^ W10 ^ W90;
  715. Vb11 ^= hash.h8[3] ^ W11 ^ W91;
  716. Vb20 ^= hash.h8[4] ^ W20 ^ WA0;
  717. Vb21 ^= hash.h8[5] ^ W21 ^ WA1;
  718. Vb30 ^= hash.h8[6] ^ W30 ^ WB0;
  719. Vb31 ^= hash.h8[7] ^ W31 ^ WB1;
  720.  
  721. hash.h8[0] = Vb00;
  722. hash.h8[1] = Vb01;
  723. hash.h8[2] = Vb10;
  724. hash.h8[3] = Vb11;
  725. hash.h8[4] = Vb20;
  726. hash.h8[5] = Vb21;
  727. hash.h8[6] = Vb30;
  728. hash.h8[7] = Vb31;
  729.  
  730. {
  731. sph_u32 c0 = HAMSI_IV512[0], c1 = HAMSI_IV512[1], c2 = HAMSI_IV512[2], c3 = HAMSI_IV512[3];
  732. sph_u32 c4 = HAMSI_IV512[4], c5 = HAMSI_IV512[5], c6 = HAMSI_IV512[6], c7 = HAMSI_IV512[7];
  733. sph_u32 c8 = HAMSI_IV512[8], c9 = HAMSI_IV512[9], cA = HAMSI_IV512[10], cB = HAMSI_IV512[11];
  734. sph_u32 cC = HAMSI_IV512[12], cD = HAMSI_IV512[13], cE = HAMSI_IV512[14], cF = HAMSI_IV512[15];
  735. sph_u32 m0, m1, m2, m3, m4, m5, m6, m7;
  736. sph_u32 m8, m9, mA, mB, mC, mD, mE, mF;
  737. sph_u32 h[16] = { c0, c1, c2, c3, c4, c5, c6, c7, c8, c9, cA, cB, cC, cD, cE, cF };
  738.  
  739. #define buf(u) hash.h1[i + u]
  740. for(int i = 0; i < 64; i += 8) {
  741. INPUT_BIG;
  742. P_BIG;
  743. T_BIG;
  744. }
  745. #undef buf
  746. #define buf(u) (u == 0 ? 0x80 : 0)
  747. INPUT_BIG;
  748. P_BIG;
  749. T_BIG;
  750. #undef buf
  751. #define buf(u) (u == 6 ? 2 : 0)
  752. INPUT_BIG;
  753. PF_BIG;
  754. T_BIG;
  755.  
  756. for (unsigned u = 0; u < 16; u ++)
  757. hash.h4[u] = h[u];
  758. }
  759.  
  760. {
  761. // fugue
  762. sph_u32 S00, S01, S02, S03, S04, S05, S06, S07, S08, S09;
  763. sph_u32 S10, S11, S12, S13, S14, S15, S16, S17, S18, S19;
  764. sph_u32 S20, S21, S22, S23, S24, S25, S26, S27, S28, S29;
  765. sph_u32 S30, S31, S32, S33, S34, S35;
  766.  
  767. ulong fc_bit_count = (sph_u64) 64 << 3;
  768.  
  769. S00 = S01 = S02 = S03 = S04 = S05 = S06 = S07 = S08 = S09 = S10 = S11 = S12 = S13 = S14 = S15 = S16 = S17 = S18 = S19 = 0;
  770. S20 = SPH_C32(0x8807a57e); S21 = SPH_C32(0xe616af75); S22 = SPH_C32(0xc5d3e4db); S23 = SPH_C32(0xac9ab027);
  771. S24 = SPH_C32(0xd915f117); S25 = SPH_C32(0xb6eecc54); S26 = SPH_C32(0x06e8020b); S27 = SPH_C32(0x4a92efd1);
  772. S28 = SPH_C32(0xaac6e2c9); S29 = SPH_C32(0xddb21398); S30 = SPH_C32(0xcae65838); S31 = SPH_C32(0x437f203f);
  773. S32 = SPH_C32(0x25ea78e7); S33 = SPH_C32(0x951fddd6); S34 = SPH_C32(0xda6ed11d); S35 = SPH_C32(0xe13e3567);
  774.  
  775. FUGUE512_3((hash.h4[0x0]), (hash.h4[0x1]), (hash.h4[0x2]));
  776. FUGUE512_3((hash.h4[0x3]), (hash.h4[0x4]), (hash.h4[0x5]));
  777. FUGUE512_3((hash.h4[0x6]), (hash.h4[0x7]), (hash.h4[0x8]));
  778. FUGUE512_3((hash.h4[0x9]), (hash.h4[0xA]), (hash.h4[0xB]));
  779. FUGUE512_3((hash.h4[0xC]), (hash.h4[0xD]), (hash.h4[0xE]));
  780. FUGUE512_3((hash.h4[0xF]), as_uint2(fc_bit_count).y, as_uint2(fc_bit_count).x);
  781.  
  782. // apply round shift if necessary
  783. int i;
  784.  
  785. for (i = 0; i < 32; i ++) {
  786. ROR3;
  787. CMIX36(S00, S01, S02, S04, S05, S06, S18, S19, S20);
  788. SMIX(S00, S01, S02, S03);
  789. }
  790. for (i = 0; i < 13; i ++) {
  791. S04 ^= S00;
  792. S09 ^= S00;
  793. S18 ^= S00;
  794. S27 ^= S00;
  795. ROR9;
  796. SMIX(S00, S01, S02, S03);
  797. S04 ^= S00;
  798. S10 ^= S00;
  799. S18 ^= S00;
  800. S27 ^= S00;
  801. ROR9;
  802. SMIX(S00, S01, S02, S03);
  803. S04 ^= S00;
  804. S10 ^= S00;
  805. S19 ^= S00;
  806. S27 ^= S00;
  807. ROR9;
  808. SMIX(S00, S01, S02, S03);
  809. S04 ^= S00;
  810. S10 ^= S00;
  811. S19 ^= S00;
  812. S28 ^= S00;
  813. ROR8;
  814. SMIX(S00, S01, S02, S03);
  815. }
  816. S04 ^= S00;
  817. S09 ^= S00;
  818. S18 ^= S00;
  819. S27 ^= S00;
  820.  
  821. hash.h4[0] = SWAP4(S01);
  822. hash.h4[1] = SWAP4(S02);
  823. hash.h4[2] = SWAP4(S03);
  824. hash.h4[3] = SWAP4(S04);
  825. hash.h4[4] = SWAP4(S09);
  826. hash.h4[5] = SWAP4(S10);
  827. hash.h4[6] = SWAP4(S11);
  828. hash.h4[7] = SWAP4(S12);
  829. hash.h4[8] = SWAP4(S18);
  830. hash.h4[9] = SWAP4(S19);
  831. hash.h4[10] = SWAP4(S20);
  832. hash.h4[11] = SWAP4(S21);
  833. hash.h4[12] = SWAP4(S27);
  834. hash.h4[13] = SWAP4(S28);
  835. hash.h4[14] = SWAP4(S29);
  836. hash.h4[15] = SWAP4(S30);
  837. }
  838.  
  839. bool result = (hash.h8[3] <= target);
  840. if (result)
  841. output[output[0xFF]++] = SWAP4(gid);
  842. }
  843.  
  844. #endif // MARUCOIN_CL
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
Public Pastes
Advertisement
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy.  OK, I Understand
Not a member of Pastebin yet?
Sign Up, it unlocks many cool features!