Hey COBRAS, I'll look at your code later, but in general, I notice that you're reducing your chances of getting good answers by putting very little effort in your questions.
You jot down whatever is on your mind, without structure, without grammar-checking it before posting.
Also by not introducing your goal, what you tried and what the results were, this burden is completely put on the reader, which again decreases your chances of someone putting in that time.
Instead, put in that time yourself, as you're the one seeking an answer.
StackOverflow's classic 'How do I ask a good question?' is a very good starting point, in my opinion, which can also be applied to this forum.
You jot down whatever is on your mind, without structure, without grammar-checking it before posting.
Also by not introducing your goal, what you tried and what the results were, this burden is completely put on the reader, which again decreases your chances of someone putting in that time.
Instead, put in that time yourself, as you're the one seeking an answer.
StackOverflow's classic 'How do I ask a good question?' is a very good starting point, in my opinion, which can also be applied to this forum.
Hello. I thant convert point from order 2^255 bit, to order 3652 bit., and after bruteforce point for find privkey.
I wal already modify order of curve in enother scrypt , then multiply point to -1 and result was not more then new N(order of curve). But, then I multiply point of privkey > new order of curve point go to unknown region(not simple 0 and not simple "not more then order of curve ")
