Graph Engineering: Why Agent Workflows Depend on Graphs

X postMahaxOpinion

Mahax cites Andrej Karpathy's claim that prompting is disappearing in favour of graphs, and provides a practical guide on graph engineering with Claude to optimise AI agent workflows.

Key points

  1. Mahax quotes Andrej Karpathy stating that prompting is going away and graphs are the foundational architecture that will remain.
  2. A workflow graph comprises nodes (discrete units of work or agents) and edges (actual data dependencies between tasks).
  3. Most standard workflows are linear chains where tasks wait unnecessarily for preceding steps, increasing execution time and failure rates.
  4. The 'fake-edge test' identifies whether a step genuinely uses data from the previous one; if it does not, tasks can run concurrently.
  5. The 'diamond' pattern fans out work into parallel independent nodes before converging into a final synthesis node, reducing latency to the slowest individual branch.

Why it matters

Building multi-agent or multi-step LLM systems as linear pipelines creates bottlenecks and brittle failure points. Applying graph engineering principles allows developers to run independent AI operations in parallel and structure workflows based on strict data requirements.

Analysis

Mahax argues that while creating individual agents has become accessible, orchestrating the execution graph behind them is the real differentiator. Public replies point out that the referenced lecture is Andrej Karpathy's Stanford CS25 talk from 2023 on transformers and attention as graph message-passing. Mahax translates these conceptual fundamentals into concrete workflow design rules, such as pruning fake dependencies and using fan-out patterns.

Original post

Mahax

@Mahaximus_ · 10 September 2026

Andrej Karpathy: "Prompting is going away. Delete everything, keep Graph." In 1 hour he shows how to build Graphs, and why it's the only thing that will be left standing at the end. Anyone can build an agent, almost no one builds the Graph that runs them. Watch it, then read t.co/tZpu4Byhy4 t.co/I3b2Rt1Wvv

919 likes18 replies2.4k bookmarks240.8k views

View on X
Selected replies (5)
  • @ohthatsjake @Mahaximus_ @grok how old is this talk? Is it still relevant?
  • @rewind02 @Mahaximus_ my notes are already a mess
  • @aiseomastery @Mahaximus_ delete everything keep graph fr
  • @WCguitarist @Mahaximus_ Was doing this 6 months ago
  • @grok @ohthatsjake @Mahaximus_ The talk is Andrej Karpathy’s Stanford CS25 “Introduction to Transformers” lecture from January 10, 2023 (about 3 years 8 months old). It covers transformer history, attention as message-passing on graphs, and a nanoGPT walkthrough. Those fundamentals remain highly relevant for

Summary generated by AI (Gemini 3.8 Flash, 27 September 2026). It may contain errors – the original source is authoritative.

Similar in content, found by the AI search.

  • X post:nicco

    Graph Engineering Over Prompting: Why Agent Workflows Require Graph Architectures

    A post by nicco highlights remarks by Andrej Karpathy asserting that prompting is an ephemeral interface and that graph architectures represent the true architectural layer for agent workflows. It pairs this with a practical guide by seeco on replacing sequential agent chains with explicit graphs.

    529bookmarks58.5kviews

    AI & LLMs· Resource

  • X post:Mahax

    Moving Beyond Prompts to Loops and Graphs in AI Systems

    Citing Andrew Ng, Mahax highlights the shift from single-shot prompting to agentic loops and graphs. An accompanying guide outlines the architecture of AI agents, self-evaluating feedback loops, and graph-based execution pipelines using Claude.

    11.8kbookmarks1mviews

    AI & LLMs· Resource

  • X post:rvaniaaa

    Graph Engineering for AI Agents: Replacing Linear Chains with Parallel Workflows

    rvaniaaa contends that the primary bottleneck in multi-agent workflows is geometry rather than model intelligence. Switching from sequential agent chains to graph-based architectures allows parallel execution and substantially reduces overall execution time.

    2.9kbookmarks233.5kviews

    AI & LLMs· Tutorial

  • X post:nicco

    Beyond Prompting: Agentic Workflows as Execution Graphs

    Citing a Stanford lecture by Andrew Ng, author nicco highlights why zero-shot prompt engineering is reaching its limits and being replaced by autonomous execution graphs, supported by a guide on moving away from linear agent chains.

    275bookmarks25.1kviews

    AI & LLMs· Opinion

Let's talk about your project

Locations

  • Mattersburg
    Johann Nepomuk Bergerstraße 7/2/14
    7210 Mattersburg, Austria
  • Vienna
    Ungargasse 64-66/3/404
    1030 Wien, Austria

Parts of this content were created with the assistance of AI.