ANTHROPIC ENGINEER JUST SHOWS EXACTLY WHAT GRAPH ENGINEERING LOOKS... LIKE WHEN A TASK RUNS THROUGH IT most people arguing about graphs online have never actually watched one execute Task → Researcher → Planner → Writer + Code Agent → Reviewer → Deploy six nodes, one shared state, graph completes itself while you watch loop mode gets disabled the second the task splits into real specialties, one agent stops trying to do everything at once reviewer catches a failure, kicks it straight back to the exact node that broke - not a full restart, no lost context the graph is not a fancier loop - it is the org chart your agents were missing bookmark this and watch it run, then read the article below to see why the timeline just found what production systems already doshow more

THIS 38,000-STAR GITHUB REPO TURNS ONE AI AGENT INTO... A REAL TEAM THAT CAN BRANCH, VERIFY ITS WORK AND WAIT FOR YOUR APPROVAL most people still run agents as one long chain where every step waits, one failure kills the run and the full workflow starts again Task → Planner → 5 Researchers in Parallel → Skeptic → Writer → Human Gate LangGraph gives every node one job while a shared state carries the findings, decisions and context through the entire system the skeptic can reject an unsupported finding and route the work back before it contaminates the final report, while independent branches keep moving if the run crashes, durable execution resumes from the saved state instead of rebuilding everything, then human-in-the-loop pauses the graph before anything expensive gets sent or published bookmark this repo and watch one prompt turn into an actual org chart for AI agentsshow more

FIVE LAYERS OF AGENT ENGINEERING, EACH ONE WRAPS THE... ONE BELOW IT. IF YOU SKIP LAYER 2, YOUR LAYER 5 WILL LOOK BROKEN WHEN IT IS ACTUALLY JUST STANDING ON NOTHING. for weeks i debated harness vs loop vs graph like they were competing choices. then a stack diagram made the shape obvious. they are not choices. they are floors. 01 | prompt engineering. the message. unit of work: one input. inputs are role, instructions, examples, format. output is a single raw response. 02 | context engineering. the memory. unit of work: what stays in the window. a curator selects, compresses, and drops from query, docs, memory, prior turns, and tool outputs before the prompt runs. 03 | harness engineering. the machine. unit of work: the machine itself. gather (context + prompt) → LLM → tools or sub-agents → verifier → final response. the article calls this the operating environment. 04 | loop engineering. the system. unit of work: the run. goal + success criteria + max iterations + budget + completion check wrap around one harness pass. failed pass appends results to context and retries. 05 | graph engineering. the topology. unit of work: the graph run. goal + nodes + edges + state schema. graph routes to agent nodes, tool nodes, or human approval. a reviewer node with a different model and fresh context checks the final answer. the wrapping is the whole point. layer 5 assumes layer 4 works. layer 4 assumes layer 3 works. skip layer 2 and layer 3's verifier keeps failing without a clear reason. this is why swapping the model is a one-day project and swapping the stack is a quarter. the model is the commodity. the five layers around it are the engineering. full three-layer breakdown of the top of the stack (harness, loop, graph) in the post below.show more

KIMI K3 + OBSIDIAN + LOOP ENGINEERING = A... VAULT THAT RUNS ITSELF the core idea: the vault is the loop's state, not the chat window everything Kimi K3 knows lives in a .md file the loop: > capture - a thought lands in 00-inbox > context - K3 pulls links, tags, and neighbouring notes > draft - edits happen inside a git worktree, never the live vault > review - a critic agent checks the diff before anything ships > commit - appended to the vault, nothing gets rewritten the key insight: frontmatter fields like supports, contradicts, and supersedes are graph edges, not metadata - the note format is the write API start with a plain loop, it runs about 2-4x the cost of one direct call > only move to a full graph once state has to outlive the session, several agents need to coordinate, or you have to explain what changed - that jump can run 10-50x one review assistant climbed from 55% to 72% to 84% just by moving through these shapes in ordershow more

AGENT ARCHITECTURE ROUTES WORK. IT DOES NOT REMEMBER WORK.... THAT GAP IS WHY YOUR LOOP KEEPS FIXING THE SAME BUG TWICE. these are two different engineering problems. every agent that silently drifts is missing one of them. architecture answers what runs. harness → loop → graph. it defines the tools, the retries, the branching routes, the approval gates. context ops answer what the run knows. write → read → compress → isolate. it defines what gets saved between attempts, pulled in on read, summarized on overflow, and split across sub-agents. for two months i believed a solid harness plus a verifier loop was enough. my coding agent kept re-discovering the same test failure across retries. the loop was working. it just had nowhere to write what it had already learned. here is the decision rule: if your agent forgets across restarts, add write and read. if it stalls on long tasks, add compress. if two sub-agents step on each other, add isolate. architecture without context ops is a well-routed system with amnesia.show more

A TEAM JUST DEPLOYED 15 AUTONOMOUS LOOP AGENTS FROM... A SINGLE PROMPT USING APPLIED GRAPH ENGINEERING Most developers still manually hardcode multi agent systems, writing separate logic for every individual task. Graph engineering changes this by using a central topological map to spin up all 15 nodes simultaneously. A single 200 word input generates the architecture, routing 120 unique pathways between agents instantly. Instead of failing under conflicting instructions, these loop agents self correct via continuous state sharing. Managing a 15 node mesh requires high token throughput, making this dependent on strict low-] latency API tiers. See exactly how this automated multi agent graph architecture actually operates in real time ↓show more

a contractor in Shenzhen priced a ¥12,470,900 hospital contract,... about $1.7m, in one afternoon and beat firms carrying forty people he explained how he did it: the bid consultancy he used to pay took three days and ¥46,000 for the same envelope. he did this one alone, off one screen, at 11.4% margin, uploaded before the 17:00 cutoff 214 pages of tender documents read, 68 binding clauses pulled out, 9,485 building parts loaded, 14 places found where a duct and a beam sit in the same cubic metre, deepest one 38mm, all of them fixed, 3,318 lines of quantities priced and the package encrypted and uploaded before the 17:00 cutoff this is Graph Engineering: the job gets cut into small nodes, one narrow task each, wired so that one node's output is the next node's input, and any node is allowed to stop the whole run. it turns a model that answers you into a machine that finishes the job: - give every node one job and one output. a node doing two things fails at both and you cannot tell which one broke - put the cheapest rejection first. his qualification node reads clause 7.4, foreign-owned firms barred, and ends the run four seconds in, before anything expensive touches the model - what moves between nodes is a file. the model travels as a model, the quantities as a table, the price as a number - build exactly one loop: the checker finds 14 collisions, the fixer drops the duct 550mm, the checker runs again, and nothing moves on until the count is zero - cap that loop, or a graph will grind on three impossible clashes until the deadline passes - keep one node whose only job is to say no, and give it authority over everything above it - log each node's output on its own, because when the price comes out wrong you need to know which node believed the wrong thing - run the expensive nodes last, always the catch is that a graph is an extremely confident machine: point it at an outdated rate book and it prices an entire hospital off it without a single node noticing, because no node is asked to doubt the input, only to process it so the nodes that earn their keep are the ones that reject, and almost nobody builds those first bookmark this, the full build with all nine nodes and what each one hands to the next is written out in the article ↓show more

this is worth more than most five figure courses... 16 claude agents audit an entire repo at once, a second fleet re-checks every finding on fresh context, and the whole thing runs off one diagram instead of a prompt i ran it against my own code and got back 11 endpoints where i never checked who was logged in, 3 of which the verifier threw out before they ever reached me this is Graph Engineering, the layer above prompting, and it runs on the agent you already pay for: - write your plan out, then ask one question at every "and then": does the next step actually read what the previous one produced - the seams that fail that question were never dependencies, so those jobs run at the same time - the arrows that survive are your real edges, and the longest chain of them is your floor that no number of agents shortens - want it faster, cut a false edge instead of adding a worker - fan the independent work out, one agent per item, no shared state between them - send every finding to a separate agent on fresh context, because a model recognises its own writing 73.5% of the time and grades it kinder once it does - make that verifier check a real signal like a passing test, never the worker's own word that it finished - shard the fleet across worktrees so parallel workers stop overwriting each other, one rule frozen into every worker: never git stash, never git reset - merge only what came back verified, into one report instead of twenty open chats the catch is the ceiling. at 95% independent work 16 agents return 9.14x rather than the 16 you would guess, and even 256 only reach 18.6x, because the merge and the verify stay serial however wide you fan coordination itself is free plain code and every agent underneath it is billed, so start at twenty files and widen once it works bookmark this, the whole method with all six ready-to-run graphs is written out in the article ↓show more

a developer showed me the cleanest multi-agent architecture i've... seen. one mission. nobody steps on anyone else. the mission: ship a safe feature. the graph decides what happens next. router reads the mission and asks one question: where should this go? three workers split in parallel. each in their own private work area. researcher finds the evidence. architect designs it. builder creates it. none of them share context. the three workers run independently. everything lands in shared state. facts, decisions, artifacts. one place where the whole picture exists without anyone copying transcripts. then the crew's work converges. integrator combines what was built. reviewer tests quality and safety. human checkpoint approves anything high-impact. then ship. verified output. private context. shared state. that separation is the whole trick. a prompter asks a question. an architect draws a graph. full breakdown with code in the article below.show more

someone just open-sourced the entire "loop engineering" playbook. for... free. 8.6k stars on github for loop engineering not prompts. loops. everything you need to build autonomous AI systems: → scheduling → memory & state → planning → sub-agents → verification → worktrees → MCP → stop conditions → safety guardrails → observability → cost tracking notice something? none of these are prompts. they're the systems wrapped around the model. that's where AI engineering is heading. we're moving from: Prompt Engineering → Context Engineering → Harness Engineering → Loop Engineering soon you'll hear people talking about Graph Engineering too. because once one loop works... the next challenge is coordinating hundreds of them. that's exactly what I explain in: save this. I think "loop engineering" is about to become one of the most important concepts in AI.show more

whoever leaked this has bigger balls than sense Google... Research and MIT ran the same agent jobs 260 different ways for Nature last month: they held the prompts, the tools and the compute budget identical and moved nothing but the wiring between the agents, and the same work swung from 70% worse than a single agent to 80.8% better, averaging out at 0.0% i ran my own single agent against the task list first and it cleared 6 of 10 alone, already past the line where a crew starts subtracting this is Graph Engineering, the layer that decides whether a crew is worth 80% more or 70% less, and it installs into the agent you already pay for: - score your solo agent on the real task first: above roughly 45% success that study predicts zero to negative returns from any crew you put around it - under that line, put one supervisor over the fan out: crews with no correction step amplified their own errors to 17.2x the single agent rate, supervised aggregation held it to 4.4x - give every worker one output and let none of them read a peer's draft, so a wrong step reaches the supervisor instead of four other agents - run the comparison again after every model upgrade, because a better model raises your baseline and a higher baseline is what makes a crew stop paying - keep the single agent alive as the control, the only number that says the wiring is earning its calls turns out the shape does not travel: the biggest win came off a finance task under one supervisor and the worst collapse off a planning task with independent agents my position, and it is the arguable one: a crew is a bet on your own diagram, and the model you pick moves that bet less than one arrow does bookmark this, the three moves that draw those arrows before you pay for one extra call are in the post below ↓show more

WTF, GROK BOT JUST MADE AI AGENTS AVAILABLE TO... LITERALLY ANYONE – CREATING CONTENT HAS NEVER BEEN THIS EASY, EVEN IF YOU'VE NEVER MADE ANYTHING BEFORE Content was never a talent problem. It's a headcount problem. One person doing research, design, copy, analytics, timing and publishing – that's six jobs. The switching between them is what kills consistency, not a lack of ideas. Here's what one of these setups actually looks like. A Chief of Staff sits in the middle and routes every task. Nothing lands on the human. → Researcher tracks what's actually moving and pulls real sources instead of guesswork → Writer turns that research into finished copy, ready to review → Visualiser gets fed a few reference visuals once, then ships everything in that style → Analyst reads the numbers and tells the rest of the team what worked → Scheduler owns timing and holds the queue → Publisher ships it The part that makes it work: every agent on Grok Bot gets its own persistent computer, browser and file system – and they all share memory. So the research is already sitting inside the draft before the draft starts. No copy-pasting between tools. No approving every step. No human in the middle. You can even teach an agent a repetitive task by recording yourself doing it once. Start recording, do the thing, stop. It learns the pattern. And that's the real shift. Nobody needs AI to tell them what to post. They need it to delete the 40 steps between the idea and the post. Everyone has a backlog of things they've meant to make for months. This is what starts clearing it. Full breakdown of the setup in the article below ↓show more

