How to use brainflayer on each cpu core ? multithreaded ?

[Jorge]

ref: https://github.com/ryancdotorg/brainflayer

hi all., i am trying to use brainflayer., but its single threaded app and runs on single core., while other cpu cores are at idle.,

the author says

 

[Diego]

how many CPU you want to use for brainflayer?

if two CPU - you can run two brainflayer instances

first
./brainflayer -v -I 0000000000000000000000000000000000000000000000000000000000000001 -b example.blf -f example.bin -n 1/2
second
./brainflayer -v -I 0000000000000000000000000000000000000000000000000000000000000001 -b example.blf -f example.bin -n 2/2


btw - why you use -f example.bin ?

 

[Cole]

how many CPU you want to use for brainflayer?

if two CPU - you can run two brainflayer instances

first
./brainflayer -v -I 0000000000000000000000000000000000000000000000000000000000000001 -b example.blf -f example.bin -n 1/2
second
./brainflayer -v -I 0000000000000000000000000000000000000000000000000000000000000001 -b example.blf -f example.bin -n 2/2


btw - why you use -f example.bin ?

Thanks i have 4 core cpu.

so i must use like these ,
1/4
2/4
3/4
4/4

i use -f example.bin to reduce the falce positive messages, as bloom filter is not that correct

 

[Ahmir]

Thanks i have 4 core cpu.

so i must use like these ,
1/4
2/4
3/4
4/4

i use -f example.bin to reduce the falce positive messages, as bloom filter is not that correct

yes, and you can test how it's work

just make new blf file
and insert 4 different hash160 there

for example, hash160 of this HEX'es
0000000000000000000000000000000000000000000000000000000000000011
0000000000000000000000000000000000000000000000000000000000000111
etc

and run brainflayer with -I 0000000000000000000000000000000000000000000000000000000000000001 option

 

[Maxwell]

Thanks i have 4 core cpu.

so i must use like these ,
1/4
2/4
3/4
4/4

i use -f example.bin to reduce the falce positive messages, as bloom filter is not that correct

yes, and you can test how it's work

just make new blf file
and insert 4 different hash160 there

for example, hash160 of this HEX'es
0000000000000000000000000000000000000000000000000000000000000011
0000000000000000000000000000000000000000000000000000000000000111
etc

and run brainflayer with -I 0000000000000000000000000000000000000000000000000000000000000001 option

but what does this mean ?

Code:
-n K/N use only the Kth of every N input lines

sorry but english isnt my primary language.,

does it mean that its not going to try incrementally ? and going to pass/skip every nth value while doing incrementation ?

 

[Ivan]

but what does this mean ?

Code:
-n K/N use only the Kth of every N input lines

sorry but english isnt my primary language.,

does it mean that its not going to try incrementally ? and going to pass/skip every nth value while doing incrementation ?

It's just number of lines in every input lines
example
you have 10 lines in your BLF file
you have 5 CPUs
you want to run 5 brainflayer instances
you run it with
1. -n 1/5
2. -n 2/5
3. -n 3/5
...

so, in 1st example, brainflayer read just first line of every 5 lines in your blf file

 

[Kingston]

but what does this mean ?

Code:
-n K/N use only the Kth of every N input lines

sorry but english isnt my primary language.,

does it mean that its not going to try incrementally ? and going to pass/skip every nth value while doing incrementation ?

It's just number of lines in every input lines
example
you have 10 lines in your BLF file
you have 5 CPUs
you want to run 5 brainflayer instances
you run it with
1. -n 1/5
2. -n 2/5
3. -n 3/5
...

so, in 1st example, brainflayer read just first line of every 5 lines in your blf file

alright it means , i have to use the exact same command i.e. -I number in all the 4 instances of brainflayer.

damn, its not what i was thinking.,

i thought i could run 4 instances of brainflayer and use new -I number for each instance.

but that would miss the hashes from .blf file.

thanks for the info

 

[Jair]

i have built dedicated box just for this.

cron job every 6 hours, parses new blocks.
having + amount addresses, creates new blf and bin file and rotates it .

my php script then

calculates random int (using my logic)
check if its in range .
start brainflayer with -I mode using this hex, gets its PID
sleep 10 seconds
kill this process.,

do above all steps continuously. with new hex number evey time. its been up 1 month and didnt find anything.

i have tried the password bruteforce method , but it also didnt gave much success.,

i like incremental thingy coz you never know when you are gonna hit a gem., coz its all random.


i have couple of questions.,

1) what is ecmult table and how can i create it and how it can benefit my cause ?

as every time killing running brainflayer process and starting new takes around 1-4 seconds.,

2) is there something like centralised blf file in memory loaded so spawinig brainflayer will be really faster., as for each instance, it first loads it in memory and then start -I counter from there.

 

[Juan]

i have built dedicated box just for this.

do above all steps continuously. with new hex number evey time. its been up 1 month and didnt find anything.

My, that’s an expensive hobby for such an unprofitable purpose:
Wait... a “gem”? Perhaps you really expect to hit the 2-160 jackpot and find a key for an “eater” address? That address with the all-zeroes Hash160 has a balance of 65 BTC plus change; that would be a “gem”, but one you’ll never find. What other “gems” do you seek?

i like incremental thingy coz you never know when you are gonna hit a gem., coz its all random.

(FYI, I’d be much less snide if you just came out and said, “Yes! I think that brainwallet users deserve a fine for their criminal stupidity in how they undermine the foundation of all cryptographic security; and I am here to collect the penalty. Consider me a Robbin’ Hood(lum) who steals from the stupid to give to me, me, me.”)

 

