|
Lol, in my short lived duration of being a source a few years ago, I asked people to provide information, or teach me something new and asked for other tasks, but then I realized I'm using merit for personal gain.
IMHO, it shouldn't be given out when a source is satisfied with a comment, it should be based on the effort and the weight of the content, sometimes a sentence could teach you what you could learn in 10 years of a life time, but mostly the posts are the same old repetitions just revised more carefully to pass the merit source criteria.🤣
Btw, where is this cash jet guy thread you mentioned he seems like a good target guy? I need to go fishing some merits, my merit-blood is low for some time. Lol.
|
|
|
|
This part of your post "19...................." is more important, but you are hiding it, so.... And I think pretty much addresses and private key ranges have no relation, it is useless to look for addresses when you do operations on public keys. Besides, you have to tell us whether this key is -n or +n, but if you give me the key you subtracted from #125 which starts with 19, I could tell you the -n or +n of this key 02c0643bd28d11d650b24dae3143b1d3578e6a3597a9395f43c25ead8ed2a9298f im sorry i just saw now -n and +n,, i thought you where saying -a , -s ... what is +n and -n bro ? Lol, weren't you teaching me how these things work a couple of hours ago? 😅 you tell me what it is, but here what I know and can share. This is N = FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 And this is my private key : +n 000000000000000000000000000000000000000083c88248824882488248f3cf Now if we convert both keys above to decimal and subtract my +n private key from N, we will get this : fffffffffffffffffffffffffffffffebaaedce62b801df33d89dc444ded4d72 My +n public key starts with 02 = 02787612ded11193e4bb5490c31d24c5a75bcec9fda0f794979556aec260990ab3 And my -n public key starts with 03 = 03787612ded11193e4bb5490c31d24c5a75bcec9fda0f794979556aec260990ab3 So one is a negative number as far as elliptic curve concerns, we call it -n and my original key is +n. Now if you take the -n public key and add to it, you'd be actually subtracting from my +n key, so as my +n key is growing smaller, so does my -n key, because they are both moving towards the end of the line which for my -n is N itself and for my +n key the end is 0. Now if you don't know whether the key you are dealing with is -n or +n, you could try to subtract from -n key, while you'd be actually adding the -n key to whatever you were trying to subtract from it, so if you don't know - or +, all operations performed could be backwards, addition could be subtraction and vice versa. First you'd have to understand the add/subtract functions on elliptic curves, you need to know what negative in negative means, what negative in positive means and then you could do things the right way. ( I'm not there yet though). Another thing you could do is division, if you multiply my +n public key with this : 7fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a0 Since my +n private key ends with 9 when converted to decimal, multiplying it by the key above would divide my -n key by 2 because the -n key ends with 8 and is an even number which we could divide by 2, however if you add G or 1 to my +n key it will become an even number and you could divide it. Furthermore, when you are dividing a key by N/2 aka the above key, it doesn't matter which key you are using, either +n or -n would do the same, only if the +n is even, otherwise good luck running on a never ending loop of divisions. Sometimes, when you are subtracting from a puzzle public key, some of the results are even numbers, you could divide them by 2, that way you'd be 50% ahead of the game. Here is another trick you didn't know about, when you are using key sub tool, if you do -a -s together and then subtract the 2 keys which are next to each other, one has # - something and one has # + something, subtracting those 2 public keys would result in double of your target key. Be careful when you do that because the key before # - sign is -n, subtracting it from any key means addition, just switch it's x coordinate if it is 02, change it to 03 and if it is 03 change it to 02 before doing the subtraction, you would know you are doing it right when you multiply your target by 2 and having it to compare with the results of your subtraction.
There now, you have just learned 1 year worth of going to university in 30 minutes. 🤣 Ps, I wonder, if I know all these stuff, why can't I do any jack? These questions keep me up at days, since I sleep at nights. Lol^125. |
|
|
|
This part of your post "19...................." is more important, but you are hiding it, so.... And I think pretty much addresses and private key ranges have no relation, it is useless to look for addresses when you do operations on public keys. Besides, you have to tell us whether this key is -n or +n, but if you give me the key you subtracted from #125 which starts with 19, I could tell you the -n or +n of this key 02c0643bd28d11d650b24dae3143b1d3578e6a3597a9395f43c25ead8ed2a9298f |
|
|
|
You can restore an encrypted message by decrypting, but you cannot unhash a hash. Yes, you cannot "unhash a hash" if you only know the final hash, and the hashing algorithm. However, you can execute hash function backwards, if you have enough data. Precisely speaking, if you know initial hash, and final hash, you cannot compute data in-between without breaking hash function. However, you can make it bidirectional: not only you can start from initial hash and data as your input, and reach final hash as your output, but you can also take the final hash and data as your input, and reach initial hash as your output (execute it backwards). If you want to see in practice, how SHA-1 can be executed backwards, you can see this post when I started from "2328fad3 75109b40 3f121481 02e1def6 cfd74e98", and passing the message with all zeroes resulted in the same final hash. But it's impossible to go backwards, even going backwards does not reveal anything about the original input, because the input is irrelevant to the output. You could have empty string as input, how can we perform the hash function backwards to reach something that doesn't exist? What you have done with SHA-1 is possible because you already know the input, without knowing the input whatever you do is blind guessing.
The difference between a hash and a public key in secp256k1 is that you can verify the authenticity of a file or data having the said file or data, but in ECC you can't have the data (private key) while by having a message signed by that data you can confirm the authenticity of the message, the message could be a transaction or just a message. What sets them apart is the fact that both hash function and ECC can be solved, you could solve the "hash problem" by finding a collision, also you could solve a public key by finding a divisor. Finding a collision should be easier IMO since the number of collisions is far far greater than number of private keys in EC. |
|
|
|
If the target key is not a prime number, you could find a divisor for it, it could either be an even number or an odd number, I guess nobody has ever tried it yet.😉
i try it two years ago, don't believe that you are the only guy who can think, i guess that some math guy already try all this some 30 or 20 years ago. I wonder if 20, 30 years ago there was any incentive for the math guy to try things harder, but you know even if Newton hadn't discovered gravity we would still be living our lives, just because no one has found the solution doesn't mean the solution doesn't exist.
Finally you reached the root problem or in other words security behind secp256k1. Figuring out Odd vs Even is literally the DLP itself. By far, any form of calculation on the curve won't work due to clock math nature of rounding around the resulting points.
But that going around the curve happens when you try division or + - with very large keys, if you limit your range of operation to a certain bit range, you could eventually find a check point. For simplicity : E.g. subtracting 200 from 1700 = 1500, subtracting 200 from 1500 = 1300, subtracting 1000 from 1300 = 300, subtracting 1700 from 2000 = *300! * see how we reached our checkpoint so fast just with a few normal elementary math operations? What makes it difficult is the size of the actual keys we are looking for, and what we are looking for is not even 0.1% of 2^256 range which most of the people's keys reside in. So far this 0.xxxxxxxx% of the curve order has kicked our asses collectively. 🤣 |
|
|
|
Still doesn't prove anything important that is needed to crack puzzle #125.
What have you done now? Did you compress the public key to a smaller range? it could be invalid public key
don't understand how you think it's easy to get #125 even though its more tougher than pzzle 66 from my own point of view.
What do you mean by invalid public key? Whatever you put into elliptic curve it will give you a valid result no matter what, the only number I found that will never give any result is adding or subtracting N itself to or from any key. You could add 2^512 to a random key and yet have a valid result, it depends on the implementation you are using. What I am trying to do has nothing to do with brute force, solving DLP or anything similar, I just add and subtract, because public keys are just representations of numbers, and we could reduce numbers by simple subtraction operation. |
|
|
|
If the target key is not a prime number, you could find a divisor for it, it could either be an even number or an odd number, I guess nobody has ever tried it yet.😉 I'd imagine finding the correct divisor is as difficult as solving the DLP, maybe solving DLP is exactly finding the correct divisor, I wouldn't know, because I never finished high school.🤣 |
|
|
|
|
New information, investigate it to find #125, God willing.
Subtract this from #125 (you should convert it to whatever your calculator accepts, note, if #125 public key is e.g. 125 and the below key is 5, I don't mean to subtract 5 from 125, that could result invalid public key, so do subtract the public key of the key I gave you from #125 public key)
000000000000000000000000000000000cfbcda3ac10c9714fbcda3ac10c9700
Then tell me what you see.
Is this what you see?
0229ec62f37968906686bfad34ad5fdd9008fe187d868c0c4f9de1055b3062f00e
Now
Subtract this from 2^125
000000000000000000000000000000000cfbcda3ac10c9714fbcda3ac10c9700
Is this what you see?
000000000000000000000000000000001304325c53ef368eb04325c53ef36900
The relation of above keys with #125 is the same relation of #125 and 2^125.
If you managed to solve #125, I'd like half of it, thanks.😉
|
|
|
|
@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.
Well, a few hours ago you didn't know -n and +n keys are one and the same, now you are saying I can't for example add "F" to "1" to reach "10"? (Hex) But instead I need to add 02d7924d4f7d43ea965a465ae3095ff41131e5946f3c85f79e44adbcf8e27e080e To 0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798 In order to reach 03e60fce93b59e9ec53011aabc21c23e97b2a31369b87a5ae9c44ee89e2a6dec0a If you are not using a decent calculator, you should find one. Because it makes your job a lot easier. |
|
|
|
|
Recently someone was trying to sell a script to halve nonces, maybe it is relates, he might have been russian or something.
It could be that some of those addresses are actually puzzle addresses, so taking from them is not considered theft.
Though there are still some low range keys with exposed public keys, they are free to break into them and take all the "loot" if they can.
But you know, it is one of the rules of the universe, the bad guys are destined to fail at the end.
|
|
|
|
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 "-"!' 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.
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.
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.
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.
The closest one is 03ed01ff219ed5c1afc12d991a82e3063ddcee1fd53b46f7cad52a0d87a7112aed, it should be searched for in the 124 range. 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.😉 |
|
|
|
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.. 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.
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.
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. Yeah those sissy programs are doing pure mathematics BUT doing it 10000000000+ times faster than you and not becoming confused after 100 pubkeys. Lol.
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? |
|
|
|
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. |
|
|
|
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.😉 |
|
|
|
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? 😉 |
|
|
|
Are the result and green keys public keys or private keys? Because without context, they could be either one.
You mean you don't know the difference between a public key and a private key? Why would I add or subtract a private key starting with 02 or 03 when #125 starts with 32 zeros, lol indeed.
Subtract the public key of 128 dec, from 129 dec, result is G or 1. So what is the difference between adding or subtracting private keys and public keys? There is no magic here, you are either adding 2 keys or subtracting a smaller one from a greater key, the result is always the same. |
|
|
|
|
Guys I need some help over here! So here is what I have so far.
I have subtracted this from #125.
0000000000000000000000000000000010******************************
The result is :
02c473281c8531d524c1a2b92b9192ffe3e8124448e47ec306f146f2f4f35269ee
Now if I add that result to this one :
0387a3951644f3bf9ee08135bcb9a00a31ed7b09e26ff7850b83713eb6f0582920
I get this key :
000000000000000000000000000000000c******************************
Ok, now I have the distance between the green key above and #125, which is :
000000000000000000000000000000000 4******************************
So why can't I figure the correct key while I have my double triangle, 3 known keys plus 3 unknown keys?
|
|
|
|
|
So what happens if Satoshi is trying to spend some of his coins? I mean we can't expect him to abandon his coins for the rest of his life, he has to spend them sooner or later, the former is better IMO.
|
|
|
|
|
Do we need to mine this emerging garbage coin?
How many were pre mined?
What I wanna know, is someone in control of the supply and the chain or not?
If they are, then it's a garbage like any other, if they are not, then it's also another type of garbage like any other.
I really don't understand the meaning of smart contracts if they are being controlled by some third parties.
|
|
|
|
|
Hi dev,so I was wondering, is it possible to run key sub on android? Since it doesn't require any computing that much, it should be no problem to run it on a phone, have you ever done such a thing or is it too hard to do?
|
|
|
|
|
Show Posts
