libbitfury.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397
  1. /*
  2. * Copyright 2013 bitfury
  3. * Copyright 2013 Anatoly Legkodymov
  4. * Copyright 2013 Luke Dashjr
  5. *
  6. * Permission is hereby granted, free of charge, to any person obtaining a copy
  7. * of this software and associated documentation files (the "Software"), to deal
  8. * in the Software without restriction, including without limitation the rights
  9. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  10. * copies of the Software, and to permit persons to whom the Software is
  11. * furnished to do so, subject to the following conditions:
  12. *
  13. * The above copyright notice and this permission notice shall be included in
  14. * all copies or substantial portions of the Software.
  15. *
  16. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  17. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  18. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  19. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  20. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  21. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  22. * THE SOFTWARE.
  23. */
  24. #include "config.h"
  25. #include <stdbool.h>
  26. #include <stdint.h>
  27. #include <stdio.h>
  28. #include <unistd.h>
  29. #include <string.h>
  30. #include "logging.h"
  31. #include "miner.h"
  32. #include "libbitfury.h"
  33. #include "lowl-spi.h"
  34. #include "sha2.h"
  35. #include <time.h>
  36. #define BITFURY_REFRESH_DELAY 100
  37. #define BITFURY_DETECT_TRIES 3000 / BITFURY_REFRESH_DELAY
  38. uint32_t bitfury_decnonce(uint32_t);
  39. /* Configuration registers - control oscillators and such stuff. PROGRAMMED when magic number is matches, UNPROGRAMMED (default) otherwise */
  40. static
  41. void bitfury_config_reg(struct spi_port *port, int cfgreg, int ena)
  42. {
  43. static const uint8_t enaconf[4] = { 0xc1, 0x6a, 0x59, 0xe3 };
  44. static const uint8_t disconf[4] = { 0, 0, 0, 0 };
  45. if (ena) spi_emit_data(port, 0x7000+cfgreg*32, enaconf, 4);
  46. else spi_emit_data(port, 0x7000+cfgreg*32, disconf, 4);
  47. }
  48. #define FIRST_BASE 61
  49. #define SECOND_BASE 4
  50. static
  51. const int8_t bitfury_counters[16] = { 64, 64,
  52. SECOND_BASE, SECOND_BASE+4, SECOND_BASE+2, SECOND_BASE+2+16, SECOND_BASE, SECOND_BASE+1,
  53. (FIRST_BASE)%65, (FIRST_BASE+1)%65, (FIRST_BASE+3)%65, (FIRST_BASE+3+16)%65, (FIRST_BASE+4)%65, (FIRST_BASE+4+4)%65, (FIRST_BASE+3+3)%65, (FIRST_BASE+3+1+3)%65};
  54. /* Oscillator setup variants (maybe more), values inside of chip ANDed to not allow by programming errors work it at higher speeds */
  55. /* WARNING! no chip temperature control limits, etc. It may self-fry and make fried chips with great ease :-) So if trying to overclock */
  56. /* Do not place chip near flammable objects, provide adequate power protection and better wear eye protection ! */
  57. /* Thermal runaway in this case could produce nice flames of chippy fries */
  58. // Thermometer code from left to right - more ones ==> faster clock!
  59. #define rotrFixed(x,y) (((x) >> (y)) | ((x) << (32-(y))))
  60. #define s0(x) (rotrFixed(x,7)^rotrFixed(x,18)^(x>>3))
  61. #define s1(x) (rotrFixed(x,17)^rotrFixed(x,19)^(x>>10))
  62. #define Ch(x,y,z) (z^(x&(y^z)))
  63. #define Maj(x,y,z) (y^((x^y)&(y^z)))
  64. #define S0(x) (rotrFixed(x,2)^rotrFixed(x,13)^rotrFixed(x,22))
  65. #define S1(x) (rotrFixed(x,6)^rotrFixed(x,11)^rotrFixed(x,25))
  66. /* SHA256 CONSTANTS */
  67. static const uint32_t SHA_K[64] = {
  68. 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
  69. 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
  70. 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
  71. 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
  72. 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
  73. 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
  74. 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
  75. 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2
  76. };
  77. static
  78. void libbitfury_ms3_compute(uint32_t *p)
  79. {
  80. uint32_t cp[8];
  81. uint32_t a,b,c,d,e,f,g,h, ne, na, i;
  82. swap32tole(cp, p, 8);
  83. a = cp[0]; b = cp[1]; c = cp[2]; d = cp[3]; e = cp[4]; f = cp[5]; g = cp[6]; h = cp[7];
  84. for (i = 0; i < 3; i++) {
  85. const uint32_t x = le32toh(p[i+16]);
  86. ne = x + SHA_K[i] + h + Ch(e,f,g) + S1(e) + d;
  87. na = x + SHA_K[i] + h + Ch(e,f,g) + S1(e) + S0(a) + Maj(a,b,c);
  88. d = c; c = b; b = a; a = na;
  89. h = g; g = f; f = e; e = ne;
  90. }
  91. p[15] = a; p[14] = b; p[13] = c; p[12] = d; p[11] = e; p[10] = f; p[9] = g; p[8] = h;
  92. swap32tole(&p[8], &p[8], 8);
  93. }
  94. static
  95. void bitfury_send_conf(struct spi_port *port) {
  96. int i;
  97. for (i = 7; i <= 11; ++i)
  98. bitfury_config_reg(port, i, 0);
  99. bitfury_config_reg(port, 6, 0); /* disable OUTSLK */
  100. bitfury_config_reg(port, 4, 1); /* Enable slow oscillator */
  101. for (i = 1; i <= 3; ++i)
  102. bitfury_config_reg(port, i, 0);
  103. spi_emit_data(port, 0x0100, bitfury_counters, 16); /* Program counters correctly for rounds processing, here baby should start consuming power */
  104. }
  105. static
  106. void bitfury_send_init(struct spi_port *port) {
  107. /* Prepare internal buffers */
  108. /* PREPARE BUFFERS (INITIAL PROGRAMMING) */
  109. {
  110. uint32_t w[] = {
  111. 0,0,0,0xffffffff,
  112. 0x80000000,0,0,0,
  113. 0,0,0,0,
  114. 0,0,0,0x00000280,
  115. };
  116. swap32tole(w, w, sizeof(w)/4);
  117. spi_emit_data(port, 0x1000, w, 16*4);
  118. spi_emit_data(port, 0x1400, w, 8*4);
  119. }
  120. {
  121. uint32_t w[] = {
  122. 0x80000000,0,0,0,
  123. 0,0,0,0x100,
  124. };
  125. swap32tole(w, w, sizeof(w)/4);
  126. spi_emit_data(port, 0x1900, &w[0],8*4); /* Prepare MS and W buffers! */
  127. uint32_t atrvec[] = {
  128. 0xb0e72d8e, 0x1dc5b862, 0xe9e7c4a6, 0x3050f1f5, 0x8a1a6b7e, 0x7ec384e8, 0x42c1c3fc, 0x8ed158a1, /* MIDSTATE */
  129. 0,0,0,0,0,0,0,0,
  130. 0x8a0bb7b7, 0x33af304f, 0x0b290c1a, 0xf0c4e61f, /* WDATA: hashMerleRoot[7], nTime, nBits, nNonce */
  131. };
  132. libbitfury_ms3_compute(&atrvec[0]);
  133. swap32tole(atrvec, atrvec, sizeof(atrvec)/4);
  134. spi_emit_data(port, 0x3000, &atrvec[0], 19*4);
  135. }
  136. }
  137. static
  138. void bitfury_set_freq(struct spi_port *port, int bits) {
  139. uint64_t freq;
  140. const uint8_t *
  141. osc6 = (unsigned char *)&freq;
  142. freq = (1ULL << bits) - 1ULL;
  143. freq = htole64(freq);
  144. spi_emit_data(port, 0x6000, osc6, 8); /* Program internal on-die slow oscillator frequency */
  145. bitfury_config_reg(port, 4, 1); /* Enable slow oscillator */
  146. }
  147. void bitfury_send_reinit(struct spi_port *port, int slot, int chip_n, int n) {
  148. spi_clear_buf(port);
  149. spi_emit_break(port);
  150. spi_emit_fasync(port, chip_n);
  151. bitfury_set_freq(port, n);
  152. bitfury_send_conf(port);
  153. bitfury_send_init(port);
  154. spi_txrx(port);
  155. }
  156. void bitfury_send_shutdown(struct spi_port *port, int slot, int chip_n) {
  157. spi_clear_buf(port);
  158. spi_emit_break(port);
  159. spi_emit_fasync(port, chip_n);
  160. bitfury_config_reg(port, 4, 0); /* Disable slow oscillator */
  161. spi_txrx(port);
  162. }
  163. void bitfury_send_freq(struct spi_port *port, int slot, int chip_n, int bits) {
  164. spi_clear_buf(port);
  165. spi_emit_break(port);
  166. spi_emit_fasync(port, chip_n);
  167. bitfury_set_freq(port, bits);
  168. spi_txrx(port);
  169. }
  170. static
  171. uint32_t libbitfury_c_diff(uint32_t ocounter, uint32_t counter) {
  172. return counter > ocounter ? counter - ocounter : (0x003FFFFF - ocounter) + counter;
  173. }
  174. static
  175. uint32_t libbitfury_get_counter(uint32_t *newbuf, uint32_t *oldbuf) {
  176. int j;
  177. for(j = 0; j < 16; j++) {
  178. if (newbuf[j] != oldbuf[j]) {
  179. uint32_t counter = bitfury_decnonce(newbuf[j]);
  180. if ((counter & 0xFFC00000) == 0xdf800000) {
  181. counter -= 0xdf800000;
  182. return counter;
  183. }
  184. }
  185. }
  186. return 0;
  187. }
  188. static
  189. int libbitfury_detect_chip(struct spi_port *port, int chip_n) {
  190. /* Test vectors to calculate (using address-translated loads) */
  191. uint32_t atrvec[] = {
  192. 0xb0e72d8e, 0x1dc5b862, 0xe9e7c4a6, 0x3050f1f5, 0x8a1a6b7e, 0x7ec384e8, 0x42c1c3fc, 0x8ed158a1, /* MIDSTATE */
  193. 0,0,0,0,0,0,0,0,
  194. 0x8a0bb7b7, 0x33af304f, 0x0b290c1a, 0xf0c4e61f, /* WDATA: hashMerleRoot[7], nTime, nBits, nNonce */
  195. 0x9c4dfdc0, 0xf055c9e1, 0xe60f079d, 0xeeada6da, 0xd459883d, 0xd8049a9d, 0xd49f9a96, 0x15972fed, /* MIDSTATE */
  196. 0,0,0,0,0,0,0,0,
  197. 0x048b2528, 0x7acb2d4f, 0x0b290c1a, 0xbe00084a, /* WDATA: hashMerleRoot[7], nTime, nBits, nNonce */
  198. 0x0317b3ea, 0x1d227d06, 0x3cca281e, 0xa6d0b9da, 0x1a359fe2, 0xa7287e27, 0x8b79c296, 0xc4d88274, /* MIDSTATE */
  199. 0,0,0,0,0,0,0,0,
  200. 0x328bcd4f, 0x75462d4f, 0x0b290c1a, 0x002c6dbc, /* WDATA: hashMerleRoot[7], nTime, nBits, nNonce */
  201. 0xac4e38b6, 0xba0e3b3b, 0x649ad6f8, 0xf72e4c02, 0x93be06fb, 0x366d1126, 0xf4aae554, 0x4ff19c5b, /* MIDSTATE */
  202. 0,0,0,0,0,0,0,0,
  203. 0x72698140, 0x3bd62b4f, 0x3fd40c1a, 0x801e43e9, /* WDATA: hashMerleRoot[7], nTime, nBits, nNonce */
  204. 0x9dbf91c9, 0x12e5066c, 0xf4184b87, 0x8060bc4d, 0x18f9c115, 0xf589d551, 0x0f7f18ae, 0x885aca59, /* MIDSTATE */
  205. 0,0,0,0,0,0,0,0,
  206. 0x6f3806c3, 0x41f82a4f, 0x3fd40c1a, 0x00334b39, /* WDATA: hashMerleRoot[7], nTime, nBits, nNonce */
  207. };
  208. int i;
  209. uint32_t newbuf[17] = {0}, oldbuf[17] = {0};
  210. uint32_t ocounter;
  211. long long odiff = 0;
  212. memset(newbuf, 0, 17 * 4);
  213. memset(oldbuf, 0, 17 * 4);
  214. libbitfury_ms3_compute(&atrvec[0]);
  215. libbitfury_ms3_compute(&atrvec[20]);
  216. libbitfury_ms3_compute(&atrvec[40]);
  217. swap32tole(atrvec, atrvec, sizeof(atrvec)/4);
  218. spi_clear_buf(port);
  219. spi_emit_break(port); /* First we want to break chain! Otherwise we'll get all of traffic bounced to output */
  220. spi_emit_fasync(port, chip_n);
  221. bitfury_set_freq(port, 30);
  222. bitfury_send_conf(port);
  223. bitfury_send_init(port);
  224. spi_txrx(port);
  225. ocounter = 0;
  226. for (i = 0; i < BITFURY_DETECT_TRIES; i++) {
  227. int counter;
  228. spi_clear_buf(port);
  229. spi_emit_break(port);
  230. spi_emit_fasync(port, chip_n);
  231. spi_emit_data(port, 0x3000, &atrvec[0], 19*4);
  232. spi_txrx(port);
  233. swap32tole(newbuf, spi_getrxbuf(port) + 4 + chip_n, 17);
  234. counter = libbitfury_get_counter(newbuf, oldbuf);
  235. if (ocounter) {
  236. long long cdiff = libbitfury_c_diff(ocounter, counter);
  237. if (llabs(odiff - cdiff) < 5000)
  238. return 1;
  239. odiff = cdiff;
  240. }
  241. ocounter = counter;
  242. if (newbuf[16] != 0 && newbuf[16] != 0xFFFFFFFF) {
  243. return 0;
  244. }
  245. cgsleep_ms(BITFURY_REFRESH_DELAY / 10);
  246. memcpy(oldbuf, newbuf, 17 * 4);
  247. }
  248. return 0;
  249. }
  250. int libbitfury_detectChips1(struct spi_port *port) {
  251. int n;
  252. for (n = 0; libbitfury_detect_chip(port, n); ++n)
  253. {}
  254. return n;
  255. }
  256. // in = 1f 1e 1d 1c 1b 1a 19 18 17 16 15 14 13 12 11 10 f e d c b a 9 8 7 6 5 4 3 2 1 0
  257. uint32_t bitfury_decnonce(uint32_t in)
  258. {
  259. uint32_t out;
  260. /* First part load */
  261. out = (in & 0xFF) << 24; in >>= 8;
  262. /* Byte reversal */
  263. in = (((in & 0xaaaaaaaa) >> 1) | ((in & 0x55555555) << 1));
  264. in = (((in & 0xcccccccc) >> 2) | ((in & 0x33333333) << 2));
  265. in = (((in & 0xf0f0f0f0) >> 4) | ((in & 0x0f0f0f0f) << 4));
  266. out |= (in >> 2)&0x3FFFFF;
  267. /* Extraction */
  268. if (in & 1) out |= (1 << 23);
  269. if (in & 2) out |= (1 << 22);
  270. // out = 7 6 5 4 3 2 1 0 f e 18 19 1a 1b 1c 1d 1e 1f 10 11 12 13 14 15 16 17 8 9 a b c d
  271. out -= 0x800004;
  272. return out;
  273. }
  274. static
  275. int libbitfury_rehash(const void *midstate, const uint32_t m7, const uint32_t ntime, const uint32_t nbits, uint32_t nnonce) {
  276. uint8_t in[16];
  277. uint32_t *in32 = (uint32_t *)in;
  278. const uint32_t *mid32 = midstate;
  279. uint32_t out32[8];
  280. uint8_t *out = (uint8_t *) out32;
  281. #ifdef BITFURY_REHASH_DEBUG
  282. static uint32_t history[512];
  283. static uint32_t history_p;
  284. #endif
  285. sha256_ctx ctx;
  286. memset( &ctx, 0, sizeof( sha256_ctx ) );
  287. memcpy(ctx.h, mid32, 8*4);
  288. ctx.tot_len = 64;
  289. ctx.len = 0;
  290. in32[0] = bswap_32(m7);
  291. in32[1] = bswap_32(ntime);
  292. in32[2] = bswap_32(nbits);
  293. in32[3] = bswap_32(nnonce);
  294. sha256_update(&ctx, in, 16);
  295. sha256_final(&ctx, out);
  296. sha256(out, 32, out);
  297. if (out32[7] == 0) {
  298. #ifdef BITFURY_REHASH_DEBUG
  299. char hex[65];
  300. bin2hex(hex, out, 32);
  301. applog(LOG_INFO, "! MS0: %08x, m7: %08x, ntime: %08x, nbits: %08x, nnonce: %08x", mid32[0], m7, ntime, nbits, nnonce);
  302. applog(LOG_INFO, " out: %s", hex);
  303. history[history_p] = nnonce;
  304. history_p++; history_p &= 512 - 1;
  305. #endif
  306. return 1;
  307. }
  308. return 0;
  309. }
  310. bool bitfury_fudge_nonce(const void *midstate, const uint32_t m7, const uint32_t ntime, const uint32_t nbits, uint32_t *nonce_p) {
  311. static const uint32_t offsets[] = {0, 0xffc00000, 0xff800000, 0x02800000, 0x02C00000, 0x00400000};
  312. uint32_t nonce;
  313. int i;
  314. for (i = 0; i < 6; ++i)
  315. {
  316. nonce = *nonce_p + offsets[i];
  317. if (libbitfury_rehash(midstate, m7, ntime, nbits, nonce))
  318. {
  319. *nonce_p = nonce;
  320. return true;
  321. }
  322. }
  323. return false;
  324. }
  325. void work_to_bitfury_payload(struct bitfury_payload *p, struct work *w) {
  326. memset(p, 0, sizeof(struct bitfury_payload));
  327. memcpy(p->midstate, w->midstate, 32);
  328. p->m7 = *(uint32_t *)&w->data[0x40];
  329. p->ntime = *(uint32_t *)&w->data[0x44];
  330. p->nbits = *(uint32_t *)&w->data[0x48];
  331. }
  332. void bitfury_payload_to_atrvec(uint32_t *atrvec, struct bitfury_payload *p)
  333. {
  334. /* Programming next value */
  335. memcpy(atrvec, p, 20*4);
  336. libbitfury_ms3_compute(atrvec);
  337. }