Ninjastic
Search content
Sort by
Showing 2 of 2 results by magnastro
Post was edited
 2 months ago (view)
Post
Topic
Board Project Development
Re: Keyhunt - development requests - bug reports
by
magnastro
on 08/05/2025, 11:08:24 UTC
@Albert0bsd First of all thank you for this amazing sw... Question for Bsgs mode... Let's say I have determined my ideal -n and -k values. Do I have to re-create the bloom filters every time I change:
- Address / adresses (-f)
- Range (-r)

And another question: If I have a list of mixed public keys list containing both compressed and uncompressed keys, do I have to use -l both or is this the default behaviour? Should I convert everything to compressed for better speed (bsgs)? Again thanks!
Post
Topic
Board Development & Technical Discussion
Re: Cyclone - fastest CPU Satoshi's puzzle solver (only CPU)
by
magnastro
on 07/05/2025, 08:09:38 UTC
Quote from: FrozenThroneGuy on May 06, 2025, 03:41:09 PM
Quote from: Lolo54 on May 06, 2025, 01:17:42 PM
good fast software work on CPU indeed but do you think you can port it to GPU?
Hi! I’m a very lazy guy for it, and this is not interesting.
In present time I try to develop an algorithm, which will be faster than BSGS or Pollard/Floyd/Brent.  
Take a look, speed of solving puzzle 70 (and x10 range).
root@ubuntu:/home/ubuntu/Triarch# ./Try_10 --N 10 --S 5902958103587056517110 --T 160000000000 --offset 19 --parity even --order forward --range 10000000000:100000000000 --even

=== Attempt 1 ===
secret = 5902958103587056517120
//Magic!!!

=== SUCCESS ===
Runtime: 33.3814 s
Synthesis: 5
Attempts: 1

If you're looking for beta testers i'm in !