Pages:
Author

Topic: == Bitcoin challenge transaction: ~1000 BTC total bounty to solvers! ==UPDATED== - page 21. (Read 54326 times)

full member
Activity: 1162
Merit: 237
Shooters Shoot...
Quote
Listen, I don't know how BSGS or any other sissy program works, I deal with pure mathematics. If I knew whatever you are saying, I'd be doing it already. Lol.
Yeah those sissy programs are doing pure mathematics BUT doing it 10000000000+ times faster than you and not becoming confused after 100 pubkeys. Lol.
jr. member
Activity: 75
Merit: 5
Okay Thank you very much. I understand it now. Thanks
hero member
Activity: 583
Merit: 502
From my calculations, if you Subtract this
0302157655af8bb1decd37d161aa92cc7050cae1d6b4f44e4aa04507e3c1855159

From this
000000000000000000000000000000001e739ce739cf7bdef7bdef7bdef7be0c

you don't reach #125.

Can you explain how do you calculate that to reach #125, please? I'm curious.
hero member
Activity: 862
Merit: 662
I am very confused about the subtracting of private keys from public keys and vice versa and also adding the private keys to the public keys. I was able to add the private keys together to get 2^125 and vice versa but where the confusion came in was when I needed to add and subtract private keys from public keys and vice versa. can you please explain more. I'm very new here. Thanks.

You can't add or subtract directly a privatekey (K) to a publickey (B).

You need first calculte the publickey of K (A) and them you need to do the Add or substraction operation bewteen the publcikeys A + B or A - B etc..
jr. member
Activity: 75
Merit: 5
I am very confused about the subtracting of private keys from public keys and vice versa and also adding the private keys to the public keys. I was able to add the private keys together to get 2^125 and vice versa but where the confusion came in was when I needed to add and subtract private keys from public keys and vice versa. can you please explain more. I'm very new here. Thanks.
jr. member
Activity: 75
Merit: 5
Oh! I see what you mean now. There is no computational program involved in this calculations. It's just pure maths and I completely understand what you are trying to say now. I thought I just had to work through the range scanning with my computer to get the private key equivalent to the public key for 125 puzzle but I was wrong. Okay let's get to work here then. I got to get my calculator ready to do some huge number calculations here. And by the way, I'm actually a newbie here. It says the same on my newly registered account. I'm very very new to this for real. but I'm a fast learner so let's get to work here.
copper member
Activity: 1330
Merit: 899
🖤😏
okay It's a little bit confusing but since it's got to do with calculations, it is clearly understandable. so after the addition and subtraction of the bigger and smaller key ranges, my BSGS public key to attack would be the result of the added / subtracted result right? or all I need to do with the result is just the range to search the initial public key for Puzzle 125 public key. because I believe BSGS deals with only public keys. all we need here is to do the maths to get the range to search from. and after getting that range, am I doing random attack or sequential attack? thanks.
Listen, I don't know how BSGS or any other sissy program works, I deal with pure mathematics. If I knew whatever you are saying, I'd be doing it already. Lol.

Ps, why is it that you registered this account just to ask questions? Are you embarrased to use your main account?

Because if you'd ask these questions with your main, I'd provide more info.

E.g. there are billions of public keys ending with "f00e" in 2^125 range, and they are all connected with some other public keys, they are connected mathematically.

To show you what I mean, take this public key

0399ae0cf361425cbea86fc0c1fecdff5f61ca8a4c4c28a1db891f3d651dc7f00e

If I subtract it from #125, the result is directly connected to this key

0286936a275e6d53bb2b2718c93d8a5aa44f371f6e0300abb73b89dd851d2fbe88

And I add the distance between "be88" and fake #125 key above to the distance between real #125 key and fake #125 key, I will reach 2^125.

Now I have another similar key which is connected to this key

0302157655af8bb1decd37d161aa92cc7050cae1d6b4f44e4aa04507e3c1855159

And the same thing applies to them as well, adding their distances would reach 2^125 key.

Now what I'm working on, I'm trying to find a way to place this key

0286936a275e6d53bb2b2718c93d8a5aa44f371f6e0300abb73b89dd851d2fbe88

And 2^125 between #125 key instead of having 2^125 on the side, meaning to find a way to add to the key above either to reach 2^124, 2^125 or #125. No success so far.

