update readme

.github/workflows/ci.yml

@@ -2,6 +2,12 @@ name: ci
 
 on:
   push:
+    branches:
+      - '**'
+    paths:
+      - .github/workflows/*.yml
+      - lib/**
+      - main.c
 
 jobs:
   build:

readme.md

@@ -58,7 +58,7 @@ ecloop add -f data/btc-puzzles-hash -t 4 -r 800000:ffffff -o /tmp/found.txt
 `echo privkeys.txt` – source of HEX encoded priv keys to search (can be file or generator program). `-f` – hash160 to search as bloom filter (can have false positive results, but has a much smaller size; eg. all BTC addresses ever used have size ~6GB). `-a` – what type of hash160 to search (`c` – compressed, `u` – uncopressed, `cu` check both). `-t` use 8 threads.
 
 ```sh
-echo privkeys.txt | ecloop mul -f data/btc-puzzles.blf -a cu -t 8
+echo privkeys.txt | ecloop mul -f data/btc-puzzles.blf -a cu -t 4
 ```
 
 ### Example 3: Generating bloom filter
@@ -67,9 +67,13 @@ echo privkeys.txt | ecloop mul -f data/btc-puzzles.blf -a cu -t 8
 
 Bloom filter uses p = 0.000001 (1 in 1,000,000 false positive). You can adjusting this option by playing with `n`. See [Bloom Filter Calculator](https://hur.st/bloomfilter/?n=1024&p=0.000001&m=&k=20). List of all addressed can be found [here](https://bitcointalk.org/index.php?topic=5265993.0). 
 
+```sh
+cat data/btc-puzzles-hash | ecloop blf-gen -n 1024 -o /tmp/test.blf
+```
 
+Then created bloom filter can be used in `ecloop` as filter:
 ```sh
-cat data/btc-puzzles-hash | ./ecloop blf-gen -n 1024 -o /tmp/test.blf
+ecloop add -f /tmp/test.blf -t 4 -r 8000:ffffff
 ```
 
 ## Benchmark