Video wird geladen...

Video konnte nicht geladen werden

Zur Startseite

the loop is not the whole agent it is only one layer of the system LOOP vs GRAPH vs HARNESS ENGINEERING LOOP ENGINEERING controls iteration turns retries budgets stop conditions success checks stalled progress use durable execution when the run must survive crashes → GRAPH ENGINEERING controls structure nodes...

0xwhrrari's profile picture

rari

9,833 subscribers

20,934 Aufrufe • vor 1 Monat •via X (Twitter)

LIVE

Anya Rossi• Live Now

Private livecam show

0 Kommentare

Keine Kommentare verfügbar

Kommentare vom Original-Post werden hier angezeigt

Ähnliche Videos

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.
0:20

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.

kocer

31,162 Aufrufe • vor 25 Tagen

HARNESS vs LOOP vs GRAPH ➜ STOP MIXING THEM UP Most people treat these three as the same thing. They’re not 1\ Harness = the machinery around the model (tools, state, permissions, memory, sandboxes, observability) 2\ Loop = the repeated work + evidence + feedback cycle with clear stop rules 3\ Graph = the explicit topology (nodes, branches, joins, controlled cycles) Clean mental model environment → feedback → flow > A raw model can’t maintain state, run tests, or restart failed jobs. Those capabilities come from the harness > Loops turn one-shot calls into managed processes that only stop when evidence proves success > Graphs decide which component is allowed to run next Most production failures that get blamed on the model are actually failures of harness, loop, or graph design Design the three layers together. Diagnose by layer when something breaks Guide in the article below
0:21

HARNESS vs LOOP vs GRAPH ➜ STOP MIXING THEM UP Most people treat these three as the same thing. They’re not 1\ Harness = the machinery around the model (tools, state, permissions, memory, sandboxes, observability) 2\ Loop = the repeated work + evidence + feedback cycle with clear stop rules 3\ Graph = the explicit topology (nodes, branches, joins, controlled cycles) Clean mental model environment → feedback → flow > A raw model can’t maintain state, run tests, or restart failed jobs. Those capabilities come from the harness > Loops turn one-shot calls into managed processes that only stop when evidence proves success > Graphs decide which component is allowed to run next Most production failures that get blamed on the model are actually failures of harness, loop, or graph design Design the three layers together. Diagnose by layer when something breaks Guide in the article below

beamnxw ./

19,531 Aufrufe • vor 1 Monat

MOST PEOPLE BUILD AI AGENTS BACKWARDS. They start with prompts, then add tools, memory, subagents, dashboards, and a graph nobody can debug. Then they wonder why the agent is expensive, confused, and unreliable. The better order is simple: harness first loop second graph only when needed A harness gives the model a workspace, tools, permissions, logs, and a definition of done. A loop lets it try, fail, read feedback, repair, and stop. A graph only makes sense when the workflow branches: approvals, parallel work, durable state, different routes, restart recovery. A graph is not a smarter prompt. A loop is not a production system. A harness is not just a system prompt. Most agents do not fail because the model is weak. They fail because nobody defined what success means.
2:07

MOST PEOPLE BUILD AI AGENTS BACKWARDS. They start with prompts, then add tools, memory, subagents, dashboards, and a graph nobody can debug. Then they wonder why the agent is expensive, confused, and unreliable. The better order is simple: harness first loop second graph only when needed A harness gives the model a workspace, tools, permissions, logs, and a definition of done. A loop lets it try, fail, read feedback, repair, and stop. A graph only makes sense when the workflow branches: approvals, parallel work, durable state, different routes, restart recovery. A graph is not a smarter prompt. A loop is not a production system. A harness is not just a system prompt. Most agents do not fail because the model is weak. They fail because nobody defined what success means.

Fluixo

11,315 Aufrufe • vor 1 Monat

Google's team published a 9-page PDF on Harness Engineering. one formula replaced prompt engineering: Agent = Model + Harness the twist: same Claude Sonnet, same benchmark. change only the harness the playbook, six steps: step 1 -> add guides AGENTS.md, rule files, constraint docs. every line is a past agent failure turned into a permanent fix step 2 -> add sensors linters, tests, validation scripts the agent runs on its own output before a human sees it step 3 -> build the agentic loop plan, execute, verify, fix. bounded retries, budget caps, escalation when stuck step 4 -> externalize memory the model forgets every session. the harness holds state, decisions and artifacts across all of them step 5 -> enforce permissions which tools, how many writes, what needs approval. safety lives in the harness, never in the model step 6 -> wire observability track every tool call, cost and retry. trip wires fire when behavior drifts the result: your agent turns from a demo into infrastructure every failure makes the system permanently better, not just the next conversation that's also the line between an agent you show people and one a client pays you to leave running one harness gets you a reliable loop. connect several and it becomes graph engineering, where one agent's failure turns into another agent's sensor the PDF stops at the harness. the graph is the next layer that breakdown, running on Kimi, is below ↓
0:24

Google's team published a 9-page PDF on Harness Engineering. one formula replaced prompt engineering: Agent = Model + Harness the twist: same Claude Sonnet, same benchmark. change only the harness the playbook, six steps: step 1 -> add guides AGENTS.md, rule files, constraint docs. every line is a past agent failure turned into a permanent fix step 2 -> add sensors linters, tests, validation scripts the agent runs on its own output before a human sees it step 3 -> build the agentic loop plan, execute, verify, fix. bounded retries, budget caps, escalation when stuck step 4 -> externalize memory the model forgets every session. the harness holds state, decisions and artifacts across all of them step 5 -> enforce permissions which tools, how many writes, what needs approval. safety lives in the harness, never in the model step 6 -> wire observability track every tool call, cost and retry. trip wires fire when behavior drifts the result: your agent turns from a demo into infrastructure every failure makes the system permanently better, not just the next conversation that's also the line between an agent you show people and one a client pays you to leave running one harness gets you a reliable loop. connect several and it becomes graph engineering, where one agent's failure turns into another agent's sensor the PDF stops at the harness. the graph is the next layer that breakdown, running on Kimi, is below ↓

Annatar.md

78,629 Aufrufe • vor 16 Tagen

This guy explained agent harness, memory, and loop engineering in one video - clearer than most paid courses a raw LLM with no harness is a wild horse. all power, no direction > trace the run -> score it with an LLM -> diagnose the bottleneck -> patch it -> ship it that loop is what lets an agent get sharper on its own, run after run memory + harness + loop engineering + evals - that's the whole stack in one picture watch it, then grab the diagram below
17:43

This guy explained agent harness, memory, and loop engineering in one video - clearer than most paid courses a raw LLM with no harness is a wild horse. all power, no direction > trace the run -> score it with an LLM -> diagnose the bottleneck -> patch it -> ship it that loop is what lets an agent get sharper on its own, run after run memory + harness + loop engineering + evals - that's the whole stack in one picture watch it, then grab the diagram below

Mr. Buzzoni

45,093 Aufrufe • vor 1 Monat

GRAPH ENGINEERING: STOP ADDING AGENTS AND START DESIGNING SYSTEMS More agents won’t save you if every step depends on the previous one Graph Engineering forces the better question “Where does the work naturally split? When it does, parallel researchers + independent verifiers + a final merge consistently outperform one overloaded model Verification is more valuable than generation Self-review is usually weaker than dedicated challengers Prompt engineering → Loop engineering → Graph Engineering Are you still designing prompts, or are you designing systems? Bookmark this, then read the article below
0:24

GRAPH ENGINEERING: STOP ADDING AGENTS AND START DESIGNING SYSTEMS More agents won’t save you if every step depends on the previous one Graph Engineering forces the better question “Where does the work naturally split? When it does, parallel researchers + independent verifiers + a final merge consistently outperform one overloaded model Verification is more valuable than generation Self-review is usually weaker than dedicated challengers Prompt engineering → Loop engineering → Graph Engineering Are you still designing prompts, or are you designing systems? Bookmark this, then read the article below

beamnxw ./

13,723 Aufrufe • vor 1 Monat

Google just released free 2-hour course on full agent engineering: 1 prompt → agent teams → loops → graphs from 0% to 100%: 10% → 38:46 - build your first agent 30% → 54:46 - connect MCP tools 55% → 1:12:43 - Loop engineering: 4 ways to run agents 70% → 1:20:57 - Graph engineering 100% → 2:22:31 - the full system that works while you sleep most people build one agent and stop there - this is the full path to a system that runs without you from scratch watch it today - then read the full graph engineering playbook below ↓
2:10:34

