Quote from: digaran on Today at 12:24:23 AM

Quote from: delta[trix] on August 10, 2023, 05:17:39 PM

Quote from: citb0in on August 10, 2023, 04:26:09 PM

Quote from: delta[trix] on August 10, 2023, 04:07:11 PM

But it seems to be something automated by the puzzle's creator itself, I looked at some transactions.

Be more specific, please

If you look at the transactions in wallet 66, and a few others, you will see that it appears to be something automated, sending small transactions with numbers that I believe might provide some clues in decimal/hexadecimal or binary code as to where the private key could be located. However, this is just an assumption.

If you mean numbers 66 and 99, they are mirrors of each other, also converting 66 and 99 to hex twice you will get 2a for 66 and 3f for 99. Converting 66 to decimal is 102, and 99 is 153.

Note that 6 and 9 are represented by each other in hex format, since there are only 6 alphabet letters, the remaining 9 digits have no alphabet representatives. So here is how it works :
0= f
1= e
2= d
3= c
4= b
5= a
6= 9
7= 8
8= 7
9= 6
It's a world of wonders this hexadecimal world!

Quote from: james5000 on August 10, 2023, 05:16:41 PM

To mathematicians, there is a way to divide one point by another point on the elliptic curve.

Are you asking or telling? Of course there is a way, look at my personal text, e.g. dividing n by 6 will give you this :

Code:

2aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa74727a26728c1ab49ff8651778090ae0

You can multiply any point by above key, and it will divide your key by 6 if it's divisible by 6 you will get a correct answer.

Now if you divide a point by the key above, you will actually be multiplying your point by 6.

Now if you divide a point by 4 and multiply the result by 2 you should naturally get half of your original point, if your point is divisible by 4 then your results are correct, otherwise you will have a much much bigger point than your original point.

Essentially dividing a point by a number other than 2 will get you no where close if your key is not divisible by that number, you can try by dividing a number by 3, 4, 5, etc and if the fraction is something other than .5, then the result of point division will not be any where close, however as long as the fraction is .5, then you can always add n/your divisor to the result to get the correct result.

For example, divide 23 by 2, you will get -n/2-12 as a result, and if you add n/2 to your result, you'll have -12.

101 on how to break cryptography by ~dig.😉

for n = fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141

Code:

print(toHex(round(n / 6)))

my result is 2aaaaaaaaaaaaa00000000000000000000000000000000000000000000000000

Sad