Загрузка видео...

Не удалось загрузить видео

Возникла проблема при загрузке этого видео. Это может быть связано с временными проблемами сети или видео может быть недоступно.

На главную

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... show more

Hanako

14,930 subscribers

124,372 просмотров • 2 дней назад •via X (Twitter)

Наука и технологии

Anya Rossi• Live Now

Private livecam show

Комментарии: 0

Нет доступных комментариев

Здесь появятся комментарии из оригинального поста

Похожие видео

Anthropic engineer: "At Anthropic we don't write prompts anymore. We build loops and graphs." in 32 minutes she shows how the Claude team builds systems that prompt themselves Prompts → Agents → Loops → Graphs a loop finishes one unit of work without you a graph decides which units exist and turns every accepted one into a rule the next run inherits 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

Anthropic engineer: "At Anthropic we don't write prompts anymore. We build loops and graphs." in 32 minutes she shows how the Claude team builds systems that prompt themselves Prompts → Agents → Loops → Graphs a loop finishes one unit of work without you a graph decides which units exist and turns every accepted one into a rule the next run inherits 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

194,897 просмотров • 1 день назад

Andrej Karpathy just rewrote the rules of using LLMs: "Prompting is going away. Delete everything, keep Graph." He dropped his full 2-hour course from Stanford on "Graph-Native Research" • 00:00 - Intro to Graph systems • 01:08:09 - LLMs architecture This Karpathy course can replace a $100K Yale LLM senior degree. Start watching right now, then read article below

Andrej Karpathy just rewrote the rules of using LLMs: "Prompting is going away. Delete everything, keep Graph." He dropped his full 2-hour course from Stanford on "Graph-Native Research" • 00:00 - Intro to Graph systems • 01:08:09 - LLMs architecture This Karpathy course can replace a $100K Yale LLM senior degree. Start watching right now, then read article below

Morty

30,772 просмотров • 6 дней назад

Anthropic engineer: "You don't need better prompts. You need graph engineering that makes agents remember everything." In 25 minutes he shows how engineers at Anthropic wire agents into a graph where each has a job, they run in parallel, verify each other, and share a memory that never resets. This beats any paid course on building agents I've seen. Watch it, then read the full guide on graph engineering below.

Anthropic engineer: "You don't need better prompts. You need graph engineering that makes agents remember everything." In 25 minutes he shows how engineers at Anthropic wire agents into a graph where each has a job, they run in parallel, verify each other, and share a memory that never resets. This beats any paid course on building agents I've seen. Watch it, then read the full guide on graph engineering below.

Anatoli Kopadze

490,467 просмотров • 27 дней назад

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,671 просмотров • 22 дней назад

Google just released a free 2-hour course on full Graph Engineering. How to go from one prompt to an agent graph that builds itself: 10:16 - Build your first AI agent 41:05 - Master prompt engineering 54:45 - Turn agents into graphs 1:20:10 - Run loops inside agent graphs 1:43:33 - Build a graph that builds itself Most people ship one agent and stop there. Google is teaching everything after: Prompt → Agents → Graphs → Loops → Self-Building Systems Single agents are the old workflow. Graphs that evolve themselves are the new one. This 2-hour watch is worth more than most paid agent engineering courses. Bookmark and watch it today Then read how to run 1,000 agents from one prompt below ↓

Google just released a free 2-hour course on full Graph Engineering. How to go from one prompt to an agent graph that builds itself: 10:16 - Build your first AI agent 41:05 - Master prompt engineering 54:45 - Turn agents into graphs 1:20:10 - Run loops inside agent graphs 1:43:33 - Build a graph that builds itself Most people ship one agent and stop there. Google is teaching everything after: Prompt → Agents → Graphs → Loops → Self-Building Systems Single agents are the old workflow. Graphs that evolve themselves are the new one. This 2-hour watch is worth more than most paid agent engineering courses. Bookmark and watch it today Then read how to run 1,000 agents from one prompt below ↓

Lunar

49,332 просмотров • 17 дней назад

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

463,265 просмотров • 24 дней назад

Head of Claude Code, Boris Cherny: "You're not supposed to write code anymore. You're supposed to build a graph that writes itself." In 30 minutes he breaks down how engineers at Anthropic build graphs that write the code, catch the bugs, and ships. The missing piece most developers skip: how to wire those agents into a graph that runs, verifies, and improves without you. Watch it, then read the full guide on graph engineering below.

Head of Claude Code, Boris Cherny: "You're not supposed to write code anymore. You're supposed to build a graph that writes itself." In 30 minutes he breaks down how engineers at Anthropic build graphs that write the code, catch the bugs, and ships. The missing piece most developers skip: how to wire those agents into a graph that runs, verifies, and improves without you. Watch it, then read the full guide on graph engineering below.

Mahax

415,665 просмотров • 24 дней назад