Google just released free 2-hour course on full agent engineering: 1 prompt → agent teams → loops → graphs from 0% to 100%: 10% → 38:46 - build your first agent 30% → 54:46 - connect MCP tools 55% → 1:12:43 - Loop engineering: 4 ways to run agents 70% → 1:20:57 - Graph engineering 100% → 2:22:31 - the full system that works while you sleep most people build one agent and stop there - this is the full path to a system that runs without you from scratch watch it today - then read the full graph engineering playbook below ↓

codila

536,454 Aufrufe • vor 1 Monat

Google just released free 2-hour course on full Graph engineering: 1 prompt → 100 agents → loops → graphs from 0% to 100%: 10% → 17:44 - build your first agent 30% → 39:30 - Loop engineering: iterate, check, break 60% → 1:12:38 - Graph engineering 75% → 1:34:26 - agents that throttle themselves 100% → 1:55:05 - full graph for multi-agentic systems everyone builds one agent and calls it done - this is the full system where agents wire themselves into a graph watch the course, build the graph - then read the full architecture below ↓
2:03:00

Google just released free 2-hour course on full Graph engineering: 1 prompt → 100 agents → loops → graphs from 0% to 100%: 10% → 17:44 - build your first agent 30% → 39:30 - Loop engineering: iterate, check, break 60% → 1:12:38 - Graph engineering 75% → 1:34:26 - agents that throttle themselves 100% → 1:55:05 - full graph for multi-agentic systems everyone builds one agent and calls it done - this is the full system where agents wire themselves into a graph watch the course, build the graph - then read the full architecture below ↓

codila

467,074 Aufrufe • vor 1 Monat

Google just released 1-hour workshop on "Graph Engineering" for agentic systems from 0% to 100%: "loop agent is getting deprecated soon, so I’m going to focus on graph workflows" 0% → 8:01 - build your first agent from scratch 30% → 24:14 - Prompt engineering 55% → 44:48 - Graphs: kill the tree, draw the graph 80% → 1:00:47 - the router that never asks the model 100% → 1:19:49 - Parallel engineering: fan out without losing control most agent tutorials tell you to add another agent - this one deletes three of them and puts plain functions in their place watch it, open the lab, build the graph - then read the full architecture below ↓
1:20:54

Google just released 1-hour workshop on "Graph Engineering" for agentic systems from 0% to 100%: "loop agent is getting deprecated soon, so I’m going to focus on graph workflows" 0% → 8:01 - build your first agent from scratch 30% → 24:14 - Prompt engineering 55% → 44:48 - Graphs: kill the tree, draw the graph 80% → 1:00:47 - the router that never asks the model 100% → 1:19:49 - Parallel engineering: fan out without losing control most agent tutorials tell you to add another agent - this one deletes three of them and puts plain functions in their place watch it, open the lab, build the graph - then read the full architecture below ↓

codila

22,815 Aufrufe • vor 1 Monat

Anthropic engineer: "At Anthropic, all of our engineers are running hundreds of agents The way you do it is graph engineering" In just 36 minutes, he shows how Anthropic runs hundreds of agents at once and what actually makes it possible Prompts → Agents → Loops → Graphs The part most people skip is the return path, where every accepted result becomes a constraint for the next run Same model, same tokens, completely different system Prompting is the old workflow Graph engineering is the next one Watch it today Then save the full graph engineering guide below before everyone starts catching up ↓
35:57

Anthropic engineer: "At Anthropic, all of our engineers are running hundreds of agents The way you do it is graph engineering" In just 36 minutes, he shows how Anthropic runs hundreds of agents at once and what actually makes it possible Prompts → Agents → Loops → Graphs The part most people skip is the return path, where every accepted result becomes a constraint for the next run Same model, same tokens, completely different system Prompting is the old workflow Graph engineering is the next one Watch it today Then save the full graph engineering guide below before everyone starts catching up ↓

Lunar

32,634 Aufrufe • vor 15 Tagen

