With information loss what you previously had as a single solution becomes a generalisation which can be decompiled into many different equally valid solutions.

With information loss what you previously had as a single solution becomes a generalisation which can be decompiled into many different equally valid solutions. That means even though information is irrecoverably transformed during compilation, LLM could come up with semantically valid expanded solution that both fits the compiled information, that is it can be recompiled successfully, and makes sense semantically for whoever would eventually want to evolve the decompiled code with an understanding of the domain. So the goal isn't to recover exactly what code really was, but to provide a possible solution that fits and is useful.