Search content
Sort by
Showing 5 of 5 results by Katamarani
Re: Bitcoin challenge transaction: ~100 BTC total bounty to solvers!
Katamarani what settings are you using to get 1500 have a 2080ti and 1250-1300 is the highest I have gotten.
Also if you have a 2080ti you should join the pool. Would love your contribution.
http://www.ttdsales.com/64bit/
Also if you have a 2080ti you should join the pool. Would love your contribution.
http://www.ttdsales.com/64bit/
Hi ttdclient. Sorry I was very vague. I think I have the same like 1300. Was wild guess from memory. You have a nice project but unfortunately I will not join because I don't like wasting energy and I don't think the money can be split fair.
Make it donation to good cause and I would join.
But better make Pollard kangaroo to go for 110. I think it is more feasible.
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.
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());
//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
and any rekeyCode:
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);
}
Resultfor (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);
}
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]
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).
Re: Bitcoin challenge transaction: ~100 BTC total bounty to solvers!
I also sell Pollard Kangaroo.
Test me please with 85 bit key.
Test me please with 85 bit key.
What is the fee?
Test Address 85 bit
Public Key : 0322d1b4a9af22c3529d7e0822673386165ea71cd6d339ccd019afa5cecdf1f015
Compress Address: 1N4Nma9JLgtZ9Ju7R8Dida1JNSU9U8h1LJ
How much will it take?
Can you please check in python 2 and write:
import math
math.log(, 2)
and check that it is 84.xxx?
edit: Your public key does not seem to be 85 bit.
The forum moderators here are not very competent so I will leave.
Zielar, if you want to team up and share 50%/50% please leave your contact details public somwhere here. Thank you.
Address : 1N4Nma9JLgtZ9Ju7R8Dida1JNSU9U8h1LJ
Public Key : 0322d1b4a9af22c3529d7e0822673386165ea71cd6d339ccd019afa5cecdf1f015
Hex : 1d00fabe494734927bcb87
Decimal : 35063474166411505082026887
Private Key : KwDiBf89QgGbjEhKnhXJuH7LrciVrZmdZmWBWvnWDoE5Du2J4Ajf
85 bit?
Yes sorry my program sucks big time. Sorry for bothering.
Re: Bitcoin challenge transaction: ~100 BTC total bounty to solvers!
I also sell Pollard Kangaroo.
Test me please with 85 bit key.
Test me please with 85 bit key.
What is the fee?
Test Address 85 bit
Public Key : 0322d1b4a9af22c3529d7e0822673386165ea71cd6d339ccd019afa5cecdf1f015
Compress Address: 1N4Nma9JLgtZ9Ju7R8Dida1JNSU9U8h1LJ
How much will it take?
Can you please check in python 2 and write:
import math
math.log(, 2)
and check that it is 84.xxx?
edit: Your public key does not seem to be 85 bit.
The forum moderators here are not very competent so I will leave.
Zielar, if you want to team up and share 50%/50% please leave your contact details public somwhere here. Thank you.
Re: Bitcoin challenge transaction: ~100 BTC total bounty to solvers!
Code:
p = 11470374874925275658116663507232161402086650258453896274534991676898999262641581519101074740642369848233294239851519212341844337347119899874391456329785623
q = 335062023296420808191071248367701059461
j = 34233586850807404623475048381328686211071196701374230492615844865929237417097514638999377942356150481334217896204702
g = 117483621780776948851322623152941329604983290852776470044816799968190986256316556722568523187517506040883960831402919848784195399671137064998190231834559
y = 10709965516783081490573356698184657992418098658871683731914897364288781862793359484228879297315128529085240057591857301471581217507082588896460650496983734
z = 224029434095732291724690823
a = 0
b = (q-1)/z
def f(y):
return pow(2, (y % k))
print 'a',a
print 'b',b
global k
k = 20
print 'k is set to %d' % k
q = 335062023296420808191071248367701059461
j = 34233586850807404623475048381328686211071196701374230492615844865929237417097514638999377942356150481334217896204702
g = 117483621780776948851322623152941329604983290852776470044816799968190986256316556722568523187517506040883960831402919848784195399671137064998190231834559
y = 10709965516783081490573356698184657992418098658871683731914897364288781862793359484228879297315128529085240057591857301471581217507082588896460650496983734
z = 224029434095732291724690823
a = 0
b = (q-1)/z
def f(y):
return pow(2, (y % k))
print 'a',a
print 'b',b
global k
k = 20
print 'k is set to %d' % k
this is the beginning of an example of implementing kangaros polard ...
Wanting to understand and test it on the empty wallet with 2 ^ 65 to which we know the public key (x, y) how to get the target which is the private key ... in this example all values are in DEC ... I did not want to wake up before testing, but since I'm starting to make an idiot of myself by asking questions so little clear that when I read, I do not understand them myself - I've given above what I mean :-)
https://gist.github.com/natmchugh/7dbd7e4f7c55d915db1e
Drotika is the best but not free
drotika can't even solve the easy tests from the users here. you and drotika are the same person?