farm_2014
- how was k chosen in this caseJun 16, 2026
Surprisingly the way to generate the k from 1LN4yp6rQALjwg53SKsi44teq1fp2v5wqR doesn't seems weak. This my method to say that Step 1 : recovered every tx signed by 1LN4yp6rQALjwg53SKsi44teq1fp2v5wqR (total sent136…
Tromp could u explain more what sort of coincidence you speak about on your link [1] This sage script doesn't find that it is rare to have the property of the post linked when P and N are primes...:
I code a quick and dirty CUDA program for sha1 mining. The speed i observe is around 5 Giga hash (tries) / second on a RTX3090. The big problem would be the way to generate the password candidate. (probably slower than…
- Factorizing PuzzlesJun 5, 2019
Ok thanks. I generated 400 randoms privkeys in the range of puzzle 64-65. I obtain that with all factors of every key: the specific pattern you noticed occurs around 1/10 times (as you found before) so i don't think…
- Factorizing PuzzlesJun 4, 2019
what do you mean by "all the possible factors"? this is what i found by factorizing the priv keys i don't understand how you found the "special" pattern you highlight on your graphics
- Checking Even or Odd PointsDec 4, 2017
Ok maybe I understand. 46 is the average length of the power of 2 sequence? that's right?
- Checking Even or Odd PointsDec 3, 2017
Alexander, can u explain how you arrive to a sequence of 46 values of power of 2 with a bloomfilter of size 2^30 for puzzle 120? Thanks
You're welcome!
Hello shrec. I quickly check your code on github for Cuda and maybe i miss something but you don't seem to use precomputed table for Ecmult . With this trick you can speed up the k.G process maybe by 15 times with…