Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
How to modify the current Baby-step-giant-step code to be able to compile on the current keyspace? I realize how long it will last and how much RAM will need.
with these declarations:
typedef struct hashtable_entry {
uint128_t x;
uint128_t exponent;
} hashtable_entry;
#define HASH_SIZE (2*GSTEP)
hashtable_entry table[HASH_SIZE];
using
#define GSTEP ((uint128_t)1<<32)
requires 256 Gb RAM !!!
to solve case #85, I assume that you need #define GSTEP ((uint128_t)1<<42)
that's 256*2*2*2*2*2*2*2*2*2*2 = 256 Tb RAM
