Matt Pocock sketches a tool to deterministically verify automergeable refactoring PRs
mattpocockuk · x · 2026-10-25
Matt Pocock outlines a tool idea: deterministically check whether a PR can be automerged, under very strict constraints—only reorganizing code, not changing the module graph, and not worsening test coverage.
The dream is refactorings in source code that don't change the bundled output. But he flags hard requirements: no import.meta.glob or reading source file positions at runtime, no global state—and admits "probably not possible the more I think about it." It would only cover refactors, not new features or most bugfixes.
Related event: Debate over deterministic auto-merge tool for refactor PRs(3 posts)→
More from coding & agent
- Three-guard architecture backs the claim: LLM-written code cross-checked by rival LLMs — arpit_bhayani · 2026-10-25
- Indie dev launches staygreen.io, a lifetime-free monitoring tool after $330/mo pricing gripes — PawelHuryn · 2026-10-25
- Free open-source AI engineering course builds every algorithm from raw math before frameworks — ghumare64 · 2026-10-25
- "No human will ever write code better than LLMs," declares engineer Arpit Bhayani — arpit_bhayani · 2026-10-25
- Dev launches staygreen.io, a lifetime-free uptime monitor, after balking at $330/mo white-label pricing — PawelHuryn · 2026-10-25
- Nous Research's Teknium Shows How to Plug Local vLLM Endpoints into Hermes Cloud — Teknium · 2026-10-25