Bsgs work example:
xman@localhost:~/keyhunt/keyhunt$ ./keyhunt -m bsgs -r ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000:ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
- Version 0.2.230519 Satoshi Quest (legacy), developed by AlbertoBSD
- Mode BSGS sequential
- Opening file addresses.txt
- Added 1 points from file
- Range
- -- from : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05000000000000
- -- to : 0xffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b05ffffffffffff
- N = 0x100000000000
- Bloom filter for 4194304 elements : 14.38 MB
- Bloom filter for 131072 elements : 0.88 MB
- Bloom filter for 4096 elements : 0.88 MB
- Allocating 0.00 MB for 4096 bP Points
- processing 3145728/4194304 bP points : 7
- processing 4194304/4194304 bP points : 100%
- Making checkums .. ... done
- Sorting 4096 elements... Done!
- Thread 0xffd8e700c03997d8c19f5c793fed42f
- Thread Key found privkey ffd8e700c03997d8c19f5c793fed42fb6c5b5a9bb408a8185b0503ba2fe979c1
- Publickey 02396651cb067749a3a54e1bafb3b589ce9a1ceed7c079e29d478af1c160448012
All points were found
But this would require you knowing the key range. If you don't, it's going to take awhile. Like kangaroo as well.
Bro I know stride, this is theoreticaly simplify task, but I continue wok on it
stride example:
0xfff97bd5755eeea420453a14355235d382f6472f8568a18b2f057a1460297556
so, for take range n is not so big task with sach stride, but, looks like may be needs brute range many many times because search is a collision search between R from your scrypt and K....
kangroo for ex example never stop and give good speed, so maybe.