|
i know about the pollards that are out,
but need to go fast and up to 110 already possible with the cpu pollard version.
only need ram, and or baby giant. for use with the pub key.
but then all whe want are those with gpu and the bitcracks so on for the ones without the pub keys.
|
|
|
|
|
hey alek76,
i pm'ed you but you could send me the files. then i post the answer to those keys for these guys
to show wich code is faster for those 3 pk's
please do
2020
soon
21
|
|
|
|
What is the meaning of this post?
As I understand it, something to brag about, or maybe you're waiting for potential investors?
Hi, I apologize for my English. Developing the theme of solving the puzzle, perhaps this will provide an incentive for independent code writing for the CUDA GPU. I don’t expect investors! 1st step: bool GenerateSptable() {
// Init SecpK1
Secp256K1 *secp = new Secp256K1();
secp->Init();
int size = 512;
// Compute generator table
Point *Sp = new Point[size];
Int *dS = new Int[size];
Sp[0] = secp->G;
dS[0].SetInt32(1);
for (int i = 1; i < size; i++) {
dS[i].Add(&dS[i-1], &dS[i-1]);
Sp[i] = secp->DoubleAffine(Sp[i-1]);
printf("\nGenerate Sp-table GPUSptable.h size i: %d", i);
}
// Write file
FILE *f = fopen("GPU/GPUSptable.h", "wb");
fprintf(f, "// File generated by Main::GenerateSptable()\n");
fprintf(f, "#define GRP_SIZE %d\n\n", size);
fprintf(f, "// SecpK1 Generator table (Contains G,2G,4G,8G...,(SIZE/2 )...G)\n");
fprintf(f, "__device__ __constant__ uint64_t Spx[][4] = {\n");
for (int i = 0; i < size/2; i++) {
fprintf(f, " %s,\n", Sp[i].x.GetC64Str(4).c_str());
}
fprintf(f, "};\n");
fprintf(f, "__device__ __constant__ uint64_t Spy[][4] = {\n");
for (int i = 0; i < size/2; i++) {
fprintf(f, " %s,\n", Sp[i].y.GetC64Str(4).c_str());
}
fprintf(f, "};\n\n");
fprintf(f, "__device__ __constant__ uint64_t dS[][4] = {\n");
for (int i = 0; i < size/2; i++) {
fprintf(f, " %s,\n", dS[i].GetC64Str(4).c_str());
}
fprintf(f, "};\n\n");
fclose(f);
delete[] Sp;
delete[] dS;
return true;
}
wich file is this step? or wrong question? GPUGenerate.cpp thanks for that brainless. but after putting it all in the right place i'm guessing, visual studio says that i have to restart. won't be able to in a few days from now maybe. but should that be all? GPUMath.h - GPUEngine.cu - GPUCompute.h - GPUGenerate.cpp and the pollard files off course. |
|
|
|
What is the meaning of this post?
As I understand it, something to brag about, or maybe you're waiting for potential investors?
Hi, I apologize for my English. Developing the theme of solving the puzzle, perhaps this will provide an incentive for independent code writing for the CUDA GPU. I don’t expect investors! 1st step: bool GenerateSptable() {
// Init SecpK1
Secp256K1 *secp = new Secp256K1();
secp->Init();
int size = 512;
// Compute generator table
Point *Sp = new Point[size];
Int *dS = new Int[size];
Sp[0] = secp->G;
dS[0].SetInt32(1);
for (int i = 1; i < size; i++) {
dS[i].Add(&dS[i-1], &dS[i-1]);
Sp[i] = secp->DoubleAffine(Sp[i-1]);
printf("\nGenerate Sp-table GPUSptable.h size i: %d", i);
}
// Write file
FILE *f = fopen("GPU/GPUSptable.h", "wb");
fprintf(f, "// File generated by Main::GenerateSptable()\n");
fprintf(f, "#define GRP_SIZE %d\n\n", size);
fprintf(f, "// SecpK1 Generator table (Contains G,2G,4G,8G...,(SIZE/2 )...G)\n");
fprintf(f, "__device__ __constant__ uint64_t Spx[][4] = {\n");
for (int i = 0; i < size/2; i++) {
fprintf(f, " %s,\n", Sp[i].x.GetC64Str(4).c_str());
}
fprintf(f, "};\n");
fprintf(f, "__device__ __constant__ uint64_t Spy[][4] = {\n");
for (int i = 0; i < size/2; i++) {
fprintf(f, " %s,\n", Sp[i].y.GetC64Str(4).c_str());
}
fprintf(f, "};\n\n");
fprintf(f, "__device__ __constant__ uint64_t dS[][4] = {\n");
for (int i = 0; i < size/2; i++) {
fprintf(f, " %s,\n", dS[i].GetC64Str(4).c_str());
}
fprintf(f, "};\n\n");
fclose(f);
delete[] Sp;
delete[] dS;
return true;
}
wich file is this step? or wrong question? |
|
|
|
|
wow alek76,
just come in here, and add what all are waiting for in someone else's code. you must be a great programmer,
where are you from,? what kind of work you do.
thanks again for the showing of the gpu code.
|
|
|
|
@bigvito19
so why not 1FFFFFFFFFFFFFFFF or just 1A838B13505B26867 as end of keyspace or i am seeing this wrong.?
anyone care to enlighten.? i say that cause most threads around the 32 or 100 btc puzzle are so silent recently.
still thinking the FFF thing is wrong, only one left with pubkey 110 bits,
vanitygen not fast enough, and ndv is paid only for upgrades? bitcrack not fast enough but great i guess,
so these programs to use for all this, and all the others i know are for public key search. no one giving updates,
Telariust hi, any news soon? Zielar, maybe sample of app with gpu pollard ready somewhere.?
So nooby where's you'r app. Finished already with the memory issues.
Of course they're all not fast enough and slow, because you're trying to brute force it, what do you expect. By the time someone else comes up with a new or modified program, the next key will be cracked by then. Guess the gpu pollard multi-gpu 2021 maybe, and any other bitcrack multi-gpu edition 2021 maybe, and vgen ultraspeed only in dev's hands. but jean_luc is still the bomb all else said oclvgen. thanks for your response big |
|
|
|
|
so why not 1FFFFFFFFFFFFFFFF or just 1A838B13505B26867 as end of keyspace or i am seeing this wrong.?
anyone care to enlighten.? i say that cause most threads around the 32 or 100 btc puzzle are so silent recently.
still thinking the FFF thing is wrong, only one left with pubkey 110 bits,
vanitygen not fast enough, and ndv is paid only for upgrades? bitcrack not fast enough but great i guess,
so these programs to use for all this, and all the others i know are for public key search. no one giving updates,
Telariust hi, any news soon? Zielar, maybe sample of app with gpu pollard ready somewhere.?
So nooby where's you'r app. Finished already with the memory issues.
|
|
|
|
|
hey supika, nice software i guess,
smart man you are, but when you transfer it to that another language thing you said,
could you do it a bit faster for us, so we can get used to that piece,
thanks bro
|
|
|
|
|
so it's not available, thanks anyway,
no need to buy them addresses.
|
|
|
|
Posted by: BtcMaker92 Insert Quote Update 1.0.2 Added support for searching by bit range https://youtu.be/UGkfshqFOUohi guys, was wondering is this available for download. or copy paste \ |
|
|
|
|
Happy New Year 2020 to all,
anything new under the sun regarding the project, maybe some gpu pollard.
or. Burt's Surprise
|
|
|
|
already available  also interested if there, Happy New Year 2020 to all, |
|
|
|
|
Happy New Year 2020 to all,
anything new under the sun regarding the project, maybe some gpu pollard.
or
|
|
|
|
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 |
|
|
|
hi there mrxtraf, great things you are making sir, is this available to try out, would again two days off, to do some program learning etc. instead of just doing nothing, thanks for the updates. |
|
|
|
|
this thread not posting nada, niet, nothing,
23-10-2019 08:26:33 PMPosted by: brainless
but the posters are the best. serious hard work and nice work.
but no BurtW software as of yet released, just test result i guessed.
so guys let some of you be heard we wan't it to.
greetings.
|
|
|
|
I did forget about this. Now I have some features to add to my slow code.
Hi there cryptohazard, you sharing the code. with the features, maybe. |
|
|
|
#105 is solved. I'll post the private key later, after learn most significant BTC forks. A checkpoint right now is uncompressed address that corresponds to the same private key: 1JATjHbShdvgkvGHyoRv1vTnEeiibqMVnj.
Thanks very much for the creator of the puzzle! I have learned so many beautiful math at puzzle solving.
@57e What hardware did you used, CPU/GPU? How long the discovery of private key took? In your opinion the other keys up to a point can be found without huge resources? I`m thinking that if huge resources are necessary only few people have access to huge amount of processing power. Thanks! I have used my own version of CUDA GPU code which almost exactly reproduces Pollard's Kangaroo algorithm published earlier as Python code. Solving #105 takes 1 month of working of GTX 1080ti at 270-275 Mh/s, and last 2 week of work of all my available GPUs (total h/s was approximately 1800Mh/s). So, it was not so simple as the Python code presented. I haven't reached published by j2002ba2 1600Mh/s. I has obtained only 470Mh/s with a cloud GPU server and one Tesla V100. I'm not a good programmer in CUDA, that why. I guess, huge power is necessary for problems behind #120, as mentioned before by j2002ba2. At least with today state of art of ECDLP. Not only GPU power, but CPU and storage too, because we need to generate a huge amount of distinguished points (it was 24GB of data in my case) and to analyze this data in appropriate time. I guess, it is the reason why #105 was unsolved so long time. The luck was 25% in my case. Very good luck. I apologize for my English. so hi man, would really love to try it out, would it become available to use for us, wish it was made available for use with gpu, then again, do you have a readme cause 6609y 8m 12d 19:32:04s this is not working> for me. thanks man reading a lot and learning a lot here. greetz. |
|
|
|
|
So hi there 57fe.
when you gonna give you'r not only code away, but somewhat explain with what and how you did it,
you have a compiled version of the app like Telariust has given,
thanks again for the info.
|
|
|
|
|
Show Posts