[Ashton]

i have built dedicated box just for this.

do above all steps continuously. with new hex number evey time. its been up 1 month and didnt find anything.

My, that’s an expensive hobby for such an unprofitable purpose:

i am from 3rd world, so its not expensive once the box is built, its just cheap electricity that matters and it gives me hope.
edit: the main struggle is keeping electricity on 24x7 and keeping internet on. as the power outages are common.

Wait... a “gem”? Perhaps you really expect to hit the 2-160 jackpot and find a key for an “eater” address? That address with the all-zeroes Hash160 has a balance of 65 BTC plus change; that would be a “gem”, but one you’ll never find. What other “gems” do you seek?

yes, i have that one too in my list and one which is open for challenge. aka warp wallet

 

[Kaiden]

I am also interested in using the sequential hash function of brainflayer to sequence ALL inputs; not just sequencing from left to right.

For example:
./brainflayer -v -I 0A00E00F00000F000008000000000E0000000000F000000E000080000C000001

I would like the A, E, F, F, 8,E, F, E, 8,... to sequence simultaneous or is there a command to break down sequencing into 8 digit partitions, using all fields or characters other than zero to que into the sequence command. Is this even possible?

0A00E00F
00000F00
00080000
00000E00
00000000
F000000E
00008000
0C000001

 

[Giovanni]

i am from 3rd world, so its not expensive once the box is built, its just cheap electricity that matters and it gives me hope.
edit: the main struggle is keeping electricity on 24x7 and keeping internet on. as the power outages are common.

Whatever money you're spending on electricity would be better spent on gambling.

 

[Jesus]

I am also interested in using the sequential hash function of brainflayer to sequence ALL inputs; not just sequencing from left to right.

For example:
./brainflayer -v -I 0A00E00F00000F000008000000000E0000000000F000000E000080000C000001

I would like the A, E, F, F, 8,E, F, E, 8,... to sequence simultaneous or is there a command to break down sequencing into 8 digit partitions, using all fields or characters other than zero to que into the sequence command. Is this even possible?

0A00E00F
00000F00
00080000
00000E00
00000000
F000000E
00008000
0C000001

I'm not entirely sure what you're asking here. If you'd like to do a masked search iterating though only specified bits, I would consider adding that feature if you are willing to pay for it. However, my consulting fees are substantial.

 

[Giovanni]

how to run parallel on a multi-core computer, I know. The question is how to run on multi-core, where are 2 threads per core? Suppose on a 10-core computer where there are 20 threads? (-n 1/10/1 -n 1/10/2 ...) or each thread, regardless of whether it's a real kernel or a virtual one, is handled separately? ( from -n 1/20 to -n 20/20? )
On a 10-core computer with 20 threads, how many processes can be run simultaneously at the same time? 10 or 20 ?

 

[Calvin]

Hi there!

how to run parallel on a multi-core computer, I know. The question is how to run on multi-core, where are 2 threads per core? Suppose on a 10-core computer where there are 20 threads? (-n 1/10/1 -n 1/10/2 ...) or each thread, regardless of whether it's a real kernel or a virtual one, is handled separately? ( from -n 1/20 to -n 20/20? )
On a 10-core computer with 20 threads, how many processes can be run simultaneously at the same time? 10 or 20 ?

Best speed is on threads_count=physical_cores_count
Following code generates random 64-char hex string and then starts bg processes and kills them after "$2" seconds.
Code:
#!/bin/bash
trap "exit" INT TERM ERR
trap "kill 0" EXIT
let "thr = $(lscpu | grep -E '^CPU\(s\)' | sed 's/CPU(s)://' | sed s/' '//g) / 2"
# if you want to get more parallel processes uncomment following (or set 'thr' value as much as you want)
# thr = $(lscpu | grep -E '^CPU\(s\)' | sed 's/CPU(s)://' | sed s/' '//g)
blfname=$1 #your_bloom_filter_filename
tosleep=$2 #time_to_sleep
while 2>1
do
hexval=$(openssl rand $[32] | xxd -p -c32 | grep -E -o '.{64}$')
for n in $(seq 1 $thr)
do
./brainflayer -a -v -I $hexval -b $blfname -n $n/$thr -o out$n -m 1tab.tab &
done
sleep $tosleep
kill $(pgrep brainflayer | echo $(tr '\n' ' '))
done

Hope this helps

 

[Stone]

Best speed is on threads_count=physical_cores_count
Following code generates random 64-char hex string and then starts bg processes and kills them after "$2" seconds.
Code:
#!/bin/bash
trap "exit" INT TERM ERR
trap "kill 0" EXIT
let "thr = $(lscpu | grep -E '^CPU\(s\)' | sed 's/CPU(s)://' | sed s/' '//g) / 2"
# if you want to get more parallel processes uncomment following (or set 'thr' value as much as you want)
# thr = $(lscpu | grep -E '^CPU\(s\)' | sed 's/CPU(s)://' | sed s/' '//g)
blfname=$1 #your_bloom_filter_filename
tosleep=$2 #time_to_sleep
while 2>1
do
hexval=$(openssl rand $[32] | xxd -p -c32 | grep -E -o '.{64}$')
for n in $(seq 1 $thr)
do
./brainflayer -a -v -I $hexval -b $blfname -n $n/$thr -o out$n -m 1tab.tab &
done
sleep $tosleep
kill $(pgrep brainflayer | echo $(tr '\n' ' '))
done

Hope this helps

sleep: missing operand

For what is here "sleep" ?