Obviously there's no holy water when it comes to go and concurrency bugs.

But go is memory managed and statically typed, and, obviously, assembly language or pure binary opcodes aren't.

The article certainly isn't perfect, but the thesis wasn't just that "Hey, LLMs can now write stuff for us in more efficient languages."

It was (rightly or wrongly) that LLMs can let us more easily use more complicated languages that both go faster and do more checking than most dynamic languages.