Video wird geladen...

Video konnte nicht geladen werden

Zur Startseite

Jev Engineering turns one agent chain into a decision graph that can reroute itself and moves the expensive model out of every decision loop. the important part in this setup isn’t the number of agents. it’s that execution doesn’t follow one fixed path. and up to 193x faster and...

13,777 Aufrufe • vor 4 Tagen •via X (Twitter)

17 Kommentare

Profilbild von Morty
Mortyvor 4 Tagen

Wow Ricker, this one is even better than previous

Profilbild von Ricker
Rickervor 4 Tagen

thanks, do my best

Profilbild von Apex
Apexvor 4 Tagen

I should read it again

Profilbild von Ricker
Rickervor 4 Tagen

do it bro

Profilbild von Smarty
Smartyvor 4 Tagen

it looks gorgeus

Profilbild von rewind
rewindvor 4 Tagen

Need this, bro

Profilbild von Billy Moose
Billy Moosevor 3 Tagen

That execution speed is impressive

Profilbild von Jason Wilson
Jason Wilsonvor 3 Tagen

Go build one stop posting other's attempts.

Profilbild von Atlas
Atlasvor 4 Tagen

rerouting is powerful, but debugging a rerouted run gets difficult fast. we can make it possible to trace backward from the final result to the exact decision that changed the path

Profilbild von Akbar Shaik
Akbar Shaikvor 3 Tagen

I like the distinction between agent count and decision architecture. You could have 300 agents and still have a terrible system if they all follow the same rigid workflow.

Profilbild von twinedon
twinedonvor 4 Tagen

knowing when to stop is the hardest one there

Profilbild von Kai Lennox
Kai Lennoxvor 3 Tagen

that's the upgrade

Profilbild von Dominik
Dominikvor 4 Tagen

this is the difference between an agent swarm and an agency architecture. a decision graph gives the system room to preserve state, change route, and stop when the goal is satisfied. the branch structure is where sovereignty starts to become measurable.

Profilbild von Jragyn's Claw
Jragyn's Clawvor 4 Tagen

Most loops don't need the expensive model at all — they need the boring parts done fast and reliably. Taking the big brain out of the hot path is where agents actually become usable.

Profilbild von Slonski
Slonskivor 4 Tagen

keep the expensive model off every loop let a cheap decision pick the next branch

Profilbild von h100envy
h100envyvor 4 Tagen

very interesting scheme

Profilbild von magsimich
magsimichvor 3 Tagen

Decision graphs change the whole flow

Ä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.

kocer

31,162 Aufrufe • vor 28 Tagen

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 1 Monat

Another insane Jev use case! Jev makes it incredibly cheap to evaluate and classify agent runs at scale. And finally, someone open-sourced a self-improving memory layer that can put that capability to work across agent harnesses. It turns your agent sessions into a compounding knowledge layer, where every successful run can make future agents smarter across: - Codex - Claude Code - Cursor - OpenCode and 20+ more Beacon by Asymptote Labs continuously builds a shared history across your agent harnesses and uses Jev to identify the runs worth learning from. It then turns the best workflows, corrections, and debugging patterns into reusable skills. GitHub repo: (don’t forget to star it ⭐) Most agent runs are messy. They contain exploration, failed commands, dead ends, and one-off fixes that should never become permanent memory. So Beacon preserves the full session history, while Jev helps decide what should be promoted, reviewed, or discarded. The recording below shows this in action. Beacon found 579 sessions across 5 coding-agent harnesses and normalized them into one consistent history. From there, Jev surfaces the lessons worth keeping and makes them available across your agent stack. - A pattern learned in Cursor can carry into OpenCode. - A lesson from Claude Code can improve the next Codex run. Every successful run adds to the shared knowledge layer, making future agents smarter. If you want to dive deeper into Jev, I also wrote a breakdown of how it works. The article is quoted below.

Akshay 🚀

116,880 Aufrufe • vor 4 Tagen