Pollard's kangaroo ECDLP solver - page 49.

WanderingPhilospher

full member

Activity: 1162

Merit: 237

Shooters Shoot...

Quote from: brainless on July 05, 2021, 11:13:29 PM

Quote from: WanderingPhilospher on July 05, 2021, 11:22:27 AM

Quote

btw i can offer 115bit range only 1 key, for make this key i need 0.75btc for buying 3090rtx gpu's for my calc fast to within 7 days Smiley, but here no one have this for work of months to days Smiley

For me, to even consider it, I'd have to know your method/how you cut it to 115 with only 1 key. I don't doubt you can, just never seen it.

Best I did once was to cut it down to 108 bit, with 1 out of 2048 keys being in the range.

And couldn't do it for less than .50 btc

if 115 could be only 1 key, then is there any delay for 40bit for 1 key ?

and do you think july 2021 status at blockchain for 120 puzzle is solved and transfered

Yeah I don't know riddler.

I know you think outside the box, and I like that.

I was messing with division and addition today and there were some keys that I could not find after reducing. Kinda scary. I was using BSGS to search for them (all were 52 bit and less.)

If you can get it down to one key, down to a 40 bit, then the btc will be yours soon!

I got it down to 104 bits today, but with 32,000 pubkeys; better than the normal 2^16 normally required, but I can't figure out a way to shrink it down to one key...

EDIT: I know how to get it down to a 40 bit range with 1 key, it would just take a very long time...

brainless

member

Activity: 348

Merit: 34

Quote from: WanderingPhilospher on July 05, 2021, 11:22:27 AM

Quote

btw i can offer 115bit range only 1 key, for make this key i need 0.75btc for buying 3090rtx gpu's for my calc fast to within 7 days Smiley, but here no one have this for work of months to days Smiley

For me, to even consider it, I'd have to know your method/how you cut it to 115 with only 1 key. I don't doubt you can, just never seen it.

Best I did once was to cut it down to 108 bit, with 1 out of 2048 keys being in the range.

And couldn't do it for less than .50 btc

if 115 could be only 1 key, then is there any delay for 40bit for 1 key ?

and do you think july 2021 status at blockchain for 120 puzzle is solved and transfered

WanderingPhilospher

full member

Activity: 1162

Merit: 237

Shooters Shoot...

Quote

btw i can offer 115bit range only 1 key, for make this key i need 0.75btc for buying 3090rtx gpu's for my calc fast to within 7 days Smiley, but here no one have this for work of months to days Smiley

For me, to even consider it, I'd have to know your method/how you cut it to 115 with only 1 key. I don't doubt you can, just never seen it.

Best I did once was to cut it down to 108 bit, with 1 out of 2048 keys being in the range.

And couldn't do it for less than .50 btc

brainless

member

Activity: 348

Merit: 34

Quote from: brainless on July 04, 2021, 09:28:12 AM

Quote from: WanderingPhilospher on July 04, 2021, 09:10:54 AM

Quote from: brainless on July 04, 2021, 08:18:53 AM

Quote from: WanderingPhilospher on July 04, 2021, 01:59:25 AM

Quote

Good job
just correct one line
Also, I have accomplished what brainless has done now/in the past, but with a twist.
now/in the past >> in the past
remove "now", as no one know whats NOW
and in the past aprox a year ago

Haha! Got it!

Ok, so what are you working on NOW? I know you are always doing some kind of pubkey manipulation/tinkering. Any newly found secrets or tips you have found?

If i post 260 pubkeys in 110 bit rang. Maybe zieler with his gpu bank could find in a year.
If i print 720 pubkeys in 90 bitrange. How much days need to find ?

Probably 1.5 to 2 hours per pubkey; but all Tames would be players, which may speed it up, especially the latter pubkeys. Would probably go with a little higher DP to try and cut down on tame and wild file size.

How many pubs would be in the 2^90 range?

1/720. 90bit
16/260 110bit

btw i can offer 115bit range only 1 key, for make this key i need 0.75btc for buying 3090rtx gpu's for my calc fast to within 7 days

, but here no one have this for work of months to days

WanderingPhilospher

full member

Activity: 1162

Merit: 237

Shooters Shoot...

