...
wow! it is a brilliant way to reduce number of combinations
Thanks but wasn't enough to get the right answer. At least i had developed a system to make brainwallet brute force to text files, maybe the code is useful for someone to solve this puzzle...
Code:
#Code in Unix BashScript
rm -rf bfResult.txt bfClean.txt;
cat bf.txt | tr -dc '[:alnum:]\n\r''\n ' | tr -d [0-9] >> bfClean.txt
for y in {a..z};
do
sed -i "s/ $y/ $(echo "$y" | tr '[:lower:]' '[:upper:]')/g" "bfClean.txt"
done
z1=$(cat bfClean.txt | wc -w)
z=$(echo "$z1-8" | bc)
for a in $(seq 1 $z)
do
c=$(echo "$a+7" | bc)
b=$(cat bfClean.txt | cut -d " " -f$a-$c)
if [ "$(echo "$b" | wc -m)" = "40" ]; #40 because is the 32+spaces
then
echo $b;
echo $b >> bfResult.txt;
fi
done
rm -rf bfResult.txt bfClean.txt;
cat bf.txt | tr -dc '[:alnum:]\n\r''\n ' | tr -d [0-9] >> bfClean.txt
for y in {a..z};
do
sed -i "s/ $y/ $(echo "$y" | tr '[:lower:]' '[:upper:]')/g" "bfClean.txt"
done
z1=$(cat bfClean.txt | wc -w)
z=$(echo "$z1-8" | bc)
for a in $(seq 1 $z)
do
c=$(echo "$a+7" | bc)
b=$(cat bfClean.txt | cut -d " " -f$a-$c)
if [ "$(echo "$b" | wc -m)" = "40" ]; #40 because is the 32+spaces
then
echo $b;
echo $b >> bfResult.txt;
fi
done
By the way, i think Op should drop another hint.
