Hexation Calculator

Introduction: what hexation is and how to read its answer

Hexation is one step beyond pentation in the hyperoperation ladder. Addition repeats counting, multiplication repeats addition, exponentiation repeats multiplication, tetration repeats exponentiation, pentation repeats tetration, and hexation repeats pentation. In Knuth up-arrow notation, hexation is written as $a\uparrow \uparrow \uparrow \uparrow b$, and in the hyperoperation numbering it is $H_6(a,b)$.

The important part is not just that the numbers get large. It is how quickly the notation stops standing for an ordinary decimal you could print on a page. A tiny expression such as 2 ↑↑↑↑ 2 still collapses to 4. One more height, 2 ↑↑↑↑ 3, unwinds to 2 ↑↑ 65,536 — a power tower of 65,536 twos. At that point, symbolic notation is not a shortcut. It is the only readable answer, which is why this page reports an expression rather than a fake decimal whenever exact arithmetic runs out.

How to use the hexation calculator

Start from a preset to see a known small case, or type a positive integer base and a positive integer height by hand. The base is the number being stacked; the height is how many times pentation gets applied. Tick Show iterative breakdown to watch each recursive stage as its own table row, and tick Include growth notes to get a sentence about why the evaluator stopped expanding and fell back to notation. Evaluate Hexation runs the calculation, Reset clears every panel back to the starting state, and Copy Summary lifts the whole report as plain text.

Keep the numbers modest if you want an exact answer. Base 1 is trivial: it never leaves 1. Base 2 is the friendliest case to trace by eye, because 2 ↑↑↑↑ 2 = 4 and only the next height escapes. Base 3 at height 2 is already off the map: it reduces to 3 ↑↑↑ 3 = 3 ↑↑ 7,625,597,484,987, a tower roughly seven and a half trillion levels tall. Larger inputs are worth trying to see how fast the symbolic form takes over, not to read a decimal.

The results area is split into five stacked panels so the answer stays separate from the commentary. The summary gives the value or symbolic form. The growth note appears only with growth notes switched on. The insights list flags interesting cases, such as landing on one of the rare heights that still reduces to an integer. The warnings list is honest about limits, including the cap on how many recursive stages get expanded. The stage table appears with the iterative breakdown switched on.

The hexation formula and the hyperoperation recursion

This calculator uses the standard positive-integer recursive convention. The base case fixes height 1, and every taller height is defined by feeding the previous result into pentation:

That is the sixth line of a single pattern. Writing $H_n$ for the n-th hyperoperation, every rung above exponentiation obeys the same recursion, with hexation being the case $n=6$:

The expression on the right uses pentation, pentation itself calls tetration, and tetration builds right-associated exponent towers: $a\uparrow \uparrow 3=a^{a^a}$. That nested chain is why the calculator tries exact arithmetic only while the intermediate values are still small enough to be honest about. When a step crosses that line, the output switches to a clean symbolic expression and says which operation ran out of room.

Worked example: evaluating 2 ↑↑↑↑ 3 by hand

1. Stage 1: 2 ↑↑↑↑ 1 = 2, straight from the base case.
2. Stage 2: 2 ↑↑↑↑ 2 = 2 ↑↑↑ (2 ↑↑↑↑ 1) = 2 ↑↑↑ 2. Pentation at height 2 reduces to 2 ↑↑ 2 = 2² = 4.
3. Stage 3: 2 ↑↑↑↑ 3 = 2 ↑↑↑ (2 ↑↑↑↑ 2) = 2 ↑↑↑ 4.
4. Unwinding the pentation: 2 ↑↑↑ 4 = 2 ↑↑ (2 ↑↑↑ 3), and 2 ↑↑↑ 3 = 2 ↑↑ (2 ↑↑↑ 2) = 2 ↑↑ 4 = 65,536.
5. Result: 2 ↑↑↑↑ 3 = 2 ↑↑ 65,536, an exponent tower of 65,536 twos.

Notice what happened between stages 2 and 3. The value went from 4 to a tower whose height alone is 65,536. Even the number of digits in that tower is far too large to print: 2 ↑↑ 5 already has about 19,729 digits, and the tower keeps going another 65,531 levels. This is the line between calculation and notation, and a symbolic answer is the most accurate answer available.

How the six hyperoperations compare

Limitations and assumptions: where the evaluator stops and why

This tool is defined only for positive integers. It deliberately avoids real- or complex-valued hexation: several competing conventions exist for fractional heights, none is the clean schoolbook extension you get for ordinary exponents, and an answer would be a choice dressed up as a fact. The exact arithmetic is also conservative on purpose. As soon as the next exponent would push a tower past JavaScript's safe integer range, the code holds the value as up-arrow notation instead of rounding a number that no longer means anything. That is why you will often see a tidy symbolic expression where you might have expected a long string of digits.

Concretely, the evaluator descends through the same ladder the math does. A hexation stage asks pentation for one value; pentation asks tetration; tetration multiplies out an exponent tower one level at a time. Each level checks whether the running exponent, multiplied by the base-10 logarithm of the base, would still land under fifteen decimal digits. The first level that fails returns a notation object carrying a short explanation instead of a number. Because the check happens in the innermost loop, the fallback is deterministic: the same base and height always stop at the same place, and the note tells you which operation ran out of room. It is also why base 2 traces further than base 3 — a taller base overflows the exponent tower after fewer levels.

Two further assumptions are worth stating. First, only the first eight recursive stages are expanded, so an enormous height such as 2 ↑↑↑↑ 1000 reports the first eight rows and keeps the rest symbolic; the page stays responsive rather than looping for minutes toward an answer nobody could read. Second, the iterated-logarithm scale used by the mini-game below is the linear approximation to the super-logarithm, which is exact on whole-number tower heights and only approximate in between. It is the right tool for ranking magnitudes, not for extracting digits.

Questions people ask about hexation

Sources: The recursion a ↑↑↑↑ 1 = a and a ↑↑↑↑ n = a ↑↑↑ (a ↑↑↑↑ (n−1)) is the sixth line of the standard hyperoperation sequence (hyperoperation), written here in Knuth's up-arrow notation, introduced by Donald Knuth in “Mathematics and Computer Science: Coping with Finiteness” (Science, 1976). The names tetration, pentation and hexation come from R. L. Goodstein, “Transfinite Ordinals in Recursive Number Theory” (Journal of Symbolic Logic, 1947). Tower notation and the power-tower conventions used above follow Wolfram MathWorld: Power Tower, and the iterated-logarithm scale in the mini-game is the linear approximation to the super-logarithm. The identity 3 ↑↑↑↑ 3 = g₁ is from the definition of Graham's number. Values that exceed safe integer range are held in symbolic form rather than rounded.