Related reading
Faster Maps: Chasing Swiss Speed
ParparVM’s HashMap suffered catastrophic miss latency due to linear probing on dense integer keys. By adopting CPython‑style perturbed probing (Swiss‑table style) and extending tagged immediate values to more primitives, miss latency dropped from 32 s to ~45 ms, allocation pressure fell dramatically, and overall performance stayed roughly flat despite a modest hit‑time slowdown.
CodeName Onecodenameone.com8 minWe Didn't Want to Build Another Java Server
Codename One introduced an experimental native Java backend that compiles Java controllers to a tiny native executable via ParparVM. Benchmarks show sub‑millisecond startup, 10‑40 MiB memory, and up to 20 % higher request throughput than a Go fasthttp server.
CodeName Onecodenameone.com15 mintokenizers v1: encode, decode and scaling, measured
Hugging Face has released `tokenizers` v1, a major performance update that achieves 3-30x faster encoding than v0.23 while maintaining identical output and API compatibility. Key optimizations include a SIMD-accelerated splitter, a thread-local word cache, and an allocation-free BPE merge loop, ensuring tokenization doesn't bottleneck ML workflows.
Hugging Facehuggingface.co10 minArchitecting Generative UI with Streaming JSON Schemas and React Server Components
This article details building a Generative UI architecture that streams structured JSON component schemas from LLMs, rendering them directly into type-safe React Server Components. It provides a full, from-scratch implementation using Web Streams, Zod, and Next.js 15+, avoiding proprietary libraries.
SitePointsitepoint.com19 min
