Good idea for Google

I've given some thought over the years, going back to (probably) 1988 about massively parralel systems. I won't go into that here. But I do have an idea that came about when pondering prime numbers recently. I was pondering the complexity of factoring and finally realised a simple thing:

Factoring is search

Google does search

Google should do factoring

Not clear enough? OK, here's how a web search goes, at least according to my short-sighted mind: A search string is entered on Google, and that search string is sent out to hundreds of thousands of servers. Each server does a search based on its narrow list of web pages it has indexed. All hundred-thousand-or-so servers run a search and return the results, instead of one server performing one hundred thousand searches at a time.

Now, just have all the google individual servers store a narrow set of prime numbers (which can find all the other factors) and the search "string" would be some large number. You would have to "re-search" any multiples of the primes for the rest of the factors. That might be hard to do with the current search algorithm.

I'm not sure what number we could get to for fast factoring, but the biggest number would be the square of the highest prime number in the system. If each of the one hundred thousand servers had, say, 1000 primes stored, that would include the first million primes. Square that, and you could easily factor any number under it.

If you like my idea, you can steal it. And by the way, I need a job, Google.