Andrew Ng just dropped a 2-hour course on Graph Engineering: from Loops to full automation 9:14 - Your first agent 33:11 - Loop engineering 1:02:46 - Graph engineering 1:30:15 - Agents that rewrite themselves 1:49:05 - Full graph system Free, the best thing on graph engineering I've come across Watch it, then build your first graph with the guide below

Andrew Ng just dropped a 2-hour course on Graph Engineering: from Loops to full automation 9:14 - Your first agent 33:11 - Loop engineering 1:02:46 - Graph engineering 1:30:15 - Agents that rewrite themselves 1:49:05 - Full graph system Free, the best thing on graph engineering I've come across Watch it, then build your first graph with the guide below

Mahax

235,617 просмотров • 14 дней назад

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 ↓

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

104,682 просмотров • 18 дней назад

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 просмотров • 21 дней назад

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 ↓

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

223,862 просмотров • 15 дней назад

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,722,246 просмотров • 26 дней назад

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

65,507 просмотров • 4 дней назад

Andrew Ng just dropped the best 1-hour course on Graph Engineering: from zero to full automation 00:00 - What is graph engineering 03:05 - Building a graph 13:58 - Multi agent architecture 22:57 - Live build: Google ADK 01:06:02 - Why graphs are the future This 1-hour watch replaces any $500 course you could pay for Watch it, then try your first graph with the step-by-step guide below

Andrew Ng just dropped the best 1-hour course on Graph Engineering: from zero to full automation 00:00 - What is graph engineering 03:05 - Building a graph 13:58 - Multi agent architecture 22:57 - Live build: Google ADK 01:06:02 - Why graphs are the future This 1-hour watch replaces any $500 course you could pay for Watch it, then try your first graph with the step-by-step guide below

Mahax

68,699 просмотров • 24 дней назад

Anthropic engineer: "You're not supposed to prompt Claude. You're supposed to build a graph that runs itself." In 30 minutes she breaks down how Anthropic builds graphs that remember, learn from their mistakes, and get smarter with every run. The difference between an agent and a graph: one runs once, the other gets better every time. Watch it, then read the full guide on graph engineering below.

Anthropic engineer: "You're not supposed to prompt Claude. You're supposed to build a graph that runs itself." In 30 minutes she breaks down how Anthropic builds graphs that remember, learn from their mistakes, and get smarter with every run. The difference between an agent and a graph: one runs once, the other gets better every time. Watch it, then read the full guide on graph engineering below.

Mahax

288,158 просмотров • 25 дней назад

OpenAI engineer: "At OpenAI, 85% of our engineers are running hundreds of agents with Codex. The way you do it is graph engineering." In 30-minutes lecture, he explains how a single engineer can now do the work of an entire team, how far this has already gone inside OpenAI, 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.

OpenAI engineer: "At OpenAI, 85% of our engineers are running hundreds of agents with Codex. The way you do it is graph engineering." In 30-minutes lecture, he explains how a single engineer can now do the work of an entire team, how far this has already gone inside OpenAI, 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.

Movez

203,544 просмотров • 16 дней назад

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

399,182 просмотров • 18 дней назад

Anthropic engineer: "You don't need to babysit agents. You need Loops and Graphs that run them for you." In 30 minutes, he shows exactly what the Anthropic engineers build so agents run without them, and how to start building it yourself. The missing piece most people skip: how to wire those agents into a graph that self-corrects every run. Watch it, then read the full guide on loops and graphs below.

Anthropic engineer: "You don't need to babysit agents. You need Loops and Graphs that run them for you." In 30 minutes, he shows exactly what the Anthropic engineers build so agents run without them, and how to start building it yourself. The missing piece most people skip: how to wire those agents into a graph that self-corrects every run. Watch it, then read the full guide on loops and graphs below.

Mahax

84,760 просмотров • 18 дней назад

Google dropped a free 2 hour course on full graph engineering, taking you from a single prompt to a hundred agents wired into loops and graphs 17:44 – Building your first agent 39:30 – Loop engineering, iterate, check, break 1:12:38 – Graph engineering 1:34:26 – Agents that throttle themselves 1:55:05 – Full graph for multi agentic systems Most people build a single agent and stop there. This course shows the full system, where agents wire themselves into a graph on their own Watch it today, then check out the graph engineering playbook below for a deeper breakdown

Google dropped a free 2 hour course on full graph engineering, taking you from a single prompt to a hundred agents wired into loops and graphs 17:44 – Building your first agent 39:30 – Loop engineering, iterate, check, break 1:12:38 – Graph engineering 1:34:26 – Agents that throttle themselves 1:55:05 – Full graph for multi agentic systems Most people build a single agent and stop there. This course shows the full system, where agents wire themselves into a graph on their own Watch it today, then check out the graph engineering playbook below for a deeper breakdown

Wayne

140,885 просмотров • 11 дней назад

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 просмотров • 26 дней назад