hash_cobra

Yeah, it looks correct. But trying to change the order number in sagemath seems useless since attacks won’t work, we just get a factor.

I used some code for this test. Started with 0x10 * G and after running it, I got 0xc9c52b33fa3cf1f5ad9e3fd77ed9ba573d36fec6139d59d88ec4cf8b2f09b056 * G. Not sure if it's right but I tried a lot of points.

I found something cool! When you double a point like this: Q = P * 2^155555555555555555555555555555553a393d1339460d5a4ffc328bbc04857, you still get the same Y value but a different X. Qx isn’t equal to Px. Just wanted…

Yeah, sounds right. That’s a standard beta lambda endomorphism in secp256k1. But the thing is, if four points have the same doubling slope, their total also equals zero, and their private keys do too. This means those…

Tried modifying the SageMath code. Looking for sets of 4 points where I know the difference between two points on the big curve. Output looks like this: k = 6 means we calculated a 6G point, and the code gave a set…

This code looks good, but I added 1G. How did you get those numbers, like 182, 680, and 44 in your code? I’m curious about that.

Igor Semaev's summation polynomials could be a way to tackle this. This might simplify finding the 4 Xs that equal zero. I'm convinced at least 16% of points have the other three matching doubling slopes, and they all…

Came across something in secp256k1. If four points share the same doubling slope, their private keys sum to zero. Like k1 + k2 + k3 + k4 = 0. On a smaller curve, P=967, N=907, found some interesting values: β (cube root…

I’m using Rotor Cuda on my second PC with an old GTX 1060 and it’s pumping out around 150 million keys per second. I’ve been learning Python too, trying to figure out how to scan private/public keys. I think using the…

Smallest I've got is with p=7 and G=(1, 1). Just brute-forced some X values to get valid points. Then I saw that if (n-1) mod 6 = 0, it mirrors the bigger secp256k1.

Exactly! I used G=(1, 69) and found that if I added the valid points, it cycles back to 0 when you mod it. Kinda funky, right? Maybe there's something useful here.

I’m curious, how did you come up with G = (2, 31) for this curve? Is there some theorem that helps with this kind of setup?

Just getting into this stuff, so bear with me. I made a smaller secp256k1 with p=43, n=31. Took point G(2, 31) as the generator and got all valid points. I printed them out and stuck the paper on my wall. When working…

What about the claim of 3% you mentioned earlier?

I honestly can't grasp what this code is trying to do or how to utilize it.

How does it even distinguish between regular halving like 16G to 8G and other operations like 7G to some other point? I mean, each point looks the same, right?

I’m diving into the technical side of Bitcoin and learning Python at the same time. I wrote a simple program to work with elliptic curves. I thought I could add points like Q+Q or Q+G, and even did things like G-Q, but…

I honestly believe it can work this way For example, you set up jumps based on starting points Make a rule for jumps where you use the last 6 digits of X plus 1G After around 5 million iterations, I’m pretty sure all…