User blog comment:GamesFan2000/Extreme Nesting Array Function (ENAF)/@comment-35606647-20181214065812

You could simplify any array into {a,b} just by leaving a as it is and making b the sum of every entry from the second to the last and it should be just as powerful I think.

Now that it's more easy to analyze,  {a,1} grows like w in the fgh (w is omega). {a,2} is {...{a,1},1},1}...} With {a,1} iterations so in the fgh it's w+1 with a w inside it. After this it's all the same pattern so it caps at w2. With {a,a}.