The jolt-vs-hand-Janet-vs-JVM mandelbrot comparison splits the 15.4x floor into two layers: a Janet-VM floor (~10.8x JVM, optimal while-loop Janet over unboxed doubles — only native codegen moves it) plus a ~1.43x jolt loop- lowering overhead on top. The overhead is entirely the loop/recur -> recursive- closure-called-per-iteration lowering; hand-Janet written the same way matches jolt, while a while+var/set version is 1.43x faster. So a cheap backend win (jolt-v28u) sits above the structural native-codegen lever. Adds the spike artifacts under bench/ and the results writeup; marks the spike done in the handoff. No source changes. Co-authored-by: Yogthos <yogthos@gmail.com> |
||
|---|---|---|
| .. | ||
| rfc | ||
| spec | ||
| architecture-refactor-plan.md | ||
| building-and-deps.md | ||
| foundational-runtime-handoff.md | ||
| foundational-runtime-spike-results.md | ||
| grammar.ebnf | ||
| libraries.md | ||
| seed-overlay-registry.md | ||
| self-hosting-architecture.md | ||
| self-hosting-compiler.md | ||
| tools-deps.md | ||