If I could stay focused and not get confused with thousands of public keys, I could generate more offsets to compare, but when I look at more than 100 keys I get confused and can't focus.
jr. member
Activity: 75
Merit: 5
okay It's a little bit confusing but since it's got to do with calculations, it is clearly understandable. so after the addition and subtraction of the bigger and smaller key ranges, my BSGS public key to attack would be the result of the added / subtracted result right? or all I need to do with the result is just the range to search the initial public key for Puzzle 125 public key. because I believe BSGS deals with only public keys. all we need here is to do the maths to get the range to search from. and after getting that range, am I doing random attack or sequential attack? thanks.
copper member
Activity: 1330
Merit: 899
🖤😏
I get that fact now bro, let's do the maths and not be a pussy. I'm new on the calculations part too and I am very much interested in puzzle 125 as well. How do we begin the calculation? my machine can also go as much as 80 Pkeys/seconds for puzzle 125 on Keyhunt BSGS Mode. Give a range lets search some more. I've only been randomly searching bit range 125 for over 20 days now still no luck.
Ok, here you go.
Subtract this
0302157655af8bb1decd37d161aa92cc7050cae1d6b4f44e4aa04507e3c1855159

From this
000000000000000000000000000000001e739ce739cf7bdef7bdef7bdef7be0c

To reach #125.

Adding this
00000000000000000000000000000000018c6318c630842108421084210841f4

To the key above will get you 2^125.

Subtracting the above from this

0286936a275e6d53bb2b2718c93d8a5aa44f371f6e0300abb73b89dd851d2fbe88

Will get you this

0302157655af8bb1decd37d161aa92cc7050cae1d6b4f44e4aa04507e3c1855159

Therefore, #125 is smaller than
000000000000000000000000000000001e739ce739cf7bdef7bdef7bdef7be0c


Note, if you add this

0286936a275e6d53bb2b2718c93d8a5aa44f371f6e0300abb73b89dd851d2fbe88

To #125, you will reach 2^125.

If you are smart enough you should figure out  what the above key actually is, by eliminating possible candidates, meaning you should find keys  smaller than this
000000000000000000000000000000001e739ce739cf7bdef7bdef7bdef7be0c

And compare their distance to 2^125, with this one

0286936a275e6d53bb2b2718c93d8a5aa44f371f6e0300abb73b89dd851d2fbe88

If you could find a key greater than above to add to another key in order to reach #125, then that key is smaller than #125.

I know it's confusing, but you need to put #125 in the middle of a smaller one and a greater one, then the distance between those 2 keys is

0286936a275e6d53bb2b2718c93d8a5aa44f371f6e0300abb73b89dd851d2fbe88

You'd solve the puzzle.😉
jr. member
Activity: 75
Merit: 5
I get that fact now bro, let's do the maths and not be a pussy. I'm new on the calculations part too and I am very much interested in puzzle 125 as well. How do we begin the calculation? my machine can also go as much as 80 Pkeys/seconds for puzzle 125 on Keyhunt BSGS Mode. Give a range lets search some more. I've only been randomly searching bit range 125 for over 20 days now still no luck.
copper member
Activity: 1330
Merit: 899
🖤😏
I see many of yours message in this topic; do you have a good machine to try your ideas/calculation? Why don't you want to understand that puzzle isn't solvible with the math, but you need a massive hardware computation

for only tryin to solve it. At this stage, I guess that puzzle 66 will require many months to be solved, unless community will combine its own force.
I wonder if you read my posts then why haven't you noticed that I'm not solving #66, but #125.
Bitcoin public keys represent numbers like 1, 2, 3 etc, the only way to find them is through math.

Anyone using powerful hardware to find a puzzle is a pussy, so using hardware to do the job is for pussies, now tell me, are you a pussy? Do you want to rely on silicon wares and keep your brain zipped or are you going to use it and join the team of real men? 😉
legendary
Activity: 1582
Merit: 1196
Reputation first.
@kalos, I don't know what you are doing looking for addresses in 125 bit! When you have public key.

But, here let me give you a hint
000000000000000000000000000000001e739ce739cf7bdef7bdef7bdef7be0c

0302157655af8bb1decd37d161aa92cc7050cae1d6b4f44e4aa04507e3c1855159

Add the keys above to each other and tell me what you see.

I see many of yours message in this topic; do you have a good machine to try your ideas/calculation? Why don't you want to understand that puzzle isn't solvible with the math, but you need a massive hardware computation

for only tryin to solve it. At this stage, I guess that puzzle 66 will require many months to be solved, unless community will combine its own force.
jr. member
Activity: 50
Merit: 1
@kalos, I don't know what you are doing looking for addresses in 125 bit! When you have public key.

But, here let me give you a hint
000000000000000000000000000000001e739ce739cf7bdef7bdef7bdef7be0c

0302157655af8bb1decd37d161aa92cc7050cae1d6b4f44e4aa04507e3c1855159

Add the keys above to each other and tell me what you see.


i told you im working on 125 bit, that means, im substracting the 125 with -f address to find similar address because when you substract you will have the end space ffffffff..... to 125 bit space,,, we can get any address in bit 90 or 100 im trying to guess a smaller range to search the sub there you get it bro ?? and yes there is a diffrence, and for now im working on public keys to find their range exactly that will help scaning in smaller range instead of scaning in hole 125,

