libbitfury.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334
  1. /**
  2. * libbitfury.c - library for Bitfury chip/board
  3. *
  4. * Copyright (c) 2013 bitfury
  5. * Copyright (c) 2013 legkodymov
  6. *
  7. * This program is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License version 2 as
  9. * published by the Free Software Foundation.
  10. *
  11. * This program is distributed in the hope that it will be useful, but
  12. * WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  14. * General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License
  17. * along with this program; if not, see http://www.gnu.org/licenses/.
  18. **/
  19. #include "config.h"
  20. #include <stdio.h>
  21. #include <unistd.h>
  22. #include <string.h>
  23. #include "miner.h"
  24. #include "libbitfury.h"
  25. #include "spidevc.h"
  26. #include "sha2.h"
  27. #include <time.h>
  28. #define BITFURY_REFRESH_DELAY 100
  29. #define BITFURY_DETECT_TRIES 3000 / BITFURY_REFRESH_DELAY
  30. // 0 .... 31 bit
  31. // 1000 0011 0101 0110 1001 1010 1100 0111
  32. // 1100 0001 0110 1010 0101 1001 1110 0011
  33. // C16A59E3
  34. unsigned char enaconf[4] = { 0xc1, 0x6a, 0x59, 0xe3 };
  35. unsigned char disconf[4] = { 0, 0, 0, 0 };
  36. /* Configuration registers - control oscillators and such stuff. PROGRAMMED when magic number is matches, UNPROGRAMMED (default) otherwise */
  37. void config_reg(int cfgreg, int ena)
  38. {
  39. if (ena) spi_emit_data(0x7000+cfgreg*32, (void*)enaconf, 4);
  40. else spi_emit_data(0x7000+cfgreg*32, (void*)disconf, 4);
  41. }
  42. #define FIRST_BASE 61
  43. #define SECOND_BASE 4
  44. char counters[16] = { 64, 64,
  45. SECOND_BASE, SECOND_BASE+4, SECOND_BASE+2, SECOND_BASE+2+16, SECOND_BASE, SECOND_BASE+1,
  46. (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};
  47. //char counters[16] = { 64, 64,
  48. // SECOND_BASE, SECOND_BASE+4, SECOND_BASE+2, SECOND_BASE+2+16, SECOND_BASE, SECOND_BASE+1,
  49. // (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};
  50. char *buf = "Hello, World!\x55\xaa";
  51. char outbuf[16];
  52. /* Oscillator setup variants (maybe more), values inside of chip ANDed to not allow by programming errors work it at higher speeds */
  53. /* WARNING! no chip temperature control limits, etc. It may self-fry and make fried chips with great ease :-) So if trying to overclock */
  54. /* Do not place chip near flammable objects, provide adequate power protection and better wear eye protection ! */
  55. /* Thermal runaway in this case could produce nice flames of chippy fries */
  56. // Thermometer code from left to right - more ones ==> faster clock!
  57. unsigned char osc6[8] = { 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x7F, 0x00, 0x00 };
  58. /* Test vectors to calculate (using address-translated loads) */
  59. unsigned atrvec[] = {
  60. 0xb0e72d8e, 0x1dc5b862, 0xe9e7c4a6, 0x3050f1f5, 0x8a1a6b7e, 0x7ec384e8, 0x42c1c3fc, 0x8ed158a1, /* MIDSTATE */
  61. 0,0,0,0,0,0,0,0,
  62. 0x8a0bb7b7, 0x33af304f, 0x0b290c1a, 0xf0c4e61f, /* WDATA: hashMerleRoot[7], nTime, nBits, nNonce */
  63. 0x9c4dfdc0, 0xf055c9e1, 0xe60f079d, 0xeeada6da, 0xd459883d, 0xd8049a9d, 0xd49f9a96, 0x15972fed, /* MIDSTATE */
  64. 0,0,0,0,0,0,0,0,
  65. 0x048b2528, 0x7acb2d4f, 0x0b290c1a, 0xbe00084a, /* WDATA: hashMerleRoot[7], nTime, nBits, nNonce */
  66. 0x0317b3ea, 0x1d227d06, 0x3cca281e, 0xa6d0b9da, 0x1a359fe2, 0xa7287e27, 0x8b79c296, 0xc4d88274, /* MIDSTATE */
  67. 0,0,0,0,0,0,0,0,
  68. 0x328bcd4f, 0x75462d4f, 0x0b290c1a, 0x002c6dbc, /* WDATA: hashMerleRoot[7], nTime, nBits, nNonce */
  69. 0xac4e38b6, 0xba0e3b3b, 0x649ad6f8, 0xf72e4c02, 0x93be06fb, 0x366d1126, 0xf4aae554, 0x4ff19c5b, /* MIDSTATE */
  70. 0,0,0,0,0,0,0,0,
  71. 0x72698140, 0x3bd62b4f, 0x3fd40c1a, 0x801e43e9, /* WDATA: hashMerleRoot[7], nTime, nBits, nNonce */
  72. 0x9dbf91c9, 0x12e5066c, 0xf4184b87, 0x8060bc4d, 0x18f9c115, 0xf589d551, 0x0f7f18ae, 0x885aca59, /* MIDSTATE */
  73. 0,0,0,0,0,0,0,0,
  74. 0x6f3806c3, 0x41f82a4f, 0x3fd40c1a, 0x00334b39, /* WDATA: hashMerleRoot[7], nTime, nBits, nNonce */
  75. };
  76. #define rotrFixed(x,y) (((x) >> (y)) | ((x) << (32-(y))))
  77. #define s0(x) (rotrFixed(x,7)^rotrFixed(x,18)^(x>>3))
  78. #define s1(x) (rotrFixed(x,17)^rotrFixed(x,19)^(x>>10))
  79. #define Ch(x,y,z) (z^(x&(y^z)))
  80. #define Maj(x,y,z) (y^((x^y)&(y^z)))
  81. #define S0(x) (rotrFixed(x,2)^rotrFixed(x,13)^rotrFixed(x,22))
  82. #define S1(x) (rotrFixed(x,6)^rotrFixed(x,11)^rotrFixed(x,25))
  83. /* SHA256 CONSTANTS */
  84. static const unsigned SHA_K[64] = {
  85. 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
  86. 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
  87. 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
  88. 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
  89. 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
  90. 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
  91. 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
  92. 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2
  93. };
  94. void ms3_compute(unsigned *p)
  95. {
  96. unsigned a,b,c,d,e,f,g,h, ne, na, i;
  97. a = p[0]; b = p[1]; c = p[2]; d = p[3]; e = p[4]; f = p[5]; g = p[6]; h = p[7];
  98. for (i = 0; i < 3; i++) {
  99. ne = p[i+16] + SHA_K[i] + h + Ch(e,f,g) + S1(e) + d;
  100. na = p[i+16] + SHA_K[i] + h + Ch(e,f,g) + S1(e) + S0(a) + Maj(a,b,c);
  101. d = c; c = b; b = a; a = na;
  102. h = g; g = f; f = e; e = ne;
  103. }
  104. p[15] = a; p[14] = b; p[13] = c; p[12] = d; p[11] = e; p[10] = f; p[9] = g; p[8] = h;
  105. }
  106. int detect_chip(int chip_n) {
  107. unsigned w[16];
  108. int i;
  109. unsigned newbuf[17], oldbuf[17];
  110. memset(newbuf, 0, 17 * 4);
  111. memset(oldbuf, 0, 17 * 4);
  112. ms3_compute(&atrvec[0]);
  113. ms3_compute(&atrvec[20]);
  114. ms3_compute(&atrvec[40]);
  115. spi_init();
  116. spi_clear_buf();
  117. spi_emit_break(); /* First we want to break chain! Otherwise we'll get all of traffic bounced to output */
  118. spi_emit_fasync(chip_n);
  119. spi_emit_data(0x6000, (void*)osc6, 8); /* Program internal on-die slow oscillator frequency */
  120. config_reg(7,0); config_reg(8,0); config_reg(9,0); config_reg(10,0); config_reg(11,0);
  121. config_reg(6,1);
  122. config_reg(4,1); /* Enable slow oscillator */
  123. config_reg(1,0); config_reg(2,0); config_reg(3,0);
  124. spi_emit_data(0x0100, (void*)counters, 16); /* Program counters correctly for rounds processing, here baby should start consuming power */
  125. /* Prepare internal buffers */
  126. /* PREPARE BUFFERS (INITIAL PROGRAMMING) */
  127. memset(&w, 0, sizeof(w)); w[3] = 0xffffffff; w[4] = 0x80000000; w[15] = 0x00000280;
  128. spi_emit_data(0x1000, (void*)w, 16*4);
  129. spi_emit_data(0x1400, (void*)w, 8*4);
  130. memset(w, 0, sizeof(w)); w[0] = 0x80000000; w[7] = 0x100;
  131. spi_emit_data(0x1900, (void*)&w[0],8*4); /* Prepare MS and W buffers! */
  132. spi_emit_data(0x3000, (void*)&atrvec[0], 19*4);
  133. spi_txrx(spi_gettxbuf(), spi_getrxbuf(), spi_getbufsz());
  134. for (i = 0; i < BITFURY_DETECT_TRIES; i++) {
  135. spi_clear_buf();
  136. spi_emit_break();
  137. spi_emit_fasync(chip_n);
  138. spi_emit_data(0x3000, (void*)&atrvec[0], 19*4);
  139. spi_txrx(spi_gettxbuf(), spi_getrxbuf(), spi_getbufsz());
  140. memcpy(newbuf, spi_getrxbuf() + 4 + chip_n, 17*4);
  141. if (newbuf[16] != 0 && newbuf[16] != 0xFFFFFFFF) {
  142. return 0;
  143. }
  144. if (i && newbuf[16] != oldbuf[16])
  145. return 1;
  146. cgsleep_ms(BITFURY_REFRESH_DELAY);
  147. memcpy(oldbuf, newbuf, 17 * 4);
  148. }
  149. return 0;
  150. }
  151. int libbitfury_detectChips(void) {
  152. int n = 0;
  153. int detected;
  154. do {
  155. detected = detect_chip(n);
  156. if (detected) {
  157. n++;
  158. applog(LOG_WARNING, "BITFURY chip #%d detected", n);
  159. } else {
  160. }
  161. } while (detected);
  162. return n;
  163. }
  164. unsigned decnonce(unsigned in)
  165. {
  166. unsigned out;
  167. /* First part load */
  168. out = (in & 0xFF) << 24; in >>= 8;
  169. /* Byte reversal */
  170. in = (((in & 0xaaaaaaaa) >> 1) | ((in & 0x55555555) << 1));
  171. in = (((in & 0xcccccccc) >> 2) | ((in & 0x33333333) << 2));
  172. in = (((in & 0xf0f0f0f0) >> 4) | ((in & 0x0f0f0f0f) << 4));
  173. out |= (in >> 2)&0x3FFFFF;
  174. /* Extraction */
  175. if (in & 1) out |= (1 << 23);
  176. if (in & 2) out |= (1 << 22);
  177. out -= 0x800004;
  178. return out;
  179. }
  180. int rehash(unsigned char *midstate, unsigned m7,
  181. unsigned ntime, unsigned nbits, unsigned nnonce) {
  182. unsigned char in[16];
  183. unsigned char hash1[32];
  184. unsigned int *in32 = (unsigned int *)in;
  185. unsigned char hex[65];
  186. unsigned int *mid32 = (unsigned int *)midstate;
  187. unsigned out32[8];
  188. unsigned char *out = (unsigned char *) out32;
  189. int i;
  190. sha256_ctx ctx;
  191. memset( &ctx, 0, sizeof( sha256_ctx ) );
  192. memcpy(ctx.h, mid32, 8*4);
  193. ctx.tot_len = 64;
  194. ctx.len = 0;
  195. nnonce = bswap_32(nnonce);
  196. in32[0] = bswap_32(m7);
  197. in32[1] = bswap_32(ntime);
  198. in32[2] = bswap_32(nbits);
  199. in32[3] = nnonce;
  200. sha256_update(&ctx, in, 16);
  201. sha256_final(&ctx, out);
  202. sha256(out, 32, out);
  203. if (out32[7] == 0) {
  204. bin2hex(hex, midstate, 32);
  205. bin2hex(hex, out, 32);
  206. applog(LOG_INFO, "! MS0: %08x, m7: %08x, ntime: %08x, nbits: %08x, nnonce: %08x\n\t\t\t out: %s\n", mid32[0], m7, ntime, nbits, nnonce, hex);
  207. return 1;
  208. }
  209. return 0;
  210. }
  211. void work_to_payload(struct bitfury_payload *p, struct work *w) {
  212. unsigned char flipped_data[80];
  213. memset(p, 0, sizeof(struct bitfury_payload));
  214. swap32yes(flipped_data, w->data, 80 / 4);
  215. memcpy(p->midstate, w->midstate, 32);
  216. p->m7 = bswap_32(*(unsigned *)(flipped_data + 64));
  217. p->ntime = bswap_32(*(unsigned *)(flipped_data + 68));
  218. p->nbits = bswap_32(*(unsigned *)(flipped_data + 72));
  219. applog(LOG_INFO, "INFO nonc: %08x bitfury_scanHash MS0: %08x, ", p->nnonce, ((unsigned int *)w->midstate)[0]);
  220. applog(LOG_INFO, "INFO merkle[7]: %08x, ntime: %08x, nbits: %08x", p->m7, p->ntime, p->nbits);
  221. }
  222. int libbitfury_sendHashData(struct bitfury_device *bf, int chip_n) {
  223. int chip;
  224. static unsigned second_run;
  225. for (chip = 0; chip < chip_n; chip++) {
  226. unsigned char *hexstr;
  227. struct bitfury_device *d = bf + chip;
  228. unsigned *newbuf = d->newbuf;
  229. unsigned *oldbuf = d->oldbuf;
  230. struct bitfury_payload *p = &(d->payload);
  231. struct bitfury_payload *op = &(d->opayload);
  232. /* Programming next value */
  233. memcpy(atrvec, p, 20*4);
  234. ms3_compute(atrvec);
  235. spi_clear_buf(); spi_emit_break();
  236. spi_emit_fasync(chip);
  237. spi_emit_data(0x3000, (void*)&atrvec[0], 19*4);
  238. spi_txrx(spi_gettxbuf(), spi_getrxbuf(), spi_getbufsz());
  239. memcpy(newbuf, spi_getrxbuf()+4 + chip, 17*4);
  240. d->job_switched = newbuf[16] != oldbuf[16];
  241. if (second_run && d->job_switched) {
  242. int i;
  243. int results_num = 0;
  244. unsigned * results = d->results;
  245. for (i = 0; i < 16; i++) {
  246. if (oldbuf[i] != newbuf[i]) {
  247. unsigned pn; //possible nonce
  248. unsigned int s = 0; //TODO zero may be solution
  249. pn = decnonce(newbuf[i]);
  250. s |= rehash(op->midstate, op->m7, op->ntime, op->nbits, pn) ? pn : 0;
  251. s |= rehash(op->midstate, op->m7, op->ntime, op->nbits, pn-0x400000) ? pn - 0x400000 : 0;
  252. s |= rehash(op->midstate, op->m7, op->ntime, op->nbits, pn-0x800000) ? pn - 0x800000 : 0;
  253. s |= rehash(op->midstate, op->m7, op->ntime, op->nbits, pn+0x2800000)? pn + 0x2800000 : 0;
  254. s |= rehash(op->midstate, op->m7, op->ntime, op->nbits, pn+0x2C00000)? pn + 0x2C00000 : 0;
  255. s |= rehash(op->midstate, op->m7, op->ntime, op->nbits, pn+0x400000) ? pn + 0x400000 : 0;
  256. if (s) {
  257. results[results_num++] = bswap_32(s);
  258. }
  259. }
  260. }
  261. d->results_n = results_num;
  262. memcpy(op, p, sizeof(struct bitfury_payload));
  263. memcpy(oldbuf, newbuf, 17 * 4);
  264. }
  265. cgsleep_ms(BITFURY_REFRESH_DELAY);
  266. }
  267. second_run = 1;
  268. return;
  269. }
  270. int libbitfury_readHashData(unsigned int *res) {
  271. return 0;
  272. }