New proof dramatically compresses space needed for computation

This seems very theoretical, just a lower bound on space required, without talking about what is being computed. Does it have any import on real algorithms?

Lower bound tells you how much it's worth to improve the SOTA. It gives you a hint that you can do better.

So it's more like polar star. Maybe not directly practical, but it will lead tons of people in the right direction.