Google just released free 2-hour course on full Graph & Loop engineering: 1 prompt → 100 agents → loops → graphs from 0% to 100%: 0% → 0:35 - Graph engineering from scratch 30% → 31:17 - build your first agents graph 45% → 43:40 - run hundreds agents in parallel 75% → 1:04:58 - Loop engineering: route, check, repeat 100% → 1:30:09 - self-improving graphs that work while you sleep most people keep stuffing instructions into one agent - the real upgrade is a graph that routes, checks, and rebuilds the workflow at runtime learn graph from Google, ship your first - then unlock the complete system design below ↓
1:25:29

Google just released free 2-hour course on full Graph & Loop engineering: 1 prompt → 100 agents → loops → graphs from 0% to 100%: 0% → 0:35 - Graph engineering from scratch 30% → 31:17 - build your first agents graph 45% → 43:40 - run hundreds agents in parallel 75% → 1:04:58 - Loop engineering: route, check, repeat 100% → 1:30:09 - self-improving graphs that work while you sleep most people keep stuffing instructions into one agent - the real upgrade is a graph that routes, checks, and rebuilds the workflow at runtime learn graph from Google, ship your first - then unlock the complete system design below ↓

codila

376,061 Aufrufe • vor 14 Tagen

one agent → a loop → a graph → a system that throttles itself Google just put the whole ladder in one free course. most people never leave the first rung. 2 hours 4 minutes, taught by two Google Cloud engineers. no signup, no paywall. 17:55 - build your first agent 39:55 - loop engineering: iterate, check, break 1:13:25 - graph engineering 1:35:27 - agents that throttle themselves 1:56:19 - the full graph for multi-agent systems the fourth one is the step nobody talks about. an agent that cannot throttle itself is not autonomous, it is just unattended. everyone builds one agent and calls it done. this is the version where the agents wire themselves into a graph and decide their own rate. and the thing that decides when one of them is allowed to stop is not in the course. that part you build yourself. bookmark and watch it today, then read the eval setup below
2:04:19

one agent → a loop → a graph → a system that throttles itself Google just put the whole ladder in one free course. most people never leave the first rung. 2 hours 4 minutes, taught by two Google Cloud engineers. no signup, no paywall. 17:55 - build your first agent 39:55 - loop engineering: iterate, check, break 1:13:25 - graph engineering 1:35:27 - agents that throttle themselves 1:56:19 - the full graph for multi-agent systems the fourth one is the step nobody talks about. an agent that cannot throttle itself is not autonomous, it is just unattended. everyone builds one agent and calls it done. this is the version where the agents wire themselves into a graph and decide their own rate. and the thing that decides when one of them is allowed to stop is not in the course. that part you build yourself. bookmark and watch it today, then read the eval setup below

Hanako

53,692 Aufrufe • vor 1 Monat

Google just released free 2-hour course on full Graph engineering: 1 prompt → agent teams → loops → graphs from 0% to 100%: 10% → 10:16 - build your first agent 40% → 41:05 - Prompt engineering 50% → 54:45 - Graph engineering 75% → 1:20:10 - Loop engineering (with graphs) 100% → 1:43:33 - the graph that builds itself most people ship one agent and stop - this is everything after watch it today - then read how to run 1000 agents from one prompt below ↓
1:56:52

Google just released free 2-hour course on full Graph engineering: 1 prompt → agent teams → loops → graphs from 0% to 100%: 10% → 10:16 - build your first agent 40% → 41:05 - Prompt engineering 50% → 54:45 - Graph engineering 75% → 1:20:10 - Loop engineering (with graphs) 100% → 1:43:33 - the graph that builds itself most people ship one agent and stop - this is everything after watch it today - then read how to run 1000 agents from one prompt below ↓

codila

105,730 Aufrufe • vor 1 Monat

Andrew Ng built agentic knowledge graph that runs agents loops from scratch: his agents searched thousands of tools through the graph, found the "right" one by meaning, and called it agent efficiency increased by 90% here's how: step 1 → embed every tool, search by meaning - not just keywords step 2 → but "similar" ≠ "correct" - it grabs the wrong one, skips the step before it step 3 → map tools as a graph - nodes are tools, edges are what runs before what step 4 → retrieve the path, not one tool - every tool the task needs, in order step 5 → bake the process into the graph - the sequence becomes data, not a guess most agents fail here and no one knows why - 1-hour brilliant course about it watch & bookmark - then read full course about graph engineering ↓
1:04:49

