yes, absolute waste of time
I try two times and quite

BitCrack can not search "16jY7" , you use vanity to find is correct tools
I think vanitysearch tools are not random but seed start is random and continue unfortunate can not custom seed start search

try using other modify/fork of vanitysearch like bit crack many developers modify

https://github.com/WanderingPhilosopher/VanBitCrakcenS
https://github.com/Telariust/VanitySearch-bitcrack

These tools can search "16jY7" in the range you want

it not works
I try 100 RSZ
but it did not have real LEAK NONCE
so I try to use zero 0 nonces and try fake leak nonce by random number
I do test fake leak nonce by random number 1 bit to 16 bit
all got error
and error loop infinite
it is never work

maybe the script use nonce point in the right direction
when got the wrong nonce, it is an error

work perfectly only with generating data from script
or you can use some brain wallet leak address (yes, you got to know nonce)

you need a mathematician who can use this lattice attack

I think for lattice attack is interesting
but you need to develop to advance to use it
or maybe focus on one pubkey specific
first, need to develop to can used without leak nonnce

if want to use lattice attack, you need to understand in math of this method
for me too much advance for understanding

this lattice-attack research developer tells already in the video present if they succeed will be rich but if not success here they are present research paper to you know here

just idea impossible you can try using fake nonce random continue until meet but how to know correct leak nonce each
develop some script auto-generate fake nonce and run it loop until found but it needs minimum 100 rsz

kangaroo may be possible and better just need to new way walk to meet key fast

use JSON Formatter, JSON Beautifier from only
upload data.json to read easy

modify
json.dump(sigs_data, fout)
to
json.dump(sigs_data, fout, indent=3)

add RSZ yourself to replace generated RSZ
you need more than 100 RSZ to calculate
RSZ without leak nonce is useless
try fake nonce leak bit or zero bit is making script error with some loop error
try to use real from some brainwallet (yes we know both private key and nonce)

I confirm gen_data.py generate real data. it is the same real RSZ from a real transaction
example  Huobi-wallet   1HckjUpRGcrrRAtFaaCAUaGjsPx9oYmLaZ  million of RSZ
script do same confirm


just put your own RSZ to JSON format the same  gen_data.py generate data.json

you can use JSON format tools to read JSON data easy
or modify gen_data.py to dump JSON data with indent options will help to read JSON format easy

1. easy manual add, put your own RSZ only by one done.
2. do yourself made script read RSZ and write to JSON format

gen_data.py is make data for use it

run script  gen_data.py
then you got file data.json
and run  lattice_attack.py

or

run script  gen_data.py -f filename
then you got the file filename.json
and run  lattice_attack.py -f filename

I test already if not have a leak nonce it not works
test with a fake nonce leak (random) it never works

don't wait for someone to code CUDA GPU

try test
https://github.com/iceland2k14/secp256k1

still use CPU but better than simple python
but the result get is pubkey base

I know CUDA GPU fast than 1000x time

how fast between compare speed
python ecdsa+gmpy2   (pip install ecdsa[gmpy2])
python + fastecdsa  (can use only on Linux or WSL2, can not use in windows)
python + iceland2k14/secp256k1   (dll on windows)

have other options available for fast  point addition , multiplication on CPU

up to your system
mostly

/usr/lib/cuda
/usr/bin/nvcc

you need to config Makefile to correct

know by the search command
whereis cuda
whereis nvcc

the result will tell you the right location of your program


however how to use CudaBrainSecp

kangaroo can search only one public key each time if have multiple pubkey setups first pubkey will be search
kangaroo can not search multiple keys in the same time because it is use pubkey that search to calculate multiply number for the search
if search multiple pubkey at the same time that means your kangaroo program or script will be worked by calculating multiply many key in the same time
JeanLucPons Kangaroo and another kangaroo in Github work by searching one key

first time I looking for kangaroo or other program that can search multiple pubkey in same time too but not have one becuase it is work by one pubkey search

