sound like create puzzle list by binary level

may be like the other puzzle
https://bitcointalk.org/index.php?topic=766000.0

https://github.com/ynohtna92/1FLAMEN6/blob/master/puzzle_decoder.py

something like that?

Can possible someone try to code python simple scan by using Fibonacci Sequence algorithm ?

That script can show newbies who interest or want to know how it works just setting to show message on working
script is one file easy to read too
old script but record to try use it study, try use with low key space and low number of puzzle under 40 bits fast to found and learn how it works

and What mean Kangaroo limited 120 bits
However all Kangaroo version have limited for 120 bits only right both  Jean_Luc's program have problem with  limited 120 bits.
if we solve puzzle #120 already so, What next?
how can extend 120 bits

or that mean limited wide of range scan for 120 bit and for high bit like 160 bits  need to split 2 keyspace or 4 keyspace and scan each method use program something like that

Do I miss understands.

Ok,
Sorry, I got how to turn off display message from help

• Version 0.1.20210306 K*BSGS

Usage:
-h      show this help
-a file      file is a binary raw file with the aMP points precalculated. Just work with -m bsgs
-b bits      For some puzzles you only need some numbers of bits in the test keys.
      This option only is valid with the Random option -R
-c crypto   Search for specific crypo. < btc, eth, all > valid only w/ -m address
      eth option is under develop sorry
-e      The file is already Sorted descendent. This skip the sorting process.
      Your file MUST be sordted if no you are going to lose collisions
-f file      Specify filename with addresses or xpoints or uncompressed public keys
-g count   Just for the stats, mark as counted every debugcount keys   
-k value   Use this with bsgs mode, k value is factor for M, more speed but more RAM use wisely
-m mode      mode of search for cryptos. < address, xpoint, bsgs >  default: address (more slow)
-n uptoN   Check for N secuential numbers before the random chossen this only work with -R option
      Use -n to set the N for the BSGS process. Bigger N more RAM needed
-p file      file is a binary raw file with the bP points precalculated. Just work with -m bsgs
-q      set quiet the thread output
-r SR:EN   StarRange:EndRange, the end range can be omited for search from start range to N-1 ECC value
-R      Random/Secuential this is the default behaivor, can't use this with range option -r
-s ns      Number of seconds for the stats output, 0 to omit output.
-t tn      Threads number, must be positive integer
-v va      Search for vanity Address, only with -m address
-w      Mark the input file as RAW data xpoint fixed 32 byte each point. Valid only with -m xpoint
      Use the hexcharstoraw tool to create a raw file from your current hexadecimal file

Example

keyhunt -t 16 -r 00000001:FFFFFFFF -s 0

This line run the program with 16 threads from the range 00000001 to FFFFFFFF without stats output

Developed by AlbertoBSD   Tips BTC: 1ABSD1rMTmNZHJrJP8AJhDNG1XbQjWcRz7
Thanks to Iceland always helping and sharing his ideas, Tips to Iceland: bc1q39meky2mn5qjq704zz0nnkl0v7kj4uz6r529at

• Opening file addresses.txt

[E] There is no valid data in the file

Require sample file addresses.txt  (just for new user not yet to know)
Can possible I turn off this line message, if can possible have option for hide this display?

• Thread 0: b52c0fa87df468ffd3fc456023767eb2c1ccbcff9a06285523d706fdd24ed0a6
• Thread 0: b52c0fa87df468ffd3fc456023767eb2c1ccbcff9a06285523d716fdd24ed0a6
• Thread 0: b52c0fa87df468ffd3fc456023767eb2c1ccbcff9a06285523d726fdd24ed0a6
• Thread 0: b52c0fa87df468ffd3fc456023767eb2c1ccbcff9a06285523d736fdd24ed0a6
• Thread 0: b52c0fa87df468ffd3fc456023767eb2c1ccbcff9a06285523d746fdd24ed0a6
• Thread 0: b52c0fa87df468ffd3fc456023767eb2c1ccbcff9a06285523d756fdd24ed0a6
• Thread 0: b52c0fa87df468ffd3fc456023767eb2c1ccbcff9a06285523d766fdd24ed0a6
• Thread 0: b52c0fa87df468ffd3fc456023767eb2c1ccbcff9a06285523d776fdd24ed0a6
• Thread 0: b52c0fa87df468ffd3fc456023767eb2c1ccbcff9a06285523d786fdd24ed0a6