Andrew Ng built agentic knowledge graph that runs agents loops from scratch: his agents searched thousands of tools through the graph, found the "right" one by meaning, and called it agent efficiency increased by 90% here's how: step 1 → embed every tool, search by meaning - not just keywords step 2 → but "similar" ≠ "correct" - it grabs the wrong one, skips the step before it step 3 → map tools as a graph - nodes are tools, edges are what runs before what step 4 → retrieve the path, not one tool - every tool the task needs, in order step 5 → bake the process into the graph - the sequence becomes data, not a guess most agents fail here and no one knows why - 1-hour brilliant course about it watch & bookmark - then read full course about graph engineering ↓

codila

17,040 Aufrufe • vor 2 Monaten

Harness vs. Graphs, clearly explained! a harness is great, and most people think it is the whole thing: retries, timeouts, a sandbox, a log, the context it assembles before every call. all of that is real work, and all of it wraps exactly one call. run it a hundred times and you have one call, made very safely, a hundred times. Graph engineering fixes this by moving the decision up a layer: not how safely one call is made, but which calls exist to be made at all. you need both, and here is the sentence that resolves the whole confusion: the harness is everything around one call. the graph is everything between them. ↳ around one call: retry, timeout, sandbox, log, assemble the context, hand back a result ↳ between calls: split, fan out, merge, gate, send back Prompts → Context → Harness → Loops → Graphs the harness does not go away when you build a graph. it moves under each node, and now there are five of them, each wrapping a call you would never have made by hand. the trick is knowing which layer a failure belongs to. turn a piece off and run it again. if the call still works, it was the harness. if the wrong step runs at all, it was the graph. people spend weeks hardening a harness around a node that should not have existed. one thing to know before you scale it. most of what people call their agent is a harness with a chat box on it. ↳ it retries, it times out, it logs, it assembles context, it holds one call up beautifully ↳ it has never once decided that a second call should exist, and that is the entire difference that last one catches careful people. a harness that never fails is not evidence the system is right. it is evidence one call went well, which is the smallest possible claim. and the one that eats whole nights: a harness cannot save you from the wrong step running. you can retry a bad decision three times with a clean log and perfect isolation, and all you bought was three copies of it. below i have quoted my full guide on graph engineering. it covers the three topologies, the verifier patterns, and where the gate should actually open. save this and read it below ↓
0:53

Harness vs. Graphs, clearly explained! a harness is great, and most people think it is the whole thing: retries, timeouts, a sandbox, a log, the context it assembles before every call. all of that is real work, and all of it wraps exactly one call. run it a hundred times and you have one call, made very safely, a hundred times. Graph engineering fixes this by moving the decision up a layer: not how safely one call is made, but which calls exist to be made at all. you need both, and here is the sentence that resolves the whole confusion: the harness is everything around one call. the graph is everything between them. ↳ around one call: retry, timeout, sandbox, log, assemble the context, hand back a result ↳ between calls: split, fan out, merge, gate, send back Prompts → Context → Harness → Loops → Graphs the harness does not go away when you build a graph. it moves under each node, and now there are five of them, each wrapping a call you would never have made by hand. the trick is knowing which layer a failure belongs to. turn a piece off and run it again. if the call still works, it was the harness. if the wrong step runs at all, it was the graph. people spend weeks hardening a harness around a node that should not have existed. one thing to know before you scale it. most of what people call their agent is a harness with a chat box on it. ↳ it retries, it times out, it logs, it assembles context, it holds one call up beautifully ↳ it has never once decided that a second call should exist, and that is the entire difference that last one catches careful people. a harness that never fails is not evidence the system is right. it is evidence one call went well, which is the smallest possible claim. and the one that eats whole nights: a harness cannot save you from the wrong step running. you can retry a bad decision three times with a clean log and perfect isolation, and all you bought was three copies of it. below i have quoted my full guide on graph engineering. it covers the three topologies, the verifier patterns, and where the gate should actually open. save this and read it below ↓

