Latest solution tried:
For some reason I felt like the answer was hidden in the question, so I did the following.
Step 1: Assign each word a number based on the length of its characters.
Why = 3
The = 3
Comb = 4
Of = 2
Natasha/Satoshi = 7
Otomoski/Nakamoto = 8
Has = 3
21 = 2
Teeth= 5
? = not a word
. = not a word
txt = ignore for this solution (assumed it was to throw us off maybe).
Step 2: Take this number list (3, 3, 4, 2 ,7 ,8, 3, 2, 5) and run it through some python code to get all the possible combinations that amount to 32 characters.
import itertools
numbers = [3, 3, 4, 2 ,7 ,8, 3, 2, 5]
result = [seq for i in range(len(numbers), 0, -1) for seq in itertools.combinations(numbers, i) if sum(seq) == 32]
print result
Step 3: Read results to find that only 1 combination consists of 8 different numbers (i.e. words).
(3, 3, 4, 2, 7, 8, 3, 2), <-- this one is 8 numbers therefore 8 words, to satisfy the hint "8 camel case words".
(3, 3, 4, 2, 7, 8, 5),
(3, 3, 4, 7, 8, 2, 5),
(3, 4, 2, 7, 8, 3, 5),
(3, 4, 7, 8, 3, 2, 5),
(3, 4, 2, 7, 8, 3, 5),
(3, 4, 7, 8, 3, 2, 5).
Step 4: Run the words corresponding to those numbers through the permutation solver program provided by ligor on page 17
https://github.com/Igor-san/1BtcPuzzle, once with Natasha Otomoski for numbers 7, 8, and once with Satoshi Nakamoto. 40,320 possible combinations of the words corresponding to (3, 3, 4, 2, 7, 8, 3, 2) give 32 characters, the solver program goes through them in a couple of minutes.
Step 5: No results, no key found.
Step 6: Cry.
