Here's what makes this insidious: the trampoline runs fine. genericClosure's C++ loop processes all 65,000 steps without complaint. The failure happens when you try to use the result. Forcing that final total unwinds the entire thunk chain as recursive C++ forceValue calls, rebuilding exactly the stack depth you thought you'd eliminated. The error is stack overflow (possible infinite recursion), not max-call-depth exceeded: this is the C++ call stack, not the Nix evaluator's depth limit. A simple integer counter where the comparison is the state (n: if n = N then ...) would survive, because the comparison forces the state at every step and call-by-need memoization prevents the chain. The trap springs when your state has components the step function doesn't touch.
Трамп высказался о важных целях для ударов в Иране02:32
Что думаешь? Оцени!。新收录的资料对此有专业解读
Фонбет Чемпионат КХЛ。新收录的资料对此有专业解读
英伟达将推出 AI 推理专用芯片
journal_mode: wal。新收录的资料是该领域的重要参考