Topic: [ARCHIVE] Bitcoin challenge discusion - page 3. (Read 28991 times)
2.5 gigabytes of public keys. Before starting the search, need to know how many bits are in the key. Or did the author collect all known public keys with a balance or invented them myself?And the keys are most likely changed. If you find a private key with 500 bitcoins, why do you share with someone? kangaroo work with only one key. And in what space look for a key? 0-256 bits?no one gpu kangaroo can no scan all 256 bits.scam.
I wish I had the ability to solve it. It's a very exciting competition. But not everyone is a software developer. Blockchain presents a new world. I'm late to learn software. I want to start again with a thrill. A small draw would be easier for me: d
For the "Secp256k1 PRO" project, CUDA software is suitable. I know that Russian guys have Pollard-kangaroo-GPU. -snip-
What you wrote is not proof. This is your opinion and assumption.
What you wrote is not proof. This is your opinion and assumption.
I like your way. You asked me why, I answered with the arguments. If you have another opinion, you are welcome to share it here.
If you are ready to find private key to one of that 144million pubkeys, you are also can do it. I just told to be careful in this, and explained that it is a hidden scam.
I have another opinion and assumption that you are (BiThemis) and the auhor of that project (Secp256k1PRO) is the same person just with different user names here. But of course this is only assumption. Why? It is strange that you have only 2 posts, both these posts were made today with the questions to me. You are like the advocate of that hidden scam project.
Please also be polite, and if you want to discuss something - discuss. But not just say "this is not proof", and "this is your opinion". I know that it is my opinion, thank you
You said nothing new to me. You can also use Pollard's kangaroo algorithm in a new puzzle where for one private key found you get one BTC coin.
Reward: 1 PRIVKEY = 1 BTC // of 144,000,000 PUBKEY
Search for private keys from a large list of compressed public keys.
The number is: 144 million public keys.
The most effective private key search tool is the Pollard's kangaroo algorithm.
-snip-
Reward: 1 PRIVKEY = 1 BTC // of 144,000,000 PUBKEY
Search for private keys from a large list of compressed public keys.
The number is: 144 million public keys.
The most effective private key search tool is the Pollard's kangaroo algorithm.
-snip-
Please be careful with this. As bounty0z already said, this is hidden scam. The details I described in his main topic:
https://bitcointalksearch.org/topic/m.53360293
BiThemis, I made the answer with the arguments in his main topic. The answer is logic and written in step by step way.
No reason to pay 1BTC for the 0 balance address. Also there is no the source address details as well as the signed message by that address (because the source address is the target address known only by the author).
You can also use Pollard's kangaroo algorithm in a new puzzle where for one private key found you get one BTC coin.
Reward: 1 PRIVKEY = 1 BTC // of 144,000,000 PUBKEY
Search for private keys from a large list of compressed public keys.
The number is: 144 million public keys.
The most effective private key search tool is the Pollard's kangaroo algorithm.
-snip-
Reward: 1 PRIVKEY = 1 BTC // of 144,000,000 PUBKEY
Search for private keys from a large list of compressed public keys.
The number is: 144 million public keys.
The most effective private key search tool is the Pollard's kangaroo algorithm.
-snip-
Please be careful with this. As bounty0z already said, this is hidden scam. The details I described in his main topic:
https://bitcointalksearch.org/topic/m.53360293
BiThemis, I made the answer with the arguments in his main topic. The answer is logic and written in step by step way.
No reason to pay 1BTC for the 0 balance address. Also there is no the source address details as well as the signed message by that address (because the source address is the target address known only by the author).
You can also use Pollard's kangaroo algorithm in a new puzzle where for one private key found you get one BTC coin.
Reward: 1 PRIVKEY = 1 BTC // of 144,000,000 PUBKEY
Search for private keys from a large list of compressed public keys.
The number is: 144 million public keys.
The most effective private key search tool is the Pollard's kangaroo algorithm.
-snip-
Reward: 1 PRIVKEY = 1 BTC // of 144,000,000 PUBKEY
Search for private keys from a large list of compressed public keys.
The number is: 144 million public keys.
The most effective private key search tool is the Pollard's kangaroo algorithm.
-snip-
Please be careful with this. As bounty0z already said, this is hidden scam. The details I described in his main topic:
https://bitcointalksearch.org/topic/m.53360293
You can also use Pollard's kangaroo algorithm in a new puzzle where for one private key found you get one BTC coin.
Reward: 1 PRIVKEY = 1 BTC // of 144,000,000 PUBKEY
Search for private keys from a large list of compressed public keys.
The number is: 144 million public keys.
The most effective private key search tool is the Pollard's kangaroo algorithm.
-snip-
Reward: 1 PRIVKEY = 1 BTC // of 144,000,000 PUBKEY
Search for private keys from a large list of compressed public keys.
The number is: 144 million public keys.
The most effective private key search tool is the Pollard's kangaroo algorithm.
-snip-
Please be careful with this. As bounty0z already said, this is hidden scam. The details I described in his main topic:
https://bitcointalksearch.org/topic/m.53360293
You can also use Pollard's kangaroo algorithm in a new puzzle where for one private key found you get one BTC coin.
Reward: 1 PRIVKEY = 1 BTC // of 144,000,000 PUBKEY
Search for private keys from a large list of compressed public keys.
The number is: 144 million public keys.
The most effective private key search tool is the Pollard's kangaroo algorithm.
Open source:
https://github.com/Telariust/vs-kangaroo
https://github.com/Telariust/pollard-kangaroo
https://github.com/Telariust/pollard-kangaroo-c99
Contact with the sender of coins: [email protected]
Official website: https://secp256k1.pro
Discussion: https://bitcointalksearch.org/topic/secp256k1-pro-project-for-the-search-for-private-key-collisions-5209950
Reward: 1 PRIVKEY = 1 BTC // of 144,000,000 PUBKEY
Search for private keys from a large list of compressed public keys.
The number is: 144 million public keys.
The most effective private key search tool is the Pollard's kangaroo algorithm.
Open source:
https://github.com/Telariust/vs-kangaroo
https://github.com/Telariust/pollard-kangaroo
https://github.com/Telariust/pollard-kangaroo-c99
Contact with the sender of coins: [email protected]
Official website: https://secp256k1.pro
Discussion: https://bitcointalksearch.org/topic/secp256k1-pro-project-for-the-search-for-private-key-collisions-5209950
pollard kangoroo if you see the statistics, he need more than 600year to find the private key of wallet 100bit if you use 1core i5
Thats why lot of membres here ask for GPU pollard kangoroo code, if you use 3 gpu you may find the key of wallet 110 in just 90day.
Ah I checked your website, so you are asking to find one of your 144M key and reward of 1BTC for any key founded right ? but first you have to say what bit is those public key !! that make pollard kangaroo find it. and between this called hidden scam, because those 144M key even if they are empty wallets !! but they are point doubling of reel public key with hugh amount of BTC.
but don't worry I though no one will waste time to find your private key because all membres here are smart and know lot about how elliptic curve work.
You can also use Pollard's kangaroo algorithm in a new puzzle where for one private key found you get one BTC coin.
Reward: 1 PRIVKEY = 1 BTC // of 144,000,000 PUBKEY
Search for private keys from a large list of compressed public keys.
The number is: 144 million public keys.
The most effective private key search tool is the Pollard's kangaroo algorithm.
Open source:
https://github.com/Telariust/vs-kangaroo
https://github.com/Telariust/pollard-kangaroo
https://github.com/Telariust/pollard-kangaroo-c99
Contact with the sender of coins: [email protected]
Official website: https://secp256k1.pro
Discussion: https://bitcointalksearch.org/topic/secp256k1-pro-project-for-the-search-for-private-key-collisions-5209950
Reward: 1 PRIVKEY = 1 BTC // of 144,000,000 PUBKEY
Search for private keys from a large list of compressed public keys.
The number is: 144 million public keys.
The most effective private key search tool is the Pollard's kangaroo algorithm.
Open source:
https://github.com/Telariust/vs-kangaroo
https://github.com/Telariust/pollard-kangaroo
https://github.com/Telariust/pollard-kangaroo-c99
Contact with the sender of coins: [email protected]
Official website: https://secp256k1.pro
Discussion: https://bitcointalksearch.org/topic/secp256k1-pro-project-for-the-search-for-private-key-collisions-5209950
wow, zielar started scanning again, that's some serious hardware he is allocating to the challenge 👍
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.
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/
#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).
hi alek76, you hold a compiled version of that to test for me.
would appreciate it, and anyway do appreciate the info you share here with us.
great work man.
go math,
and greets
would appreciate it, and anyway do appreciate the info you share here with us.
great work man.
go math,
and greets
any link to download VanitySearch-1.15.2_bitcrack for ubuntu ? i just find this link which is .exe :
https://github.com/brichard19/BitCrack/files/3514377/VanitySearch-1.15.2_bitcrack_prototype.zip
https://github.com/brichard19/BitCrack/files/3514377/VanitySearch-1.15.2_bitcrack_prototype.zip
#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]
On a my GTX 1050ti on Ubuntu 16.04, after 3 month of development work, i get 105 Mkey/s with -p 512 and 112 MKey/sec with -p 768.
I get 125 MKey/sec when the program run with nvprof but I don't know why for the moment... it's +50% from 83 MKey/sec and +100% from 64 MKey/sec !
I get 125 MKey/sec when the program run with nvprof but I don't know why for the moment... it's +50% from 83 MKey/sec and +100% from 64 MKey/sec !
Table update with bitcrack key/rate per sec:
Code:
1. RTX 2080ti 1,200-1,300 Mkey/sec (price $1,200-1,500)
2. RTX 2080 810 Mkey/s | 300 Mkey/s (2M addresses)
3. GTX 2070ti 805 Mkey/sec
4. RTX 2060 620 Mkey/sec
5. GTX 1080ti 345 Mkey/sec (price $700-1,000)
6. Tesla K80 250 Mkey/sec | 100 Mkes/s (2M addresses)
7. GTX 1080 130 Mkey/sec (price $500)
8. GTX 1070ti 100 Mkey/sec
9. GTX 1070 80-90 Mkey/sec (price $450-550)
10. GTX 1060 69 Mkey/sec
11. GTX 1050ti 64 Mkey/sec (price $150-200)
12. GTX 980 70-80 Mkey/sec
13. GTX 770(2Gb) 120 MKey/sec
14. GTX 680 109 Mkey/sec (price $150)
15. GT 640 9 Mkey/sec
16. RX 480 107 Mkey/sec (price $130-150)
17. RX 470 105 Mkey/sec (price $150-300)
18. RX 580 89 Mkey/sec (price $200-250)
19. RX 560 50 Mkey/sec (price $100-150)
20. R9 280/290x 20 Mkey/sec (price $50)
2. RTX 2080 810 Mkey/s | 300 Mkey/s (2M addresses)
3. GTX 2070ti 805 Mkey/sec
4. RTX 2060 620 Mkey/sec
5. GTX 1080ti 345 Mkey/sec (price $700-1,000)
6. Tesla K80 250 Mkey/sec | 100 Mkes/s (2M addresses)
7. GTX 1080 130 Mkey/sec (price $500)
8. GTX 1070ti 100 Mkey/sec
9. GTX 1070 80-90 Mkey/sec (price $450-550)
10. GTX 1060 69 Mkey/sec
11. GTX 1050ti 64 Mkey/sec (price $150-200)
12. GTX 980 70-80 Mkey/sec
13. GTX 770(2Gb) 120 MKey/sec
14. GTX 680 109 Mkey/sec (price $150)
15. GT 640 9 Mkey/sec
16. RX 480 107 Mkey/sec (price $130-150)
17. RX 470 105 Mkey/sec (price $150-300)
18. RX 580 89 Mkey/sec (price $200-250)
19. RX 560 50 Mkey/sec (price $100-150)
20. R9 280/290x 20 Mkey/sec (price $50)
For Nvidia GTX 1050Ti (4gb) on Ubuntu 16.04 and Cuda 10.1, with the parameters that you can find on this topic (-b 500 -t 128 -p 128) you can get 69 MKey/sec with 15 targets.
Why 15 ? Because it's the limit in bitcrack between classic comparison and bloom filter to find adresses.
With the parameters : -b 300 -t 128 -p 512 -> 83 mKey/sec.
Blocks must be a multiple of Streaming Multiprocessors (SM) count.
Threads must be a multiple of 32. The true count in each SM is better...
GTX 1050Ti have 6 SM with 4 units of 32 ROPs -> 6*4*32 = 768 cuda core !
mine spent electricity will cost more than a reward. 
I have a 6kw solar panel mounted on our roof, and we have some surplus electricity most of the time, so due to a low price for selling the extra produced, im happy to use some extra kw while scanning for wallets in this challenge.
So in the daylight hours im running on pretty much zero cost of scanning, only using paid electricity in the night hours
I'm thinking of installing a solar panel. But the battery costs too much. The problem in the electrical world. Renewable nergs need to gain weight. Bitcoin and electricity are in contrast. Is Bitcoin a hope for a democratic world? Well electricity consumption. Anyway let's focus on the puzzle: d
very nice feature, i have just switched over to the new version and started scanning with a selected range, will report if there is any trouble doing so... thanks for you continued support with the pool client and challenge all in all 👍
Jump to: