|
| 1 | +/*- |
| 2 | + * Copyright 2009 Colin Percival, 2011 ArtForz |
| 3 | + * All rights reserved. |
| 4 | + * |
| 5 | + * Redistribution and use in source and binary forms, with or without |
| 6 | + * modification, are permitted provided that the following conditions |
| 7 | + * are met: |
| 8 | + * 1. Redistributions of source code must retain the above copyright |
| 9 | + * notice, this list of conditions and the following disclaimer. |
| 10 | + * 2. Redistributions in binary form must reproduce the above copyright |
| 11 | + * notice, this list of conditions and the following disclaimer in the |
| 12 | + * documentation and/or other materials provided with the distribution. |
| 13 | + * |
| 14 | + * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND |
| 15 | + * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 16 | + * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 17 | + * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE |
| 18 | + * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 19 | + * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 20 | + * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 21 | + * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 22 | + * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 23 | + * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 24 | + * SUCH DAMAGE. |
| 25 | + * |
| 26 | + * This file was originally written by Colin Percival as part of the Tarsnap |
| 27 | + * online backup system. |
| 28 | + */ |
| 29 | + |
| 30 | +#include "config.h" |
| 31 | +#include "miner.h" |
| 32 | + |
| 33 | +#include <stdlib.h> |
| 34 | +#include <stdint.h> |
| 35 | +#include <string.h> |
| 36 | + |
| 37 | +#include "sph/sph_whirlpool.h" |
| 38 | + |
| 39 | +/* |
| 40 | + * Encode a length len/4 vector of (uint32_t) into a length len vector of |
| 41 | + * (unsigned char) in big-endian form. Assumes len is a multiple of 4. |
| 42 | + */ |
| 43 | +static inline void |
| 44 | +be32enc_vect(uint32_t *dst, const uint32_t *src, uint32_t len) |
| 45 | +{ |
| 46 | + uint32_t i; |
| 47 | + |
| 48 | + for (i = 0; i < len; i++) |
| 49 | + dst[i] = htobe32(src[i]); |
| 50 | +} |
| 51 | + |
| 52 | +inline void whirlpoolx_hash(void *state, const void *input) |
| 53 | +{ |
| 54 | + sph_whirlpool1_context ctx; |
| 55 | + |
| 56 | + sph_whirlpool1_init(&ctx); |
| 57 | + |
| 58 | + uint8_t digest[64]; |
| 59 | + |
| 60 | + sph_whirlpool(&ctx, input, 80); |
| 61 | + sph_whirlpool_close(&ctx, digest); |
| 62 | + |
| 63 | + ((uint8_t *)state)[0] = digest[0] ^ digest[16]; |
| 64 | + ((uint8_t *)state)[1] = digest[1] ^ digest[17]; |
| 65 | + ((uint8_t *)state)[2] = digest[2] ^ digest[18]; |
| 66 | + ((uint8_t *)state)[3] = digest[3] ^ digest[19]; |
| 67 | + ((uint8_t *)state)[4] = digest[4] ^ digest[20]; |
| 68 | + ((uint8_t *)state)[5] = digest[5] ^ digest[21]; |
| 69 | + ((uint8_t *)state)[6] = digest[6] ^ digest[22]; |
| 70 | + ((uint8_t *)state)[7] = digest[7] ^ digest[23]; |
| 71 | + ((uint8_t *)state)[8] = digest[8] ^ digest[24]; |
| 72 | + ((uint8_t *)state)[9] = digest[9] ^ digest[25]; |
| 73 | + ((uint8_t *)state)[10] = digest[10] ^ digest[26]; |
| 74 | + ((uint8_t *)state)[11] = digest[11] ^ digest[27]; |
| 75 | + ((uint8_t *)state)[12] = digest[12] ^ digest[28]; |
| 76 | + ((uint8_t *)state)[13] = digest[13] ^ digest[29]; |
| 77 | + ((uint8_t *)state)[14] = digest[14] ^ digest[30]; |
| 78 | + ((uint8_t *)state)[15] = digest[15] ^ digest[31]; |
| 79 | + ((uint8_t *)state)[16] = digest[16] ^ digest[32]; |
| 80 | + ((uint8_t *)state)[17] = digest[17] ^ digest[33]; |
| 81 | + ((uint8_t *)state)[18] = digest[18] ^ digest[34]; |
| 82 | + ((uint8_t *)state)[19] = digest[19] ^ digest[35]; |
| 83 | + ((uint8_t *)state)[20] = digest[20] ^ digest[36]; |
| 84 | + ((uint8_t *)state)[21] = digest[21] ^ digest[37]; |
| 85 | + ((uint8_t *)state)[22] = digest[22] ^ digest[38]; |
| 86 | + ((uint8_t *)state)[23] = digest[23] ^ digest[39]; |
| 87 | + ((uint8_t *)state)[24] = digest[24] ^ digest[40]; |
| 88 | + ((uint8_t *)state)[25] = digest[25] ^ digest[41]; |
| 89 | + ((uint8_t *)state)[26] = digest[26] ^ digest[42]; |
| 90 | + ((uint8_t *)state)[27] = digest[27] ^ digest[43]; |
| 91 | + ((uint8_t *)state)[28] = digest[28] ^ digest[44]; |
| 92 | + ((uint8_t *)state)[29] = digest[29] ^ digest[45]; |
| 93 | + ((uint8_t *)state)[30] = digest[30] ^ digest[46]; |
| 94 | + ((uint8_t *)state)[31] = digest[31] ^ digest[47]; |
| 95 | +} |
| 96 | + |
| 97 | +static const uint32_t diff1targ = 0x0000ffff; |
| 98 | + |
| 99 | + |
| 100 | +/* Used externally as confirmation of correct OCL code */ |
| 101 | +int whirlpoolx_test(unsigned char *pdata, const unsigned char *ptarget, uint32_t nonce) |
| 102 | +{ |
| 103 | + uint32_t tmp_hash7, Htarg = le32toh(((const uint32_t *)ptarget)[7]); |
| 104 | + uint32_t data[20], ohash[8]; |
| 105 | + |
| 106 | + be32enc_vect(data, (const uint32_t *)pdata, 19); |
| 107 | + data[19] = htobe32(nonce); |
| 108 | + |
| 109 | + whirlpoolx_hash(ohash, data); |
| 110 | + tmp_hash7 = be32toh(ohash[7]); |
| 111 | + |
| 112 | + applog(LOG_DEBUG, "htarget %08lx diff1 %08lx hash %08lx", |
| 113 | + (long unsigned int)Htarg, |
| 114 | + (long unsigned int)diff1targ, |
| 115 | + (long unsigned int)tmp_hash7); |
| 116 | + if (tmp_hash7 > diff1targ) |
| 117 | + return -1; |
| 118 | + if (tmp_hash7 > Htarg) |
| 119 | + return 0; |
| 120 | + return 1; |
| 121 | +} |
| 122 | + |
| 123 | +void whirlpoolx_regenhash(struct work *work) |
| 124 | +{ |
| 125 | + uint32_t data[20]; |
| 126 | + uint32_t *nonce = (uint32_t *)(work->data + 76); |
| 127 | + uint32_t *ohash = (uint32_t *)(work->hash); |
| 128 | + |
| 129 | + be32enc_vect(data, (const uint32_t *)work->data, 19); |
| 130 | + data[19] = htobe32(*nonce); |
| 131 | + whirlpoolx_hash(ohash, data); |
| 132 | +} |
| 133 | + |
| 134 | +bool scanhash_whirlpoolx(struct thr_info *thr, const unsigned char __maybe_unused *pmidstate, |
| 135 | + unsigned char *pdata, unsigned char __maybe_unused *phash1, |
| 136 | + unsigned char __maybe_unused *phash, const unsigned char *ptarget, |
| 137 | + uint32_t max_nonce, uint32_t *last_nonce, uint32_t n) |
| 138 | +{ |
| 139 | + uint32_t *nonce = (uint32_t *)(pdata + 76); |
| 140 | + uint32_t data[20]; |
| 141 | + uint32_t tmp_hash7; |
| 142 | + uint32_t Htarg = le32toh(((const uint32_t *)ptarget)[7]); |
| 143 | + bool ret = false; |
| 144 | + |
| 145 | + be32enc_vect(data, (const uint32_t *)pdata, 19); |
| 146 | + |
| 147 | + while(1) { |
| 148 | + uint32_t ostate[8]; |
| 149 | + |
| 150 | + *nonce = ++n; |
| 151 | + data[19] = (n); |
| 152 | + whirlpoolx_hash(ostate, data); |
| 153 | + tmp_hash7 = (ostate[7]); |
| 154 | + |
| 155 | + applog(LOG_INFO, "data7 %08lx", |
| 156 | + (long unsigned int)data[7]); |
| 157 | + |
| 158 | + if (unlikely(tmp_hash7 <= Htarg)) { |
| 159 | + ((uint32_t *)pdata)[19] = htobe32(n); |
| 160 | + *last_nonce = n; |
| 161 | + ret = true; |
| 162 | + break; |
| 163 | + } |
| 164 | + |
| 165 | + if (unlikely((n >= max_nonce) || thr->work_restart)) { |
| 166 | + *last_nonce = n; |
| 167 | + break; |
| 168 | + } |
| 169 | + } |
| 170 | + |
| 171 | + return ret; |
| 172 | +} |
0 commit comments