Using Local Coding Agents
I put together a new article on setting up local coding agents with open-weight models. Everything runs 100% locally.
I thought it might be useful to put this together because many people asked me about my setup in the past, and I thought it would also motivate people to get started tinkering with local models for serious work. Things got incredibly capable this year with better LLMs and better harnesses.
So, here’s a walkthrough of how to connect a local LLM to a local coding harness. That could be Claude Code or Codex, which you may already be familiar with.
I also included some assessment notes that are useful as a checklist to select between and consider certain LLMs over others:
- Checking RAM usage at long contexts to see if the model is suitable for real work
- Measuring prefill and decoding tok/sec to see whether it’s fast enough to not be annoying
- Making sure the model has sufficient tool-calling capabilities in theory
- Doing a security audit of the agent framework
- Assessing whether the model can solve some more challenging tasks when used in a coding harness
Of course, there are always more specialized tools that can squeeze a bit more performance out of things, but I hope this is a good starter kit that stays flexible. That is, you can easily switch to newer models as they are released or even tap into cloud models in your familiar harness if the current ones are not sufficient for a given task.
You can find the full article here: Using Local Coding Agents.
Source: lightly edited website version of my Substack note.
Read Next
OpenAI Astra and Looped Transformers
A short note on OpenAI Astra, recurrent depth, looped transformers, Nanbeige 4.2, and the Mixture-of-Recursions paper.
Reasoning Models From Scratch: Code Setup
A short video on how conventional LLMs relate to reasoning models and agents, along with Python and PyTorch setup using uv.
Two Live Book Club Q&As on September 3
Two free live book club Q&A sessions on September 3 about Build a Reasoning Model From Scratch and related reader questions.
