forked from tpruvot/cpuminer-multi
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Signed-off-by: Tanguy Pruvot <[email protected]>
- Loading branch information
Showing
9 changed files
with
277 additions
and
1 deletion.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,256 @@ | ||
| /** | ||
| * X11EVO algo implementation | ||
| * | ||
| * Trivial implementation by tpruvot@github May 2016 | ||
| */ | ||
| #include "miner.h" | ||
|
|
||
| #include <stdio.h> | ||
| #include <stdlib.h> | ||
| #include <string.h> | ||
|
|
||
| #include <sha3/sph_blake.h> | ||
| #include <sha3/sph_bmw.h> | ||
| #include <sha3/sph_groestl.h> | ||
| #include <sha3/sph_jh.h> | ||
| #include <sha3/sph_keccak.h> | ||
| #include <sha3/sph_skein.h> | ||
| #include <sha3/sph_luffa.h> | ||
| #include <sha3/sph_cubehash.h> | ||
| #include <sha3/sph_shavite.h> | ||
| #include <sha3/sph_simd.h> | ||
| #include <sha3/sph_echo.h> | ||
|
|
||
| enum Algo { | ||
| BLAKE = 0, | ||
| BMW, | ||
| GROESTL, | ||
| SKEIN, | ||
| JH, | ||
| KECCAK, | ||
| LUFFA, | ||
| CUBEHASH, | ||
| SHAVITE, | ||
| SIMD, | ||
| ECHO, | ||
| HASH_FUNC_COUNT | ||
| }; | ||
|
|
||
| static void swap8(uint8_t *a, uint8_t *b) | ||
| { | ||
| uint8_t t = *a; | ||
| *a = *b; | ||
| *b = t; | ||
| } | ||
|
|
||
| static void initPerm(uint8_t n[], int count) | ||
| { | ||
| for (int i = 0; i < count; i++) | ||
| n[i] = i; | ||
| } | ||
|
|
||
| static int nextPerm(uint8_t n[], int count) | ||
| { | ||
| int tail, i, j; | ||
|
|
||
| if (count <= 1) | ||
| return 0; | ||
|
|
||
| for (i = count - 1; i>0 && n[i - 1] >= n[i]; i--); | ||
| tail = i; | ||
|
|
||
| if (tail > 0) { | ||
| for (j = count - 1; j>tail && n[j] <= n[tail - 1]; j--); | ||
| swap8(&n[tail - 1], &n[j]); | ||
| } | ||
|
|
||
| for (i = tail, j = count - 1; i<j; i++, j--) | ||
| swap8(&n[i], &n[j]); | ||
|
|
||
| return (tail != 0); | ||
| } | ||
|
|
||
| static void getAlgoString(char *str, int seq) | ||
| { | ||
| uint8_t algoList[HASH_FUNC_COUNT]; | ||
| char *sptr; | ||
|
|
||
| initPerm(algoList, HASH_FUNC_COUNT); | ||
|
|
||
| for (int k = 0; k < seq; k++) { | ||
| nextPerm(algoList, HASH_FUNC_COUNT); | ||
| } | ||
|
|
||
| sptr = str; | ||
| for (int j = 0; j < HASH_FUNC_COUNT; j++) { | ||
| if (algoList[j] >= 10) | ||
| sprintf(sptr, "%c", 'A' + (algoList[j] - 10)); | ||
| else | ||
| sprintf(sptr, "%u", (uint32_t) algoList[j]); | ||
| sptr++; | ||
| } | ||
| *sptr = '\0'; | ||
| } | ||
|
|
||
| static __thread uint32_t s_ntime = 0; | ||
| static char hashOrder[HASH_FUNC_COUNT + 1] = { 0 }; | ||
| static int s_sequence = -1; | ||
|
|
||
| #define INITIAL_DATE 0x57254700 | ||
| static inline int getCurrentAlgoSeq(uint32_t current_time) | ||
| { | ||
| // change once per day | ||
| return (int) (current_time - INITIAL_DATE) / (60 * 60 * 24); | ||
| } | ||
|
|
||
| static void evo_twisted_code(uint32_t ntime, char *permstr) | ||
| { | ||
| int seq = getCurrentAlgoSeq(ntime); | ||
| if (s_sequence != seq) { | ||
| getAlgoString(permstr, seq); | ||
| s_sequence = seq; | ||
| } | ||
| } | ||
|
|
||
| void x11evo_hash(void *output, const void *input) | ||
| { | ||
| uint32_t hash[64/4]; | ||
| uint32_t len = 80; | ||
|
|
||
| sph_blake512_context ctx_blake; | ||
| sph_bmw512_context ctx_bmw; | ||
| sph_groestl512_context ctx_groestl; | ||
| sph_skein512_context ctx_skein; | ||
| sph_jh512_context ctx_jh; | ||
| sph_keccak512_context ctx_keccak; | ||
| sph_luffa512_context ctx_luffa1; | ||
| sph_cubehash512_context ctx_cubehash1; | ||
| sph_shavite512_context ctx_shavite1; | ||
| sph_simd512_context ctx_simd1; | ||
| sph_echo512_context ctx_echo1; | ||
|
|
||
| if (s_sequence == -1) { | ||
| uint32_t *data = (uint32_t*) input; | ||
| const uint32_t ntime = data[17]; | ||
| evo_twisted_code(ntime, hashOrder); | ||
| } | ||
|
|
||
| void *in = (void*) input; | ||
| int size = len; | ||
|
|
||
| const int hashes = (int) strlen(hashOrder); | ||
|
|
||
| for (int i = 0; i < hashes; i++) | ||
| { | ||
| const char elem = hashOrder[i]; | ||
| uint8_t algo = elem >= 'A' ? elem - 'A' + 10 : elem - '0'; | ||
|
|
||
| if (i > 0) { | ||
| in = (void*) hash; | ||
| size = 64; | ||
| } | ||
|
|
||
| switch (algo) { | ||
| case BLAKE: | ||
| sph_blake512_init(&ctx_blake); | ||
| sph_blake512 (&ctx_blake, in, size); | ||
| sph_blake512_close (&ctx_blake, hash); | ||
| break; | ||
| case BMW: | ||
| sph_bmw512_init(&ctx_bmw); | ||
| sph_bmw512 (&ctx_bmw, in, size); | ||
| sph_bmw512_close(&ctx_bmw, hash); | ||
| break; | ||
| case GROESTL: | ||
| sph_groestl512_init(&ctx_groestl); | ||
| sph_groestl512 (&ctx_groestl, in, size); | ||
| sph_groestl512_close(&ctx_groestl, hash); | ||
| break; | ||
| case SKEIN: | ||
| sph_skein512_init(&ctx_skein); | ||
| sph_skein512 (&ctx_skein, in, size); | ||
| sph_skein512_close (&ctx_skein, hash); | ||
| break; | ||
| case JH: | ||
| sph_jh512_init(&ctx_jh); | ||
| sph_jh512 (&ctx_jh, in, size); | ||
| sph_jh512_close(&ctx_jh, hash); | ||
| break; | ||
| case KECCAK: | ||
| sph_keccak512_init(&ctx_keccak); | ||
| sph_keccak512 (&ctx_keccak, in, size); | ||
| sph_keccak512_close(&ctx_keccak, hash); | ||
| break; | ||
| case LUFFA: | ||
| sph_luffa512_init (&ctx_luffa1); | ||
| sph_luffa512 (&ctx_luffa1, in, size); | ||
| sph_luffa512_close (&ctx_luffa1, hash); | ||
| break; | ||
| case CUBEHASH: | ||
| sph_cubehash512_init (&ctx_cubehash1); | ||
| sph_cubehash512 (&ctx_cubehash1, in, size); | ||
| sph_cubehash512_close(&ctx_cubehash1, hash); | ||
| break; | ||
| case SHAVITE: | ||
| sph_shavite512_init (&ctx_shavite1); | ||
| sph_shavite512 (&ctx_shavite1, in, size); | ||
| sph_shavite512_close(&ctx_shavite1, hash); | ||
| break; | ||
| case SIMD: | ||
| sph_simd512_init (&ctx_simd1); | ||
| sph_simd512 (&ctx_simd1, in, size); | ||
| sph_simd512_close(&ctx_simd1, hash); | ||
| break; | ||
| case ECHO: | ||
| sph_echo512_init (&ctx_echo1); | ||
| sph_echo512 (&ctx_echo1, in, size); | ||
| sph_echo512_close(&ctx_echo1, hash); | ||
| break; | ||
| } | ||
| } | ||
|
|
||
| memcpy(output, hash, 32); | ||
| } | ||
|
|
||
| int scanhash_x11evo(int thr_id, struct work *work, uint32_t max_nonce, uint64_t *hashes_done) | ||
| { | ||
| uint32_t _ALIGN(128) hash32[8]; | ||
| uint32_t _ALIGN(128) endiandata[20]; | ||
| uint32_t *pdata = work->data; | ||
| uint32_t *ptarget = work->target; | ||
| const uint32_t Htarg = ptarget[7]; | ||
| const uint32_t first_nonce = pdata[19]; | ||
| uint32_t nonce = first_nonce; | ||
| volatile uint8_t *restart = &(work_restart[thr_id].restart); | ||
|
|
||
| if (s_ntime != pdata[17] || s_sequence == -1) { | ||
| uint32_t ntime = swab32(pdata[17]); | ||
| evo_twisted_code(ntime, hashOrder); | ||
| s_ntime = ntime; | ||
| if (opt_debug) applog(LOG_DEBUG, "evo hash order %s (%08x)", hashOrder, ntime); | ||
| } | ||
|
|
||
| if (opt_benchmark) | ||
| ptarget[7] = 0x0cff; | ||
|
|
||
| for (int k=0; k < 19; k++) | ||
| be32enc(&endiandata[k], pdata[k]); | ||
|
|
||
| do { | ||
| be32enc(&endiandata[19], nonce); | ||
| x11evo_hash(hash32, endiandata); | ||
|
|
||
| if (hash32[7] <= Htarg && fulltest(hash32, ptarget)) { | ||
| work_set_target_ratio(work, hash32); | ||
| pdata[19] = nonce; | ||
| *hashes_done = pdata[19] - first_nonce; | ||
| return 1; | ||
| } | ||
| nonce++; | ||
|
|
||
| } while (nonce < max_nonce && !(*restart)); | ||
|
|
||
| pdata[19] = nonce; | ||
| *hashes_done = pdata[19] - first_nonce + 1; | ||
| return 0; | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters