Recursion runs at machine speed

The loop compiler could only ever speed up loops, so a function that calls itself - all recursion - ran at plain-interpreter speed, and a recursive Fibonacci was this scorecard's standing example of the gap ("recursion runs about 83 times slower than the reference JavaScript engine"). 0.1.93 adds a native entry tier that compiles a self-recursive numeric function all the way to machine code, with its own depth and fuel guards, so the hot recursive shape is native rather than interpreted. It is proven equal to the interpreter across a differential fuzzing campaign, and the JIT sub-score moves one honest point for closing the shape.