Video wird geladen...

Video konnte nicht geladen werden

Beim Laden dieses Videos ist ein Problem aufgetreten. Dies könnte an einem vorübergehenden Netzwerkproblem liegen oder das Video ist möglicherweise nicht verfügbar.

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

kocer

2,391 subscribers

29,945 Aufrufe • vor 5 Tagen •via X (Twitter)

Anya Rossi• Live Now

Private livecam show

0 Kommentare

Keine Kommentare verfügbar

Kommentare vom Original-Post werden hier angezeigt

Ähnliche Videos

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 edges state branches checkpoints routing handoffs build stateful agents as explicit graphs → inspect the topology without putting a model in the loop → HARNESS ENGINEERING controls exposure tools permissions memory sandboxes evals traces humans isolate generated code from the host machine → test behavior before users ever see it → preserve one trace across every model step and tool call → without loop control it keeps running without graph structure the path stays invisible without harness control it can reach anything the loop runs inside the graph the graph runs inside the harness the model is only one component debug the layer that actually owns the failure save this then read the article below

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 edges state branches checkpoints routing handoffs build stateful agents as explicit graphs → inspect the topology without putting a model in the loop → HARNESS ENGINEERING controls exposure tools permissions memory sandboxes evals traces humans isolate generated code from the host machine → test behavior before users ever see it → preserve one trace across every model step and tool call → without loop control it keeps running without graph structure the path stays invisible without harness control it can reach anything the loop runs inside the graph the graph runs inside the harness the model is only one component debug the layer that actually owns the failure save this then read the article below

rari

20,934 Aufrufe • vor 1 Monat

context engineering vs graph engineering. every few months the list gets a new word and everyone treats it as a replacement for the last one. these two are not on the same list. one decides what the model sees this turn, the other decides what exists at all. the cleanest way to tell them apart is to ask what a single unit of work looks like. > context engineering is the window the window opens empty, every single time. you assemble what goes in it. the prompt, the docs, the history, the tool results. the assembling is the work. the window only grows. it never shrinks on its own, so eventually something gets dropped. usually from the middle. usually without telling you. then the turn ends and the window is thrown away. not archived, thrown away. the next turn opens empty again and you re-explain what you already explained. good context engineering is knowing what to leave out, not what to pack in. the unit of work is one window. > graph engineering is the structure the same material arrives from the same sources. instead of packing it into a window, you pull entities out of it, resolve the duplicates into one node, and write typed edges between them. nothing here is stored as text you hope to find again. it is stored as a thing with a name and its connections to other things. when the turn ends, the graph is still there. the next turn does not start from zero. it starts by querying what already exists, and the query walks edges instead of guessing at similarity. good graph engineering is deciding what counts as the same thing twice. the unit of work is one relationship. > they are not alternatives the graph is what refills the window. context engineering decides what fits. graph engineering decides what there is to choose from. remove the graph and every session starts blind. remove the context work and the best structure in the world arrives as an unreadable dump. that also tells you which one broke. the answer drifted from what you actually said, or forgot something from this same session. that is the window. the answer is coherent but invents a connection that does not exist, or cannot join two facts it has clearly seen. that is the structure. people debug the prompt because the prompt is the easiest thing to edit. it keeps taking the blame for failures that live a layer down. save this - then read the full breakdown below

context engineering vs graph engineering. every few months the list gets a new word and everyone treats it as a replacement for the last one. these two are not on the same list. one decides what the model sees this turn, the other decides what exists at all. the cleanest way to tell them apart is to ask what a single unit of work looks like. > context engineering is the window the window opens empty, every single time. you assemble what goes in it. the prompt, the docs, the history, the tool results. the assembling is the work. the window only grows. it never shrinks on its own, so eventually something gets dropped. usually from the middle. usually without telling you. then the turn ends and the window is thrown away. not archived, thrown away. the next turn opens empty again and you re-explain what you already explained. good context engineering is knowing what to leave out, not what to pack in. the unit of work is one window. > graph engineering is the structure the same material arrives from the same sources. instead of packing it into a window, you pull entities out of it, resolve the duplicates into one node, and write typed edges between them. nothing here is stored as text you hope to find again. it is stored as a thing with a name and its connections to other things. when the turn ends, the graph is still there. the next turn does not start from zero. it starts by querying what already exists, and the query walks edges instead of guessing at similarity. good graph engineering is deciding what counts as the same thing twice. the unit of work is one relationship. > they are not alternatives the graph is what refills the window. context engineering decides what fits. graph engineering decides what there is to choose from. remove the graph and every session starts blind. remove the context work and the best structure in the world arrives as an unreadable dump. that also tells you which one broke. the answer drifted from what you actually said, or forgot something from this same session. that is the window. the answer is coherent but invents a connection that does not exist, or cannot join two facts it has clearly seen. that is the structure. people debug the prompt because the prompt is the easiest thing to edit. it keeps taking the blame for failures that live a layer down. save this - then read the full breakdown below