Hanako

50,770 Aufrufe • vor 13 Tagen

Loops vs. Graphs, clearly explained! loops are great, and the ceiling is one you can watch turn: a loop is a gear. it produces, checks, corrects, and comes back around. after six turns you have one job, done very well. after six hundred turns you still have one job, done very well. the teeth are perfect. they are touching nothing. Graph engineering fixes this by moving the decision up a layer: not how well one gear turns, but what it is meshed into. you need both, and here is the sentence that resolves the whole confusion: the loop lives inside a node. the graph lives between them. ↳ inside one unit: produce, check, correct, repeat until green ↳ between units: split, fan out, merge, gate, send back Prompts → Context → Harness → Loops → Graphs the loop does not go away when you build a graph. it moves inside, and now there are three of them turning at once on three things you would never have thought to run. the trick is being selective about what becomes a node. only spend a model where judgment lives. merging, ranking, deduping and schema checks are edges, and edges are code. free, instant, and they cannot be argued out of a verdict. one thing to know before you scale it. a loop that cannot fail is not a loop, it is a repeat with a bill attached. ↳ the test suite exits 0 is a check. the diff touches only the files in the plan is a check ↳ the output looks good, the model says it is confident, no errors were raised, none of those are checks that last one catches careful people. absence of an error is not evidence of correctness, and a loop built on it will confidently repeat a mistake until the budget runs out, with a clean log the whole way. and the one that eats whole nights: when a unit fails, return that unit, not the batch. send back four slices because one failed and you have just rewritten three correct ones. do it twice in a run and the run never converges. below i have quoted my full guide on graph engineering. it covers the three topologies, the verifier patterns, and where the gate should actually open. save this and read it below ↓
0:50

Loops vs. Graphs, clearly explained! loops are great, and the ceiling is one you can watch turn: a loop is a gear. it produces, checks, corrects, and comes back around. after six turns you have one job, done very well. after six hundred turns you still have one job, done very well. the teeth are perfect. they are touching nothing. Graph engineering fixes this by moving the decision up a layer: not how well one gear turns, but what it is meshed into. you need both, and here is the sentence that resolves the whole confusion: the loop lives inside a node. the graph lives between them. ↳ inside one unit: produce, check, correct, repeat until green ↳ between units: split, fan out, merge, gate, send back Prompts → Context → Harness → Loops → Graphs the loop does not go away when you build a graph. it moves inside, and now there are three of them turning at once on three things you would never have thought to run. the trick is being selective about what becomes a node. only spend a model where judgment lives. merging, ranking, deduping and schema checks are edges, and edges are code. free, instant, and they cannot be argued out of a verdict. one thing to know before you scale it. a loop that cannot fail is not a loop, it is a repeat with a bill attached. ↳ the test suite exits 0 is a check. the diff touches only the files in the plan is a check ↳ the output looks good, the model says it is confident, no errors were raised, none of those are checks that last one catches careful people. absence of an error is not evidence of correctness, and a loop built on it will confidently repeat a mistake until the budget runs out, with a clean log the whole way. and the one that eats whole nights: when a unit fails, return that unit, not the batch. send back four slices because one failed and you have just rewritten three correct ones. do it twice in a run and the run never converges. below i have quoted my full guide on graph engineering. it covers the three topologies, the verifier patterns, and where the gate should actually open. save this and read it below ↓

Hanako

31,867 Aufrufe • vor 8 Tagen

Andrew Ng just released a free 2-hour course on complete Graph Engineering How to go from one prompt to 100 agents that loop, improve, and run without you: 09:14 - Build your first AI agent 33:11 - Run agents with loop engineering 1:02:46 - Turn agent loops into graphs 1:30:15 - Build agents that rewrite themselves 1:49:05 - Run the full graph system without you Most people are still building one agent and calling it finished Andrew Ng is already teaching everything that comes next: Prompt → Agents → Loops → Graphs → Self-Improving Systems Single agents are the old workflow Systems that improve and run without you are the next one This 2-hour course is worth more than most $500 agent engineering programs Bookmark it and watch before everyone catches up Then read how to run 1,000 agents from one prompt below ↓
1:51:29

