From a paper I’ve been trying to understand:

It seems to us that the aforementioned capacity theorem is one of the most complex coding theorems ever proved. Its proof not only involves the techniques of AVC theory but also some of the most advanced techniques from multiuser theory… Fifteen years ago such a capacity theorem must have been out of reach, but now it serves almost only as a demonstration for the power of certain methods. It is even conceivable that soon a much simpler proof will be found. This shows that there is hope also for several of the harder problems in multiuser theory, which seem to resist all efforts for their solution. Some problems can be solved only at the right time; the time is right if the methods are mature.

Corollary : The author is a super-genius.