<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>JIT on miti99</title><link>https://miti99.com/en/tags/jit/</link><description>Recent content in JIT on miti99</description><generator>Hugo</generator><language>en</language><lastBuildDate>Mon, 16 Nov 2026 17:39:19 +0700</lastBuildDate><atom:link href="https://miti99.com/en/tags/jit/index.xml" rel="self" type="application/rss+xml"/><item><title>Newsletter #61</title><link>https://miti99.com/en/post/2025/11/25/</link><pubDate>Tue, 25 Nov 2025 00:00:00 +0700</pubDate><guid>https://miti99.com/en/post/2025/11/25/</guid><description>&lt;p&gt;&lt;em&gt;Been &amp;lsquo;offline&amp;rsquo; for quite a while, finally resurfacing today. Enjoy Newsletter #61.&lt;/em&gt;&lt;/p&gt;
&lt;h2 id="beyond-indexes-how-open-table-formats-optimize-query-performance"&gt;&lt;a href="https://jack-vanlightly.com/blog/2025/10/8/beyond-indexes-how-open-table-formats-optimize-query-performance/" rel="noopener noreferrer"&gt;Beyond Indexes: How Open Table Formats Optimize Query Performance&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Jack Vanlightly, who previously worked on SQL Server performance tuning and now specializes in data systems, pushes back against the idea that open table formats (OTFs) like Apache Iceberg or Delta Lake should add secondary indexes like relational databases. In an OLTP RDBMS, B-tree clustered indexes and secondary indexes quickly locate one or a few rows in exchange for higher write overhead. Analytical queries are fundamentally different: they scan millions of rows of immutable, columnar data stored on object storage like S3, so chasing secondary-index pointers offers almost no benefit.&lt;/p&gt;
&lt;p&gt;Instead, OTFs speed up queries through data skipping: pruning entire irrelevant files before reading them. Data skipping relies on physical layout (partitioning, sorting, compaction), min/max statistics in manifests and data files, and file- or row-group-level Bloom filters where supported, alongside complementary tools like materialized views. The author sums it up as &amp;ldquo;layout is king&amp;rdquo;: performance comes from organizing data so partitions match filter predicates and similar values sit close together. Materialized views are the closest equivalent to a secondary index, and the path forward is letting query engines build their own optimizations on top of standard table specs rather than cramming complex index structures into the OTF specification itself.&lt;/p&gt;
&lt;h2 id="what"&gt;&lt;a href="https://den.dev/blog/github-spec-kit/" rel="noopener noreferrer"&gt;What&amp;rsquo;s The Deal With GitHub Spec Kit&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Den Delimarsky observes that while LLMs are useful for coding, their output varies wildly: for the same requirement, different prompts produce very different code. His proposed solution is Spec-Driven Development (SDD), where a specification clearly defines the &amp;ldquo;what&amp;rdquo; and &amp;ldquo;why&amp;rdquo; of a feature while deliberately leaving out technical implementation details. GitHub Spec Kit is an experimental open-source toolkit that puts this workflow into practice through a sequence of slash commands: &lt;code&gt;/constitution&lt;/code&gt; sets core principles, &lt;code&gt;/specify&lt;/code&gt; writes the spec, &lt;code&gt;/clarify&lt;/code&gt; resolves ambiguities, &lt;code&gt;/plan&lt;/code&gt; creates the technical plan, &lt;code&gt;/tasks&lt;/code&gt; breaks down the work, and &lt;code&gt;/analyze&lt;/code&gt; checks consistency before implementation.&lt;/p&gt;
&lt;p&gt;In the author&amp;rsquo;s view, an LLM is like an over-eager junior engineer who needs clear requirements and guidance. With SDD, the specification becomes an executable document while the source code becomes disposable—something that can be regenerated and verified on demand; decoupling the spec from a specific tech stack also makes it easy to compare multiple implementations. He illustrates this by building a tool that aggregates webcam images from Mauna Kea in under two hours, while stressing that specs are no silver bullet: humans still have to supervise and iterate continually. As models grow more capable, the bottleneck shifts to accurately communicating developer intent, and a solid spec is how you solve it.&lt;/p&gt;
&lt;h2 id="just-talk-to-it---the-no-bs-way-of-agentic-engineering"&gt;&lt;a href="https://steipete.me/posts/just-talk-to-it" rel="noopener noreferrer"&gt;Just Talk To It - the no-bs Way of Agentic Engineering&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Peter Steinberger shares his agentic engineering workflow for projects where nearly all the code is written by AI. His central message is &amp;ldquo;just talk to it&amp;rdquo;: instead of chasing elaborate frameworks, work directly with a capable model, use it enough to build intuition, and keep your workflow dead simple. He prefers &lt;code&gt;GPT-5-Codex&lt;/code&gt; over Claude Code because it uses context more efficiently, runs faster, supports message queueing, and reads more files before acting. His prompts are often just one or two sentences paired with a screenshot pointing out what needs fixing. A key concept is &amp;ldquo;blast radius&amp;rdquo;: estimating how many files a change will touch so you can slice work sensibly, run multiple agents in parallel across terminal panes, and commit in small increments.&lt;/p&gt;
&lt;p&gt;He favors CLIs over MCPs to avoid wasting context, writes tests right after each feature in the same session, and spends roughly 20% of his time having the agent refactor code. Conversely, RAG, subagents, &amp;ldquo;plan mode,&amp;rdquo; and convoluted agent instructions aren&amp;rsquo;t worth much in his experience. His toolkit consists of Codex CLI, Wispr Flow for voice input, &lt;code&gt;tmux&lt;/code&gt; for background tasks, and &lt;code&gt;ast-grep&lt;/code&gt; for code checks, backed by an ~800-line &lt;code&gt;Agents.md&lt;/code&gt; file. His takeaway: building great software is still hard, the required skillset resembles managing senior engineers, and the bar for architecture and user experience is higher than ever.&lt;/p&gt;
&lt;h2 id="jit-so-you-want-to-be-faster-than-an-interpreter-on-modern-cpus"&gt;&lt;a href="https://www.pinaraf.info/2025/10/jit-so-you-want-to-be-faster-than-an-interpreter-on-modern-cpus/" rel="noopener noreferrer"&gt;JIT: so you want to be faster than an interpreter on modern CPUs&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;Pinaraf, who is developing a JIT compiler for PostgreSQL, explains why a JIT isn&amp;rsquo;t automatically faster than an interpreter on modern CPUs. Today&amp;rsquo;s CPUs are superscalar, out-of-order machines with sophisticated branch predictors capable of executing multiple instructions in parallel and hiding latency remarkably well. Traditional interpreters use a &lt;code&gt;switch&lt;/code&gt; statement to dispatch opcodes, creating hard-to-predict branches; PostgreSQL replaces this with computed gotos that jump directly to each opcode handler, allowing the CPU to predict branches much more accurately. As a result, a well-written interpreter is surprisingly competitive with compiled code.&lt;/p&gt;
&lt;p&gt;The author analyzes the query &lt;code&gt;SELECT a FROM table WHERE a = 42&lt;/code&gt; over a 10-million-row table, which compiles into an opcode sequence of &lt;code&gt;SCAN_FETCHSOME&lt;/code&gt;, &lt;code&gt;SCAN_VAR&lt;/code&gt;, &lt;code&gt;FUNCEXPR_STRICT_2&lt;/code&gt; (null checks followed by &lt;code&gt;int4eq&lt;/code&gt;), &lt;code&gt;QUAL&lt;/code&gt;, and &lt;code&gt;DONE_RETURN&lt;/code&gt;. Removing redundant null checks on constants yields a 7.9% speedup, dropping all null checks gives 9.5%, inlining &lt;code&gt;int4eq&lt;/code&gt; reaches 10.3%, and his experimental JIT achieves 23%—cutting instructions by 11%, cycles by 20%, and branches by 13%. Notably, those first optimizations apply just as well to the interpreter as to the JIT, narrowing the JIT&amp;rsquo;s traditional edge; truly beating the interpreter requires deeper optimizations that the author promises to cover in follow-up posts.&lt;/p&gt;
&lt;p&gt;&lt;em&gt;For this post I used CCR with the &lt;code&gt;x-ai/grok-4.1-fast:free&lt;/code&gt; model. It doesn&amp;rsquo;t seem great yet—a lot of rough untranslated English remained. I&amp;rsquo;ll try to improve it further.&lt;/em&gt;&lt;/p&gt;
&lt;hr&gt;
&lt;p&gt;&lt;em&gt;This post was rewritten by Claude Code with Opus 5.5 on 27/09/2026; reviewed and edited by Codex with GPT 6.1 Sol on 09/11/2026, and re-verified by Claude Code with Sonnet 5.5 on 16/11/2026.&lt;/em&gt;&lt;/p&gt;</description></item></channel></rss>