Pollard's kangaroo ECDLP solver - page 61.

bigvito19

full member

Activity: 706

Merit: 111

Quote from: fxsniper on April 26, 2021, 08:56:32 PM

Quote from: WanderingPhilospher on April 26, 2021, 08:28:25 PM

Range is too high and too wide for a reason...Billions of dollars in wallets/private keys. If it was too narrow of a range, no one would use Bitcoin.

It's all relative to your GPU/CPU power. You can't have one GTX 1050 and expect to find keys in 120 bit range over night, or over a decade. But if you have many GPUs, then you have a chance to find keys after time, depending on your GPU power.

challenge is too big for 256 bit it is can not possible find

challenge what maximum we can do on records, will be stuck with 120 bit forever same 256 bit or not?

if can do 120 may be can use up to 140 bit or some 2-3 level, do far from 160 bit

I think all random method is stuck on too high range, next method may be concern about calculate or mix

last records is 256 card x Tesla V100 32GB right, How many power for GPU need to solve

I try kangaroo cpu only is difference with GPU over 12-15 time, kangaroo require to use with GPU

256 card x Tesla V100 32GB is close to or around 300 billion keys per second. I'm going after a 256 bit key with cpu now.

fxsniper

member

Activity: 406

Merit: 47

Quote from: WanderingPhilospher on April 26, 2021, 08:28:25 PM

Range is too high and too wide for a reason...Billions of dollars in wallets/private keys. If it was too narrow of a range, no one would use Bitcoin.

It's all relative to your GPU/CPU power. You can't have one GTX 1050 and expect to find keys in 120 bit range over night, or over a decade. But if you have many GPUs, then you have a chance to find keys after time, depending on your GPU power.

challenge is too big for 256 bit it is can not possible find

challenge what maximum we can do on records, will be stuck with 120 bit forever same 256 bit or not?

if can do 120 may be can use up to 140 bit or some 2-3 level, do far from 160 bit

I think all random method is stuck on too high range, next method may be concern about calculate or mix

last records is 256 card x Tesla V100 32GB right, How many power for GPU need to solve

I try kangaroo cpu only is difference with GPU over 12-15 time, kangaroo require to use with GPU

WanderingPhilospher

full member

Activity: 1232

Merit: 242

Shooters Shoot...

Quote from: fxsniper on April 26, 2021, 08:23:46 PM

Quote from: jacky19790729 on April 26, 2021, 11:37:54 AM

you must use %s , not %d

Improve and optimize the project "Kangaroo , VanitySearch " , maybe requires several years of learn VC++

Thank you

Yes, I need to learn C++ more

kangaroo is powerful random search

I think kangaroo need to modify to haves new feature can find key

or some tools like GPS find zone ok key and use kangaroo scan, now range is too high too wide range

other way is new one algorithm power more than kangaroo

Range is too high and too wide for a reason...Billions of dollars in wallets/private keys. If it was too narrow of a range, no one would use Bitcoin.

It's all relative to your GPU/CPU power. You can't have one GTX 1050 and expect to find keys in 120 bit range over night, or over a decade. But if you have many GPUs, then you have a chance to find keys after time, depending on your GPU power.

fxsniper

member

Activity: 406

Merit: 47

Quote from: jacky19790729 on April 26, 2021, 11:37:54 AM

you must use %s , not %d

Improve and optimize the project "Kangaroo , VanitySearch " , maybe requires several years of learn VC++

Thank you

Yes, I need to learn C++ more

kangaroo is powerful random search

I think kangaroo need to modify to haves new feature can find key

or some tools like GPS find zone ok key and use kangaroo scan, now range is too high too wide range

other way is new one algorithm power more than kangaroo

WanderingPhilospher

full member

Activity: 1232

Merit: 242

Shooters Shoot...

Quote from: unclevito on April 26, 2021, 06:20:42 PM

Quote from: WanderingPhilospher on April 26, 2021, 05:19:13 PM

Quote

One problem is that when it goes to save I get an illegal memory operation and it shuts down. The few times it did save the save work was 1.5 GB (a whole lot of points) and after the 2nd or 3rd save it would get the illegal memory operation so i just have the save work for 3 days. i don't want to do the entire keyspace on these larger puzzles because the electric could go off or some other issue and have to start over, rather just do a smaller slice. The smaller keys did not do that because it found them before 3o seconds and 50 is not that big of a keyspace as 120

