forked from zcash/zcash
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Auto merge of zcash#1578 - daira:1570.tromp-equihash-with-libsodium-b…
…lake.2, r=daira 1570.tromp equihash with libsodium blake.2 Remove BLAKE2b implementation from Tromp Equihash solver, and address almost all of @str4d's review comments on zcash#1570. Supercedes zcash#1576. Signed-off-by: Daira Hopwood [email protected]
- Loading branch information
Showing
6 changed files
with
871 additions
and
12 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,98 @@ | ||
| // Equihash solver | ||
| // Copyright (c) 2016-2016 John Tromp, The Zcash developers | ||
|
|
||
| #include "sodium.h" | ||
| #ifdef __APPLE__ | ||
| #include "pow/tromp/osx_barrier.h" | ||
| #endif | ||
| #include "compat/endian.h" | ||
|
|
||
| #include <stdint.h> // for types uint32_t,uint64_t | ||
| #include <string.h> // for functions memset | ||
| #include <stdlib.h> // for function qsort | ||
|
|
||
| typedef uint32_t u32; | ||
| typedef unsigned char uchar; | ||
|
|
||
| // algorithm parameters, prefixed with W to reduce include file conflicts | ||
|
|
||
| #ifndef WN | ||
| #define WN 200 | ||
| #endif | ||
|
|
||
| #ifndef WK | ||
| #define WK 9 | ||
| #endif | ||
|
|
||
| #define NDIGITS (WK+1) | ||
| #define DIGITBITS (WN/(NDIGITS)) | ||
|
|
||
| static const u32 PROOFSIZE = 1<<WK; | ||
| static const u32 BASE = 1<<DIGITBITS; | ||
| static const u32 NHASHES = 2*BASE; | ||
| static const u32 HASHESPERBLAKE = 512/WN; | ||
| static const u32 HASHOUT = HASHESPERBLAKE*WN/8; | ||
|
|
||
| typedef u32 proof[PROOFSIZE]; | ||
|
|
||
|
|
||
| enum verify_code { POW_OK, POW_DUPLICATE, POW_OUT_OF_ORDER, POW_NONZERO_XOR }; | ||
| const char *errstr[] = { "OK", "duplicate index", "indices out of order", "nonzero xor" }; | ||
|
|
||
| void genhash(const crypto_generichash_blake2b_state *ctx, u32 idx, uchar *hash) { | ||
| crypto_generichash_blake2b_state state = *ctx; | ||
| u32 leb = htole32(idx / HASHESPERBLAKE); | ||
| crypto_generichash_blake2b_update(&state, (uchar *)&leb, sizeof(u32)); | ||
| uchar blakehash[HASHOUT]; | ||
| crypto_generichash_blake2b_final(&state, blakehash, HASHOUT); | ||
| memcpy(hash, blakehash + (idx % HASHESPERBLAKE) * WN/8, WN/8); | ||
| } | ||
|
|
||
| int verifyrec(const crypto_generichash_blake2b_state *ctx, u32 *indices, uchar *hash, int r) { | ||
| if (r == 0) { | ||
| genhash(ctx, *indices, hash); | ||
| return POW_OK; | ||
| } | ||
| u32 *indices1 = indices + (1 << (r-1)); | ||
| if (*indices >= *indices1) | ||
| return POW_OUT_OF_ORDER; | ||
| uchar hash0[WN/8], hash1[WN/8]; | ||
| int vrf0 = verifyrec(ctx, indices, hash0, r-1); | ||
| if (vrf0 != POW_OK) | ||
| return vrf0; | ||
| int vrf1 = verifyrec(ctx, indices1, hash1, r-1); | ||
| if (vrf1 != POW_OK) | ||
| return vrf1; | ||
| for (int i=0; i < WN/8; i++) | ||
| hash[i] = hash0[i] ^ hash1[i]; | ||
| int i, b = r * DIGITBITS; | ||
| for (i = 0; i < b/8; i++) | ||
| if (hash[i]) | ||
| return POW_NONZERO_XOR; | ||
| if ((b%8) && hash[i] >> (8-(b%8))) | ||
| return POW_NONZERO_XOR; | ||
| return POW_OK; | ||
| } | ||
|
|
||
| int compu32(const void *pa, const void *pb) { | ||
| u32 a = *(u32 *)pa, b = *(u32 *)pb; | ||
| return a<b ? -1 : a==b ? 0 : +1; | ||
| } | ||
|
|
||
| bool duped(proof prf) { | ||
| proof sortprf; | ||
| memcpy(sortprf, prf, sizeof(proof)); | ||
| qsort(sortprf, PROOFSIZE, sizeof(u32), &compu32); | ||
| for (u32 i=1; i<PROOFSIZE; i++) | ||
| if (sortprf[i] <= sortprf[i-1]) | ||
| return true; | ||
| return false; | ||
| } | ||
|
|
||
| // verify Wagner conditions | ||
| int verify(u32 indices[PROOFSIZE], const crypto_generichash_blake2b_state *ctx) { | ||
| if (duped(indices)) | ||
| return POW_DUPLICATE; | ||
| uchar hash[WN/8]; | ||
| return verifyrec(ctx, indices, hash, WK); | ||
| } |
Oops, something went wrong.