There is one thing I've been thinking about.

We've been talking about factorizing numbers, but can the grid be used to multiply numbers?

Currently the fastest (I think) known multiplication algorithm does so in O(n log n log log n). Would the grid beat that?