Re: Bitcoin challenge transaction: ~100 BTC total bounty to solvers!

#64

9000000000000000 - 900008c8cdbfc000
fe38B13505B26867 - fe38b4e9a9e18000
fe08b4e9a9e18000 - fe38b28c4dcdf000
f908b4e9a9e18000 - f908b83fef996800
e908b4e9a9e18000 - e908b8e3fd70a800
f200000000000000 - f20007dc504d4000
a0dea1390507f800 - a0decf332bc7f800
f4430518eaddc000 - f44309cb5f5dc000
d39b97986985a000 - d39bf99dea45a000
c89526398b87e000 - c895840b4507e000
de1df04147b1b000 - de1df13e0f31b000
e3ef4e58aa31b000 - e3efc87af531b000
cde0b6b3a7640000 - cde0c690b6a40000

This ranges are already scanned.

what do you use ? and what is your speed?

i try this and no luck yet

Code:

VanitySearch-1.15.2_bitcrack -stop -t 2 -r 500 -s 000000000000000000000000000000000000000000000000cdf0d690b6af0000 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN

VanitySearch-1.15.2_bitcrack uses non-sequential search, there are dips in the range
Vanity.cpp line 1530.

Code:

void VanitySearch::getGPUStartingKeys(int thId, int groupSize, int nbThread, Int *keys, Point *p, uint64_t *n_count) {
//printf("\n[gpu-rekey][Th#%u][gsize#%u][nbT#%u][%u] \n", thId, groupSize, nbThread, *n_count);
  for (int i = 0; i < nbThread; i++) {
   if (rekey > 0) {
   //keys[i].Rand(256);

keys[i].Set(&startKey);
Int off((uint64_t)i);
off.Mult((uint64_t)((rekey * 1000000) / nbThread));
off.Add((*n_count)*(rekey * 1000000));// <-- !!! The no Sequential search !!!
keys[i].Add(&off);
//printf("\n[rekey][i#%u][count#%u] 0x%064s \n", i, *n_count, keys[i].GetBase16().c_str());

I use the code Wink

and any rekey

Code:

void VanitySearch::getGPUStartingKeys(int thId, int groupSize, int nbThread, Int *keys, Point *p, uint64_t *n_count) {

for (int i = 0; i <= nbThread; i++) {
if (rekey > 0) {
// Sequential search (no dips)
rekey = nbThread;
// ;)
keys[i].Set(&startKey);
Int off((uint64_t)i);
off.ShiftL(20);
//off.Mult((uint64_t)((rekey * 1000000) / nbThread));
//off.Add((*n_count)*(rekey * 1000000));
if (*n_count != 0) keys[i].Add(((*n_count)*(rekey * 1048576) + 1048576));
keys[i].Add(&off);
// Check GPU Start Key
if (i < 5) printf("\n GPU Start Key %d: %s nbThread %d ", i, keys[i].GetBase16().c_str(), nbThread);
if (i == nbThread) printf("\n GPU Start Key %d: %s nbThread %d \n", i, keys[i].GetBase16().c_str(), nbThread);

}

Result

Code:

VSearch bit64 key range 0-100 percent v1.15
key from 0x8000000000000000 to 0xffffffffffffffff
Difficulty: 1461501637330902918203684832716283019655932542976
Search: 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN [Compressed]
Start Sat Dec 14 10:22:44 2019
Starting at PrivKey: 0x D000034800200000
Number of CPU thread: 0
GPU: GPU #0 Tesla P100-PCIE-16GB (56x64 cores) Grid(448x512)

GPU Start Key 0: D000034800200000 nbThread 229376
GPU Start Key 1: D000034800300000 nbThread 229376
GPU Start Key 2: D000034800400000 nbThread 229376
GPU Start Key 3: D000034800500000 nbThread 229376
GPU Start Key 4: D000034800600000 nbThread 229376
GPU Start Key 229376: D000038000200000 nbThread 229376
[save] 0x D000034800200000
[616.45 Mkey/s][GPU 616.45 Mkey/s][Total 2^37.81][Prob 0.0%][50% in 5.211e+31y][Found 0]
GPU Start Key 0: D000038000300000 nbThread 229376
GPU Start Key 1: D000038000400000 nbThread 229376
GPU Start Key 2: D000038000500000 nbThread 229376
GPU Start Key 3: D000038000600000 nbThread 229376
GPU Start Key 4: D000038000700000 nbThread 229376
GPU Start Key 229376: D00003B800300000 nbThread 229376
[save] 0x D000038000300000
[631.12 Mkey/s][GPU 631.12 Mkey/s][Total 2^38.29][Prob 0.0%][50% in 5.08984e+31y][Found 0]

This is little slow. I get much better speed with Bitcrack on rtx2080ti (about 1500 Mkeys).