I'll read this if I can afford the time! It would be nice if there were a summary more detailed than the abstract but still short relative to the length of the article (say, 10-pages long?).
If I had to summarize it from one sentence from the article, I'd go with:
"The one prediction I feel confident in making is that the idea of “ironic complexity theory”—i.e.,
of a profound duality between upper and lower bounds, where the way to prove that there’s no
fast algorithm for problem A is to discover fast algorithms for problems B, C, and D—is here to
stay."
