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

@digaran:

Man, this is the last I'm going to say about the subject: You are doing the calculations wrong, like alberto said and WP repeated to you, you can't do operations on public keys and privet keys at once, you can't mix them, they are not in the same context. One makes reference to the other, but they are not in the same category (excuse my writings, English is not my native language).

To prove my point, you should use any script that manages public keys/privet keys and you will realize that you are doing it wrong.

It's not criticizing, I just want you to advise that you are wasting your time doing that kind of operations.

Good luck, man.

There is a chain of lols in this page and previous one.
Don't let the looks of private keys deceive you.

This is N

FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141

Now in order to find the inverse of your private key, just subtract it from N and you will have negative x coordinate of your private key. You should know whenever you generate an address, you are actually generating 4 addresses which you could use, but only can control 2 addresses with your key unless you subtract the key from N to obtain -n of your private key.

In ECC, those large private keys are just negative numbers, till you reach the middle range, meaning half of all private keys are negatives, the other half are positives.

So, as I said earlier, in order to subtract a private key from your public key, it's best to switch x coordinate and also switching the x coordinate of the result because it would be -n and as you did yesterday, subtracting something from a -n key will actually add the 2 keys together, also adding to a -n key as I said will subtract from the +n version of your key.

You should use another calculator which shows, accepts public keys with 02 and 03, this way you won't get confused as to whether you are adding or subtracting.

---

You can just multiply G by any number in one go, adding or subtracting and I'm not talking about under the hood as you like to say, but manually you can just add 2 private keys directly to have a resulting public key, though you don't have to manually convert a private key into a public key and then try math operations on them.

Also, do kangaroo and BSGS do any division? If they are not, then they are useless, if they do then again they are useless because by dividing properly, you should find a key in a much much shorter period of time.

However I'm guessing kangaroo might do division but ECC doesn't bend so easily.

---

This key you call the closest one could have a size half the 2^124.
I might be wrong but somehow I can say with 50% certainty that #125 starts with 0x1c. If I'm right it could help a lot in further lowering the bit range, this has taken me more than 45 days and I am still not sure.

---

Maybe, maybe one way to figure out if we are subtracting too much from #125, would be to start subtracting a bigger key and keep reducing it's size very carefully till we see a -n key as a result,  though because of this mod thingy it is extremely difficult to determine if the result is -n or not.

Chop chop guys, the rich and wealthy are about to use their silicon wares and grab our loot, we need to step up our game.😉

You can't convert public keys to privet keys (at least not yet). What you can do is what BSGS do: try a privet key, convert that one to public key, and see if it match the public key you are looking for; if it don't match, try the next one, and so on.
 

Well, it's amazing that even you wrote it yourself, you don't realize what your saying. As you can clearly see on your own example "0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b" and "0330210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b" have different privet keys, which is what I wrote, Now do you understand?

BTW, there are no privet keys 'with a minus sign "-"!'

but I'm asking for the closest private key to work with on the BSGS. I'm still learning how to convert these public keys to private keys

The closest one is 03ed01ff219ed5c1afc12d991a82e3063ddcee1fd53b46f7cad52a0d87a7112aed, it should be searched for in the 124 range.

So If I have to start from a range on BSGS according to your mathematical calculations, which key is the closest that you almost thought could have hit puzzle 125... lets search within that range on BSGS. then we can all share some funds together too.

Hello.
You apparently did not carefully read what @digaran wrote to you.
If you change #125 02 to 03, you will get the same private key as #125 but with a minus sign "-"!
The public key 0333709eb11e0d4439a729f21c2c443dedb727528229713f0065721ba8fa46f00e is also on the EC, but on the other hand.

For example, puzzle #65:
Private key: 00000000000000000000000000000000000000000000001a838b13505b26867
Public key: 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b


Private key: fffffffffffffffffffffffffffffebaaedce6af48a03a1799ad57ca83d8da
Public key: 0330210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b

Now do you understand?

Just stop lol. Read what he said. You can’t subtract a private key, a private key, from a public key. Yes, you have to convert the private key to a public key before subtracting it from another public key.

All those programs you are calling sissy, do math like you are doing.

Kangaroo, for the wilds, takes given pub key, subtracts or adds the distance it landed on/calculates what the input pubkey plus or minus the distance (private key) and checks if resulting pubkey starts or ends with whatever DP the user supplies. If it is a matching DP, the program keeps it in memory/stores it to a file. Now if the resulting pubkey is found by a tame, you have a match and have solved the pubkey’s private key you are looking for.

You can supply/run as many ranges as you want to. It’s not limited to one range.

The thing is that the "x" coordinate of #125 is: 33709eb11e0d4439a729f21c2c443dedb727528229713f0065721ba8fa46f00e; so I don't see how do you add "F" to 03 x coordinate of #125. Not only that, but if you switch "02" to "03" on a public key, you are talking about a very different privet key, so 0333709eb11e0d4439a729f21c2c443dedb727528229713f0065721ba8fa46f00e is no longer #125.

And BSGS don't use dp, it actually works in a sequential manner, deterministic, and not probabilistic like Kangaroo.

Thanks anyway man, but I think you should re-learn ECC, I can see you are confused on how it works.
Cheers.

I didn't expect from you, of course you can add or subtract private keys, don't you know public keys are just smoke and mirror, they simply represent private keys.  Maybe you don't have a calculator that could do that, tell me, is key subtracter doing the conversion first before operation? A week ago I encountered an anomaly, where I had to add or subtract a different key from my target to find a key, I still have the keys on my laptop, I might find them and show what I mean.

---

 
Switch x coordinate of that key and try again, remember whenever you have a private key, try to directly add or subtract with it for less confusion.

This way you should always change x coordinate of the result, because for example if you change the x of #125 from 02 to 03 in order to subtract something from it, the result could be -n key if the key you are trying to subtract from it is smaller than #125.

E.g. I subtracted "F" (15 decimal) from #125 by adding F to 03 x coordinate of #125, therefore the result is

03bb7d0fd320386226ff713108a743b3d2885e9f77f17da6654f40ae2a712af5d7

Now if you try to add anything to it, you'd be further subtracting from the puzzle key, turn 03 into 02 and add F to it to reach #125.

Now this key

0302157655af8bb1decd37d161aa92cc7050cae1d6b4f44e4aa04507e3c1855159

Is actually -n so you need to add the key above to it in order to subtract from it, now in ECC, subtracting a small key from a greater key or vice versa has the same result, just different x coordinate.

You could try to understand this by using a normal calculator, subtract 30 from 10, you will get -20.

No doubt, but they are not dynamic, they search user input range and can't change the range of search. Is BSGS doing any + & - ? Or it just randomly jumps up and down to find a dp?

Yeah those sissy programs are doing pure mathematics BUT doing it 10000000000+ times faster than you and not becoming confused after 100 pubkeys. Lol.

Okay Thank you very much. I understand it now. Thanks

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.

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..

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.

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.

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.

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.

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.😉