Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
~~ snippet ~~
You have these options in ecloop by default. There is even an option to have zeros in the middle of the range - like stride (here is offset for example 19bit). Plus it is 2 -3 times faster than Cyclone in HASH160 mode.
https://github.com/vladkens/ecloop
# ./ecloop rnd -f 71.txt -t 12 -o ./BINGO.txt -r 400000000000000000:7fffffffffffffffff -endo
threads: 12 ~ addr33: 1 ~ addr65: 0 ~ endo: 1 | filter: list (1)
----------------------------------------
[RANDOM MODE] offs: 19 ~ bits: 32
0000000000000000 0000000000000000 0000000000000078 62f0000000024f56
0000000000000000 0000000000000000 0000000000000078 62f7fffffffa4f56
8.86s ~ 68.54 Mkeys/s ~ 0 / 465,567,744 ('p' – pause)
Makefile flags:
Code:
CC_FLAGS ?= -m64 -Ofast -Wall -Wextra -mtune=native \
-funroll-loops -ftree-vectorize -fstrict-aliasing \
-fno-semantic-interposition -fvect-cost-model=unlimited \
-fno-trapping-math -fipa-ra -flto -fassociative-math \
-mavx2 -mbmi2 -madx -fwrapv \
-fomit-frame-pointer -fpredictive-commoning -fgcse-sm -fgcse-las \
-fmodulo-sched -fmodulo-sched-allow-regmoves -funsafe-math-optimizations
-funroll-loops -ftree-vectorize -fstrict-aliasing \
-fno-semantic-interposition -fvect-cost-model=unlimited \
-fno-trapping-math -fipa-ra -flto -fassociative-math \
-mavx2 -mbmi2 -madx -fwrapv \
-fomit-frame-pointer -fpredictive-commoning -fgcse-sm -fgcse-las \
-fmodulo-sched -fmodulo-sched-allow-regmoves -funsafe-math-optimizations
I'm having ridiculous speeds with these flags. Fastest CPU s*it out here.
$ ./ecloop rnd -f /home/yohan/ecloop/data/btc-puzzles-hash -o ./found.txt -a c -r 650000000000000000:67ffffffffffffffff -t 2
failed to open /dev/urandom