Quote from: NotATether on July 04, 2021, 03:28:14 PM

Quote from: WanderingPhilospher on July 04, 2021, 03:15:11 PM

Quote from: NotATether on July 04, 2021, 02:57:03 PM

~

That's over 1 million public keys to search individually!

Group ops of 100 bit range is 2^50 group ops, now times that by 2^20, so group ops is now 2^70 when 120 bit range is only 2^60 group ops.
Do you see? Now you are doing more work than just running original pub and range. Not to mention you will have to set the -m option which will increase your group ops or you may never know if the pubkey was in the range or not; but with original, you know it's in the range.

Gee, I didn't know that. Yeah I did deliberately generate 2 million keys thinking it would be faster.

Is the number of group ops always half of the range? Meaning the group ops logarithm => 50 in this case -- is always half the bit range?

I'm kinda confused now about how group ops relate to range boundary check, is it like taking a modulus?

JLP touched on it:

Quote

The program uses 2 herds of kangaroos, a tame herd and a wild herd. When 2 kangoroos (a wild one and a tame one) collide, the key can be solved. Due to the birthday paradox, a collision happens (in average) after 2.08*sqrt(k2-k1) [1] group operations, the 2 herds have the same size. To detect collision, the distinguished points method is used with a hashtable.

Here is a brief description of the algorithm:

We have to solve P = k.G, P is the public key, we know that k lies in the range [k1,k2], G is the SecpK1 generator point.
Group operations are additions on the elliptic curve, scalar operations are done modulo the order of the curve.

His program auto calculates estimated group ops.

Code:

Range width: 2^84
Jump Avg distance: 2^42.03
Number of kangaroos: 2^23.32
Suggested DP: 16
Expected operations: 2^43.12
Expected RAM: 6347.6MB
DP size: 16 [0xFFFF000000000000]

NotATether

legendary

Activity: 1568

Merit: 6660

bitcoincleanup.com / bitmixlist.org

Quote from: WanderingPhilospher on July 04, 2021, 03:15:11 PM

Quote from: NotATether on July 04, 2021, 02:57:03 PM

~

That's over 1 million public keys to search individually!

Group ops of 100 bit range is 2^50 group ops, now times that by 2^20, so group ops is now 2^70 when 120 bit range is only 2^60 group ops.
Do you see? Now you are doing more work than just running original pub and range. Not to mention you will have to set the -m option which will increase your group ops or you may never know if the pubkey was in the range or not; but with original, you know it's in the range.

Gee, I didn't know that. Yeah I did deliberately generate 2 million keys thinking it would be faster.

Is the number of group ops always half of the range? Meaning the group ops logarithm => 50 in this case -- is always half the bit range?

I'm kinda confused now about how group ops relate to range boundary check, is it like taking a modulus?

unclevito

jr. member

Activity: 76

Merit: 4

Quote from: unclevito on July 04, 2021, 02:53:18 PM

Quote from: WanderingPhilospher on July 04, 2021, 02:44:36 PM

Quote from: unclevito on July 04, 2021, 02:25:05 PM

Quote from: WanderingPhilospher on July 04, 2021, 12:26:51 PM

Quote from: unclevito on July 04, 2021, 11:09:35 AM

Quote from: WanderingPhilospher on July 03, 2021, 11:59:57 PM

Just FYI, for my 2 cents, if you know the range a key lies in, or want to gamble and take a chance where you think the key may lie, then I think subtraction is better.

Like I said a few posts back; we will take #120 puzzle for example. The private key can only start with 1 of 8 possibilities: 8, 9, A, B, C, D, E, F

Let's say you think it starts with C. You can then take the pubkey and subtract by C00000000000000000000000000000. Let us now say for example purposes the private key is:
C23BD97E765A75F0D6D4A6C6B67221.

So for your search range, after subtracting the C000....would be 0:FFFFFFFFFFFFFFFFFFFFFFFFFFFFF

By subtracting, you went from a search range of 2^120 to 2^116; 16 times smaller the original search range. BUT if you guessed wrong and the key does not start with C, then you will not find the key.