You shouldn't get a memory code on save. Here's what I would do. Run the precompiled version and see if it does the same thing; see if you get memory error or the MK/s rate is the same.

It's always better to do the whole slice, not smaller ones because you will actually wind up doing more work/longer run time breaking it up into smaller chunks AND the biggest issue is, you really won't know if the key is in a smaller slice unless you let it run for 6+ times the expected operations and even then, you still may not know.

What is the link to the compiled version. I will try it, must be the 256 bit version for comparison, that is the one I am using not the 128 version.

https://github.com/JeanLucPons/Kangaroo/releases/tag/2.2

dextronomous

full member

Activity: 431

Merit: 105

guys anyone got a way to add a find a text *string i am searching for the puzzle address while inside golang.

// Get compressed and uncompressed addresses
      caddr, _ := btcutil.NewAddressPubKey(public.SerializeCompressed(), &chaincfg.MainNetParams)
      uaddr, _ := btcutil.NewAddressPubKey(public.SerializeUncompressed(), &chaincfg.MainNetParams)

      // Print keys
      fmt.Printf("%x %34s %34s\n", padded, uaddr.EncodeAddress(), caddr.EncodeAddress())
      fmt.Printf( "count:%v\n", count );
   }

somewhere in the area in the text above. thanks so much in advance

the result of what i am doing is outputting this on my screen
000000000000000000000000000000000000000000000000c249fdd32778046b 1HCeANYVqecNUkQGVnczXdjq2PjgtBdvDo 1JxXytq4KSJFgMZit8gZcRiiUZCYiQdoNR
count:14000000000000001131

but then like if found, We Found It! yippie something like text.

unclevito

jr. member

Activity: 76

Merit: 4

Quote from: WanderingPhilospher on April 26, 2021, 05:19:13 PM

Quote

One problem is that when it goes to save I get an illegal memory operation and it shuts down. The few times it did save the save work was 1.5 GB (a whole lot of points) and after the 2nd or 3rd save it would get the illegal memory operation so i just have the save work for 3 days. i don't want to do the entire keyspace on these larger puzzles because the electric could go off or some other issue and have to start over, rather just do a smaller slice. The smaller keys did not do that because it found them before 3o seconds and 50 is not that big of a keyspace as 120

You shouldn't get a memory code on save. Here's what I would do. Run the precompiled version and see if it does the same thing; see if you get memory error or the MK/s rate is the same.

It's always better to do the whole slice, not smaller ones because you will actually wind up doing more work/longer run time breaking it up into smaller chunks AND the biggest issue is, you really won't know if the key is in a smaller slice unless you let it run for 6+ times the expected operations and even then, you still may not know.

What is the link to the compiled version. I will try it, must be the 256 bit version for comparison, that is the one I am using not the 128 version.

WanderingPhilospher

full member

Activity: 1232

Merit: 242

Shooters Shoot...

Quote

One problem is that when it goes to save I get an illegal memory operation and it shuts down. The few times it did save the save work was 1.5 GB (a whole lot of points) and after the 2nd or 3rd save it would get the illegal memory operation so i just have the save work for 3 days. i don't want to do the entire keyspace on these larger puzzles because the electric could go off or some other issue and have to start over, rather just do a smaller slice. The smaller keys did not do that because it found them before 3o seconds and 50 is not that big of a keyspace as 120

You shouldn't get a memory code on save. Here's what I would do. Run the precompiled version and see if it does the same thing; see if you get memory error or the MK/s rate is the same.

It's always better to do the whole slice, not smaller ones because you will actually wind up doing more work/longer run time breaking it up into smaller chunks AND the biggest issue is, you really won't know if the key is in a smaller slice unless you let it run for 6+ times the expected operations and even then, you still may not know.

WanderingPhilospher

full member

Activity: 1232

Merit: 242

Shooters Shoot...

Quote from: unclevito on April 26, 2021, 05:02:00 PM

Yes I compiled it a few days ago and noticed it was going extremely fast so I tried it on a few puzzles that had been solved 30 35 40 and it found them on seconds except for 50 which took about 20 minutes so it seems to be working (used the entire keyspace for those). I was scanning the entire keyspace. this time I am trying 120 and I was just scanning 65% to 75% which was estimated at 15 hrs, now 50% to 65% which shows an estimate of 18 hrs. not sure if I should just scan the entire keyspace at once which has a 6 to 7 day estimate

