Undeconation refers to the binary function $$a \{\{\{\{\{\{\{\{\{\{\{1\}\}\}\}\}\}\}\}\}\}\} b = \{a,b,1,11\}$$, using BEAF.[1]
In the fast-growing hierarchy, $$f_{\omega10+1}(n)$$ is approximately comparable to the growth rate of undeconation.