Related reading
I vibed a proof of Conway's conjecture
The author used Claude to generate a Lean formalisation and proof of Conway’s refinement conjecture for omnific (surreal) integers. The proof passes mechanical checks and informal review but lacks independent verification. The post narrates the workflow, token cost, and reflections on AI‑assisted theorem proving.
Hacker News front pageoverreacted.io32 minHN269294Article: Your Next DSL Author Is a Language Model
Typed Domain Grounding (TDG) embeds a DSL inside a mainstream language the LLM already knows (e.g., Kotlin) and uses the host compiler as an oracle. The author describes five building blocks—embedding, choosing a host language with high training‑data frequency, compiler‑driven type safety, a generate‑compile‑repair loop, and an on‑demand teaching tool—and shows measured results from kUML, a Kotli…
InfoQinfoq.com18 minFathom: Per-Query Read Depth for Sparse Decoding over Offloaded KV Caches
Fathom introduces a per-query read depth mechanism for sparse decoding over offloaded KV caches, allowing each query to adaptively decide how many bits of each key channel to read. This method significantly speeds up decoding for large language models with long contexts by reducing host memory traffic, achieving 1.67x faster GPU decoding on Qwen3-8B at one million tokens.
Hugging Face Daily Papersarxiv.org1 minpaperMonitor TAS and gang scheduling for AI training in Kubernetes
Kubernetes’ default scheduler can’t satisfy AI training’s need for low‑latency GPU interconnects and simultaneous pod start‑up. The blog explains how the open‑source Kueue job queue adds topology‑aware placement (using node labels like `topology.kubernetes.io/rack`) and how the Coscheduling plugin adds a permit phase that only binds a gang of pods when the full set is ready, preventing idle GPU r…
Datadogdatadoghq.com19 min- 1 points
Saving another 100TB of RAM with math (and Rust)
Cloudflare reduced the memory footprint of its Pingora Backend Router by re‑examining the consistent‑hashing implementation in the pingora‑ketama library. By increasing the number of virtual hash points per server from the default 1 to the standard 160 (and applying weighted hashing based on disk capacity), they cut the per‑node overhead enough to reclaim >100 TB of RAM across the fleet. The post…
Consistent Hashing Proofs
Lobstersterabyteoff.comlobste.rs7