Andrew Ng just released a free 2-hour course on complete Graph Engineering How to go from one prompt to 100 agents that loop, improve, and run without you: 09:14 - Build your first AI agent 33:11 - Run agents with loop engineering 1:02:46 - Turn agent loops into graphs 1:30:15 - Build agents that rewrite themselves 1:49:05 - Run the full graph system without you Most people are still building one agent and calling it finished Andrew Ng is already teaching everything that comes next: Prompt → Agents → Loops → Graphs → Self-Improving Systems Single agents are the old workflow Systems that improve and run without you are the next one This 2-hour course is worth more than most $500 agent engineering programs Bookmark it and watch before everyone catches up Then read how to run 1,000 agents from one prompt below ↓

reira

14,729 Aufrufe • vor 23 Tagen

OpenAI engineer: "Nobody on my team has touched code in 9 months. Agents write all the code, the way you do it is harness engineering." In 45 minutes he breaks down exactly how to build the setup so agents do the full job without you in the loop. This beats any paid course on building agents I've seen. Watch it, then read the full guide on harness engineering below.
45:40

OpenAI engineer: "Nobody on my team has touched code in 9 months. Agents write all the code, the way you do it is harness engineering." In 45 minutes he breaks down exactly how to build the setup so agents do the full job without you in the loop. This beats any paid course on building agents I've seen. Watch it, then read the full guide on harness engineering below.

Anatoli Kopadze

25,222 Aufrufe • vor 1 Monat

Andrew Ng just released a 2-hour course on full Graph Engineering. How to go from one prompt to 100 agents that loop, rewrite themselves, and run without you: 09:14 - Build your first AI agent 33:11 - Run agents with loop engineering 1:02:46 - Turn agent loops into graphs 1:30:15 - Build agents that rewrite themselves 1:49:05 - Run the full graph system without you Most people are still building one agent and calling it done. Andrew Ng is already teaching everything after: Prompt → Agents → Loops → Graphs → Self-Improving Systems Single agents are the old workflow. Systems that improve and run without you are the new one. This 2-hour watch is worth more than most $500 agent engineering courses. Bookmark and watch it before everyone catches up. Then read how to run 1,000 agents from one prompt below ↓
1:48:23

Andrew Ng just released a 2-hour course on full Graph Engineering. How to go from one prompt to 100 agents that loop, rewrite themselves, and run without you: 09:14 - Build your first AI agent 33:11 - Run agents with loop engineering 1:02:46 - Turn agent loops into graphs 1:30:15 - Build agents that rewrite themselves 1:49:05 - Run the full graph system without you Most people are still building one agent and calling it done. Andrew Ng is already teaching everything after: Prompt → Agents → Loops → Graphs → Self-Improving Systems Single agents are the old workflow. Systems that improve and run without you are the new one. This 2-hour watch is worth more than most $500 agent engineering courses. Bookmark and watch it before everyone catches up. Then read how to run 1,000 agents from one prompt below ↓

Lunar

226,395 Aufrufe • vor 1 Monat

Creator of agent loops: "Anthropic also using my agent systems formula and still the biggest mistake in agents: is skipping Graphs" his 3 rules for every agent: rule 1 → loop it, don't run once - think, act, observe, repeat - cut the context and it forgets why it started rule 2 → an agent is memory + tools + reasoning - drop one and it breaks rule 3 → stop fine-tuning the model - the real alpha is the infrastructure around it the formula behind every AI agent - explained by the one who wrote it one agent → a loop → a graph of loops → a system that never forgets watch & bookmark - then read how to wire it into a graph ↓
45:37

Creator of agent loops: "Anthropic also using my agent systems formula and still the biggest mistake in agents: is skipping Graphs" his 3 rules for every agent: rule 1 → loop it, don't run once - think, act, observe, repeat - cut the context and it forgets why it started rule 2 → an agent is memory + tools + reasoning - drop one and it breaks rule 3 → stop fine-tuning the model - the real alpha is the infrastructure around it the formula behind every AI agent - explained by the one who wrote it one agent → a loop → a graph of loops → a system that never forgets watch & bookmark - then read how to wire it into a graph ↓

codila

23,915 Aufrufe • vor 2 Monaten