Topic: == Bitcoin challenge transaction: ~1000 BTC total bounty to solvers! ==UPDATED== - page 54. (Read 56520 times)
April 01, 2020, 11:55:49 AM
April 01, 2020, 08:04:29 AM
I managed to find the first 8 numbers of the public key that corresponds to a private key. Is it possible to narrow the range to find the next ones?
April 01, 2020, 07:32:34 AM
March 30, 2020, 09:14:44 PM
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.
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.
March 30, 2020, 07:42:43 PM
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
he will never send 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
for 1 pubkey in bit 65, you can found it within 3 hours with powerfull gpu and bitcrack, only i need 30 min to code corresponding key, and rest if you have 2080ti or p100 and bitcrack you can find
wanna test ?
March 30, 2020, 07:19:13 PM
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
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
March 30, 2020, 02:50:20 PM
[You better take a notepad to start with and write C ++ code for your algorithm, and then rewrite it for the GPU. Have you seen the modified source for the Kangaroo GPU that I posted? Another would say thanks. In general, I doubt your competence and do not see the point of further discussion.
First: you did not publish all the code.
Second: it is impossible to run your code.
Third: you don’t show the video.
The discussion is over
March 30, 2020, 01:35:17 PM
Пoнял. Bcё этo cмaxивaeт нa paзвoд и дeтcкий лeпeт... Aлгopитм быcтpый, a типa Питoн мeдлeнный, интepecнo пoлyчaeтcя
Быcтpo cкaтилиcь нa pyccкий.
Cкoлькo ты гoтoв зaплaтить зa aлгopитм быcтpee тoгo, кoтopый y тeбя?
March 30, 2020, 01:03:49 PM
And how long does it take to puzzle 65 bits?
43.6M j/s; 18.0Gj of 8.0Gj 211.2%; DP 0T+0W=0+0=0; dp/kgr=0.0;[runtime] 0: 6:56
See above post.
Tвoй пocт я видeл, я y этoгo "пpoдaвцa" cпpaшивaл )
March 30, 2020, 12:49:28 PM
So write that you are selling a slow algorithm, and there is no time to test it in practice. 
On the video there is testing the algorithm in single-threaded python execution mode. What else is needed?
I made a multi-threaded and economical memory option, and I sell it. It can still be improved, but I do not have time.
And how long does it take to puzzle 65 bits?
March 30, 2020, 12:38:11 PM
So write that you are selling a slow algorithm, and there is no time to test it in practice.
On the video there is testing the algorithm in single-threaded python execution mode. What else is needed?
I made a multi-threaded and economical memory option, and I sell it. It can still be improved, but I do not have time.
March 30, 2020, 12:06:04 PM
Prove in practice, 15 minutes is enough?
No. Python is very slow. I wrote that I was selling an algorithm
I don’t have time to do development and I need money right now.
March 30, 2020, 11:49:26 AM
Wow n00by
The algorithm is important. My algorithm allows me to search faster than Pollard-Ro. In general, I sell an algorithm
Code:
Random pybkey bit64 - bit65
pk: 02d3f7e6437398932017b803d1253ccefafae819d29ad5d5be9a4278d702f2427d
pk: 027bd3a5baf58b2dd2872605a8667451a95ae8684db15e2f726ab3aa8cbe308670
pk: 036300883803608848b5fa2832a4da1e2dc937dd948ce0dc35650f1d03aaf06173
March 30, 2020, 10:39:45 AM
Well, look for it yourself, you will earn more
So I am the author of the script and algorithm. I need money now, so I want to sell the algorithm and its implementation for python.
March 30, 2020, 10:23:24 AM
Wow n00by
The algorithm is important. My algorithm allows me to search faster than Pollard-Ro. In general, I sell an algorithm
Well, look for it yourself, you will earn more ... It seems he wrote that there is no equipment? So there is Amazon EC2.
In general, do something smarter. Because in this way, you can find only the latest noobs.
March 30, 2020, 09:54:08 AM
Wow n00by
The algorithm is important. My algorithm allows me to search faster than Pollard-Ro. In general, I sell an algorithm
March 30, 2020, 09:20:11 AM
March 29, 2020, 01:07:21 PM
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.As I understand it, something to brag about, or maybe you're waiting for potential investors?
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:
Code:
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?
won't be able to in a few days from now maybe.
but should that be all? GPUMath.h - GPUEngine.cu - GPUCompute.h - and the pollard files off course.
March 29, 2020, 12:48:34 PM
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.As I understand it, something to brag about, or maybe you're waiting for potential investors?
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:
Code:
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?
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.
March 29, 2020, 10:43:36 AM
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.As I understand it, something to brag about, or maybe you're waiting for potential investors?
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:
Code:
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?
Jump to: