zec
/
librustzcash
mirror of https://github.com/zcash/librustzcash.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity
librustzcash/components/equihash/tromp/equi_miner.c

738 lines
22 KiB
C
Raw Blame History

// Equihash solver
// Copyright (c) 2016 John Tromp, The Zcash developers
// Fix N, K, such that n = N/(k+1) is integer
// Fix M = 2^{n+1} hashes each of length N bits,
// H_0, ... , H_{M-1}, generated from (n+1)-bit indices.
// Problem: find binary tree on 2^K distinct indices,
// for which the exclusive-or of leaf hashes is all 0s.
// Additionally, it should satisfy the Wagner conditions:
// for each height i subtree, the exclusive-or
// of its 2^i corresponding hashes starts with i*n 0 bits,
// and for i>0 the leftmost leaf of its left subtree
// is less than the leftmost leaf of its right subtree
// The algorithm below solves this by maintaining the trees
// in a graph of K layers, each split into buckets
// with buckets indexed by the first n-RESTBITS bits following
// the i*n 0s, each bucket having 4 * 2^RESTBITS slots,
// twice the number of subtrees expected to land there.
#ifndef ZCASH_POW_TROMP_EQUI_MINER_H
#define ZCASH_POW_TROMP_EQUI_MINER_H
#include "equi.h"
// Provides htole32() on macOS and Windows
#include "portable_endian.h"
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
typedef uint16_t u16;
typedef uint64_t u64;
#ifdef EQUIHASH_TROMP_ATOMIC
#include <stdatomic.h>
typedef atomic_uint au32;
#else
typedef u32 au32;
#endif
#ifndef RESTBITS
#define RESTBITS 8
#endif
// 2_log of number of buckets
#define BUCKBITS (DIGITBITS-RESTBITS)
#ifndef SAVEMEM
#if RESTBITS == 4
// can't save memory in such small buckets
#define SAVEMEM 1
#elif RESTBITS >= 8
// take advantage of law of large numbers (sum of 2^8 random numbers)
// this reduces (200,9) memory to under 144MB, with negligible discarding
#define SAVEMEM 9/14
#endif
#endif
// number of buckets
#define NBUCKETS (1<<BUCKBITS)
// 2_log of number of slots per bucket
#define SLOTBITS (RESTBITS+1+1)
#define SLOTRANGE (1<<SLOTBITS)
#ifdef SLOTDIFF
static const u32 SLOTMSB = 1<<(SLOTBITS-1);
#endif
// number of slots per bucket
#define NSLOTS (SLOTRANGE * SAVEMEM)
// number of per-xhash slots
#define XFULL 16
// SLOTBITS mask
static const u32 SLOTMASK = SLOTRANGE-1;
// number of possible values of xhash (rest of n) bits
#define NRESTS (1<<RESTBITS)
// number of blocks of hashes extracted from single 512 bit blake2b output
#define NBLOCKS ((NHASHES+HASHESPERBLAKE-1)/HASHESPERBLAKE)
// nothing larger found in 100000 runs
static const u32 MAXSOLS = 8;
// tree node identifying its children as two different slots in
// a bucket on previous layer with the same rest bits (x-tra hash)
struct tree {
u32 bid_s0_s1; // manual bitfields
};
typedef struct tree tree;
tree tree_from_idx(const u32 idx) {
tree t;
t.bid_s0_s1 = idx;
return t;
}
tree tree_from_bid(const u32 bid, const u32 s0, const u32 s1) {
tree t;
#ifdef SLOTDIFF
u32 ds10 = (s1 - s0) & SLOTMASK;
if (ds10 & SLOTMSB) {
bid_s0_s1 = (((bid << SLOTBITS) | s1) << (SLOTBITS-1)) | (SLOTMASK & ~ds10);
} else {
bid_s0_s1 = (((bid << SLOTBITS) | s0) << (SLOTBITS-1)) | (ds10 - 1);
}
#else
t.bid_s0_s1 = (((bid << SLOTBITS) | s0) << SLOTBITS) | s1;
#endif
return t;
}
u32 getindex(const tree *t) {
return t->bid_s0_s1;
}
u32 bucketid(const tree *t) {
#ifdef SLOTDIFF
return t->bid_s0_s1 >> (2 * SLOTBITS - 1);
#else
return t->bid_s0_s1 >> (2 * SLOTBITS);
#endif
}
u32 slotid0(const tree *t) {
#ifdef SLOTDIFF
return (t->bid_s0_s1 >> (SLOTBITS-1)) & SLOTMASK;
#else
return (t->bid_s0_s1 >> SLOTBITS) & SLOTMASK;
#endif
}
u32 slotid1(const tree *t) {
#ifdef SLOTDIFF
return (slotid0() + 1 + (t->bid_s0_s1 & (SLOTMASK>>1))) & SLOTMASK;
#else
return t->bid_s0_s1 & SLOTMASK;
#endif
}
union hashunit {
u32 word;
uchar bytes[sizeof(u32)];
};
typedef union hashunit hashunit;
#define WORDS(bits) ((bits + 31) / 32)
#define HASHWORDS0 WORDS(WN - DIGITBITS + RESTBITS)
#define HASHWORDS1 WORDS(WN - 2*DIGITBITS + RESTBITS)
struct slot0 {
tree attr;
hashunit hash[HASHWORDS0];
};
typedef struct slot0 slot0;
struct slot1 {
tree attr;
hashunit hash[HASHWORDS1];
};
typedef struct slot1 slot1;
// a bucket is NSLOTS treenodes
typedef slot0 bucket0[NSLOTS];
typedef slot1 bucket1[NSLOTS];
// the N-bit hash consists of K+1 n-bit "digits"
// each of which corresponds to a layer of NBUCKETS buckets
typedef bucket0 digit0[NBUCKETS];
typedef bucket1 digit1[NBUCKETS];
// size (in bytes) of hash in round 0 <= r < WK
u32 hashsize(const u32 r) {
const u32 hashbits = WN - (r+1) * DIGITBITS + RESTBITS;
return (hashbits + 7) / 8;
}
u32 hashwords(u32 bytes) {
return (bytes + 3) / 4;
}
// manages hash and tree data
struct htalloc {
u32 *heap0;
u32 *heap1;
bucket0 *trees0[(WK+1)/2];
bucket1 *trees1[WK/2];
u32 alloced;
};
typedef struct htalloc htalloc;
htalloc htalloc_new() {
htalloc hta;
hta.alloced = 0;
return hta;
}
void *htalloc_alloc(htalloc *hta, const u32 n, const u32 sz);
void alloctrees(htalloc *hta) {
// optimize xenoncat's fixed memory layout, avoiding any waste
// digit trees hashes trees hashes
// 0 0 A A A A A A . . . . . .
// 1 0 A A A A A A 1 B B B B B
// 2 0 2 C C C C C 1 B B B B B
// 3 0 2 C C C C C 1 3 D D D D
// 4 0 2 4 E E E E 1 3 D D D D
// 5 0 2 4 E E E E 1 3 5 F F F
// 6 0 2 4 6 . G G 1 3 5 F F F
// 7 0 2 4 6 . G G 1 3 5 7 H H
// 8 0 2 4 6 8 . I 1 3 5 7 H H
assert(DIGITBITS >= 16); // ensures hashes shorten by 1 unit every 2 digits
hta->heap0 = (u32 *)htalloc_alloc(hta, 1, sizeof(digit0));
hta->heap1 = (u32 *)htalloc_alloc(hta, 1, sizeof(digit1));
for (int r=0; r<WK; r++)
if ((r&1) == 0)
hta->trees0[r/2] = (bucket0 *)(hta->heap0 + r/2);
else
hta->trees1[r/2] = (bucket1 *)(hta->heap1 + r/2);
}
void dealloctrees(htalloc *hta) {
if (hta == NULL) {
return;
}
free(hta->heap0);
free(hta->heap1);
// Avoid use-after-free and double-free
hta->heap0 = NULL;
hta->heap1 = NULL;
for (int r=0; r<WK; r++)
if ((r&1) == 0)
hta->trees0[r/2] = NULL;
else
hta->trees1[r/2] = NULL;
hta->alloced = 0;
}
void *htalloc_alloc(htalloc *hta, const u32 n, const u32 sz) {
void *mem = calloc(n, sz);
assert(mem);
hta->alloced += n * sz;
return mem;
}
typedef au32 bsizes[NBUCKETS];
u32 minu32(const u32 a, const u32 b) {
return a < b ? a : b;
}
struct equi {
BLAKE2bState* blake_ctx;
blake2b_clone blake2b_clone;
blake2b_free blake2b_free;
blake2b_update blake2b_update;
blake2b_finalize blake2b_finalize;
htalloc hta;
bsizes *nslots; // PUT IN BUCKET STRUCT
proof *sols;
au32 nsols;
u32 xfull;
u32 hfull;
u32 bfull;
};
typedef struct equi equi;
void equi_clearslots(equi *eq);
equi *equi_new(
blake2b_clone blake2b_clone,
blake2b_free blake2b_free,
blake2b_update blake2b_update,
blake2b_finalize blake2b_finalize
) {
assert(sizeof(hashunit) == 4);
equi *eq = malloc(sizeof(equi));
eq->blake2b_clone = blake2b_clone;
eq->blake2b_free = blake2b_free;
eq->blake2b_update = blake2b_update;
eq->blake2b_finalize = blake2b_finalize;
alloctrees(&eq->hta);
eq->nslots = (bsizes *)htalloc_alloc(&eq->hta, 2 * NBUCKETS, sizeof(au32));
eq->sols = (proof *)htalloc_alloc(&eq->hta, MAXSOLS, sizeof(proof));
// C malloc() does not guarantee zero-initialized memory (but calloc() does)
eq->blake_ctx = NULL;
eq->nsols = 0;
equi_clearslots(eq);
return eq;
}
void equi_free(equi *eq) {
if (eq == NULL) {
return;
}
dealloctrees(&eq->hta);
free(eq->nslots);
free(eq->sols);
eq->blake2b_free(eq->blake_ctx);
// Avoid use-after-free and double-free
eq->nslots = NULL;
eq->sols = NULL;
eq->blake_ctx = NULL;
free(eq);
}
void equi_setstate(equi *eq, const BLAKE2bState *ctx) {
if (eq->blake_ctx) {
eq->blake2b_free(eq->blake_ctx);
}
eq->blake_ctx = eq->blake2b_clone(ctx);
memset(eq->nslots, 0, NBUCKETS * sizeof(au32)); // only nslots[0] needs zeroing
equi_clearslots(eq);
eq->nsols = 0;
}
void equi_clearslots(equi *eq) {
eq->xfull = eq->bfull = eq->hfull = 0;
}
u32 getslot(equi *eq, const u32 r, const u32 bucketi) {
#ifdef EQUIHASH_TROMP_ATOMIC
return std::atomic_fetch_add_explicit(&eq->nslots[r&1][bucketi], 1U, std::memory_order_relaxed);
#else
return eq->nslots[r&1][bucketi]++;
#endif
}
u32 getnslots(equi *eq, const u32 r, const u32 bid) { // SHOULD BE METHOD IN BUCKET STRUCT
au32 *nslot = &eq->nslots[r&1][bid];
const u32 n = minu32(*nslot, NSLOTS);
*nslot = 0;
return n;
}
void orderindices(u32 *indices, u32 size) {
if (indices[0] > indices[size]) {
for (u32 i=0; i < size; i++) {
const u32 tmp = indices[i];
indices[i] = indices[size+i];
indices[size+i] = tmp;
}
}
}
void listindices1(equi *eq, u32 r, const tree t, u32 *indices);
void listindices0(equi *eq, u32 r, const tree t, u32 *indices) {
if (r == 0) {
*indices = getindex(&t);
return;
}
const bucket1 *buck = &eq->hta.trees1[--r/2][bucketid(&t)];
const u32 size = 1 << r;
u32 *indices1 = indices + size;
listindices1(eq, r, (*buck)[slotid0(&t)].attr, indices);
listindices1(eq, r, (*buck)[slotid1(&t)].attr, indices1);
orderindices(indices, size);
}
void listindices1(equi *eq, u32 r, const tree t, u32 *indices) {
const bucket0 *buck = &eq->hta.trees0[--r/2][bucketid(&t)];
const u32 size = 1 << r;
u32 *indices1 = indices + size;
listindices0(eq, r, (*buck)[slotid0(&t)].attr, indices);
listindices0(eq, r, (*buck)[slotid1(&t)].attr, indices1);
orderindices(indices, size);
}
void candidate(equi *eq, const tree t) {
proof prf;
listindices1(eq, WK, t, prf); // assume WK odd
qsort(prf, PROOFSIZE, sizeof(u32), &compu32);
for (u32 i=1; i<PROOFSIZE; i++)
if (prf[i] <= prf[i-1]) {
/*
printf(
"failed dup indexes check: wanted: proof[%d] > proof[%d], actual: %d <= %d\n",
i, i-1, prf[i], prf[i-1]
);
*/
return;
}
#ifdef EQUIHASH_TROMP_ATOMIC
u32 soli = std::atomic_fetch_add_explicit(&eq->nsols, 1U, std::memory_order_relaxed);
#else
u32 soli = eq->nsols++;
#endif
if (soli < MAXSOLS)
listindices1(eq, WK, t, eq->sols[soli]); // assume WK odd
}
#ifdef EQUIHASH_SHOW_BUCKET_SIZES
void showbsizes(equi *eq, u32 r) {
#if defined(HIST) || defined(SPARK) || defined(LOGSPARK)
u32 binsizes[65];
memset(binsizes, 0, 65 * sizeof(u32));
for (u32 bucketid = 0; bucketid < NBUCKETS; bucketid++) {
u32 bsize = minu32(eq->nslots[r&1][bucketid], NSLOTS) >> (SLOTBITS-6);
binsizes[bsize]++;
}
for (u32 i=0; i < 65; i++) {
#ifdef HIST
// printf(" %d:%d", i, binsizes[i]);
#else
#ifdef SPARK
u32 sparks = binsizes[i] / SPARKSCALE;
#else
u32 sparks = 0;
for (u32 bs = binsizes[i]; bs; bs >>= 1) sparks++;
sparks = sparks * 7 / SPARKSCALE;
#endif
// printf("\342\226%c", '\201' + sparks);
#endif
}
// printf("\n");
#endif
}
#endif
struct htlayout {
htalloc hta;
u32 prevhashunits;
u32 nexthashunits;
u32 dunits;
u32 prevbo;
u32 nextbo;
};
typedef struct htlayout htlayout;
htlayout htlayout_new(equi *eq, u32 r) {
htlayout htl;
htl.hta = eq->hta;
htl.prevhashunits = 0;
htl.dunits = 0;
u32 nexthashbytes = hashsize(r);
htl.nexthashunits = hashwords(nexthashbytes);
htl.prevbo = 0;
htl.nextbo = htl.nexthashunits * sizeof(hashunit) - nexthashbytes; // 0-3
if (r) {
u32 prevhashbytes = hashsize(r-1);
htl.prevhashunits = hashwords(prevhashbytes);
htl.prevbo = htl.prevhashunits * sizeof(hashunit) - prevhashbytes; // 0-3
htl.dunits = htl.prevhashunits - htl.nexthashunits;
}
return htl;
}
u32 getxhash0(const htlayout *htl, const slot0* pslot) {
#if WN == 200 && RESTBITS == 4
return pslot->hash->bytes[htl->prevbo] >> 4;
#elif WN == 200 && RESTBITS == 8
return (pslot->hash->bytes[htl->prevbo] & 0xf) << 4 | pslot->hash->bytes[htl->prevbo+1] >> 4;
#elif WN == 200 && RESTBITS == 9
return (pslot->hash->bytes[htl->prevbo] & 0x1f) << 4 | pslot->hash->bytes[htl->prevbo+1] >> 4;
#elif WN == 144 && RESTBITS == 4
return pslot->hash->bytes[htl->prevbo] & 0xf;
#else
#error non implemented
#endif
}
u32 getxhash1(const htlayout *htl, const slot1* pslot) {
#if WN == 200 && RESTBITS == 4
return pslot->hash->bytes[htl->prevbo] & 0xf;
#elif WN == 200 && RESTBITS == 8
return pslot->hash->bytes[htl->prevbo];
#elif WN == 200 && RESTBITS == 9
return (pslot->hash->bytes[htl->prevbo]&1) << 8 | pslot->hash->bytes[htl->prevbo+1];
#elif WN == 144 && RESTBITS == 4
return pslot->hash->bytes[htl->prevbo] & 0xf;
#else
#error non implemented
#endif
}
bool htlayout_equal(const htlayout *htl, const hashunit *hash0, const hashunit *hash1) {
return hash0[htl->prevhashunits-1].word == hash1[htl->prevhashunits-1].word;
}
#if RESTBITS <= 6
typedef uchar xslot;
#else
typedef u16 xslot;
#endif
struct collisiondata {
#ifdef XBITMAP
#if NSLOTS > 64
#error cant use XBITMAP with more than 64 slots
#endif
u64 xhashmap[NRESTS];
u64 xmap;
#else
xslot nxhashslots[NRESTS];
xslot xhashslots[NRESTS][XFULL];
xslot *xx;
u32 n0;
u32 n1;
#endif
u32 s0;
};
typedef struct collisiondata collisiondata;
void collisiondata_clear(collisiondata *cd) {
#ifdef XBITMAP
memset(cd->xhashmap, 0, NRESTS * sizeof(u64));
#else
memset(cd->nxhashslots, 0, NRESTS * sizeof(xslot));
#endif
}
bool addslot(collisiondata *cd, u32 s1, u32 xh) {
#ifdef XBITMAP
xmap = xhashmap[xh];
xhashmap[xh] |= (u64)1 << s1;
s0 = -1;
return true;
#else
cd->n1 = (u32)cd->nxhashslots[xh]++;
if (cd->n1 >= XFULL)
return false;
cd->xx = cd->xhashslots[xh];
cd->xx[cd->n1] = s1;
cd->n0 = 0;
return true;
#endif
}
bool nextcollision(const collisiondata *cd) {
#ifdef XBITMAP
return cd->xmap != 0;
#else
return cd->n0 < cd->n1;
#endif
}
u32 slot(collisiondata *cd) {
#ifdef XBITMAP
const u32 ffs = __builtin_ffsll(cd->xmap);
s0 += ffs; cd->xmap >>= ffs;
return s0;
#else
return (u32)cd->xx[cd->n0++];
#endif
}
void equi_digit0(equi *eq, const u32 id) {
uchar hash[HASHOUT];
BLAKE2bState* state;
htlayout htl = htlayout_new(eq, 0);
const u32 hashbytes = hashsize(0);
for (u32 block = id; block < NBLOCKS; block++) {
state = eq->blake2b_clone(eq->blake_ctx);
u32 leb = htole32(block);
eq->blake2b_update(state, (uchar *)&leb, sizeof(u32));
eq->blake2b_finalize(state, hash, HASHOUT);
eq->blake2b_free(state);
// Avoid use-after-free and double-free
state = NULL;
for (u32 i = 0; i<HASHESPERBLAKE; i++) {
const uchar *ph = hash + i * WN/8;
#if BUCKBITS == 16 && RESTBITS == 4
const u32 bucketid = ((u32)ph[0] << 8) | ph[1];
#elif BUCKBITS == 12 && RESTBITS == 8
const u32 bucketid = ((u32)ph[0] << 4) | ph[1] >> 4;
#elif BUCKBITS == 11 && RESTBITS == 9
const u32 bucketid = ((u32)ph[0] << 3) | ph[1] >> 5;
#elif BUCKBITS == 20 && RESTBITS == 4
const u32 bucketid = ((((u32)ph[0] << 8) | ph[1]) << 4) | ph[2] >> 4;
#elif BUCKBITS == 12 && RESTBITS == 4
const u32 bucketid = ((u32)ph[0] << 4) | ph[1] >> 4;
const u32 xhash = ph[1] & 0xf;
#else
#error not implemented
#endif
const u32 slot = getslot(eq, 0, bucketid);
if (slot >= NSLOTS) {
eq->bfull++;
continue;
}
slot0 *s = &eq->hta.trees0[0][bucketid][slot];
s->attr = tree_from_idx(block * HASHESPERBLAKE + i);
memcpy(s->hash->bytes+htl.nextbo, ph+WN/8-hashbytes, hashbytes);
}
}
}
void equi_digitodd(equi *eq, const u32 r, const u32 id) {
htlayout htl = htlayout_new(eq, r);
collisiondata cd;
for (u32 bucketid=id; bucketid < NBUCKETS; bucketid++) {
collisiondata_clear(&cd);
slot0 *buck = htl.hta.trees0[(r-1)/2][bucketid]; // optimize by updating previous buck?!
u32 bsize = getnslots(eq, r-1, bucketid); // optimize by putting bucketsize with block?!
for (u32 s1 = 0; s1 < bsize; s1++) {
const slot0 *pslot1 = buck + s1; // optimize by updating previous pslot1?!
if (!addslot(&cd, s1, getxhash0(&htl, pslot1))) {
eq->xfull++;
continue;
}
for (; nextcollision(&cd); ) {
const u32 s0 = slot(&cd);
const slot0 *pslot0 = buck + s0;
if (htlayout_equal(&htl, pslot0->hash, pslot1->hash)) {
eq->hfull++;
continue;
}
u32 xorbucketid;
const uchar *bytes0 = pslot0->hash->bytes, *bytes1 = pslot1->hash->bytes;
#if WN == 200 && BUCKBITS == 12 && RESTBITS == 8
xorbucketid = (((u32)(bytes0[htl.prevbo+1] ^ bytes1[htl.prevbo+1]) & 0xf) << 8)
| (bytes0[htl.prevbo+2] ^ bytes1[htl.prevbo+2]);
#elif WN == 200 && BUCKBITS == 11 && RESTBITS == 9
xorbucketid = (((u32)(bytes0[htl.prevbo+1] ^ bytes1[htl.prevbo+1]) & 0xf) << 7)
| (bytes0[htl.prevbo+2] ^ bytes1[htl.prevbo+2]) >> 1;
#elif WN == 144 && BUCKBITS == 20 && RESTBITS == 4
xorbucketid = ((((u32)(bytes0[htl.prevbo+1] ^ bytes1[htl.prevbo+1]) << 8)
| (bytes0[htl.prevbo+2] ^ bytes1[htl.prevbo+2])) << 4)
| (bytes0[htl.prevbo+3] ^ bytes1[htl.prevbo+3]) >> 4;
#elif WN == 96 && BUCKBITS == 12 && RESTBITS == 4
xorbucketid = ((u32)(bytes0[htl.prevbo+1] ^ bytes1[htl.prevbo+1]) << 4)
| (bytes0[htl.prevbo+2] ^ bytes1[htl.prevbo+2]) >> 4;
#else
#error not implemented
#endif
const u32 xorslot = getslot(eq, r, xorbucketid);
if (xorslot >= NSLOTS) {
eq->bfull++;
continue;
}
slot1 *xs = &htl.hta.trees1[r/2][xorbucketid][xorslot];
xs->attr = tree_from_bid(bucketid, s0, s1);
for (u32 i=htl.dunits; i < htl.prevhashunits; i++)
xs->hash[i-htl.dunits].word = pslot0->hash[i].word ^ pslot1->hash[i].word;
}
}
}
}
void equi_digiteven(equi *eq, const u32 r, const u32 id) {
htlayout htl = htlayout_new(eq, r);
collisiondata cd;
for (u32 bucketid=id; bucketid < NBUCKETS; bucketid++) {
collisiondata_clear(&cd);
slot1 *buck = htl.hta.trees1[(r-1)/2][bucketid]; // OPTIMIZE BY UPDATING PREVIOUS
u32 bsize = getnslots(eq, r-1, bucketid);
for (u32 s1 = 0; s1 < bsize; s1++) {
const slot1 *pslot1 = buck + s1; // OPTIMIZE BY UPDATING PREVIOUS
if (!addslot(&cd, s1, getxhash1(&htl, pslot1))) {
eq->xfull++;
continue;
}
for (; nextcollision(&cd); ) {
const u32 s0 = slot(&cd);
const slot1 *pslot0 = buck + s0;
if (htlayout_equal(&htl, pslot0->hash, pslot1->hash)) {
eq->hfull++;
continue;
}
u32 xorbucketid;
const uchar *bytes0 = pslot0->hash->bytes, *bytes1 = pslot1->hash->bytes;
#if WN == 200 && BUCKBITS == 12 && RESTBITS == 8
xorbucketid = ((u32)(bytes0[htl.prevbo+1] ^ bytes1[htl.prevbo+1]) << 4)
| (bytes0[htl.prevbo+2] ^ bytes1[htl.prevbo+2]) >> 4;
#elif WN == 200 && BUCKBITS == 11 && RESTBITS == 9
xorbucketid = ((u32)(bytes0[htl.prevbo+2] ^ bytes1[htl.prevbo+2]) << 3)
| (bytes0[htl.prevbo+3] ^ bytes1[htl.prevbo+3]) >> 5;
#elif WN == 144 && BUCKBITS == 20 && RESTBITS == 4
xorbucketid = ((((u32)(bytes0[htl.prevbo+1] ^ bytes1[htl.prevbo+1]) << 8)
| (bytes0[htl.prevbo+2] ^ bytes1[htl.prevbo+2])) << 4)
| (bytes0[htl.prevbo+3] ^ bytes1[htl.prevbo+3]) >> 4;
#elif WN == 96 && BUCKBITS == 12 && RESTBITS == 4
xorbucketid = ((u32)(bytes0[htl.prevbo+1] ^ bytes1[htl.prevbo+1]) << 4)
| (bytes0[htl.prevbo+2] ^ bytes1[htl.prevbo+2]) >> 4;
#else
#error not implemented
#endif
const u32 xorslot = getslot(eq, r, xorbucketid);
if (xorslot >= NSLOTS) {
eq->bfull++;
continue;
}
slot0 *xs = &htl.hta.trees0[r/2][xorbucketid][xorslot];
xs->attr = tree_from_bid(bucketid, s0, s1);
for (u32 i=htl.dunits; i < htl.prevhashunits; i++)
xs->hash[i-htl.dunits].word = pslot0->hash[i].word ^ pslot1->hash[i].word;
}
}
}
}
void equi_digitK(equi *eq, const u32 id) {
collisiondata cd;
htlayout htl = htlayout_new(eq, WK);
u32 nc = 0;
for (u32 bucketid = id; bucketid < NBUCKETS; bucketid++) {
collisiondata_clear(&cd);
slot0 *buck = htl.hta.trees0[(WK-1)/2][bucketid];
u32 bsize = getnslots(eq, WK-1, bucketid);
for (u32 s1 = 0; s1 < bsize; s1++) {
const slot0 *pslot1 = buck + s1;
if (!addslot(&cd, s1, getxhash0(&htl, pslot1))) // assume WK odd
continue;
for (; nextcollision(&cd); ) {
const u32 s0 = slot(&cd);
if (htlayout_equal(&htl, buck[s0].hash, pslot1->hash))
nc++, candidate(eq, tree_from_bid(bucketid, s0, s1));
}
}
}
//printf(" %d candidates\n", nc);
}
size_t equi_nsols(const equi *eq) {
return eq->nsols;
}
proof *equi_sols(const equi *eq) {
return eq->sols;
}
typedef struct {
u32 id;
equi *eq;
} thread_ctx;
void *worker(void *vp) {
thread_ctx *tp = (thread_ctx *)vp;
equi *eq = tp->eq;
// if (tp->id == 0)
// printf("Digit 0\n");
if (tp->id == 0) {
equi_clearslots(eq);
}
equi_digit0(eq, tp->id);
if (tp->id == 0) {
equi_clearslots(eq);
#ifdef EQUIHASH_SHOW_BUCKET_SIZES
showbsizes(eq, 0);
#endif
}
for (u32 r = 1; r < WK; r++) {
// if (tp->id == 0)
// printf("Digit %d", r);
r&1 ? equi_digitodd(eq, r, tp->id) : equi_digiteven(eq, r, tp->id);
if (tp->id == 0) {
// printf(" x%d b%d h%d\n", eq->xfull, eq->bfull, eq->hfull);
equi_clearslots(eq);
#ifdef EQUIHASH_SHOW_BUCKET_SIZES
showbsizes(eq, r);
#endif
}
}
// if (tp->id == 0)
// printf("Digit %d\n", WK);
equi_digitK(eq, tp->id);
return 0;
}
#endif // ZCASH_POW_TROMP_EQUI_MINER_H
Reference in New Issue View Git Blame Copy Permalink