I assume you're using the brute-force method to try to crack the passwords. Have you considered dividing the problem into pieces and having multiple people run the same image through at the same time, but only on a subset of all the possibilities? You could speed up the process tremendously this way.
As a very gross analogy: Person 1 does A-G, Person 2 does H-N, Person 3 does O-V, etc.
Have you cracked anything yet? I was wondering whether each picture has a separate password, or whether one password would open them all.
I've been thinking about this whole password business and I find it hard to imagine that Q expects us to have to go thru the process of a brute-force sequential search to find it. After all, who knows how long this password is? The longer it is, the longer it'll take to find it. If it's more than just letters and numbers, the number of possibilities becomes enormous. Also, does case matter? Is an "A" the same thing as an "a"? Not everyone would have the computing power to crack this. Realistically, you'd almost need a number-crunching mainframe for the task.
Has anyone thought to go thru the Q posts to see if there's a hint in there? With over 4,000 posts, it's possible that there's something buried in there and no one has noticed or realized what it was.
I know for myself that I've browsed thru the notes on numerous occasions and yet I'm still finding ones that I've never read before. It's possible that it's just being overlooked.
Just a quick note for now -- more when I have time.
Something to think about: How to handle the situation when you do crack the code.
We need to be careful with this information so that it doesn't get into the hands of the resident shills and other nefarious elements. The last thing we need is to see this broadcast on the next edition of 60 mins.
BTW, I was just thinking...
I assume you're using the brute-force method to try to crack the passwords. Have you considered dividing the problem into pieces and having multiple people run the same image through at the same time, but only on a subset of all the possibilities? You could speed up the process tremendously this way.
As a very gross analogy: Person 1 does A-G, Person 2 does H-N, Person 3 does O-V, etc.
Have you cracked anything yet? I was wondering whether each picture has a separate password, or whether one password would open them all.
I've been thinking about this whole password business and I find it hard to imagine that Q expects us to have to go thru the process of a brute-force sequential search to find it. After all, who knows how long this password is? The longer it is, the longer it'll take to find it. If it's more than just letters and numbers, the number of possibilities becomes enormous. Also, does case matter? Is an "A" the same thing as an "a"? Not everyone would have the computing power to crack this. Realistically, you'd almost need a number-crunching mainframe for the task.
Has anyone thought to go thru the Q posts to see if there's a hint in there? With over 4,000 posts, it's possible that there's something buried in there and no one has noticed or realized what it was.
I know for myself that I've browsed thru the notes on numerous occasions and yet I'm still finding ones that I've never read before. It's possible that it's just being overlooked.
Just a quick note for now -- more when I have time.
Something to think about: How to handle the situation when you do crack the code. We need to be careful with this information so that it doesn't get into the hands of the resident shills and other nefarious elements. The last thing we need is to see this broadcast on the next edition of 60 mins.