Hacker News Reader

The circuit that repeatedly multiplies the previous result with itself has higher than exponential growth rate.

No, because you can only multiply a fixed number of times.

Good luck finding something that grows faster than https://en.wikipedia.org/wiki/Ackermann_function

Easy, just square it. Also, the Ackermann function is not a primitive recursive function.