Matt Pocock: deterministic checks could safely automerge refactor PRs under strict rules
mattpocockuk · x · 2026-10-25
Matt Pocock proposes a tool idea: under very strict constraints (code reorganization only, no module graph changes, no test coverage regression, etc.), it should be possible to deterministically check whether a PR can be automerged. It wouldn't work for new features or bugfixes, but could unlock a class of refactorings that let teams change code more confidently — "there is a tool here waiting to be created."
Related event: Debate over deterministic auto-merge tool for refactor PRs(3 posts)→
More from coding & agent
- Poll: Only 8.4% of X developers still hand-write over 20% of their code, vs 65% on Mastodon — charliermarsh · 2026-10-25
- $39/mo analytics tool gets open-sourced in 4 hours, then an AI agent deploys it for free — fekdaoui · 2026-10-25
- Open-source userscript brings back a table of contents for long ChatGPT chats — TonyHMeow · 2026-10-25
- Opus 5.5 reviews other models' code: deletes a lot without breaking anything — CtrlAltDwayne · 2026-10-25
- OpenUI: open-source generative UI standard uses a streaming language that saves up to 67% tokens vs JSON — tom_doerr · 2026-10-25
- Chip Huyen's free AI Engineering companion repo packs 10-chapter notes and real-world prompts — mdancho84 · 2026-10-25