RadExpression

Expression trees support at most 2,048 total levels and 256 nested non-binary constructs, including the leaf expression. Constructing a deeper tree throws NestingDepthExceededException before recursive processing. Binary operators consume total depth only; functions, unary, implicit intersection and spill operators also consume nesting depth. On x64 threads requesting a 1 MiB stack, Release100 (net10.0-windows) and Release462 (net462) completed guarded array-capability, string/XLSX serialization, translation and clone traversals of 2,048-level addition trees; constructing 2,049 levels hit the numeric cap. This compatibility ceiling is not an overflow threshold. Stack probes can reject other traversal patterns or smaller stacks earlier. Evaluation supports at most 8,192 simultaneously computing expressions, including dependencies in other cells. Every frame beyond 16 also probes remaining execution stack. On x64 threads requesting a 1 MiB stack, seven cold 5,000-cell reference/running-total patterns reached catchable stack probes at 584-2,786 active expression frames in Release100 (net10.0-windows), and 601-1,704 in Release462 (net462). A 2,048-level addition tree evaluated on Release100; Release462 completed 2,000 levels, while the 2,048-level tree reached its probe at 2,027 active expression frames. These are guarded observations, not overflow thresholds. The 8,192 compatibility ceiling permits ordinary dependency chains on larger stacks without lowering the construction ceiling; smaller stacks still fail catchably earlier.