I just don't think something is right, with MK/s, which will affect your solve time; meaning it will show a few days when it could be a few years.

For lower bits like 30, 35, 40, those will be quick, even on a CPU it will take less than a second. 50 shouldn't take that long, even with CPU.

What GPU or CPU are you using?

unclevito

jr. member

Activity: 76

Merit: 4

Yes I compiled it a few days ago and noticed it was going extremely fast so I tried it on a few puzzles that had been solved 30 35 40 and it found them on seconds except for 50 which took about 20 minutes so it seems to be working (used the entire keyspace for those). I was scanning the entire keyspace. this time I am trying 120 and I was just scanning 65% to 75% which was estimated at 15 hrs, now 50% to 65% which shows an estimate of 18 hrs. not sure if I should just scan the entire keyspace at once which has a 6 to 7 day estimate

One problem is that when it goes to save I get an illegal memory operation and it shuts down. The few times it did save the save work was 1.5 GB (a whole lot of points) and after the 2nd or 3rd save it would get the illegal memory operation so i just have the save work for 3 days. i don't want to do the entire keyspace on these larger puzzles because the electric could go off or some other issue and have to start over, rather just do a smaller slice. The smaller keys did not do that because it found them before 3o seconds and 50 is not that big of a keyspace as 120

WanderingPhilospher

full member

Activity: 1232

Merit: 242

Shooters Shoot...

Quote from: unclevito on April 26, 2021, 02:55:48 PM

So if I am searching a keyspace and the count say Count 2^60.86 and that exceeds the expected
Range width: 2^116
Jump Avg distance: 2^57.96
Number of kangaroos: 2^17.60
Expected operations: 2^59.99
then does it mean it has finished searching the range inputted and I should check another portion of the keyspace?

[21295663.60 MK/s][GPU 21295655.80 MK/s][Count 2^60.86][Dead 0][1.4d (Avg 14:58:43)][2.0/4.0MB] B]

No, it is an estimate. Do you know if the key is in the range you are looking for?

Also, your MK/s seems extremely high.

The B] is a carry over from the MB]

unclevito

jr. member

Activity: 76

Merit: 4

So if I am searching a keyspace and the count say Count 2^60.86 and that exceeds the expected
Range width: 2^116
Jump Avg distance: 2^57.96
Number of kangaroos: 2^17.60
Expected operations: 2^59.99
then does it mean it has finished searching the range inputted and I should check another portion of the keyspace?

[21295663.60 MK/s][GPU 21295655.80 MK/s][Count 2^60.86][Dead 0][1.4d (Avg 14:58:43)][2.0/4.0MB] B]

unclevito

jr. member

Activity: 76

Merit: 4

Thanks for the response I already read your similar response on another post. I am still trying to get an answer regarding the "B]" that appears after a while on long keyspaces. i tried to upload an image of what I am talking about but seems they blocked the google drive address

WanderingPhilospher

full member

Activity: 1232

Merit: 242

Shooters Shoot...

Quote from: unclevito on April 26, 2021, 02:33:47 PM

Three questions,
Is there any way to see the current keyspace being worked on like some type of command that prints out in intervals the progress like "continue.txt" on bitcrack. I know there is save.work but this is not readable.
and what does the "B]" stand for at the end of the command line? picture here of the B.

Why in some keyspaces searches are there many dead kangaroos?

Current keyspace is the entire keyspace. The Tames and Wilds start at different random points and hop looking for DPs. So if you are searching from 0:FFFFFFFFFF ; then kangaroos will be spread out all over the range. The progress is group ops or total DPs found. It is readable if you use python script loaded in this thread. But it will not help you determine "progress"; total ops/DPs are your progress.

If you are in a small range (especially if using a GPU), you may get many dead kangaroos because you have many kangaroos hopping around in a small keyspace so many of them will be landing on the same points. Dead kangaroos can also happen if you are searching for a key that does not exist in the keyspace being searched.

unclevito

jr. member

Activity: 76

Merit: 4

Three questions,
Is there any way to see the current keyspace being worked on like some type of command that prints out in intervals the progress like "continue.txt" on bitcrack. I know there is save.work but this is not readable.
and what does the "B]" stand for at the end of the command line? picture here of the B.

Why in some keyspaces searches are there many dead kangaroos?

jacky19790729

jr. member

Activity: 82

Merit: 8

Quote