burning finger or can not scan finger scan is happening often, HR department know
finger accident from work and someone's fingerprint is thin can not scan

problem is no algorithm that can convert Biometrics to mathematics or vectors for use with a digital print that is stable and correct 100%
Biometrics still unstable
Another problem is devices for scanning no standard or use what device for standard like finger scan in iPhone and android is difference

maybe it will very large privatekey over 100000bit can store data
and it dangerous if hackers can copy it, privatekey still can change to use another one key never use but Biometrics can not change it

I think Biometrics it does not work for now
my experience with chean finger scan time attendance
it is an possible to duplicate Biometrics
I copy database finger scan to new one finger scan found someone is duplicating with other people

carefully all bitcoin addresses have someone monitor automatic all time including used addresses and leaked passwords address
I testing on bitcoin testnet with some addresses public on the internet and use that address to receive testnet faucet
The next days my testnet faucet receive is gone someone monitored and scanned the address all time I think that is an automatic system that monitors and schedule time scan everyday

you need to know how it works
I am not an expert but I understand basic and overview (not sure I understand clear all)

kangaroo and BSGS both have some different technic and some parts same technic
kangaroo work like blind two people walk to hits each other if both walks hit your found key but if not never found a key kangaroo is a technic walk to hit spot it fast when using GPU but if blind walk in a small room with hit easy but both blind walking in a football field or in sea, kangaroo not use much memory on PC but using fast speed to walk that is calculated point to jump by use GPU make blind  walk faster until hits
if kangaroo use wrong jump it will take time a lot and never hit mostly is still have a problem when walk in space

BSGS uses store million/billion points in memory that it is made to use more memory
babystep gientstep,  babystep is small point quantity million point start if choose babystep large size will using large memory on PC, and then giant step is babystep to move next position next and next until cover your spot
point quantity 1 million lines using storage save on disk 70MB and point 10 million using space 700MB and 100 million use 7GB storage save on harddisk so, on memory it same if boomfile is large will use on memory large
if use a small size babystep will using time compare using 1 million and use 2.5 hundred thousand 4 time
maybe imagine using table in excel spredsheet first table is babastep and change the table to giantstep
or maybe imagine like raining in a small area and clouds move to hit your spot if large could rain in a wide area using large memory

gtx 1070 has 8GB memory
kangaroo uses GPU and use 8GB on the card
but BSGS use memory on PC if have 32GB or 64GB will be can use large size of babystep

first time I doubt why not make BSGS use on GPU for faster
try BSGS solver for Cuda ( Purebasic v5.31)
understand try iceland2k14/bsgs/v1_fastecdsa

Thank you. I got it.

I think the next calculation maybe need CUDA GPU to calculate with massive number calculate (maybe style like brute force calculate)
maybe you can find cheap coder CUDA on Fiverr
another way fast calculate without GPU is to try using python with multiprocess (multi-core CPU) to replace
of course, it is still slower than using CUDA GPU to calculate
AMD Ryzen Threadripper 3990X 64-Core, 128-Thread cost over $7000 still expensive same cust of hi-end 2GPU)
programmer CUDA will be coded if they interesting in that idea

rehashaddress it work by using privatekey to hash with sha-256 and use it again for next privatekey and loop right?

Thank you PowerGlove for helping answer
puzzle project help me to interesting in learning deep detail of cryptography now I interesting in blockchain programming technology bitcoin it is a very complex algorithm hard to crack (still try)

this method calculates
Can possibly use it to calculate some points back to the G point?
Inverse Modulo of private key can multiply with the public key and roll back to G point right

from an image that means calculate point 1 and calculate to point 6 and use point 6 to be point 1 again right?

Hi, albert0bsd

Can you help to develop tools like this I post on BitCrack thread?

https://bitcointalk.org/index.php?topic=4453897.msg60659772#msg60659772