Bilingual

Website is served from a 200KB binary
9 days ago
- AOT systems language that compiles directly to x86-64 with a philosophy of treating world failures as data and bugs as fatal errors.
- Original garbage collector had critical flaws: it moved live objects on macOS/Windows, reclaimed almost no memory, and caused server crashes after 828 requests; rewriting it enabled stable handling of 20,000 requests.
- Many bugs existed unnoticed due to structural issues like untestable heap size, which was fixed by making heap size a compile-time knob, revealing multiple backend and memory management errors.
- Language design prioritized immediate error detection, catching mistakes quickly (e.g., miscompilations, uninitialized stack reads) and enshrining the thesis that 'bugs are fatal' and 'world failures are data'.
- Claude (the AI) contributed significantly to compiler improvements, including garbage collector rewrite, first-class op references, and HTTP stack, highlighting effectiveness in fixing implementation flaws over philosophy changes.
Tune Code Before Your Garbage Collector
13 days ago
- Memory allocation optimization in Java can have a greater impact on performance than the choice of Garbage Collector (GC).
- A benchmark using JLBH for MarketDataSnapshot to NewOrderSingle at 50K/s for 30 minutes compared logging with SLF4J versus no logging (using Chronicle Queue).
- Adding redundant SLF4J logging significantly degraded latency metrics (p99 and p99.99) across various GCs like Parallel, ZGC, G1, and Shenandoah.
- Moving logs to a tmpfs filesystem reduced latency, but removing redundant logging entirely led to even greater improvements, with p99.99 dropping by three orders of magnitude.
- Removing logging changed the optimal GC choice: Parallel GC performed best, while Shenandoah worsened, highlighting that workload optimization should precede GC tuning.
Meta Garbage Collection: Using OCaml's GC to GC Rust
a day ago
- Soteria Rust, a symbolic execution tool, experienced quadratic slowdown due to its Tree Borrows aliasing model when handling loops.
- The fix leverages OCaml's garbage collector to automatically remove unreachable tree nodes, using weak references and periodic major collections.
- This change achieved linear execution time and up to 10x speedup on benchmarks, with only about 40 lines of code.
- The approach highlights the benefit of deeply integrating with the host language (OCaml) for complex memory management tasks.

Hasty Briefsbeta

#garbage collection

Website is served from a 200KB binary

Tune Code Before Your Garbage Collector

Meta Garbage Collection: Using OCaml's GC to GC Rust