Reading up on compilers
3 deep · digging since feb 08
- Queryable Executables
The article explains a technique to compile programs so they can answer queries about their own execution without re-running, using static analysis or embedded metadata.
- Show HN: Timber – Ollama for classical ML models, 336x faster than Python
Timber compiles classical ML models into self-contained C99 artifacts, enabling 2 µs inference that is approximately 336× faster than Python.
- We tasked Opus 4.6 using agent teams to build a C Compiler
Anthropic's Opus 4.5 agent teams built a 100k-line C compiler from scratch for $20k that compiles Linux 6.9 on three architectures, but produces code worse than GCC -O0.