Staying with the same example, if you thought it started with C, D, E, or F and you subtracted by C000....then you could search the range of:
0:3FFFFFFFFFFFFFFFFFFFFFFFFFFFFF, and now you've went from 2^120 down to 2^117, 8 times smaller. BUT again, if the key does not start with C, D, E, or F, you won't find the key.

Dividing is fascinating because in your mind you see a much smaller search range, BUT the amount of pubkeys you have to search GROWS the smaller you cut the search range.

So I understand you subtract C00000000000000000000000000000 from 02CEB6CBBCDBDF5EF7150682150F4CE2C6F4807B349827DCDBDD1F2EFA885A2630 the public key for 120 and for example if you wanted to search F then you would subtract F00000000000000000000000000000 from 120 public key? and then search the same range 0:FFFFFFFFFFFFFFFFFFFFFFFFFFFFF

Correct.

i was thinking last night that we treat each keyspace as if they were separated by a wall but they are not so i measured the distance between 115 and the center of 60 then reduced the public key of 115 by that amount. i hit the 115 public key ( i scanned a thru f on 60 and about one hour later I got a hit. Key found privkey fc07a1825367bbc
Publickey 0242257a130fe109c25c2ca6c60af60e5849305f77370401299b63da2094ec0297 and the addition + 31464123230573851029232324144930570 . Trying it on 120 but so far no luck. i wish I had this kind of luck on 120 or the powerball lol. I have a image of the hit but don't think I can post it. The addition goes to the private key found

Awesome!

So the center of 60, which was what, in your calculation? so you took 115 - minus middle of 60 = x and subtracted x from original 115 pubkey, right?
And then you did a search in the 2^60 range?

Yes but i got so excited i overwrote the calculations wanting to try 120 lol. I used a python script to reduce it though

These are the subtraction points i tried but I don't know which one hit and not sure if they were for 115 or 120. i do remember the center of 60 used was c00000000000000
subtraction points 60
7FFFFFFFFFFFFFF400000000000000
08FFFFFFFFFFFFFF400000000000000
09FFFFFFFFFFFFFF400000000000000
0AFFFFFFFFFFFFFF400000000000000
0BFFFFFFFFFFFFFF400000000000000
0CFFFFFFFFFFFFFF400000000000000
0DFFFFFFFFFFFFFF400000000000000
0EFFFFFFFFFFFFFF400000000000000
0FFFFFFFFFFFFFFF400000000000000

WanderingPhilospher

full member

Activity: 1162

Merit: 237

Shooters Shoot...

Quote from: NotATether on July 04, 2021, 02:57:03 PM

Quote from: unclevito on July 04, 2021, 02:53:18 PM

Yes but i got so excited i overwrote the calculations wanting to try 120 lol. I used a python script to reduce it though

As we speak, I'm reducing #120 to 100 bit keyspace with the custom python script in my post and it should be done in an hour or so and I'll post a link to them here.

I already reduced it to 110-bit keyspace and the compressed keys can be downloaded from https://files.notatether.com/public/misc/puzzle/120div10.txt .

That's over 1 million public keys to search individually!

Group ops of 100 bit range is 2^50 group ops, now times that by 2^20, so group ops is now 2^70 when 120 bit range is only 2^60 group ops.
Do you see? Now you are doing more work than just running original pub and range. Not to mention you will have to set the -m option which will increase your group ops or you may never know if the pubkey was in the range or not; but with original, you know it's in the range.

unclevito

jr. member

Activity: 76

Merit: 4

Quote from: NotATether on July 04, 2021, 02:57:03 PM

Quote from: unclevito on July 04, 2021, 02:53:18 PM

Yes but i got so excited i overwrote the calculations wanting to try 120 lol. I used a python script to reduce it though

As we speak, I'm reducing #120 to 100 bit keyspace with the custom python script in my post and it should be done in an hour or so and I'll post a link to them here.

I already reduced it to 110-bit keyspace and the compressed keys can be downloaded from https://files.notatether.com/public/misc/puzzle/120div10.txt .

I am going to try your keys now. Thanks

unclevito

jr. member

Activity: 76

Merit: 4

The difference between 110 and 60 is a few months to a few hours to know if it will work. But 110 is certainly better than 120 a huge reduction. One problem i see is going from a such an immense keyspace like 120 or 115 is not knowing where the actual key lies in 120 so I believe one would need to scan the 50's and 60's in the event not found in 60. i am working on logic totally with limited knowledge regarding these issues so i could be wrong.

NotATether

legendary

Activity: 1568

Merit: 6660

bitcoincleanup.com / bitmixlist.org

Quote from: unclevito on July 04, 2021, 02:53:18 PM

Yes but i got so excited i overwrote the calculations wanting to try 120 lol. I used a python script to reduce it though

As we speak, I'm reducing #120 to 100 bit keyspace with the custom python script in my post and it should be done in an hour or so and I'll post a link to them here.

I already reduced it to 110-bit keyspace and the compressed keys can be downloaded from https://files.notatether.com/public/misc/puzzle/120div10.txt .

WanderingPhilospher

full member

Activity: 1162

Merit: 237

Shooters Shoot...

Quote

Yes but i got so excited i overwrote the calculations wanting to try 120 lol. I used a python script to reduce it though

Understandable for sure.

unclevito

jr. member

Activity: 76

Merit: 4

Quote from: WanderingPhilospher on July 04, 2021, 02:44:36 PM

Quote from: unclevito on July 04, 2021, 02:25:05 PM

Quote from: WanderingPhilospher on July 04, 2021, 12:26:51 PM

Quote from: unclevito on July 04, 2021, 11:09:35 AM

Quote from: WanderingPhilospher on July 03, 2021, 11:59:57 PM

Just FYI, for my 2 cents, if you know the range a key lies in, or want to gamble and take a chance where you think the key may lie, then I think subtraction is better.

Like I said a few posts back; we will take #120 puzzle for example. The private key can only start with 1 of 8 possibilities: 8, 9, A, B, C, D, E, F

Let's say you think it starts with C. You can then take the pubkey and subtract by C00000000000000000000000000000. Let us now say for example purposes the private key is:
C23BD97E765A75F0D6D4A6C6B67221.

So for your search range, after subtracting the C000....would be 0:FFFFFFFFFFFFFFFFFFFFFFFFFFFFF

By subtracting, you went from a search range of 2^120 to 2^116; 16 times smaller the original search range. BUT if you guessed wrong and the key does not start with C, then you will not find the key.

Staying with the same example, if you thought it started with C, D, E, or F and you subtracted by C000....then you could search the range of:
0:3FFFFFFFFFFFFFFFFFFFFFFFFFFFFF, and now you've went from 2^120 down to 2^117, 8 times smaller. BUT again, if the key does not start with C, D, E, or F, you won't find the key.

Dividing is fascinating because in your mind you see a much smaller search range, BUT the amount of pubkeys you have to search GROWS the smaller you cut the search range.

So I understand you subtract C00000000000000000000000000000 from 02CEB6CBBCDBDF5EF7150682150F4CE2C6F4807B349827DCDBDD1F2EFA885A2630 the public key for 120 and for example if you wanted to search F then you would subtract F00000000000000000000000000000 from 120 public key? and then search the same range 0:FFFFFFFFFFFFFFFFFFFFFFFFFFFFF

Correct.

i was thinking last night that we treat each keyspace as if they were separated by a wall but they are not so i measured the distance between 115 and the center of 60 then reduced the public key of 115 by that amount. i hit the 115 public key ( i scanned a thru f on 60 and about one hour later I got a hit. Key found privkey fc07a1825367bbc
Publickey 0242257a130fe109c25c2ca6c60af60e5849305f77370401299b63da2094ec0297 and the addition + 31464123230573851029232324144930570 . Trying it on 120 but so far no luck. i wish I had this kind of luck on 120 or the powerball lol. I have a image of the hit but don't think I can post it. The addition goes to the private key found

Awesome!

So the center of 60, which was what, in your calculation? so you took 115 - minus middle of 60 = x and subtracted x from original 115 pubkey, right?
And then you did a search in the 2^60 range?

Yes but i got so excited i overwrote the calculations wanting to try 120 lol. I used a python script to reduce it though

WanderingPhilospher

full member

Activity: 1162

Merit: 237

Shooters Shoot...

Quote from: unclevito on July 04, 2021, 02:25:05 PM

Quote from: WanderingPhilospher on July 04, 2021, 12:26:51 PM

Quote from: unclevito on July 04, 2021, 11:09:35 AM

Quote from: WanderingPhilospher on July 03, 2021, 11:59:57 PM

Just FYI, for my 2 cents, if you know the range a key lies in, or want to gamble and take a chance where you think the key may lie, then I think subtraction is better.

Like I said a few posts back; we will take #120 puzzle for example. The private key can only start with 1 of 8 possibilities: 8, 9, A, B, C, D, E, F

Let's say you think it starts with C. You can then take the pubkey and subtract by C00000000000000000000000000000. Let us now say for example purposes the private key is:
C23BD97E765A75F0D6D4A6C6B67221.

So for your search range, after subtracting the C000....would be 0:FFFFFFFFFFFFFFFFFFFFFFFFFFFFF

By subtracting, you went from a search range of 2^120 to 2^116; 16 times smaller the original search range. BUT if you guessed wrong and the key does not start with C, then you will not find the key.

Staying with the same example, if you thought it started with C, D, E, or F and you subtracted by C000....then you could search the range of:
0:3FFFFFFFFFFFFFFFFFFFFFFFFFFFFF, and now you've went from 2^120 down to 2^117, 8 times smaller. BUT again, if the key does not start with C, D, E, or F, you won't find the key.

Dividing is fascinating because in your mind you see a much smaller search range, BUT the amount of pubkeys you have to search GROWS the smaller you cut the search range.

So I understand you subtract C00000000000000000000000000000 from 02CEB6CBBCDBDF5EF7150682150F4CE2C6F4807B349827DCDBDD1F2EFA885A2630 the public key for 120 and for example if you wanted to search F then you would subtract F00000000000000000000000000000 from 120 public key? and then search the same range 0:FFFFFFFFFFFFFFFFFFFFFFFFFFFFF

Correct.

i was thinking last night that we treat each keyspace as if they were separated by a wall but they are not so i measured the distance between 115 and the center of 60 then reduced the public key of 115 by that amount. i hit the 115 public key ( i scanned a thru f on 60 and about one hour later I got a hit. Key found privkey fc07a1825367bbc
Publickey 0242257a130fe109c25c2ca6c60af60e5849305f77370401299b63da2094ec0297 and the addition + 31464123230573851029232324144930570 . Trying it on 120 but so far no luck. i wish I had this kind of luck on 120 or the powerball lol. I have a image of the hit but don't think I can post it. The addition goes to the private key found

Awesome!

So the center of 60, which was what, in your calculation? so you took 115 - minus middle of 60 = x and subtracted x from original 115 pubkey, right?
And then you did a search in the 2^60 range?

unclevito

jr. member

Activity: 76

Merit: 4

Quote from: WanderingPhilospher on July 04, 2021, 12:26:51 PM

Quote from: unclevito on July 04, 2021, 11:09:35 AM

Quote from: WanderingPhilospher on July 03, 2021, 11:59:57 PM

Just FYI, for my 2 cents, if you know the range a key lies in, or want to gamble and take a chance where you think the key may lie, then I think subtraction is better.

Like I said a few posts back; we will take #120 puzzle for example. The private key can only start with 1 of 8 possibilities: 8, 9, A, B, C, D, E, F

Let's say you think it starts with C. You can then take the pubkey and subtract by C00000000000000000000000000000. Let us now say for example purposes the private key is:
C23BD97E765A75F0D6D4A6C6B67221.

So for your search range, after subtracting the C000....would be 0:FFFFFFFFFFFFFFFFFFFFFFFFFFFFF

By subtracting, you went from a search range of 2^120 to 2^116; 16 times smaller the original search range. BUT if you guessed wrong and the key does not start with C, then you will not find the key.

Staying with the same example, if you thought it started with C, D, E, or F and you subtracted by C000....then you could search the range of:
0:3FFFFFFFFFFFFFFFFFFFFFFFFFFFFF, and now you've went from 2^120 down to 2^117, 8 times smaller. BUT again, if the key does not start with C, D, E, or F, you won't find the key.

Dividing is fascinating because in your mind you see a much smaller search range, BUT the amount of pubkeys you have to search GROWS the smaller you cut the search range.

So I understand you subtract C00000000000000000000000000000 from 02CEB6CBBCDBDF5EF7150682150F4CE2C6F4807B349827DCDBDD1F2EFA885A2630 the public key for 120 and for example if you wanted to search F then you would subtract F00000000000000000000000000000 from 120 public key? and then search the same range 0:FFFFFFFFFFFFFFFFFFFFFFFFFFFFF

Correct.

i was thinking last night that we treat each keyspace as if they were separated by a wall but they are not so i measured the distance between 115 and the center of 60 then reduced the public key of 115 by that amount. i hit the 115 public key ( i scanned a thru f on 60 and about one hour later I got a hit. Key found privkey fc07a1825367bbc
Publickey 0242257a130fe109c25c2ca6c60af60e5849305f77370401299b63da2094ec0297 and the addition + 31464123230573851029232324144930570 . Trying it on 120 but so far no luck. i wish I had this kind of luck on 120 or the powerball lol. I have a image of the hit but don't think I can post it. The addition goes to the private key found

WanderingPhilospher

full member

Activity: 1162

Merit: 237

Shooters Shoot...

Quote from: unclevito on July 04, 2021, 11:09:35 AM

Quote from: WanderingPhilospher on July 03, 2021, 11:59:57 PM

Just FYI, for my 2 cents, if you know the range a key lies in, or want to gamble and take a chance where you think the key may lie, then I think subtraction is better.

Like I said a few posts back; we will take #120 puzzle for example. The private key can only start with 1 of 8 possibilities: 8, 9, A, B, C, D, E, F

Let's say you think it starts with C. You can then take the pubkey and subtract by C00000000000000000000000000000. Let us now say for example purposes the private key is:
C23BD97E765A75F0D6D4A6C6B67221.

So for your search range, after subtracting the C000....would be 0:FFFFFFFFFFFFFFFFFFFFFFFFFFFFF

By subtracting, you went from a search range of 2^120 to 2^116; 16 times smaller the original search range. BUT if you guessed wrong and the key does not start with C, then you will not find the key.

Staying with the same example, if you thought it started with C, D, E, or F and you subtracted by C000....then you could search the range of:
0:3FFFFFFFFFFFFFFFFFFFFFFFFFFFFF, and now you've went from 2^120 down to 2^117, 8 times smaller. BUT again, if the key does not start with C, D, E, or F, you won't find the key.

Dividing is fascinating because in your mind you see a much smaller search range, BUT the amount of pubkeys you have to search GROWS the smaller you cut the search range.

So I understand you subtract C00000000000000000000000000000 from 02CEB6CBBCDBDF5EF7150682150F4CE2C6F4807B349827DCDBDD1F2EFA885A2630 the public key for 120 and for example if you wanted to search F then you would subtract F00000000000000000000000000000 from 120 public key? and then search the same range 0:FFFFFFFFFFFFFFFFFFFFFFFFFFFFF

Correct.

unclevito

jr. member

Activity: 76

Merit: 4

Quote from: WanderingPhilospher on July 03, 2021, 11:59:57 PM

Just FYI, for my 2 cents, if you know the range a key lies in, or want to gamble and take a chance where you think the key may lie, then I think subtraction is better.

Like I said a few posts back; we will take #120 puzzle for example. The private key can only start with 1 of 8 possibilities: 8, 9, A, B, C, D, E, F

Let's say you think it starts with C. You can then take the pubkey and subtract by C00000000000000000000000000000. Let us now say for example purposes the private key is:
C23BD97E765A75F0D6D4A6C6B67221.

So for your search range, after subtracting the C000....would be 0:FFFFFFFFFFFFFFFFFFFFFFFFFFFFF

By subtracting, you went from a search range of 2^120 to 2^116; 16 times smaller the original search range. BUT if you guessed wrong and the key does not start with C, then you will not find the key.

Staying with the same example, if you thought it started with C, D, E, or F and you subtracted by C000....then you could search the range of:
0:3FFFFFFFFFFFFFFFFFFFFFFFFFFFFF, and now you've went from 2^120 down to 2^117, 8 times smaller. BUT again, if the key does not start with C, D, E, or F, you won't find the key.

Dividing is fascinating because in your mind you see a much smaller search range, BUT the amount of pubkeys you have to search GROWS the smaller you cut the search range.

So I understand you subtract C00000000000000000000000000000 from 02CEB6CBBCDBDF5EF7150682150F4CE2C6F4807B349827DCDBDD1F2EFA885A2630 the public key for 120 and for example if you wanted to search F then you would subtract F00000000000000000000000000000 from 120 public key? and then search the same range 0:FFFFFFFFFFFFFFFFFFFFFFFFFFFFF

WanderingPhilospher

full member

Activity: 1162

Merit: 237

Shooters Shoot...

Quote from: brainless on July 04, 2021, 09:28:12 AM

Quote from: WanderingPhilospher on July 04, 2021, 09:10:54 AM

Quote from: brainless on July 04, 2021, 08:18:53 AM

Quote from: WanderingPhilospher on July 04, 2021, 01:59:25 AM

Quote

Good job
just correct one line
Also, I have accomplished what brainless has done now/in the past, but with a twist.
now/in the past >> in the past
remove "now", as no one know whats NOW
and in the past aprox a year ago

Haha! Got it!

Ok, so what are you working on NOW? I know you are always doing some kind of pubkey manipulation/tinkering. Any newly found secrets or tips you have found?

If i post 260 pubkeys in 110 bit rang. Maybe zieler with his gpu bank could find in a year.
If i print 720 pubkeys in 90 bitrange. How much days need to find ?

Probably 1.5 to 2 hours per pubkey; but all Tames would be players, which may speed it up, especially the latter pubkeys. Would probably go with a little higher DP to try and cut down on tame and wild file size.

How many pubs would be in the 2^90 range?

1/720. 90bit
16/260 110bit

The above was an estimate using my hardware. I ran tests in the 92 bit range, with high DP (32) and it took around 1.5 hours.
If you are asking about Zielar's hardware, I would imagine he could run each pubkey, combine and check for solve, in around 33 days total. Maybe faster with 90 bit.

brainless

member

Activity: 348

Merit: 34

Quote from: WanderingPhilospher on July 04, 2021, 09:10:54 AM

Quote from: brainless on July 04, 2021, 08:18:53 AM

Quote from: WanderingPhilospher on July 04, 2021, 01:59:25 AM

Quote

Good job
just correct one line
Also, I have accomplished what brainless has done now/in the past, but with a twist.
now/in the past >> in the past
remove "now", as no one know whats NOW
and in the past aprox a year ago

Haha! Got it!

Ok, so what are you working on NOW? I know you are always doing some kind of pubkey manipulation/tinkering. Any newly found secrets or tips you have found?

If i post 260 pubkeys in 110 bit rang. Maybe zieler with his gpu bank could find in a year.
If i print 720 pubkeys in 90 bitrange. How much days need to find ?

Probably 1.5 to 2 hours per pubkey; but all Tames would be players, which may speed it up, especially the latter pubkeys. Would probably go with a little higher DP to try and cut down on tame and wild file size.

How many pubs would be in the 2^90 range?

1/720. 90bit
16/260 110bit

WanderingPhilospher

full member

Activity: 1162

Merit: 237

Shooters Shoot...

Quote from: brainless on July 04, 2021, 08:18:53 AM

Quote from: WanderingPhilospher on July 04, 2021, 01:59:25 AM

Quote

Good job
just correct one line
Also, I have accomplished what brainless has done now/in the past, but with a twist.
now/in the past >> in the past
remove "now", as no one know whats NOW
and in the past aprox a year ago

Haha! Got it!

Ok, so what are you working on NOW? I know you are always doing some kind of pubkey manipulation/tinkering. Any newly found secrets or tips you have found?

If i post 260 pubkeys in 110 bit rang. Maybe zieler with his gpu bank could find in a year.
If i print 720 pubkeys in 90 bitrange. How much days need to find ?

Probably 1.5 to 2 hours per pubkey; but all Tames would be players, which may speed it up, especially the latter pubkeys. Would probably go with a little higher DP to try and cut down on tame and wild file size.

How many pubs would be in the 2^90 range?

Topic: Pollard's kangaroo ECDLP solver - page 49. (Read 59436 times)