 Show Posts
|
|
Pages: [1] 2 »
|
you ignored my question, which proves that you cannot answer it plausibly. There is even a way to find out the range in which the key is located, ...
Really? So tell us what the range is where #66 is lying I apologize for not providing clarification. You can find out the range from the public key. There is even a way to find out the range in which the key is located, ...
Really? So tell us what the range is where #66 is lyingCurrently you are just one of hundreds of messiahs and wannabe bitcoin crackers who just post nonsense. Probably on top of that an awkwardly programmed forum bot. Until you prove otherwise, you remain a "smartass". Here are some posts of you before Jan/19th/202 1: https://bitcointalk.org/index.php?action=profile;u=3342959;sa=showPostsJust as an aside, here are your posts: other than the current one since yesterday, you last posted in January 2019. One read through your questions  2.5 years of radio silence before you speak up again here in this thread. A rogue who thinks evil Not meening offending, just being honest. Good luck in improving your chat bot algorithm I will break my word and answer once and only to you because you resorted to insults that are not justified. In order . 1. I told you that it is impossible to assign a range to the 66th key with hash160 (I do not know such a technique). And there is no open key to number 66. 2. You want to get an algorithm, because you think that there is a grail behind it. There is no grail behind him either. 3. You resorted to searching for my messages for the entire period in order to slander me and justify your supremacy, that you are right and I am still a fraud, which will very much calm your dryness. It is your right to do so. But if you read my messages, you noticed that I asked there if I know two different private keys that form the same public key and everything is the same up to the address, whether it is possible to damage the integrity of the curve. I received the answer that no. But everyone immediately, as now, was bombarded with questions, how did you find it, tell us and things like that, when I refused, everyone started calling me a fraud, just like now. Surely the human essence, if it does not get what it wants, then it resorts to insults. Then I had to ask the moderator to delete the message because there was a very large amount of slander and insults. Now it turns out that this is exactly what should be done. 4. As for why I didn't write for so long, everything is simple. After the slander, I took a break and had lunch on my soul. and if you notice again, my last message was January 19, 2022, a month later, the war began. So I live in a country where war has been going on for more than 500 days. Somehow it was not as written between shelling and bombs. Now I have calmed down a bit, so I decided to look at the forum and write, and everyone has already seen what happened. On the one hand, you are being bombarded, on the other hand, they are insulting you. An ideal picture of the universe. PS There will be no further answers. Anyone who wants can write anything, even insults in my direction, if it will make him feel better and he will please his pride, please. If the moderator deems it necessary, he can delete my posts so that they do not give rise to further insults in my direction and deviation of the forum topic from the main goal. Thank you to everyone who understood my answer. All my posts written above in no way intended to offend or humiliate any of the forum members or visitors. Thanks for the peace everyone. |
|
|
|
Ok, lets test your script without you revealing it to the public, just drop the first 2 characters on the left for this public key's private key :
03cefd304a9a8da40666e97b2d9650e31a71a9a9fcd29a24724d31a2fabbc8ea0e
Do you need the exact range or not? It has 32 characters and it starts with F, just drop the second character and give me the public key for it to verify, that could help a lot for others to believe you.
I did not understand your proposal very well regarding the range of your pk but for example if you eliminate the first 2 digits of your pk in decimal and generate another pubkey you will possibly get a pubkey that starts (although I recommend explaining the range better): 1= 03941029... 2=02caf96e4.. After I know what your pubkey is, I get the rest of the digits. without the need to generate millions of keys. I was very clear, I gave you my public key, and my private key has 32 hex characters starting with F, I just want you to drop the second character with your first try since there are only 16 possible answers, if your script works, you should be able to drop the second char from my private key. Only hex, I don't work with decimal or binary. I think you misunderstood my point, if I was able to know the second character easily ecc would be broken. just my script takes pk1=20540573305730573 and convert it for example to pk2= 3305730573 to know the first digits you would need to know pk2. all this without the need to save millions of results. my problem is that my computer basically runs out of power to reduce more. due to stress and hangs It is not necessary to reduce by so much pk2= 3305730573 Even one character is enough if you can reduce it clearly by 1 digit. pk2= 3 this is more than enough. |
|
|
|
There is even a way to find out the range in which the key is located, ...
Really? So tell us what the range is where #66 is lying I apologize for not providing clarification. You can find out the range from the public key. Then it will not be difficult for you to determine in what range this public key is located. 0359c777fb4a0bf9c16ba308259eb4f5ef2abfd2928a8f499cbdc47300f9dcb8d5 What strange people. You don't take my word for it, you always want confirmation. And then this and this. I regret that I again fell into the trap I fell into a year ago on the same forum. Everyone laughed at me. No more comments. Good luck to everyone. |
|
|
|
You can find out the range from the public key.
This is serious stuff, you probably didn't realize what you said... HOW ON EARTH YOU FIGURE THE RANGE FROM PUBLIC KEY? To believe in a word or not is your right. PS Everything will go to society together when the work is completed. Best regards. |
|
|
|
There is even a way to find out the range in which the key is located, ...
Really? So tell us what the range is where #66 is lying I apologize for not providing clarification. You can find out the range from the public key. |
|
|
|
It all lies in computing power, currently I can reduce the range of puzzle #130 to the equivalent of looking for the public key of puzzle #103 without slowing down the search (my resources aren't useful for looking for a public key in range 103 anyway), I could reduce more but I do not have the necessary resources for it and the search becomes slow, therefore it is my "acceptable" range. It doesn't seem unreasonable to me that more puzzles will continue to be found this year by comparing what I can do with basic resources with others who have many .
in short, a puzzle for rich people
Well, if you can really reduce the range down to 103 bits, there are already a few hunters with decent rigs willing to help you out and then you could use an escrow to split the prize, you could also divide the 103 bit range into 100 small ranges and search each one per day, after 100 days or even less, you will find the key, but the question is, are you really sure you can lower the range to 103 or even lower? What if the key you are looking for is not there? You need to provide a reasonable solution to prove that the target is in the said range. Good luck though, I'm off this puzzle till I see the private keys for #120 and especially #125, I might work on other puzzles here and there, but won't engage in sharing my findings and talk about possible solutions, as it seems we could spend more than 120 days 24/7 just to have nothing at the end, and I don't mean money, who ever solved it they deserve it and I hope the best for them, but not being able to have the answer ( private key ) of the puzzle, even an empty key, is a deal breaker. I am completely sure of it because I tested it with public keys that I know the pk and I was able to know that the script work My problem is that I lack computing power and at this time I do not have how to invest in it. I have thought about sharing the script but we would return to the same starting point where someone with a lot of computer power takes advantage of the script, take the money and then do not even have the decency to thank the developers or reveal the key. You can eliminate as many numbers as you like. for example, I can reduce the key by 4 digits from 32 to 28, but for this there will be 65,000 open keys, which I count is a lot. 5 and 6 digits can also be eliminated.  |
|
|
|
Is there any way to figure out the first character for #160 private key?, I figured since working more than 3 months on #125 resulted in a failure, it's better to work on something which nobody would go near for years. Lol
If there is a way to find out the first one, it will be possible to find out all the other symbols. Which will lead to a complete Bitcoin hack. |
|
|
|
|
Hello, help with the code.
I get an error.
line 3, in <module>
pub=ice.pub2upub('0433709eb11e0d4439a729f21c2c443dedb727528229713f0065721ba8fa46f00e2a1c304a39a77 775d3579d077b6ee5e4d26fd3ec36f52ad674a9b4 7fdd999c48')
AttributeError: module 'secp256k1' has no attribute 'pub2upub'
or can you specify which libraries you actually used, maybe there is an error in this?
thank you
Solved the problem, thanks.
|
|
|
|
|
digaran
If you are surprised by the doubling of the original key, then you are still at the very beginning of this "jungle". numbers
I will share with you a little bit what the future holds for you if you have the strength and inspiration to explore the Bitcoin curve.
There are amazing things that can make 100 hours of your work useless and make you happy in the most unexpected place and time of working with a curve.
There are special numbers on the curve that can be used to get exactly 1 digit less.
A third of the number you are looking for.
A quarter of the sought number.
You can get the mirror part of the number you are looking for, which can also be compared with the original.
And this is not even a 10th part of what is there.
You can get a lot.
But by carrying out various manipulations with the numbers on the curve, as vjudeu said, you can get into an even more difficult situation and get a .....................labyrinth.
I wish you success.
|
|
|
|
|
CrunchyF
A question for you.
If you know how to define the range in which the private key is located.
How can I find out the private key?
What is an algorithm?
P.S. I have previously asked this question on this forum people who also boasted that if you know the range you can find out the private key.
They did not provide answers. (Either they don't know how to brag or they don't want to share.)
|
|
|
|
I appreciate your opinion and your position on the curve. It wasn't an opinion. Those were facts. That, according to your words, there are 2-96, closed inclusions.
Which differ from each other.
But form completely the same
Public key
HASH160 Closed inclusions? Do you use some sort of translator? Because that doesn't make much sense. There are ~2 96 different private keys that give the same RIPEMD-160 hash, but they each give a unique public key that cannot be generated by any other private key. I realized . Sorry for interfering with the conversation and didn't understand. |
|
|
|
|
o_e_l_e_o
I understood you correctly.
That, according to your words, there are 2-96 private keys.
Which differ from each other.
But form completely the same
Public key
HASH160
.
.
.
.
The address compressed and uncompressed.
Everything is correct ?
|
|
|
|
|
Gentlemen.
pooya87
HeRetiK
BlackHatCoiner
I appreciate your opinion and your position on the curve.
But, there are at least on the curve, two private keys that are completely different from each other. At the same time they form identical (identical)
Public key
HASH160
.
.
.
.
The address compressed and uncompressed.
But, in my opinion, there are 4 such keys. Which can be different, and at the same time form the same source data, up to the address itself.
P.S.
I can't prove the theory of 4 keys now, I'm working on it. In free time from work.
|
|
|
|
|
You are all wrong.
There are at least two different private keys that can be generated, one and the same public key and everything related to it, to the address itself.
But, in my opinion, there are four different such keys. Which can form all the same.
|
|
|
|
|
Let's wait, maybe NotATether will answer and dispel the myth.
|
|
|
|
|
Alpaste
I also hold this opinion. But I doubted, re-reading the forum posts because NotATether claimed that it is possible to calculate ..
NotATether can dispel the myth?
|
|
|
|
Just silly question  is it possible to know this public key is from this range? like 110 or 115? is there any way to identify? No, otherwise you would be able to find the upper bits of every private key in existence. Hi. Can you explain how you can learn the upper bits by knowing the range? Hi. I once asked the question of whether it is possible to calculate mathematically in which range the key is. To which I received a response from NotATether. If you know the range you can calculate the upper bits of the key. The question logically asks for answers. If we know, and we know in what range the key lies (like puzzle 120). Then why not calculate the upper bits? What is the calculation algorithm? Thanks. |
|
|
|
|
I am very grateful to you for your answer.
|
|
|
|
|
Hello everybody. The question arose.
How to determine between the two public keys which is bigger? In addition to the subtraction function.
Example.
123456789 private key is not known to us.
His public key.
025004d7d9c2a3b2d675ada618d9ceda55d1f6a9fdf263e24daa8cbea586af2b2b
And accordingly his rival.
12345678a private key is not known to us
His public key.
02fde2347f83e21198fc48b918f5657c188ffcdd8611b39b987230addb91d05d80
Thanks for the answer.
|
|
|
|
Some addresses may have no collisions at all.
It is unbelievable, but each address exists approximately 2^96 times in the whole 2^256 bit space. (2^256 / 2^160 = 2^96) So the chances that an address has no collisions at all are ~ 1 to 2^96, that means nearly zero. We can be sure, that there are always collisions for an address. You are right they are and there are many of them. |
|
|
|
|
