== Bitcoin challenge transaction: ~1000 BTC total bounty to solvers! ==UPDATED==

[Firebox]

Thanks for pointing to the github. I learned a lot from Telariust code.
Now I’ve modified the algorithm (I’ll write the whole algorithm here soon) in terms of performing operations specific to python and productivity has increased by 14%. And this is only single-threaded execution.
I also have a multithreaded part ready.
I still can not lay out a single-threaded code, because it is not optimized by memory. Soon

When rewriting program for CUDA, I don’t share the code.
./vs-kangaroo-hybrid -v 1 -p 8 -gpu -bits 65 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b

Code:

bla bla bla
[x] EXIT

Bro, show us the result of finding the address # 105, othervise all this has no sense at all...

Why spend electricity on 105 bits , preferably 110 bits.

If with this code you still need to waste an electricity for #105, then this code is still useless. In order to have it profitable it must solve #105 in a few seconds... ok, few minutes... ok, few hours... )))

[dextronomous]

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.

[paniker]

hi
anybody try to use p106 with bitcrack?

[PrivatePerson]

Yes, I think everyone wants to try Pollard at GPU
Everyone else is embarrassed to admit

[dextronomous]

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:

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?

[brainless]

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:

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?

GPUGenerate.cpp

[dextronomous]

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:

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?

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.

[brainless]

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:

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?

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 - and the pollard files off course.

Alek76 shown working gpu and 65 bit results, mean have working Gpu kangroo copy, but for other things he put some codes not complete, and asking others coder for additional, maybe more optimizing or some other difrent ways of working, but overall, he have gpu kangroo working, but did not like share to community, he dont know other 4 other gpu kangroo developers are already running for puzzle 110 from last 6 months, and wasting there time and money in gpu power, bc coin price already breakup 40%, let them all enjoy to waste gpu power money

[n00by]

Selling search script for $ 1000

https://bitcointalk.org/index.php?topic=5218972.msg53781868#msg53781868

[n00by]

Wow n00by

The algorithm is important. My algorithm allows me to search faster than Pollard-Ro. In general, I sell an algorithm

[sssergy2705]

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.

[n00by]

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.

[brainless]

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

Prove in practice, 15 minutes is enough?

you all running to proove "i am the best", i have this and that, but unable to find 110 puzzle, hope you understand

[n00by]

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.

[n00by]

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.

[sssergy2705]

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?

[sssergy2705]

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л )

[n00by]

П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бя?

[n00by]

[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

[dextronomous]

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