I STOPPED REVIEWING MY OWN AGENT, SOMETHING ELSE DOES... IT NOW I used to read every diff it produced and approve most of them, because an agent grading itself always says the work is good. -> Now a second model with different instructions tries to break the work first, and I only read what survived. Here is what is actually in the folder that took over the night shift: • the brief > CONTRACT.md -- what it may touch, and what it may never touch. > VISION.md -- the destination, so turn 47 still knows why it started. • the gate > judge/ -- a different model, never the one that wrote the code. > break-it.md -- it opens the page, clicks, screenshots, reports back. > -- no opinion, just zero or non-zero. > shift.yml -- 03:30 every night, laptop closed. • the memory > receipts/ -- one folder per night, dated and graded. > STATE.md -- where it stopped and what it escalated. > lessons.log -- the flaky test, written down once instead of rediscovered weekly. • the brakes > caps.json -- turn limit, retry limit, spend limit. > -- written on day one, used never. The generator decides what your loop can produce -> The judge decides what it refuses to produce. One of those is the part everyone builds -> The other is why most loops quietly fail. Bookmark it & Read Full breakdown below ↓show more

an agent is four parts in a loop. you... own one. the other three break it. that's why the demo works and prod doesn't. you can't debug what you can't see. 1) the prompt → what you tell the model each turn. you own this one. good. 2) the context window → what it sees right now. the framework fills it with junk, and you never notice until it rots. 3) the tools → what it can do. you own the list, not when or why it fires them. 4) the control flow → what happens next, when to stop. the framework owns this. it's what breaks at 80%. own all four and your agent stops being a magic trick that works on stage and dies on call. this isn't my idea. it's the 12-factor agents guide (24k stars) github: the whole thing every serious builder ends up rewriting their stack around. full breakdown in the article below.show more

The Matrix launch video lands on one line; in... Matrix, anyone can become a CEO. That’s the real claim. Not one assistant doing one task. A company that keeps running after the first prompt, routing intent through a CEO Office, into OKRs, down to departments that do the work and send back proof to review. Connect Codex, point your leftover credits at it, and the first agent company is live.show more

AMAZON SENIOR DEVELOPER BUILT A CONTEXT PIPELINE THAT DECIDES... WHAT THE MODEL EVEN GETS TO SEE Most teams still dump the entire codebase into every prompt and hope it sorts itself out. He ranked every file by relevance to the task instead of how recently it was touched. A router decides how much context each task earns, a typo fix pulls three files, a full rewrite pulls the whole module. Whatever survives gets compressed to the exact lines that actually matter, so nothing bloats the window with dead weight. Token cost per finished task dropped the moment the model stopped reading dead weight just to fix one function. See how the four stages work together below👇show more

SOMEONE MAPPED CHAOS INTO A NAVIGABLE SPACE AND YOUR... HERMES AGENT NEEDS THE SAME THING thousands of chaotic data points, each given a position, navigation becomes instant because the structure does the work your vault is the same chaos, hermes lands in it and opens files at random because nothing tells it where to start one index file per major folder with a clear starting point changes everything 2 minutes per task drops to 10 seconds, same agent, same model full breakdown in the article below ↓show more

