This article says a new algorithm for facilitating the multiplication of very large numbers is on the horizon:

"According to the researchers, multiplying two numbers together with a billion digits each by the process of long multiplication would take a computer months to calculate.
Using the Schönhage-Strassen algorithm, it would take under 30 seconds, and with their theoretical proof, it would be even quicker – theoretically – and may even represent the fastest multiplication algorithm that's mathematically possible."

I wonder, if it is actually proven beyond doubt, and passes from pure to applied, what implications it may have for simplifying certain BOINC WCG tasks.
Maybe it could substantially reduce the amount of computer time needed to solve certain problems, or conversely, problems that once were thought to take years could be tackled in days or weeks.
Maybe in the future even complex tasks could be run on Android devices.