Thanks
but, I still not understand code
why GetBase10() not convert hex to decimal
that mean I use wrong code
(sorry I am not programmer)

Code:

   printf("\nP.x   %s\n" , P.x.GetBase10().c_str() );

you must use %s , not %d

Improve and optimize the project "Kangaroo , VanitySearch " , maybe requires several years of learn VC++

fxsniper

member

Activity: 406

Merit: 47

Quote from: jacky19790729 on April 26, 2021, 09:38:27 AM

Quote from: fxsniper on April 26, 2021, 06:57:19 AM

like sample
GetBase16() result = P.x.: 59EF0C8304BB2FDB2C0F18B262EBDBCB992D0B4CB7AE92358C22406740862D78
GetBase10() result = P.x.: -1235795984
Base10 should be = 40678206325600170710078198845059231036639843417349082810943540381348337692024

Code:

  Int privKey;
  privKey.SetBase16("00000000000000000000000000000000000000000000000000000000000000FF"); 	 
  printf("A: %s \n", privKey.GetBase10().c_str());
  privKey.SetBase16("59ef0c8304bb2fdb2c0f18b262ebdbcb992d0b4cb7ae92358c22406740862d78");
  printf("B: %s \n", privKey.GetBase10().c_str());
  privKey.SetBase16("FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141");
  printf("spec256k1 MAX value: %s \n", privKey.GetBase10().c_str());

=====output Decimal:=====
A: 255
B: 40678206325600170710078198845059231036639843417349082810943540381348337692024
spec256k1 MAX value: 115792089237316195423570985008687907852837564279074904382605163141518161494337

Thanks
but, I still not understand code

I use code from jacky19790729

I print like this

printf("\nP.x %064s\n" , P.x.GetBase16().c_str() );

and I change 16 to 10

printf("\nP.x %d\n" , P.x.GetBase10().c_str() );

result = P.x.: 59EF0C8304BB2FDB2C0F18B262EBDBCB992D0B4CB7AE92358C22406740862D78
result = P.x.: -1235795984

for this I convert from hex to decimal by manual
40678206325600170710078198845059231036639843417349082810943540381348337692024
https://www.rapidtables.com/convert/number/hex-to-decimal.html

why GetBase10() not convert hex to decimal

that mean I use wrong code
(sorry I am not programmer)

jacky19790729

jr. member

Activity: 82

Merit: 8

Quote from: fxsniper on April 26, 2021, 06:57:19 AM

like sample
GetBase16() result = P.x.: 59EF0C8304BB2FDB2C0F18B262EBDBCB992D0B4CB7AE92358C22406740862D78
GetBase10() result = P.x.: -1235795984
Base10 should be = 40678206325600170710078198845059231036639843417349082810943540381348337692024

Code:

  Int privKey;
  privKey.SetBase16("00000000000000000000000000000000000000000000000000000000000000FF"); 	 
  printf("A: %s \n", privKey.GetBase10().c_str());
  privKey.SetBase16("59ef0c8304bb2fdb2c0f18b262ebdbcb992d0b4cb7ae92358c22406740862d78");
  printf("B: %s \n", privKey.GetBase10().c_str());
  privKey.SetBase16("FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141");
  printf("secp256k1 MAX value: %s \n", privKey.GetBase10().c_str());

=====output Decimal:=====
A: 255
B: 40678206325600170710078198845059231036639843417349082810943540381348337692024
secp256k1 MAX value: 115792089237316195423570985008687907852837564279074904382605163141518161494337

fxsniper

member

Activity: 406

Merit: 47

how to use function GetBase10() on kangaroo

I copy GetBase16() and change to GetBase10()
I using GetBase10() with display %d but it is show wring

GetBase10() convert to decimal right?
( and GetBase16() convert to hex)

I compare by print out next line

like sample
GetBase16() result = P.x.: 59EF0C8304BB2FDB2C0F18B262EBDBCB992D0B4CB7AE92358C22406740862D78
GetBase10() result = P.x.: -1235795984

Base10 should be = 40678206325600170710078198845059231036639843417349082810943540381348337692024

fxsniper

member

Activity: 406

Merit: 47

Quote from: ?? on ??

My goal is not to race the quiz.

I like to have a name on Wikipedia records
https://en.wikipedia.org/wiki/Discrete_logarithm_records

Topic: Pollard's kangaroo ECDLP solver - page 61. (Read 60698 times)