CPUMiner with gostd algo
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 

252 lines
7.1 KiB

#include "cpuminer-config.h"
#include "miner.h"
#include <string.h>
#include <stdint.h>
#include "sph_blake.h"
#include "sph_bmw.h"
#include "sph_groestl.h"
#include "sph_jh.h"
#include "sph_keccak.h"
#include "sph_skein.h"
/* Move init out of loop, so init once externally, and then use one single memcpy with that bigger memory block */
typedef struct {
sph_blake512_context blake1, blake2;
sph_bmw512_context bmw1, bmw2;
sph_groestl512_context groestl1, groestl2;
sph_skein512_context skein1, skein2;
sph_jh512_context jh1, jh2;
sph_keccak512_context keccak1, keccak2;
} quarkhash_context_holder;
quarkhash_context_holder base_contexts;
void init_quarkhash_contexts()
{
sph_blake512_init(&base_contexts.blake1);
sph_bmw512_init(&base_contexts.bmw1);
sph_groestl512_init(&base_contexts.groestl1);
sph_skein512_init(&base_contexts.skein1);
sph_groestl512_init(&base_contexts.groestl2);
sph_jh512_init(&base_contexts.jh1);
sph_blake512_init(&base_contexts.blake2);
sph_bmw512_init(&base_contexts.bmw2);
sph_keccak512_init(&base_contexts.keccak1);
sph_skein512_init(&base_contexts.skein2);
sph_keccak512_init(&base_contexts.keccak2);
sph_jh512_init(&base_contexts.jh2);
}
static void quarkhash(void *state, const void *input)
{
// sph_blake512_context ctx_blake;
// sph_bmw512_context ctx_bmw;
// sph_groestl512_context ctx_groestl;
// sph_jh512_context ctx_jh;
// sph_keccak512_context ctx_keccak;
// sph_skein512_context ctx_skein;
// static unsigned char pblank[1];
quarkhash_context_holder ctx;
uint32_t mask = 8;
uint32_t zero = 0;
//these uint512 in the c++ source of the client are backed by an array of uint32
uint32_t hashA[16], hashB[16];
//do one memcopy to get fresh contexts, its faster even with a larger block then issuing 9 memcopies
memcpy(&ctx, &base_contexts, sizeof(base_contexts));
// sph_blake512_init(&ctx.blake1);
sph_blake512 (&ctx.blake1, input, 80);
sph_blake512_close (&ctx.blake1, hashA); //0
// sph_bmw512_init(&ctx.bmw1);
sph_bmw512 (&ctx.bmw1, hashA, 64); //0
sph_bmw512_close(&ctx.bmw1, hashB); //1
if ((hashB[0] & mask) != zero) //1
{
// sph_groestl512_init(&ctx.groestl1);
sph_groestl512 (&ctx.groestl1, hashB, 64); //1
sph_groestl512_close(&ctx.groestl1, hashA); //2
}
else
{
// sph_skein512_init(&ctx.skein1);
sph_skein512 (&ctx.skein1, hashB, 64); //1
sph_skein512_close(&ctx.skein1, hashA); //2
}
// sph_groestl512_init(&ctx.groestl2);
sph_groestl512 (&ctx.groestl2, hashA, 64); //2
sph_groestl512_close(&ctx.groestl2, hashB); //3
// sph_jh512_init(&ctx.jh1);
sph_jh512 (&ctx.jh1, hashB, 64); //3
sph_jh512_close(&ctx.jh1, hashA); //4
if ((hashA[0] & mask) != zero) //4
{
// sph_blake512_init(&ctx.blake2);
sph_blake512 (&ctx.blake2, hashA, 64); //
sph_blake512_close(&ctx.blake2, hashB); //5
}
else
{
// sph_bmw512_init(&ctx.bmw2);
sph_bmw512 (&ctx.bmw2, hashA, 64); //4
sph_bmw512_close(&ctx.bmw2, hashB); //5
}
// sph_keccak512_init(&ctx.keccak1);
sph_keccak512 (&ctx.keccak1, hashB, 64); //5
sph_keccak512_close(&ctx.keccak1, hashA); //6
// sph_skein512_init(&ctx.skein2);
sph_skein512 (&ctx.skein2, hashA, 64); //6
sph_skein512_close(&ctx.skein2, hashB); //7
if ((hashB[0] & mask) != zero) //7
{
// sph_keccak512_init(&ctx.keccak2);
sph_keccak512 (&ctx.keccak2, hashB, 64); //
sph_keccak512_close(&ctx.keccak2, hashA); //8
}
else
{
// sph_jh512_init(&ctx.jh2);
sph_jh512 (&ctx.jh2, hashB, 64); //7
sph_jh512_close(&ctx.jh2, hashA); //8
}
memcpy(state, hashA, 32);
/*
int ii;
printf("result: ");
for (ii=0; ii < 32; ii++)
{
printf ("%.2x",((uint8_t*)state)[ii]);
};
printf ("\n");
*/
}
int scanhash_quark(int thr_id, uint32_t *pdata, const uint32_t *ptarget,
uint32_t max_nonce, unsigned long *hashes_done)
{
uint32_t n = pdata[19] - 1;
const uint32_t first_nonce = pdata[19];
const uint32_t Htarg = ptarget[7];
uint32_t hash64[8] __attribute__((aligned(32)));
uint32_t endiandata[32];
//char testdata[] = {"\x70\x00\x00\x00\x5d\x38\x5b\xa1\x14\xd0\x79\x97\x0b\x29\xa9\x41\x8f\xd0\x54\x9e\x7d\x68\xa9\x5c\x7f\x16\x86\x21\xa3\x14\x20\x10\x00\x00\x00\x00\x57\x85\x86\xd1\x49\xfd\x07\xb2\x2f\x3a\x8a\x34\x7c\x51\x6d\xe7\x05\x2f\x03\x4d\x2b\x76\xff\x68\xe0\xd6\xec\xff\x9b\x77\xa4\x54\x89\xe3\xfd\x51\x17\x32\x01\x1d\xf0\x73\x10\x00"};
//we need bigendian data...
//lessons learned: do NOT endianchange directly in pdata, this will all proof-of-works be considered as stale from minerd....
int kk=0;
for (; kk < 32; kk++)
{
be32enc(&endiandata[kk], ((uint32_t*)pdata)[kk]);
};
// if (opt_debug)
// {
// applog(LOG_DEBUG, "Thr: %02d, firstN: %08x, maxN: %08x, ToDo: %d", thr_id, first_nonce, max_nonce, max_nonce-first_nonce);
// }
/* I'm to lazy to put the loop in an inline function... so dirty copy'n'paste.... */
/* i know that i could set a variable, but i don't know how the compiler will optimize it, not that then the cpu needs to load the value *everytime* in a register */
if (ptarget[7]==0) {
do {
pdata[19] = ++n;
be32enc(&endiandata[19], n);
quarkhash(hash64, &endiandata);
if (((hash64[7]&0xFFFFFFFF)==0) &&
fulltest(hash64, ptarget)) {
*hashes_done = n - first_nonce + 1;
return true;
}
} while (n < max_nonce && !work_restart[thr_id].restart);
}
else if (ptarget[7]<=0xF)
{
do {
pdata[19] = ++n;
be32enc(&endiandata[19], n);
quarkhash(hash64, &endiandata);
if (((hash64[7]&0xFFFFFFF0)==0) &&
fulltest(hash64, ptarget)) {
*hashes_done = n - first_nonce + 1;
return true;
}
} while (n < max_nonce && !work_restart[thr_id].restart);
}
else if (ptarget[7]<=0xFF)
{
do {
pdata[19] = ++n;
be32enc(&endiandata[19], n);
quarkhash(hash64, &endiandata);
if (((hash64[7]&0xFFFFFF00)==0) &&
fulltest(hash64, ptarget)) {
*hashes_done = n - first_nonce + 1;
return true;
}
} while (n < max_nonce && !work_restart[thr_id].restart);
}
else if (ptarget[7]<=0xFFF)
{
do {
pdata[19] = ++n;
be32enc(&endiandata[19], n);
quarkhash(hash64, &endiandata);
if (((hash64[7]&0xFFFFF000)==0) &&
fulltest(hash64, ptarget)) {
*hashes_done = n - first_nonce + 1;
return true;
}
} while (n < max_nonce && !work_restart[thr_id].restart);
}
else if (ptarget[7]<=0xFFFF)
{
do {
pdata[19] = ++n;
be32enc(&endiandata[19], n);
quarkhash(hash64, &endiandata);
if (((hash64[7]&0xFFFF0000)==0) &&
fulltest(hash64, ptarget)) {
*hashes_done = n - first_nonce + 1;
return true;
}
} while (n < max_nonce && !work_restart[thr_id].restart);
}
else
{
do {
pdata[19] = ++n;
be32enc(&endiandata[19], n);
quarkhash(hash64, &endiandata);
if (fulltest(hash64, ptarget)) {
*hashes_done = n - first_nonce + 1;
return true;
}
} while (n < max_nonce && !work_restart[thr_id].restart);
}
*hashes_done = n - first_nonce + 1;
pdata[19] = n;
return 0;
}