sam_vector

Yes, you are right, that is a standard beta lambda endomorphism in secp256k1... But I found diferent relation between points. I found that if 4 points have the same doubling slope, they give 0 in total, and their…

I tried to modify the SageMath code, and I was looking for sets of 4 points where I know the difference between 2 points in the set on the big curve so the output is something like this k = 6 means we calculated 6G…

This code seems to be working but I added 1G How did you get these numbers 182 680 44 in the code? Also for And in python I get

Well, maybe Igor Semaev's summation polynomials or index calculus or something like that I mean this is an easier way to find 4 X to gives 0 Also, I am 100% sure that about 16% off all points have the other 3 with the…

Came across something interesting with secp256k1. If you have 4 points that share the same doubling slope, their private keys sum up to zero: k1 + k2 + k3 + k4 = 0. On a smaller curve, I found these values: P = 967, N =…

I was using this website https://asecuritysite.com/ecc/ecc_points_mult I was putting random p-prime numbers, then "manually" bruteforce X value to get valid point Then if you get rule (n-1)mod 6 = 0 then you basically…

I do not want to create a new thread I just want to continue here... I tried to figure out how BSGS works for scanning points and how it maybe can be improved... Many BSGS scanners makes babystep file where you take…

@dexizer7799 Thank you but I think this is an example for different type of curve... I do not know I did not understand the content of that link for small secp256k1 I found that if you do addition of all X values for…

I'm diving into this whole crypto thing and I know this might come off as a bit amateurish. So, I created a smaller version of secp256k1, where p=43 and n=31. I picked the point G(2, 31) as my generator point and…

How does the library "know" when to do regular inverse double 16G-->8G and when to do 7G---->SomethingG... I am asking because every dot looks like any other dot. You do not know if multiplier*G is odd or even

I've been diving into the technical details of Bitcoin and learning Python for programming... I created a basic program that lets you add points on the elliptic curve, like Q+Q or Q+G, and I also implemented operations…

I am running Rotor Cuda on my second PC with an old Zotac Nvidia 1060 GTX and I am getting about 150.000.000 keys per seconds... I am learning Python and try to also to make my way for scan private/public keys... I…

I think it is possible on this way For example you define jumps like you have a starting points you make a rule of jumps where you take |last 6 digits of X +1G| after 5.000.000 of those iterations, I guarantee that all…

p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f ** 2 I tried this P and I basically get like P * regular curves (I am not sure how to explain) So the structure and order of points are the same…

I was using this code to check that And I have starting point 0x10 * G After executing the code I got 0xc9c52b33fa3cf1f5ad9e3fd77ed9ba573d36fec6139d59d88ec4cf8b2f09b056 * G Maybe something is not good, but I tested for…

I just found that if you double one point Q = P * 2^155555555555555555555555555555553a393d1339460d5a4ffc328bbc04857 You get the point with the same Py=Qy value and different X | Qx != Px.... (I know this is old thread…

Is there any kind of like youtube video for this? I am not sure how this is working I mean what decides what will be the size of the jump and in which direction?

I was making a similar thing for puzzle 135... I put in babystep file only public keys that starts with "145d" and sometimes I had 2000 keys between 2 "145d" points and sometimes I had 120.000 keys between 2 "145d"...…

I just can not understand what this code represent... And how to use it

Is this really the result of the test ~4.5 min for puzzle 40? When I test my code on the puzzle, I always substract lower value for the range and then I start from 1G I mean, I made some lame scanner in RUST, and RUST…