There are 2 processors installed on the motherboard. The program only works with one. I specify all cores, but only one processor is used. The program can't work with multiple processors?

By the way, I didn’t find any discussion of the public key, the owner of this puzzle, in the topic.

Do you mean to say this by chance?

024b0faa9624763002e963816b2f6774df0dedd770896a9511cb5c9d90f674ecda

It is clear that a letter is missing, but even such a combination is too much for an accident.

Well, this is all clear))

I have this question for you.
Let's say I found a key that I use as point G.
Using this, I add 1 to my search key, and I also subtract 1 to my search key. As a result, I get the same public key, one is 03 and the other is 02.

Is it possible in this case to calculate the private key I am looking for?

As far as I remember, by changing point G, as a result, we no longer add and subtract, but divide and multiply our public key? Or I was mistaken. Just knowing this, it seems to me that you can calculate the difference.

Not necessary. He can then empty dead wallets from which there will be no demand. And as far as we know, there are a lot of lost wallets, especially wallets that did not have outgoing transactions after 2012. And this will not be theft, since even the real owner will not be able to confirm his right to this wallet. And you can easily, having a private key, say that it was yours, you just recently managed to find the key.

We all know that there is no system created by people that does not have vulnerabilities. Everything breaks. And Bitcoin too. It may even already be hacked, just why talk about it, withdraw your money and live happily.
Every year billions are stolen from the Visa and Maestro systems, but they don’t talk about it so you don’t panic. Even the Apple system is not secure as advertised.

Just if I could find a vulnerability that allows me to get any private key. I would quietly and calmly rummage through dead small wallets and cash out through exchangers. Why would I leak such information and put my life in danger? Such news will reset the price and many will simply lose billions, and many will want to take revenge on me for this.

Behind the creation of this puzzle is a 100% mathematician scientist. And it was not created to test the security of Bitcoin. But for your own purposes. 1000 coins is the minimum deposit to get more. As a rule, there is no point in testing brute force and this is understandable. But it makes sense to look for vulnerabilities in the curve. And even a person without education can stumble upon a vulnerability and not understand what it is, but write about it in the topic. And the creator, for example, will be able to understand what to do with it and calmly gain access to wallets with a huge balance, recouping their costs.

Using division and other manipulations of the public key of puzzle 130, we managed to obtain the key 02000000000000000000000003b78ce563f89a0ed9414f5aa28ad0d96d6795f9c63
Someone tell me what sense does this make? For now I’m just researching what kind of public key this is.
I apologize if for my stupidity. It’s just that the specialists here are on topic, unlike me.

This is Hex 1000000000 in decimal

I uploaded the subtraction program to GitHub. If anyone needs it, you can use it, there is a compiled version for Windows.
https://github.com/Flleowa/ecctools-Subtraction

I have less. Only 5 Ekeys/s, which is very little.
He should be taught not to slow down if there are a lot of keys.
By the way, I modified the divider from Alberto ecctools.
I made a subtractor out of it, and it saves everything into a text file. It can also take keys line by line from a file and take them away in order and write them either to a given file, or it creates a file with the name of who it subtractor it from and writes the keys.

Here are the numbers I found out of boredom.
This is the minimum number
16492674416640
And this is the Maximum
115792089237316195423570985008687907853269984665640564039457584006813618012160
With these numbers, nothing is possible on the curve. Subtraction, multiplication, addition does not work with them. Perhaps they are simply 0 on the curve. If you change the number at the end to +, you get one.

The curve does not accept these numbers at all.
789842187514178900234385207627528242391713215504118334407332331520
394921093757089450117192603813764121195856607752059167203666165760
197460546878544725058596301906882060597928303876029583601833082880
I couldn’t find this information about these numbers at all on the forum. Maybe someone will find this information useful. I have already done everything that came into my head with these numbers.

You can reduce each range 16 times, and then reduce all the results obtained by 16. And so you can go all the way to 0. But the lower you decrease, the more your number of public keys will grow. But 100% them will have 1 working key.
There is another option, a little simpler. Make the G point the 130 range key. Then generate new keys in the 130 range. And then simply subtract 1 from all these keys. If successful, you will get a key in the lower range, and then it’s a matter of little things.

Somehow aggressive in your topic here. Or many people simply don’t want someone else to try to hack it. Or, they're just people like that. In general, I understand that the puzzle was created not to try brute force, but to test the elliptic curve itself. In order for you to try to hack it, the public keys were revealed to you.
One could calmly answer that there are a lot of numbers on the curve that it accepts as 0. That there are also numbers that it does not accept at all. I’m not good at it myself, but now I’m reading the documentation and studying it. And one thing I see is that there cannot be a number that she will not accept. But such numbers exist precisely in 256k1; in others I checked there are no such numbers. This means that this error was inherent from the very beginning.
Well, I won’t post the numbers themselves just yet, since there will be a smarter person than me who will just quickly hack everything himself. And if this really poses a threat to the curve, then the disclosure of this information will collapse the entire crypt to 0. But I don’t want to just invest effort, I want to save a little money before that.

New Year's dreams of a rich life.

Happy New Year everyone. I only read here but didn’t write anything.

What did I find? I found a number that, if subtracted or added to the public key. Returns the same public key, regardless of whether the private key is large or small. A number was also found that, if subtracted or added to the public key, produces a key that is not on the curve.

I don't know to be honest. Has anyone found this already or not? But I’m still deciding what to do with it next. Because, in my opinion, this is the vulnerability of the curve. I've been working on the puzzle for 2 weeks. So far I've only found this. Sorry for broken English. I wrote through a translator.