somebody explain this because i refuse to accept it... someone ran 48 scored trials and one agent beat a whole fleet of them on all 6 task families, at 0.93 cents a run against 1.9, while openai's best fleet shape was paying $0.008 for every single point of accuracy it bought i read it expecting a hit piece and found the opposite: the fleets that partitioned the dependency graph properly lifted pass rate 14% and cut wall-clock 2.10x on the same tasks, and one of them beat claude code with agent teams the thing that decides it has a name, Graph Engineering, and it is a property of the diagram rather than the model: - partition on the real dependency graph pulled from static analysis, never by folder or by file, because the gains land hardest on the most dependency-dense projects - isolate the structural hub files first, since those are the nodes every partition would otherwise have to share - measure the critical path and treat it as the floor, because a chain that genuinely feeds itself cannot be replaced by more workers and wrapping it in a scheduler does not shorten it - match the topology to the coupling instead of defaulting to parallel: on coupled work a static parallel shape drops below a single agent, so the mismatch is worse than no orchestration - remember each worker serialises its own subtasks, which adds edges inside every agent that were never in your plan - budget the fan-out before you fire it, because three agents already burn roughly three times the tokens and the multiplier compounds across sessions - check worker count against your rate limit, since fifteen workers at ten requests a second walk straight through a hundred-per-second ceiling and cascade - put a script gate in front of the planner: it costs 0.15 seconds and zero tokens, and it lets the expensive model skip 43 to 63% of the steps for at most 1.4 points of accuracy the catch is the coordination tax, and it scales with how clever the shape looks: 58% extra reasoning turns for independent workers, 263% decentralised, 285% centralised, and 515% for the hybrid setup everyone reaches for first the same paper found that hybrid then collapses hardest on tool-heavy work at a 0.452 success rate, while the plainer decentralised shape beat centralised outright despite carrying more overhead, because parallel efficiency is what survives bookmark this, the whole build sits in the article ↓show more

Claude Code can now go find the right skill... itself, instead of you searching for one. it's called find-skills. a small package that plugs into Claude Code, and instead of you hunting for rest, you just describe the task and it searches the whole open skills ecosystem, finds the ones that fit, and installs them for you. > tell it what you're trying to do, in plain english > it scans the skills registry and maps your task to real skills > it pulls the right ones in and sets them up half the time you don't even know a skill exists for what you're doing. now you don't have to.show more

A RUSSIAN MATHEMATICIAN BUILT A SYSTEM WHERE MEMORY AND... EVAL WORK AS ONE PIPELINE NOT TWO SEPARATE TOOLS Most setups run memory and evaluation as separate systems that never actually talk to each other. He wired them into one loop instead, memory stores every past output, eval scores each one before it gets kept. Anything that scores low never enters memory at all, so nothing weak gets carried into future decisions. High scorers get tagged with the exact eval criteria they passed, not just a raw pass or fail. The next task pulls only memories that passed the same bar it's about to be judged on. See how the two systems feed each other below👇show more

sorry, they just did WHAT someone gave a machine... one disease name, the leading cause of blindness in the developed world with 1.5 million americans already in its path, and it came back pointing at a drug that has sat in pharmacies for years under a different label: 551 papers read in 30 minutes against the 294 hours a human would have needed, and the loop that did it is public on GitHub most agent setups answer one question at a time, so the ceiling on the work is the quality of the question you happened to think of this one was handed a single question and wrote the second one itself. turns out that follow-up is where the real find was: a target called ABCA1, upregulated threefold, in an experiment no human ordered i read the whole paper looking for the trick, and the trick is structural. that is the second question, and it is the gap between an assistant and a factory: - hand the loop a field rather than a task: it was given a disease, and choosing the mechanism was part of its job - make it rank before it spends: 151 papers in, ten candidate mechanisms out, scored against each other before anything touched a bench - split reading from judging, so the agent that forms the theory is a different agent from the one grading it - close every cycle on physical reality: the verdict was an experiment, and another model's opinion was never allowed to stand in for one - feed each result back as the next question rather than a log line, which is the step almost nobody builds - search what already passed inspection first: the winner was an approved compound with a safety file already on record - write down what the round learned before opening the next one, so round two starts where round one stopped my read, and i think it is the uncomfortable one: reading was the entire bottleneck in that field, and everybody spent the decade optimising the writing. people ran every physical experiment here, the analysis agent needs a domain expert writing its prompts, and the authors decline to call this the leap it resembles. the thinking got replaced, and the hands did not so the question i cannot answer for my own setup: which step of your loop still stops dead until you sit down and type something bookmark this one. the four parts that turn one model into a line that runs like this, the queue, the rooms, the write permissions and the gate, are built file by file in the piece below ↓show more