Jive rebuilds the agentic loop with DAG 'graph calls', beating Codex 7x on speed

merijjeyn · reddit · 2026-09-25

The author argues the current LLM-call → tool-call agentic loop is outdated, and rebuilds it around System 1 / System 2 thinking: use full reasoning power to plan an execution graph, then execute the plan with cheap "fast thinking".

Approach: Jive replaces tool calls with "graph calls" — each graph is a DAG of bash nodes and jev nodes that can declare dependencies and reference each other's outputs. The model lays out its own execution flow while reasoning, then walks through it with jev calls, eliminating redundant LLM calls.

Benchmarks: Across 6 tasks vs Codex and Claude Code, Jive averages 2m31s / 8.7k tokens, versus 17m40s / 16.2k for Codex and 12m12s / 32.7k for Claude Code — fastest and cheapest on every task. It shines at repo investigation, bulk classification, multi-step profiling, repetitive edits, and eval workflows.

Caveats: Accuracy on a large-scale SWE benchmark is not yet verified; the author reports never seeing it underperform other harnesses in personal use, and has open-sourced the code inviting discussion and contributions.

Related event: Open-source Jive Rebuilds Agent Loop with Fast/Slow Thinking(2 posts)→

Original post →

More from coding & agent

coding & agent channel →