Hanako

19,160 Aufrufe • vor 1 Monat

Loops vs. Graphs, clearly explained! loops are great, but they have a ceiling: a loop makes one unit of work better. it cannot decide which units exist. so you end up with a very good agent running the wrong three steps, in the wrong order, one at a time. Graph engineering fixes this by moving the decision up a layer: what runs, what runs at the same time, and what never runs at all. you need both. here's how it works: a graph splits your system into two kinds of decision. ↳ inside a unit: the loop. produce, check, correct, repeat until green ↳ between units: the graph. split, fan out, merge, gate, send back Prompts → Context → Harness → Loops → Graphs you get parallel work, isolated contexts, and steps that stop running when nothing needs them. 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. a graph where every edge is an agent pays rent on its own wiring. one thing to know before you scale it. a graph has two return paths, and almost everyone builds one. ↳ the correction edge is short. a gate rejects one unit back to the step that produced it, and it fixes the run you are in ↳ the learning edge is long. an accepted result goes back to the splitter as a constraint, and it fixes every run after skip the second and you get a graph that is fast and never gets smarter. next week it starts from the same place with the same blind spots. and a smaller 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 ↓

Loops vs. Graphs, clearly explained! loops are great, but they have a ceiling: a loop makes one unit of work better. it cannot decide which units exist. so you end up with a very good agent running the wrong three steps, in the wrong order, one at a time. Graph engineering fixes this by moving the decision up a layer: what runs, what runs at the same time, and what never runs at all. you need both. here's how it works: a graph splits your system into two kinds of decision. ↳ inside a unit: the loop. produce, check, correct, repeat until green ↳ between units: the graph. split, fan out, merge, gate, send back Prompts → Context → Harness → Loops → Graphs you get parallel work, isolated contexts, and steps that stop running when nothing needs them. 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. a graph where every edge is an agent pays rent on its own wiring. one thing to know before you scale it. a graph has two return paths, and almost everyone builds one. ↳ the correction edge is short. a gate rejects one unit back to the step that produced it, and it fixes the run you are in ↳ the learning edge is long. an accepted result goes back to the splitter as a constraint, and it fixes every run after skip the second and you get a graph that is fast and never gets smarter. next week it starts from the same place with the same blind spots. and a smaller 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

73,867 Aufrufe • vor 14 Tagen

Ex-Google engineer just compressed the shift from AI agents to "graphs" and "loops" into one 2h47m lecture: • 00:00 - understanding the different layers of AI memory • 30:00 - moving from simple LLM calls to AI agents • 50:00 - why agent systems are becoming a graph engineering problem • 1:12:00 - connecting context, tools and agent state • 1:24:00 - building a minimal agent harness from scratch • 1:46:00 - breaking down the architecture behind Hermes Agent • 2:08:00 - turning agent concepts into working systems 167-minute deep dive, and one of the clearest ways to understand how AI engineering is moving beyond prompts The progression: Prompt → Context → Memory → Agent → Loop → Graph → Agent Harness Watch it today, then read the full roadmap below

