Is computing $g^{xy} \bmod{s}$ from $g^{x} \bmod{s}$ and $g^{y} \bmod{s}$ easier harder or the same level of difficulty as computing
$g\uparrow\uparrow(xy) \bmod s$ from from $g\uparrow\uparrow x$ and $g\uparrow \uparrow y$. Here $\uparrow\uparrow$ denotes tetration or repeated exponentiation, for example $5\uparrow\uparrow 3 = 5^{5^5}$
Is solving this tetration problem in BQP?