this display over 10000 message

just try BSGS  version

if anyone use keyhunt and compile mission gmp.h

try install  libgmp3-dev



Recommend to put sample address.txt and 120.txt setting puzzle 120 to github for easy copy setting

because first time I found Invalid length

Can this tools use for solve puzzle very old python code?
may be slow than bitcrack

https://github.com/Xefrok/BitBruteForce-Wallet/blob/master/seekanddestroy.py
may be need to modify to can use with custom keyspace for puzzle #64
done have other python script recommend to use better than?

all python code use random method right not calculate not pattern

I looking to bitcrack version python code

I would like to try use for puzzle #64 by random keyspace set it each 1000000 key and scan it and do random next keyspace
I can't not code c++ but python is easy more than. I can modify on python code

now I try to scan small range cover with limited in 1 hour or 5 hour max. no more 3 days long

right,  is no wrong or right , just do it.

why not try last 6 key have pubkey for reference search

read from first page they protect one person solve puzzle can pick all address no match no algorithm all random pick so best method brute force then

I give up method all brute force (scan everything)

but still think figure out about select brute force target may be better but still no idea how to.

I don't really know much

if we still use pure kangaroo , now we still stuck with high bits high range high keyspace

kangaroo need to jump a lot may be too many days jumps and jumps to new position scan

I don't know how kangaroo use pubkey XY to calculate but point XY use for calculate

Can possible to create dataset use method private key generate with public point and train AI to give some value and use kangaroo to get point to jump or do something like that ?
Use AI. predict key space and give it to kangaroo ?

Any idea?

still need to AI. expert help to analysist

I think for now
Try focus on 9 puzzle that have public key for can use reference

Other puzzle not have public still like fly on space  (know only range information)

high bits puzzle need to fine algorithm or upgrade method great than now he have bitcrack, kangaroo, BSGS


Long term method brute-force from bitcrack may be strategy for solve puzzle
Absolute way solve puzzle

brute-force straight directly make waste time and use a lot of power to force
need to use smart calculate for brute-force

Some bad idea for spend bitcoin
Every one have some bitcoin on hand right?
Can possible with use dust bitcoin sent to random address that guess nearly puzzle and use it reference like use pubkey on kangaroo
use it like calculate phone location like mobile cell site

Like pubkey can help to solve puzzle high bits with kangaroo
I don't know may be not works
I think may be try to test play around
send some bitcoin dust I have sent to some address random on range and sent it out again to make pubkey
may be 10 satoshi or minimum dust limited with lowest fee limited


We have low power brute-force, 256 x tesla v100  still very very low power
Challenge is create massive brute-force for solve puzzle (idea lotto, still can do when bitcoin price still high should do before bitcoin price drop) but still limited with low bits

From calculations based

Anyone want to scan all , you can do it, scan till die, as you want LOL.

puzzle require to smart and better way, may be need to calculate zone, keyspace before scan and found in 1 hour or 5 hour something like that

if challenge scan found before you die, need to be change method to scan

ok, brute-force all may be absolute method to found but it use time a lot

may be I try puzzle challenge for a while and may be give up or back when recall or boring

still never have some news about someone can brute-force full key success

I think Normal python can not run on GPU  and tensorflow and keras it use specific for AI. deep learning

Normal python code work with CPU only it generate slowly and use time a lot

Try code on NumPy arrays and use Numba for work on GPU

or Try write code to OpenCL calculate for can work with any GPU

but all option can use GPU need to write code all new one.

https://www.geeksforgeeks.org/running-python-script-on-gpu/
https://stackoverflow.com/questions/53650577/how-to-run-python-code-with-support-of-gpu