im looking for address in 125 ? did i say that ?? no bro,, ill show exemple
keysub -p 0233709eb11e0d4439a729f21c2c443dedb727528229713f0065721ba8fa46f00e -s -n 2147463600000 -r 0:1f245bd3efe3ab8768efc849659bef11 -o D:\test3994.txt

so here , ill have the address from end range to 120, im searching for closer range by matching same address first 7 digits or hash160.

copper member
Activity: 1330
Merit: 899
🖤😏
@kalos, I don't know what you are doing looking for addresses in 125 bit! When you have public key.

But, here let me give you a hint
000000000000000000000000000000001e739ce739cf7bdef7bdef7bdef7be0c

0302157655af8bb1decd37d161aa92cc7050cae1d6b4f44e4aa04507e3c1855159

Add the keys above to each other and tell me what you see.
jr. member
Activity: 50
Merit: 1
guys, windows is closing. we need a new method to solve ECDLP with wallet address only.
Yeah about that, it's the other way around, we solve the address using EC only, the DLP  part can be solved through public keys and not addresses.



I have an idea, why not picking a key from the middle of 66 bit range and start adding and subtracting to it using key subtract in address mode, you never know, you might get lucky and find puzzle 66, at least this way you could adjust start and end range of addition and subtraction, then you could for example, add and subtract 1 million keys to your middle of the range key with this stride "10000000000" and then add and subtract the same to another key, repeat that until you see #66 address, but we have no tool capable of doing that by itself, so you'd have to do addition and subtraction a few million times by hand, but if we could modify key subtractor to do that by itself, it would be great.

I wonder who is a wondering developer around these woods? !!!😉



thats what im doing in 120 and 125 now for months , now im just searching for addresses that matches the range of 00000000000000 or end range fffffffffff to guess the range of 125 bit.. my opinion from lot of calculations, pr of 125 between 30 and 9f.. the a to f range is in the end of keyspace i guess that and i dont know for sure but im trying, now,,

and ,, no digaran thats a bad idea,, you substract only from the public key and try to guess the range by similar first 7 digits of address is the same in range 100 or 80,,, but doing that to find 66,,, no men,, ill run vbcr with 10mkey per second and not substraction of 1 million per 10 minutes and searching,, bad idea, but its good on 125 onlyy Smiley,,, thats is impossible to get lucky and have find address that you now its prvkey,, but its not impossible,, sometimes i do that for fun, but you must be very lucky men
copper member
Activity: 1330
Merit: 899
🖤😏
guys, windows is closing. we need a new method to solve ECDLP with wallet address only.
Yeah about that, it's the other way around, we solve the address using EC only, the DLP  part can be solved through public keys and not addresses.



I have an idea, why not picking a key from the middle of 66 bit range and start adding and subtracting to it using key subtract in address mode, you never know, you might get lucky and find puzzle 66, at least this way you could adjust start and end range of addition and subtraction, then you could for example, add and subtract 1 million keys to your middle of the range key with this stride "10000000000" and then add and subtract the same to another key, repeat that until you see #66 address, but we have no tool capable of doing that by itself, so you'd have to do addition and subtraction a few million times by hand, but if we could modify key subtractor to do that by itself, it would be great.

I wonder who is a wondering developer around these woods? !!!😉
legendary
Activity: 1568
Merit: 6660
bitcoincleanup.com / bitmixlist.org
guys, windows is closing. we need a new method to solve ECDLP with wallet address only.

What do you mean by "windows is closing"?

Also, you can not solve the ECDLP problem using wallet address, because they are a hash of the public key, not the public key itself. Now it is theoretically possible that you break 160-bit space and find a private key that encodes into the exact same address, which can then be used in transactions to fool script verifiers since they only include the address hash in UTXOs. But that's a completely different matter.
newbie
Activity: 1
Merit: 0
guys, windows is closing. we need a new method to solve ECDLP with wallet address only.
full member
Activity: 282
Merit: 114
Wow, look what I found!  I found it using my phone, I also have another one on laptop.

0399ae0cf361425cbea86fc0c1fecdff5f61ca8a4c4c28a1db891f3d651dc7f00e

Imagine my face when I realized they are both different keys.🤣

And what? What success have you achieved?
copper member
Activity: 1330
Merit: 899
🖤😏
Wow, look what I found!  I found it using my phone, I also have another one on laptop.

0399ae0cf361425cbea86fc0c1fecdff5f61ca8a4c4c28a1db891f3d651dc7f00e

Imagine my face when I realized they are both different keys.🤣
Pages:
Jump to: