I looked around and it seems that the language is defined by the compiler not operational semantics. In normal code golf new languages are banned because of the loophole of implementing the answer as a compiler entry to empty text. This renders answers as non-competing and are often seen as worth deleting as non-competing often means this or failing to meet the specification.
Is it allowed to post non-competing fastest-code solutions where I look into the problem and see how the compiler is failing me then adjust it?
To me trivial languages in fastest-code do not exist as the best possible answer is going to be in hardcoded machine code, in that case I would just be posting machine code. By compiler optimisations I mean possibly vectorisation, garbage collection, dead-code elimination, fusion etc... not hardcoding.