Thanks
rights that old python code, I just use learning about how Kangaroo it works (easy to show how it work and read code on one files or print show display data how it works for use this tools better

For real use use JeanLucPons Kangaroo with GPU is faster
https://github.com/JeanLucPons/Kangaroo

However old python code may be interesting if someone can use python connect and work with AI. tensor flow and Keras do deep learning work with kangaroo I mean modify to work beater

if anyone try using python script and require to use gmpy2 library

http://bitchain.pl/100btc/pollard_kangaroo.txt
https://github.com/Telariust/pollard-kangaroo/blob/master/pollard-kangaroo.py
https://github.com/Telariust/pollard-kangaroo/blob/master/pollard-kangaroo-multi.py

or use BSGS and script use gmpy2
or other script generate bitcoin address and use gmpy2 to accelerate calculate for faster

use library gmpy2 make calculate faster

install gmpy2 on linux

need to install  libgmp first after that then install gmpy2 normal


install gmpy2  on anaconda (windows 10)
Anaconda Individual Edition or Miniconda
use conda install
command

install gmpy2  on python windows 10
download gmpy2 from this url
https://www.lfd.uci.edu/~gohlke/pythonlibs/
choose version macth with you python version
example download
gmpy2‑2.0.8‑cp39‑cp39‑win_amd64.whl

command

right this formula very hard to use I see a lot of talk with this formula  on this forum still not success to use

Reference script BSGS
https://github.com/iceland2k14/bsgs
https://github.com/iceland2k14/bsgs/blob/main/bsgs_v4_gmp.py


I modify to hide message PVK not found.
and print S value is show X,Y and hex_line

What is hex_line value?

script generate large file baby_steps table for calculate
found key when meet hex_line on baby_steps table

I read baby step from
https://asecuritysite.com/encryption/baby

scripts make 1073741824 list babystep for multiply right
and when calculate use run with babystep

I think both script and BSGS.exe do the same right
https://github.com/JeanLucPons/BSGS
create large table hash table (25bit hash) to store the baby steps. 2^30 baby steps is about 9GB

still learning
not yet clear understand

now I try to looking way to reduce keyspace for search because high bits it is too much large area to search
if can fine right keyspace  may be helpful to working search

Now all brute force method bitcrack, kangaroo, BSGS all stuck with high rank of very very large keyspace

if scan all it use a time too much

We need to find the way and method to can calculate or guest right keyspace 
may be an help reduce from 1000 area to scan 100 area

use pubkey to caclulare direction of keyspace  and then use  bitcrack, kangaroo, BSGS

if can fine keyspace  low than 2^30 to 2^40 may be better ot less 1 days scan complate (Max 2^50)

(2^ 60 too high)

other puzzle no pubkey  still no idea what to do?

Anyone have any idea use pubkey to calculate keyspace  ?

To do brute force all area of keyspace in range it is not good idea?



Anyone an expert with python language please advice. Can you do Ai. on python?

I think about used version python scripts with all AI. api
it can possible to generate private key with address to as dataset and train Ai.
and do brute force by random with use call AI. model to give multiply value. something like that
just learn to read a lot about AI. deep learning.

I am not programmer

hope so someone forked bitcrack to have more option or upgrade to next generation bitcrack


now bitcrack is do brute force straight directly by random

I think bitcrack random private key first and convert to address and check meet target or not right?
(may be random hex 64 digits)

What version think may be better?

bitcrack private keys with random split key space to small under limited size 2^41 to small
like from large areal split to small area and scan one by one or random area and finish one by one may be each area use time 1 hour each (or max 5 hour)

bitcrack private keys with use Pollard's kangaroo calculate and jump number on key space
may be can like kangaroo curve and move
may be just use some part but not use wild tame meet

bitcrack private keys with use Baby Step Giant Step calculate and move step number on key space

bitcrack private keys with use pub key convert to x y and use it multiply to on key space

bitcrack private keys with use formula like  K((z1*s2 - z2*s1)/(r*(s1-s2))) or other formula and scan around

not yet think about on detail and how can possible to do, just think an idea only.
just think about how can upgrade bitcrack to better

may be need to make it split to new one program not incudes with standard version

high bits is area that very large too much it is need to calculate key space before search


other idea
if not modify bitcrack direcly
make some program algorithm or strategy search to call bitcrack to work (may be make it slow works use two program work)
but bitcrack build-in system may be work faster than
or put new algorithm to bitcrack require to modify

Done bitcrack do brute-forcing with use algorithm like this


https://www.educba.com/brute-force-algorithm/
http://www.people.vcu.edu/~gasmerom/MAT131/brutefrc.html
https://www.chegg.com/homework-help/use-brute-force-method-find-optimal-solution-complete-weight-chapter-14.3-problem-4cp-solution-9780321867322-exc
https://www.quora.com/What-is-a-brute-force-algorithm-with-an-example
https://www.youtube.com/watch?v=xRVpT-7c0Rw