21 sats \ 5 replies \ @antic OP 5 Mar \ parent \ on: Did we just pass the P2PK brute force price point, or are we getting prepared? bitcoin

ECDSA using Secp256k1 can still be brute forced (albeit inefficiently) using a discrete log solving method like rho:

This would take a gazillion lifetimes of the universe to compute.
It could be ported to Shor's on a quantum cluster if the cluster gets stupid large and actually corrects for errors.

Schnorr signatures are also reliant on the difficulty of solving the discrete log problem.

Yes correct, Nothing to do with prime factoring as your previous message indicated. Did ChatGPT write that code block?

reply

reply

AI gen code sucks, you will notice it’s importing but not using the isprime, nextprime.
We generally called that “Pollards Rho”, not “Rho”.

It’s hallucinating fragments contextually related from a cryptography library.

I would recommend not using chatgpt for code.

reply

reply

Yes :-) all good! Just wanted to mention ECC/DLP va RSA in terminology;

I see people confuse factoring primes (RSA) with ECDLP (ECC). Bitcoin doesn’t specifically have to worry about prime factoring! (It may however indicate further advances in number theory…)

reply