Ex-Google engineer just compressed the shift from AI agents to "graphs" and "loops" into one 2h47m lecture: • 00:00 - understanding the different layers of AI memory • 30:00 - moving from simple LLM calls to AI agents • 50:00 - why agent systems are becoming a graph engineering problem • 1:12:00 - connecting context, tools and agent state • 1:24:00 - building a minimal agent harness from scratch • 1:46:00 - breaking down the architecture behind Hermes Agent • 2:08:00 - turning agent concepts into working systems 167-minute deep dive, and one of the clearest ways to understand how AI engineering is moving beyond prompts The progression: Prompt → Context → Memory → Agent → Loop → Graph → Agent Harness Watch it today, then read the full roadmap below

Morlex

50,478 Aufrufe • vor 19 Tagen

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

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

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

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

44,891 Aufrufe • vor 1 Monat

Most people lump prompt engineering, context engineering, and graph engineering together. Here's the simple breakdown: - Prompt engineering: how you ask the AI a better question. - Context engineering: how you give the AI better information. - Graph engineering: how you design the work around the AI so it stops living inside one giant chat. Example: researching a startup idea. The chat way: - One model, one pass. - It decides what matters - Researches the market - Interprets the evidence - Writes the recommendation - Grades its own confidence. The graph way: - A planner breaks the question into angles - 5 researchers split up: customer, competitors, distribution, pricing, risks - A skeptic tries to kill the weak findings - A merger turns what survives into a one-page recommendation - You approve before you act Same written report. Completely different work behind it. Think: - Prompt = the question - Context = the information - Graph = the workflow Design the workflow. That's where it clicks.

Most people lump prompt engineering, context engineering, and graph engineering together. Here's the simple breakdown: - Prompt engineering: how you ask the AI a better question. - Context engineering: how you give the AI better information. - Graph engineering: how you design the work around the AI so it stops living inside one giant chat. Example: researching a startup idea. The chat way: - One model, one pass. - It decides what matters - Researches the market - Interprets the evidence - Writes the recommendation - Grades its own confidence. The graph way: - A planner breaks the question into angles - 5 researchers split up: customer, competitors, distribution, pricing, risks - A skeptic tries to kill the weak findings - A merger turns what survives into a one-page recommendation - You approve before you act Same written report. Completely different work behind it. Think: - Prompt = the question - Context = the information - Graph = the workflow Design the workflow. That's where it clicks.

The Startup Ideas Podcast (SIP) 🧃

19,232 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.

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,298 Aufrufe • vor 1 Monat

Andrej Karpathy: "Prompting is fading away. Delete everything else and keep the graph." in 68 minutes at Stanford he explains how to build one and why it is the layer everything ends up becoming LLMs → Prompts → Agents → Graphs everything before the graph is a step the graph is where the system stops being steps most people are still perfecting the thing that goes away first same model, same tokens, and the only thing that changes is the shape you run it in watch it today, then save the full graph engineering guide below

Andrej Karpathy: "Prompting is fading away. Delete everything else and keep the graph." in 68 minutes at Stanford he explains how to build one and why it is the layer everything ends up becoming LLMs → Prompts → Agents → Graphs everything before the graph is a step the graph is where the system stops being steps most people are still perfecting the thing that goes away first same model, same tokens, and the only thing that changes is the shape you run it in watch it today, then save the full graph engineering guide below

Hanako

127,756 Aufrufe • vor 12 Tagen

Agents vs. Graphs, clearly explained! spawning more agents is great, but it has a ceiling nobody says out loud: five agents is a count. a graph is a shape. only one of them changes the answer. point five agents at the same pile with the same window and they converge. the first one writes a finding, the rest read it, and all five reports centre on the same thing. you paid five times for one opinion with four echoes. Graph engineering fixes this by moving the decision up a layer: not how many agents, but who is allowed to look at what. you need both. here's how it works: ↳ the count buys you throughput. five things happening instead of one ↳ the shape buys you coverage. five different things happening instead of the same one five times Prompts → Context → Harness → Agents → Graphs the node that does this is the splitter, and it decides more than any other node in the system. cut a repository by folder and four workers audit the same three files. cut it by blast radius and each one sees something the others cannot. the trick is being selective about what each lane is allowed to see. separate contexts are not a nice-to-have, they are the mechanism. if two agents are meant to produce different things, they must not share a window. if they are meant to produce the same thing, you did not need two agents. one thing to know before you scale it. a branch that throws does not reject the batch. it resolves to null, and that is the containment. which means your merge quietly receives a short list. ↳ filter the nulls before the merge, or one dead lane poisons the whole result ↳ never index a merge by position. eight good branches and one failure will shift everything by one, silently skip that and the run looks like it worked. the output is just missing a lane, and nothing errored. and the one that eats whole nights: multi-agent setups can use up to fifteen times the total tokens of a single chat, because every lane reloads its own core. you are trading total tokens for a clean main window. usually the right trade, always a choice. 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 ↓

Agents vs. Graphs, clearly explained! spawning more agents is great, but it has a ceiling nobody says out loud: five agents is a count. a graph is a shape. only one of them changes the answer. point five agents at the same pile with the same window and they converge. the first one writes a finding, the rest read it, and all five reports centre on the same thing. you paid five times for one opinion with four echoes. Graph engineering fixes this by moving the decision up a layer: not how many agents, but who is allowed to look at what. you need both. here's how it works: ↳ the count buys you throughput. five things happening instead of one ↳ the shape buys you coverage. five different things happening instead of the same one five times Prompts → Context → Harness → Agents → Graphs the node that does this is the splitter, and it decides more than any other node in the system. cut a repository by folder and four workers audit the same three files. cut it by blast radius and each one sees something the others cannot. the trick is being selective about what each lane is allowed to see. separate contexts are not a nice-to-have, they are the mechanism. if two agents are meant to produce different things, they must not share a window. if they are meant to produce the same thing, you did not need two agents. one thing to know before you scale it. a branch that throws does not reject the batch. it resolves to null, and that is the containment. which means your merge quietly receives a short list. ↳ filter the nulls before the merge, or one dead lane poisons the whole result ↳ never index a merge by position. eight good branches and one failure will shift everything by one, silently skip that and the run looks like it worked. the output is just missing a lane, and nothing errored. and the one that eats whole nights: multi-agent setups can use up to fifteen times the total tokens of a single chat, because every lane reloads its own core. you are trading total tokens for a clean main window. usually the right trade, always a choice. 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

96,243 Aufrufe • vor 12 Tagen

Context vs. Graphs, clearly explained! context engineering is great, but it has a ceiling: you can make one window perfect. there is still only one of it. every technique on that layer is rationing the same scarce thing. compact, retrieve less, delete, defer. all of it is deciding what to drop. Graph engineering fixes this by moving the decision up a layer: not what goes in the window, but how many windows there are and what each one is for. you need both. here's how it works: ↳ inside a window: context engineering. what loads, in what order, what gets compacted ↳ between windows: the graph. how many lanes, what each one is allowed to see, what comes back Prompts → Context → Harness → Loops → Graphs each lane gets a clean window, nothing in one competes with anything in another, and your main thread stops filling up. the trick is being selective about what comes back. a subagent reads six thousand tokens of files and hands you a four hundred token summary. that ratio is the whole point. send back the raw material instead and you have moved the problem, not solved it. one thing to know before you scale it. not everything survives compaction equally, and almost nobody knows the table. ↳ the project-root rules file and auto memory are re-injected from disk. they come back intact ↳ path-scoped rules and nested rules files live in message history. they get summarized away and do not return until a matching file is read again so a rule that genuinely must persist cannot be path-scoped. move it to the root and pay the always-loaded cost, or accept that it is advisory in any long session. and the one that eats whole nights: shared context makes parallel agents converge. four auditors on one window produce one opinion with three echoes. you paid four times for 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 ↓

Context vs. Graphs, clearly explained! context engineering is great, but it has a ceiling: you can make one window perfect. there is still only one of it. every technique on that layer is rationing the same scarce thing. compact, retrieve less, delete, defer. all of it is deciding what to drop. Graph engineering fixes this by moving the decision up a layer: not what goes in the window, but how many windows there are and what each one is for. you need both. here's how it works: ↳ inside a window: context engineering. what loads, in what order, what gets compacted ↳ between windows: the graph. how many lanes, what each one is allowed to see, what comes back Prompts → Context → Harness → Loops → Graphs each lane gets a clean window, nothing in one competes with anything in another, and your main thread stops filling up. the trick is being selective about what comes back. a subagent reads six thousand tokens of files and hands you a four hundred token summary. that ratio is the whole point. send back the raw material instead and you have moved the problem, not solved it. one thing to know before you scale it. not everything survives compaction equally, and almost nobody knows the table. ↳ the project-root rules file and auto memory are re-injected from disk. they come back intact ↳ path-scoped rules and nested rules files live in message history. they get summarized away and do not return until a matching file is read again so a rule that genuinely must persist cannot be path-scoped. move it to the root and pay the always-loaded cost, or accept that it is advisory in any long session. and the one that eats whole nights: shared context makes parallel agents converge. four auditors on one window produce one opinion with three echoes. you paid four times for 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

36,819 Aufrufe • vor 13 Tagen

300 agents without context engineering is just 300 ways to lose track of the answer. a serious agent system starts looking less like: 1 model → 1 prompt → 1 answer and more like: 1 planner → N parallel agents → verifier → merge → memory → human gate once you have 10, 50, or 300 agents, the number of possible relationships explodes. 100 entities = 4,950 possible pairwise relationships. 300 = 44,850. 1,000 = 499,500. that’s why “just give the model more context” stops working surprisingly fast. you need different agents seeing different slices of the graph. the architecture around the model is becoming the product. full article below ↓

300 agents without context engineering is just 300 ways to lose track of the answer. a serious agent system starts looking less like: 1 model → 1 prompt → 1 answer and more like: 1 planner → N parallel agents → verifier → merge → memory → human gate once you have 10, 50, or 300 agents, the number of possible relationships explodes. 100 entities = 4,950 possible pairwise relationships. 300 = 44,850. 1,000 = 499,500. that’s why “just give the model more context” stops working surprisingly fast. you need different agents seeing different slices of the graph. the architecture around the model is becoming the product. full article below ↓

Ricker

32,708 Aufrufe • vor 15 Tagen

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 ↓

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

464,895 Aufrufe • vor 1 Monat

Google just released a free 2-hour course on full Graph Engineering. How to go from one prompt to 100 agents running inside one graph: 17:44 - Build your first AI agent 39:30 - Run agents with loop engineering 1:12:38 - Turn agent loops into graphs 1:34:26 - Build agents that throttle themselves 1:55:05 - Orchestrate the full multi-agent system Most people build one agent and stop there. Google is teaching the full stack: Prompt → Agents → Loops → Graphs → Multi-Agent Systems Single agents are the old workflow. Self-regulating agent graphs are the new one. This 2-hour watch is worth more than most paid agent engineering courses. Bookmark and watch it today Then read the full architecture below ↓

Google just released a free 2-hour course on full Graph Engineering. How to go from one prompt to 100 agents running inside one graph: 17:44 - Build your first AI agent 39:30 - Run agents with loop engineering 1:12:38 - Turn agent loops into graphs 1:34:26 - Build agents that throttle themselves 1:55:05 - Orchestrate the full multi-agent system Most people build one agent and stop there. Google is teaching the full stack: Prompt → Agents → Loops → Graphs → Multi-Agent Systems Single agents are the old workflow. Self-regulating agent graphs are the new one. This 2-hour watch is worth more than most paid agent engineering courses. Bookmark and watch it today Then read the full architecture below ↓

Lunar

400,916 Aufrufe • vor 29 Tagen

Andrew Ng just released a 1-hour course on what comes after RAG. How to turn raw documents into agent memory: 00:00 - Why larger context windows are not enough 02:18 - Extract entities, relationships, and sources 14:31 - Coordinate specialized agents inside one graph 30:43 - Build it with Google ADK and Neo4j 47:25 - Turn knowledge graphs into persistent memory Most people are still learning RAG. Andrew Ng is already teaching the layer that comes after it. Documents → Entities → Relationships → Agents → Knowledge Graph More context is the old workflow. Persistent graphs are the new memory layer. This 1-hour watch is worth more than most paid GraphRAG courses. Bookmark and watch it today Then read the full graph engineering roadmap below

Andrew Ng just released a 1-hour course on what comes after RAG. How to turn raw documents into agent memory: 00:00 - Why larger context windows are not enough 02:18 - Extract entities, relationships, and sources 14:31 - Coordinate specialized agents inside one graph 30:43 - Build it with Google ADK and Neo4j 47:25 - Turn knowledge graphs into persistent memory Most people are still learning RAG. Andrew Ng is already teaching the layer that comes after it. Documents → Entities → Relationships → Agents → Knowledge Graph More context is the old workflow. Persistent graphs are the new memory layer. This 1-hour watch is worth more than most paid GraphRAG courses. Bookmark and watch it today Then read the full graph engineering roadmap below

Lunar

42,118 Aufrufe • vor 1 Monat

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

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 a free 2-hour+ course on full agent engineering. How to go from one prompt to a system that runs while you sleep: 38:46 - Build your first AI agent 54:46 - Connect MCP tools 1:12:43 - Run agents with four loop patterns 1:20:57 - Turn agent loops into graphs 2:22:31 - Build the complete autonomous system Most people are still building one agent and stopping there. Google is already teaching the full stack: Agents → Tools → Loops → Graphs → Autonomous Systems Single agents are the old workflow. Systems that run without you are the new one. This course is worth more than most paid agent engineering bootcamps. Bookmark and watch it today Then read the full graph engineering playbook below

Google just released a free 2-hour+ course on full agent engineering. How to go from one prompt to a system that runs while you sleep: 38:46 - Build your first AI agent 54:46 - Connect MCP tools 1:12:43 - Run agents with four loop patterns 1:20:57 - Turn agent loops into graphs 2:22:31 - Build the complete autonomous system Most people are still building one agent and stopping there. Google is already teaching the full stack: Agents → Tools → Loops → Graphs → Autonomous Systems Single agents are the old workflow. Systems that run without you are the new one. This course is worth more than most paid agent engineering bootcamps. Bookmark and watch it today Then read the full graph engineering playbook below

Lunar

197,346 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 ↓

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

533,997 Aufrufe • vor 1 Monat

Google just released a free 2-hour course on full Graph Engineering. How to go from one prompt to 100 agents running inside a single graph: 0% → 17:44 - build your first AI agent 25% → 39:30 - run agents with loop engineering 50% → 1:12:38 - turn agent loops into graphs 75% → 1:34:26 - build agents that regulate themselves 100% → 1:55:05 - orchestrate the entire multi-agent system Most people build one agent and stop there. Google is teaching the entire stack: Prompt → Agents → Loops → Graphs → Multi-Agent Systems Single agents are the old workflow. Self-regulating agent graphs are the next one. This 2-hour course is worth more than most paid agent engineering courses. Bookmark it and watch today Then read the full architecture below ↓

Google just released a free 2-hour course on full Graph Engineering. How to go from one prompt to 100 agents running inside a single graph: 0% → 17:44 - build your first AI agent 25% → 39:30 - run agents with loop engineering 50% → 1:12:38 - turn agent loops into graphs 75% → 1:34:26 - build agents that regulate themselves 100% → 1:55:05 - orchestrate the entire multi-agent system Most people build one agent and stop there. Google is teaching the entire stack: Prompt → Agents → Loops → Graphs → Multi-Agent Systems Single agents are the old workflow. Self-regulating agent graphs are the next one. This 2-hour course is worth more than most paid agent engineering courses. Bookmark it and watch today Then read the full architecture below ↓

Lunar

11,688 Aufrufe • vor 2 Tagen

Head of Claude Code: "85% of our engineers are running dozens or hundreds of agents. The way you do it is graph engineering." In 40 minutes he explains how a single engineer now does the work of a whole team, how far this has gone inside Anthropic and where it goes next. This is something you can't skip if you don't want to be left behind. Watch it, then read the full guide on graph engineering below.

Head of Claude Code: "85% of our engineers are running dozens or hundreds of agents. The way you do it is graph engineering." In 40 minutes he explains how a single engineer now does the work of a whole team, how far this has gone inside Anthropic and where it goes next. This is something you can't skip if you don't want to be left behind. Watch it, then read the full guide on graph engineering below.

Anatoli Kopadze

1,725,855 Aufrufe • vor 1 Monat