tbh I got tired of guessing whether agent handoffs/retries could deadlock, so I built SharpLogic. Idea: map your routing/retry graph to k-CNF, then count deadlock / #F paths with a Rust core. There's a Python AgentGuard hook + CLI. On the built-in 20-var demo (220 states) checks are ~microsecond-level locally. Context: there's been a lot of talk around the OpenAI Oct 2026 #k-SAT / ETH preprint. This is not a claim that I implemented their asymptotic algorithm — OpenAI themselves say practical algorithms need more research. SharpLogic is an engineering toy/tool for agent graphs, inspired by that momentum. MIT. Prefer clone over curl|bash installs. Repo: https://github.com/reacherwu/SharpLogic Demo: https://sharplogic.vercel.app/?code=ETH-2026 Happy to take roast feedback — especially if you've seen better ways to formalize LangGraph-style graphs.   submitted by   /u/CartographerDue5382 [link]   [comments]