Loading video...

Video Failed to Load

There was a problem loading this video. This could be due to a temporary network issue or the video might be unavailable.

Turn any open LLM into a Jev-style model: Researchers just open-sourced AnyJev, a Python library that extracts typed choices, yes/no judgments, scores, and probabilities from causal LLMs. Beyond its raw baseline, AnyJev offers three levels depending on how much labeled data and calibration you need: - L0 requires no... labels. It rotates the answer options to reduce position bias, but its probabilities remain uncalibrated. - L1 uses 100-500 labeled examples per question to calibrate those probabilities through temperature scaling. It improves confidence estimates without changing the answer ranking. - L2 uses 100-300 labels to fit a closed-form head on an intermediate hidden state. It leaves model weights untouched and can stop inference before the full forward pass completes. The main constraint is model access. AnyJev requires access to logits or hidden states, so it is built for open models. L2 heads are also specific to a model and question. It is compatible with several open causal LLMs. Repo: (don't forget to star it ⭐ ) If you want to dive deeper, I also wrote about a similar mechanism in a hands-on guide. It covers building a Jev-style decision path with open models, entirely locally. Read it below.show more

Avi Chawla

78,712 subscribers

55,843 views • 19 days ago •via X (Twitter)

Anya Rossi• Live Now

Private livecam show

0 Comments

No comments available

Comments from the original post will appear here

Related Videos

Jev + SERV is actually insane. We already showed you can increase Jev's performance with SERV Reasoning. Now we're taking it further, bringing Jev-powered Decision nodes into Graph Sharding with the upcoming SERV v3. Here's a breakdown of how it works: Jev is a decision-making model. Given a task and a set of options, it predicts which path is more likely. Think of the octopus that predicted World Cup results. Jev does that for your business, except it's not luck. It weighs every option and tells you how sure it is. It does this by assigning probabilities to outcomes. It doesn't generate text on its own, so you can't expect it to create a new outcome for you. But that's also what enables it to be lightning fast and dirt cheap. For example, in customer service you can ask Jev how to triage an incoming query and route it to the correct department. It can only select from the list of departments you provide it. This also means it can't hallucinate a new outcome outside the options it's given, which makes it incredibly interesting for OpenServ. In Graph Sharding, we take a single system prompt and break it down into multiple LLM steps with deterministic input and output shapes. Some of these steps require an LLM to produce new output, while others are simply decision routers that determine the next possible path. Traditionally, LLMs are slow and expensive. Breaking a single prompt into multiple steps increases accuracy and reliability by a ton, but it also introduces latency. Jev takes on those decision nodes, which are the backbone of a business process and therefore SERV graphs, and makes them super consistent and lightning fast, lowering the overall cost and latency of graph execution. SERV Reasoning on its own is a great force multiplier for Jev because, like all other models, it works by interpreting input instructions. The clearer those instructions are, the better the model performs. That's where SERV Reasoning comes into play. Just like amplifying any other model, we also amplify the accuracy and consistency of Jev's responses. And now we're bringing Jev-powered Decision nodes into Graph Sharding with SERV v3.

Jev + SERV is actually insane. We already showed you can increase Jev's performance with SERV Reasoning. Now we're taking it further, bringing Jev-powered Decision nodes into Graph Sharding with the upcoming SERV v3. Here's a breakdown of how it works: Jev is a decision-making model. Given a task and a set of options, it predicts which path is more likely. Think of the octopus that predicted World Cup results. Jev does that for your business, except it's not luck. It weighs every option and tells you how sure it is. It does this by assigning probabilities to outcomes. It doesn't generate text on its own, so you can't expect it to create a new outcome for you. But that's also what enables it to be lightning fast and dirt cheap. For example, in customer service you can ask Jev how to triage an incoming query and route it to the correct department. It can only select from the list of departments you provide it. This also means it can't hallucinate a new outcome outside the options it's given, which makes it incredibly interesting for OpenServ. In Graph Sharding, we take a single system prompt and break it down into multiple LLM steps with deterministic input and output shapes. Some of these steps require an LLM to produce new output, while others are simply decision routers that determine the next possible path. Traditionally, LLMs are slow and expensive. Breaking a single prompt into multiple steps increases accuracy and reliability by a ton, but it also introduces latency. Jev takes on those decision nodes, which are the backbone of a business process and therefore SERV graphs, and makes them super consistent and lightning fast, lowering the overall cost and latency of graph execution. SERV Reasoning on its own is a great force multiplier for Jev because, like all other models, it works by interpreting input instructions. The clearer those instructions are, the better the model performs. That's where SERV Reasoning comes into play. Just like amplifying any other model, we also amplify the accuracy and consistency of Jev's responses. And now we're bringing Jev-powered Decision nodes into Graph Sharding with SERV v3.

Armagan Amcalar

365,108 views • 21 days ago

Something just launched that makes VS Code feel ancient. And im all in for it: Cline Desktop app, an open-source app for open-weight models (and you know how much i love open source) brings its coding agent into a standalone Cline Desktop app for Mac + Windows. Just open a project and tell it what you want to change. No need to open VS Code first. In Cline's demo, it adds priority filters to a task board, works through the code and runs the build. Glad to see the model choice stays open, too. You can bring your own API keys, use supported open-weight models and even switch models halfway through a project!

Something just launched that makes VS Code feel ancient. And im all in for it: Cline Desktop app, an open-source app for open-weight models (and you know how much i love open source) brings its coding agent into a standalone Cline Desktop app for Mac + Windows. Just open a project and tell it what you want to change. No need to open VS Code first. In Cline's demo, it adds priority filters to a task board, works through the code and runs the build. Glad to see the model choice stays open, too. You can bring your own API keys, use supported open-weight models and even switch models halfway through a project!

Chubby♨️

40,292 views • 1 month ago

Top 12 agentic use cases for Jev: (bookmark this) Jev handles semantic decisions that ordinary code cannot express reliably. It returns typed answers and probabilities, while code continues to cover the workflow. Here are 12 practical use cases for Jev: 1. Browser next action > Convert the current DOM state into a bounded action such as click, type, or stop. Code executes only valid operation-target pairs. There are already several open-source Jev web agents. 2. Context compaction > Decide which events from a long agent trace should remain. The selected text stays verbatim instead of being replaced with a generated summary. 3. Skill and context loading > Compare the current user turn against the available skills. Load only the instructions needed for that turn instead of filling the context window with every skill. 4. Typed tool-call compilation > Map a natural-language request to a function and fill its typed arguments. Each argument is evaluated separately before code allows execution. 5. Citation verification > Check whether a quoted passage exists and whether the surrounding evidence supports the claim. The output can be supported, unsupported, or contradicted. 6. Extraction verification > Run a cheap extractor first, then use Jev to verify questionable fields. Clean records stay on the fast path while uncertain ones reach a reasoning model. 7. Agent trace evaluation > Turn raw trajectories into queryable labels such as progress and repetition. This avoids asking another LLM to write a full review of every run. 8. Semantic regression tests > Replay a trace suite against a new agent build. Semantic checks can then pass or block prompt, model, tool, and policy changes in CI. 9. Jevgrep code search > Search a codebase by what the code does rather than its exact words. Jev scores candidate snippets and returns the most relevant code first. 10. Entity alignment > Compare two candidate records and decide whether to merge, review, or keep them separate. Candidate generation remains deterministic while Jev handles semantic identity. 11. Retrieval reranking > Let embeddings retrieve a broad candidate set, then use Jev to reorder passages by relevance. The generation model receives the most useful evidence first. 12. Memory promotion gate > Capture a completed agent trace, then judge whether its corrections contain a reusable lesson. Trace-backed lessons can be promoted while task-specific noise is discarded. If you want to see the final pattern in practice, it is already implemented in the Beacon open-source project. Beacon captures full sessions across Claude Code, Codex, Cursor, OpenCode, and 20+ agent harnesses, and then Jev identifies which workflows and corrections are worth learning from, so that a lesson discovered by one agent can become available to the others. GitHub repo: (don’t forget to star it ⭐) If you want to dive deeper, I also wrote about a similar mechanism in a hands-on guide. It covers building a Jev-style decision path with open models, entirely locally. Read it below.

Top 12 agentic use cases for Jev: (bookmark this) Jev handles semantic decisions that ordinary code cannot express reliably. It returns typed answers and probabilities, while code continues to cover the workflow. Here are 12 practical use cases for Jev: 1. Browser next action > Convert the current DOM state into a bounded action such as click, type, or stop. Code executes only valid operation-target pairs. There are already several open-source Jev web agents. 2. Context compaction > Decide which events from a long agent trace should remain. The selected text stays verbatim instead of being replaced with a generated summary. 3. Skill and context loading > Compare the current user turn against the available skills. Load only the instructions needed for that turn instead of filling the context window with every skill. 4. Typed tool-call compilation > Map a natural-language request to a function and fill its typed arguments. Each argument is evaluated separately before code allows execution. 5. Citation verification > Check whether a quoted passage exists and whether the surrounding evidence supports the claim. The output can be supported, unsupported, or contradicted. 6. Extraction verification > Run a cheap extractor first, then use Jev to verify questionable fields. Clean records stay on the fast path while uncertain ones reach a reasoning model. 7. Agent trace evaluation > Turn raw trajectories into queryable labels such as progress and repetition. This avoids asking another LLM to write a full review of every run. 8. Semantic regression tests > Replay a trace suite against a new agent build. Semantic checks can then pass or block prompt, model, tool, and policy changes in CI. 9. Jevgrep code search > Search a codebase by what the code does rather than its exact words. Jev scores candidate snippets and returns the most relevant code first. 10. Entity alignment > Compare two candidate records and decide whether to merge, review, or keep them separate. Candidate generation remains deterministic while Jev handles semantic identity. 11. Retrieval reranking > Let embeddings retrieve a broad candidate set, then use Jev to reorder passages by relevance. The generation model receives the most useful evidence first. 12. Memory promotion gate > Capture a completed agent trace, then judge whether its corrections contain a reusable lesson. Trace-backed lessons can be promoted while task-specific noise is discarded. If you want to see the final pattern in practice, it is already implemented in the Beacon open-source project. Beacon captures full sessions across Claude Code, Codex, Cursor, OpenCode, and 20+ agent harnesses, and then Jev identifies which workflows and corrections are worth learning from, so that a lesson discovered by one agent can become available to the others. GitHub repo: (don’t forget to star it ⭐) If you want to dive deeper, I also wrote about a similar mechanism in a hands-on guide. It covers building a Jev-style decision path with open models, entirely locally. Read it below.

Avi Chawla

128,535 views • 17 days ago

Big win for open-source LLMs! DeepSeek V4 Pro holds the top open-weights score on SWE-bench Verified, in the GPT-5.5 range. GLM 5.2 leads the open-weight intelligence index and sits near the closed frontier on long-horizon coding. But this leaderboard number is a weak proxy for real performance. It comes from one task set, run through one harness, served at one precision. The same weights can even score differently across providers, since many hosts quantize activations to fp8 and drift the model off its reference weights. Real performance is determined based on whether a model can read a repo, make coordinated edits across files, run the tests, and recover when one breaks. By that measure, the top open models hold up, but only inside the right harness. The teams that actually put DeepSeek V4 into production pipelines as a frontier substitute got there through the harness they built around the model, not by picking a stronger model. If you want to see this in practice, Cline (64k+ stars) has actually built that harness around open models, tuned so they run at production quality. And it's tuned so that these LLMs can run at production quality, with plan and act modes, checkpoints, and terminal feedback. ClinePass is the new access layer on top of it. It runs a curated set of those models inside Cline, narrowed to the ones tested for coding-agent use, with 2 to 5x the standard rate limits and no separate provider accounts, keys, or billing to track. The video below shows the setup, and I worked with the team to put this together. It runs alongside custom keys and local models as well, not in place of them.

Big win for open-source LLMs! DeepSeek V4 Pro holds the top open-weights score on SWE-bench Verified, in the GPT-5.5 range. GLM 5.2 leads the open-weight intelligence index and sits near the closed frontier on long-horizon coding. But this leaderboard number is a weak proxy for real performance. It comes from one task set, run through one harness, served at one precision. The same weights can even score differently across providers, since many hosts quantize activations to fp8 and drift the model off its reference weights. Real performance is determined based on whether a model can read a repo, make coordinated edits across files, run the tests, and recover when one breaks. By that measure, the top open models hold up, but only inside the right harness. The teams that actually put DeepSeek V4 into production pipelines as a frontier substitute got there through the harness they built around the model, not by picking a stronger model. If you want to see this in practice, Cline (64k+ stars) has actually built that harness around open models, tuned so they run at production quality. And it's tuned so that these LLMs can run at production quality, with plan and act modes, checkpoints, and terminal feedback. ClinePass is the new access layer on top of it. It runs a curated set of those models inside Cline, narrowed to the ones tested for coding-agent use, with 2 to 5x the standard rate limits and no separate provider accounts, keys, or billing to track. The video below shows the setup, and I worked with the team to put this together. It runs alongside custom keys and local models as well, not in place of them.

Avi Chawla

44,124 views • 3 months ago

You can now use Jev right inside Claude Code 🤯 It's called jev-model-router, an early access mod built on Claude Code's new function hooks. Before every turn, it checks in with Jev and asks: > how mechanical the task is > how much reasoning it needs > whether it's risky Then it routes: → it'll move up to a stronger model on weak evidence, and only drops to a cheaper one when it's confident the task is simple → every decision gets logged in your transcript → if the call fails, your request runs untouched Setup: 1. copy the install command: npx claude-code-templates@latest --mod productivity/jev-model-router 2. paste it inside Claude Code 3. run claude with CLAUDE_CODE_ENABLE_FUNCTION_HOOKS=1 set 4. accept the trust prompt on first launch Link: Also works with no api key, it just falls back to a built-in classifier with no confidence score. For real jev routing, add your typesafeApiKey or gatewayApiKey to ~/.claude/settings.json. Follow me for more AI workflows and tutorials.

You can now use Jev right inside Claude Code 🤯 It's called jev-model-router, an early access mod built on Claude Code's new function hooks. Before every turn, it checks in with Jev and asks: > how mechanical the task is > how much reasoning it needs > whether it's risky Then it routes: → it'll move up to a stronger model on weak evidence, and only drops to a cheaper one when it's confident the task is simple → every decision gets logged in your transcript → if the call fails, your request runs untouched Setup: 1. copy the install command: npx claude-code-templates@latest --mod productivity/jev-model-router 2. paste it inside Claude Code 3. run claude with CLAUDE_CODE_ENABLE_FUNCTION_HOOKS=1 set 4. accept the trust prompt on first launch Link: Also works with no api key, it just falls back to a built-in classifier with no confidence score. For real jev routing, add your typesafeApiKey or gatewayApiKey to ~/.claude/settings.json. Follow me for more AI workflows and tutorials.

Alvaro Cintas

43,331 views • 23 days ago

I'll always root for a team that open-sources its best work, and Robbyant just did it properly. Robbyant, Ant Group's embodied-AI company, released LingBot-Vision, a vision foundation model for robots, and the part I love is the data. They trained it on 161M images, filtered down from 2B raw ones and mostly pulled straight from the open web, with no human labels, no edge detectors, no depth sensors anywhere in the loop. It learns the exact edges of objects from raw pixels. That's roughly a tenth of the data DINOv3 saw, and under a third of the training. And it shows in the results. On depth, working out how far away things are, the 1B model edges out a 7B on NYU-Depth. It also powers LingBot-Depth 2.0, which reads the surfaces cameras usually choke on, glass and mirrors, and halves indoor depth error. LingBot-Vision is fully open. Weights from the 1.1B flagship down to a tiny 21M version, code, and the paper. This is the timeline I want more of. Robbyant

I'll always root for a team that open-sources its best work, and Robbyant just did it properly. Robbyant, Ant Group's embodied-AI company, released LingBot-Vision, a vision foundation model for robots, and the part I love is the data. They trained it on 161M images, filtered down from 2B raw ones and mostly pulled straight from the open web, with no human labels, no edge detectors, no depth sensors anywhere in the loop. It learns the exact edges of objects from raw pixels. That's roughly a tenth of the data DINOv3 saw, and under a third of the training. And it shows in the results. On depth, working out how far away things are, the 1B model edges out a 7B on NYU-Depth. It also powers LingBot-Depth 2.0, which reads the surfaces cameras usually choke on, glass and mirrors, and halves indoor depth error. LingBot-Vision is fully open. Weights from the 1.1B flagship down to a tiny 21M version, code, and the paper. This is the timeline I want more of. Robbyant

Chubby♨️

48,249 views • 3 months ago

New open-source agent harness just landed! I got early access to TrueForge by TrueFoundry and have been running it locally for the past few days. The harness layer deserves as much attention as the model, and open source matters here because you can inspect the loop, run it on your own infrastructure, and swap to the latest or cheaper models. TrueForge handles the runtime work that makes an agent reliable. It drives the tool-calling loop, manages context, coordinates subagents, and executes code in a sandbox, with any model you choose. Every tool call re-sends the growing context to the model, so in practice the harness controls most of what an agent costs to run. A few things stood out from my testing and their published benchmarks. Vendor-Neutral by design. It runs OpenAI, Anthropic, and Google models alongside open-weight models like Kimi, GLM, and DeepSeek. Model routing is a setting, and you can send each task to the model that fits it. On a 14-task enterprise agent benchmark, it matched the accuracy of Claude Managed Agents running the same Opus 4.8 model at roughly 30% lower cost per run (3.8M tokens vs 10M for the same answers). Routing the same tasks to GLM-5.2 held accuracy and brought cost down by about 75%, around $3 per run instead of $12. Fully self-hosted and Open Source (MIT License). I had it running locally with one command, with sandboxed code execution working out of the box. It's time to own your agent harness. Thanks to TrueFoundry for partnering on this post.

New open-source agent harness just landed! I got early access to TrueForge by TrueFoundry and have been running it locally for the past few days. The harness layer deserves as much attention as the model, and open source matters here because you can inspect the loop, run it on your own infrastructure, and swap to the latest or cheaper models. TrueForge handles the runtime work that makes an agent reliable. It drives the tool-calling loop, manages context, coordinates subagents, and executes code in a sandbox, with any model you choose. Every tool call re-sends the growing context to the model, so in practice the harness controls most of what an agent costs to run. A few things stood out from my testing and their published benchmarks. Vendor-Neutral by design. It runs OpenAI, Anthropic, and Google models alongside open-weight models like Kimi, GLM, and DeepSeek. Model routing is a setting, and you can send each task to the model that fits it. On a 14-task enterprise agent benchmark, it matched the accuracy of Claude Managed Agents running the same Opus 4.8 model at roughly 30% lower cost per run (3.8M tokens vs 10M for the same answers). Routing the same tasks to GLM-5.2 held accuracy and brought cost down by about 75%, around $3 per run instead of $12. Fully self-hosted and Open Source (MIT License). I had it running locally with one command, with sandboxed code execution working out of the box. It's time to own your agent harness. Thanks to TrueFoundry for partnering on this post.

elvis

11,303 views • 1 month ago

You've probably scrolled past a dozen posts about Jev this week without anyone telling you what it actually is. It's the first model from TypeSafe, a lab started by one of the researchers behind ChatGPT. It's a decision engine: you give it options, it picks one and tells you how sure it is. It cannot write a single word, and that is the interesting part. Every other AI you use writes. That is the whole interface. So when software needs a plain yes or no, we make a model write a paragraph and then dig the answer back out of it. Fine in a chat window where a human reads it. Bad inside software, where code has to act on it. The bet is that the valuable half was never the writing. It was the deciding. That problem showed up in WordPress years ago, and it is the reason WPVibe works the way it does. The AI does the work. Anything permanent stops and waits, because a delete that skips the trash is not something software should decide on its own.

You've probably scrolled past a dozen posts about Jev this week without anyone telling you what it actually is. It's the first model from TypeSafe, a lab started by one of the researchers behind ChatGPT. It's a decision engine: you give it options, it picks one and tells you how sure it is. It cannot write a single word, and that is the interesting part. Every other AI you use writes. That is the whole interface. So when software needs a plain yes or no, we make a model write a paragraph and then dig the answer back out of it. Fine in a chat window where a human reads it. Bad inside software, where code has to act on it. The bet is that the valuable half was never the writing. It was the deciding. That problem showed up in WordPress years ago, and it is the reason WPVibe works the way it does. The AI does the work. Anything permanent stops and waits, because a delete that skips the trash is not something software should decide on its own.

John Turner

21,029 views • 27 days ago

this is pure f*cking treasure TypeSafeAI engineers spelled out in their docs exactly how Jev fits inside an agent, and these patterns are perfect one rule behind all of them: the LLM thinks, jev decides, code acts I mapped them into 9 live schemes: > model routing jev picks the cheapest model that can do the step > guardrails screens what your agent reads before it acts > tool-call gating every tool call gets allow, ask or deny before it runs > inbox triage the agent only opens what actually needs a reply > reranking jev scores 30 passages, the agent gets the best two > llm evals grades the output and sends it back if it falls short > bulk labeling one question fanned out over a huge table, the agent reads the counts > real-time control games, bots, trading loops: a decision every tick > confidence gate act, confirm or hand it to a human. your code sets the thresholds, not the LLM why it works: > ~100 ms per decision > $0.042 per 1M input tokens, output tokens free > calibrated probabilities on every answer one LLM does the thinking. jev makes the thousand small calls in between save this before you wire your next agent

this is pure f*cking treasure TypeSafeAI engineers spelled out in their docs exactly how Jev fits inside an agent, and these patterns are perfect one rule behind all of them: the LLM thinks, jev decides, code acts I mapped them into 9 live schemes: > model routing jev picks the cheapest model that can do the step > guardrails screens what your agent reads before it acts > tool-call gating every tool call gets allow, ask or deny before it runs > inbox triage the agent only opens what actually needs a reply > reranking jev scores 30 passages, the agent gets the best two > llm evals grades the output and sends it back if it falls short > bulk labeling one question fanned out over a huge table, the agent reads the counts > real-time control games, bots, trading loops: a decision every tick > confidence gate act, confirm or hand it to a human. your code sets the thresholds, not the LLM why it works: > ~100 ms per decision > $0.042 per 1M input tokens, output tokens free > calibrated probabilities on every answer one LLM does the thinking. jev makes the thousand small calls in between save this before you wire your next agent

NO1ennn

24,699 views • 14 days ago

Stop manually making flowcharts. Try this GitHub skill with Claude Code. I found an open-source tool that turns a plain description of a software system into a clean, interactive diagram. It's called Archify, and it has more than 66,000 stars on GitHub. You add it as a skill to an AI coding agent like Claude Code, Codex, Cursor, or OpenCode. Then you describe the system in the chat in one line. Archify turns that line into a single HTML file you can open, click through, and send to anyone. If you point your agent at an existing codebase, it reads the code and Archify maps how the pieces connect. I liked five things about it. 1. It makes five kinds of diagrams, including system maps and step-by-step workflows. 2. You can click any piece and trace what connects to it. 3. It checks the layout before it hands the diagram over, so arrows don't pile up and labels don't overlap. 4. It has dark and light themes and exports to PNG, SVG, or a short video. 5. You keep editing in plain chat, with requests like "add Redis" or "highlight the rollback path." You don't need a codebase to use it. A description in the chat is enough.

Stop manually making flowcharts. Try this GitHub skill with Claude Code. I found an open-source tool that turns a plain description of a software system into a clean, interactive diagram. It's called Archify, and it has more than 66,000 stars on GitHub. You add it as a skill to an AI coding agent like Claude Code, Codex, Cursor, or OpenCode. Then you describe the system in the chat in one line. Archify turns that line into a single HTML file you can open, click through, and send to anyone. If you point your agent at an existing codebase, it reads the code and Archify maps how the pieces connect. I liked five things about it. 1. It makes five kinds of diagrams, including system maps and step-by-step workflows. 2. You can click any piece and trace what connects to it. 3. It checks the layout before it hands the diagram over, so arrows don't pile up and labels don't overlap. 4. It has dark and light themes and exports to PNG, SVG, or a short video. 5. You keep editing in plain chat, with requests like "add Redis" or "highlight the rollback path." You don't need a codebase to use it. A description in the chat is enough.

Alex Veremeyenko

61,928 views • 25 days ago

A simple MPC controller for path tracking implemented in python. Few resources actually teach it without assuming a PhD first. This open-source project does exactly that: An iterative MPC tracking controller (built with CVXPY and MuJoCo) that shows how to make a robot (or autonomous vehicle) follow a path and avoid obstacles in real time. → Autonomous logistics, robot navigation, vehicle control; there's a path-following algorithm behind all of it. → Most implementations are black boxes. This one shows you what's actually happening. → It uses convex optimization (no non-linear solver), and still handles real vehicle physics through iterative linearization. What makes it practical is that you can run it with the mushr car model in MuJoCo, or headless without any physics simulation if you just want to understand the logic. If you're making the jump from classical control to real-time optimisation, this is a very good starting point. 📌 Repository: ——- Weekly robotics and AI insights. Subscribe free:

A simple MPC controller for path tracking implemented in python. Few resources actually teach it without assuming a PhD first. This open-source project does exactly that: An iterative MPC tracking controller (built with CVXPY and MuJoCo) that shows how to make a robot (or autonomous vehicle) follow a path and avoid obstacles in real time. → Autonomous logistics, robot navigation, vehicle control; there's a path-following algorithm behind all of it. → Most implementations are black boxes. This one shows you what's actually happening. → It uses convex optimization (no non-linear solver), and still handles real vehicle physics through iterative linearization. What makes it practical is that you can run it with the mushr car model in MuJoCo, or headless without any physics simulation if you just want to understand the logic. If you're making the jump from classical control to real-time optimisation, this is a very good starting point. 📌 Repository: ——- Weekly robotics and AI insights. Subscribe free:

Ilir Aliu

16,064 views • 1 month ago

Own your personal agent, folks. Just built my own little personal agent with Pi's Pi Durable. I wanted to see how quickly I could build an OpenAI dots clone with open-source tools. I am amazed at how quickly I got this off the ground. It's proactive. It keeps working when you're not watching. It remembers you, runs jobs on a schedule, waits for your approval, and uses its own computer. Pi Durable makes that possible. Every step is checkpointed. I can kill the process mid-task, and My Pi picks up right where it left off. Memory lives in durable documents. What My Pi learns about me in one Space survives a crash and carries over to every other Space. Approvals are durable too. It also has its own computer. Each Space gets a full Linux desktop that My Pi controls with screenshots, mouse, and keyboard. The model runs through OpenRouter, so I can swap models without changing anything else. That's all configurable however you like it. If you've been wanting your own personal agent, now is a great time to build one. I am building this as an experimental ground where I can test new ideas and experiment deeply with proactive personal agents. But I plan to open-source it after testing it a bit and adding more interesting primitives. The goal is to make it customizable and easy to build on, so others can experiment with their own personal agent functionalities.

Own your personal agent, folks. Just built my own little personal agent with Pi's Pi Durable. I wanted to see how quickly I could build an OpenAI dots clone with open-source tools. I am amazed at how quickly I got this off the ground. It's proactive. It keeps working when you're not watching. It remembers you, runs jobs on a schedule, waits for your approval, and uses its own computer. Pi Durable makes that possible. Every step is checkpointed. I can kill the process mid-task, and My Pi picks up right where it left off. Memory lives in durable documents. What My Pi learns about me in one Space survives a crash and carries over to every other Space. Approvals are durable too. It also has its own computer. Each Space gets a full Linux desktop that My Pi controls with screenshots, mouse, and keyboard. The model runs through OpenRouter, so I can swap models without changing anything else. That's all configurable however you like it. If you've been wanting your own personal agent, now is a great time to build one. I am building this as an experimental ground where I can test new ideas and experiment deeply with proactive personal agents. But I plan to open-source it after testing it a bit and adding more interesting primitives. The goal is to make it customizable and easy to build on, so others can experiment with their own personal agent functionalities.

elvis

35,547 views • 9 days ago

I built a custom TradingView indicator with Claude Code & Fable 5. It's called the Storm Gauge and is built off a real quant trading strategy. I open-sourced the full code on GitHub. Free to install, free to fork, yours to improve. Here's how to install a quant indicator on your TradingView chart: What it actually is The Storm Gauge is a live implementation of the GARCH model, a Nobel Prize-winning volatility framework that real quant desks run daily. It forecasts how "violent" tomorrow's market could be by combining three inputs: an asset's baseline volatility, yesterday's shock, and where volatility was already sitting before that shock happened. It doesn't predict market direction. Instead, it measures risk, in real time, on your actual chart. How to install it Method 1. Plugin command Open the GitHub repo: Find the installation section, copy the command, and paste it into Claude Code. It runs the plugin install automatically. Method 2. Manual config Open garchmethod.md in the repo, copy the entire file, and paste it into Claude Code. It fetches the skill files directly and verifies the strategy for you. (you only need one method; I'm just showing both) Getting it onto your TradingView chart Inside the repo, there's a Pine Script folder. Open it, copy the entire file. Go into TradingView's Pine Editor, paste it in, hit Enter, and refresh. That's it. The Storm Gauge now runs live on your chart as a real number. Once it's installed, just talk to it: → "What's the volatility forecast on Bitcoin?" → "Explain what the current volatility forecast means on $BTC and how it should impact my position sizing" → "Help me size my S&P500 position according to current market volatility" Does it actually work? I backtested the same EMA cross strategy two ways across 15 years of BTC data. Same entries, same exits. → Fixed position sizing: $17,957 final equity → Storm Gauge (GARCH) sizing: $21,205 final equity Fewer drawdowns, less risk, better result. Full breakdown of the entire build process in my recent article - pinned on my profile.

Miles Deutscher

56,625 views • 2 months ago

I was super intrigued when I noticed that JEV returns not just probs for candidate choices, but also a CONFIDENCE SCORE of it's prediction... I was wondering if TypeSafe AI brought back Bayesian Networks or something to learn uncertainty. Turns out - NO. Acc to their docs, confidence is just a derived metric from the classification scores. It carries ZERO extra information. Their demo page shows: confidence = (3 × largest probability − 1) / 2 Confidence is tightly coupled with the classification scores it is measuring the uncertainty for. There is no magic here. The model can produce high probability on a wrong choice and just be confidently wrong.

I was super intrigued when I noticed that JEV returns not just probs for candidate choices, but also a CONFIDENCE SCORE of it's prediction... I was wondering if TypeSafe AI brought back Bayesian Networks or something to learn uncertainty. Turns out - NO. Acc to their docs, confidence is just a derived metric from the classification scores. It carries ZERO extra information. Their demo page shows: confidence = (3 × largest probability − 1) / 2 Confidence is tightly coupled with the classification scores it is measuring the uncertainty for. There is no magic here. The model can produce high probability on a wrong choice and just be confidently wrong.

AVB

66,564 views • 24 days ago

90% of "AI developers" just download pre packaged GGUF files from Hugging Face, hit run, and call it a day. The top 10% know how to pull the raw safetensors, run the math, and quantize massive models into Q4_K_M themselves. If you think llama.cpp can only execute models, you’re missing the best part of the open source ecosystem. It’s a high performance optimization suite. Manually stripping 69% of the VRAM footprint off a brand new model architecture is where real infrastructure value is made. If you want to actually master local inference and deploy models like Google’s massive Gemma 4 12B it on consumer NVIDIA hardware using llama.cpp, you need to learn this pipeline. Let's build it. I just took the raw 22.7 GB Gemma 4 baseline and manually compressed it down to a 7.02 GB Q4_K_M GGUF artifact using llama.cpp. That is a 69% reduction in footprint. No quality loss. No VRAM bottlenecks. Just native, hardware accelerated C++ inference running a full 2,50,000 token context window on a dual NVIDIA Tesla T4 setup. Stop melting your VRAM on unoptimized weights and stop relying on other people's pipelines. Own your stack. I mapped this entire architecture from dynamic binary fetching to raw quantization and real time GPU streaming into a single, bulletproof notebook. Notebook link is in the comments below. Bookmark this blueprint for your next deployment and tell me which quantization works best for your workflow and model.

Alok

62,631 views • 3 months ago

Stop renting a chatbot and calling it your company’s brain. Utopia is the first open-source enterprise world model I’ve seen that actually treats knowledge like a system, not a vibe. It's a Self-hosted, open source and built around the one question every other knowledge base ignores: when. Every fact in it carries a start date and an end date. Nothing gets overwritten. When something changes, the correction closes the old version and opens a new one. The history stays intact. So the graph isn't a snapshot anymore. It's a recording you can rewind. You drag a timeline on the screen and watch the whole thing redraw itself to show what was true on that date. Who owned what. What the policy said before it changed. All of it, replayable. And every fact points back to the exact sentence it came from. Nothing gets in without a receipt. Here's the part that got me. The whole thing is one binary and one Postgres database. That's it. No Elasticsearch, no separate vector service and no message queue. Most RAG stacks are six services duct-taped together. This is two. It even runs fully offline on an air-gapped network with any model you want.

Stop renting a chatbot and calling it your company’s brain. Utopia is the first open-source enterprise world model I’ve seen that actually treats knowledge like a system, not a vibe. It's a Self-hosted, open source and built around the one question every other knowledge base ignores: when. Every fact in it carries a start date and an end date. Nothing gets overwritten. When something changes, the correction closes the old version and opens a new one. The history stays intact. So the graph isn't a snapshot anymore. It's a recording you can rewind. You drag a timeline on the screen and watch the whole thing redraw itself to show what was true on that date. Who owned what. What the policy said before it changed. All of it, replayable. And every fact points back to the exact sentence it came from. Nothing gets in without a receipt. Here's the part that got me. The whole thing is one binary and one Postgres database. That's it. No Elasticsearch, no separate vector service and no message queue. Most RAG stacks are six services duct-taped together. This is two. It even runs fully offline on an air-gapped network with any model you want.

Hasan Toor

176,136 views • 1 month ago

Big moment for text-to-speech. Qwen just open-sourced a text-to-speech model that lets you clone voices, design new ones, and control speech using natural language. Let me explain what I mean: You can literally tell it "speak in a cheerful tone with slight nervousness," and it actually does that. No complex audio engineering needed. What makes this special: - 3-second voice cloning - Covers 10 languages: English, German, French, and more - Latency as low as 97ms for real-time applications - Supports both streaming and non-streaming generation The model comes in two sizes (0.6B and 1.7B parameters), so you can pick based on your hardware and quality needs. Three modes to work with: 1. Custom Voice: Use pre-built premium voices with instruction-based style control 2. Voice Design: Describe the voice you want in plain English (or Chinese), and the model creates it 3. Voice Clone: Provide a 3-second reference audio and clone that voice The best part? It integrates with vLLM for production deployment and has a simple Python package you can pip install. I've shared a link to the GitHub repo in the next tweet.

Big moment for text-to-speech. Qwen just open-sourced a text-to-speech model that lets you clone voices, design new ones, and control speech using natural language. Let me explain what I mean: You can literally tell it "speak in a cheerful tone with slight nervousness," and it actually does that. No complex audio engineering needed. What makes this special: - 3-second voice cloning - Covers 10 languages: English, German, French, and more - Latency as low as 97ms for real-time applications - Supports both streaming and non-streaming generation The model comes in two sizes (0.6B and 1.7B parameters), so you can pick based on your hardware and quality needs. Three modes to work with: 1. Custom Voice: Use pre-built premium voices with instruction-based style control 2. Voice Design: Describe the voice you want in plain English (or Chinese), and the model creates it 3. Voice Clone: Provide a 3-second reference audio and clone that voice The best part? It integrates with vLLM for production deployment and has a simple Python package you can pip install. I've shared a link to the GitHub repo in the next tweet.

Akshay 🚀

31,249 views • 8 months ago

A good technical LLM interview question: Your LLM chatbot takes 12s before it generates the first token, and the users are complaining. So you move the model onto a GPU with 3x the computing power. The time to first token barely improves. Why did this happen? (answer below) Latency in an LLM app is a placement problem disguised as a model problem. If you profile the 12 seconds, the model's prefill itself may only account for around 1.5 seconds of it. So halving the prefill step saves just 750ms out of 12000, which is under 7%. The rest is spread across stages that never touch the GPU. The request first travels to whatever region the app runs in, and a cross-continent round trip could cost over a second before any code executes. Then the request handler starts. On a container-based serverless platform under load, this adds several seconds of cold start, paid before auth, rate limiting, or prompt assembly even begins. Retrieval adds its own hop, and the response streams back across the same distance. Optimizing a stage that was already fast cannot alter the latency that's majorly affected by other stages. Those other stages are slow for a structural reason. An LLM app runs two workloads that want opposite machines. - The request path is short, spiky, and needs to sit close to users - Inference is long-running, GPU-bound, and billed hourly, whether requests arrive or not. So the actual decision is not which model to run, but where each of these two workloads runs. There are three options, each with its own tradeoffs: > A dedicated GPU box removes inference cold starts, but it bills around the clock and lives in one location, so distant users wait out the round trip on every request > Container-based serverless scales to zero, but the request path pays a cold start, and most of these platforms have no GPU behind them. > Edge runtimes start in under a millisecond, because a WebAssembly module carries no OS or container image to boot. They handle the request path well and cannot hold a model. So the answer is not to pick one, but to split the app across two of them. The request path runs close to users, and inference runs on a dedicated GPU it calls into. That also explains the failed upgrade. More compute made a stage that was already fast faster, and left the 10.5 seconds around it untouched. To actually learn how it's done in practice, Akamai's GitHub has a reference implementation for each half. - vllm-on-lke serves Qwen2.5-7B-Instruct behind an OpenAI-compatible endpoint on one RTX 4000 Ada GPU in Linode Kubernetes Engine, with Terraform creating the cluster, both firewalls, and the GPU operator in one apply. - akamai-functions-llm-chatbot covers the front, where a WebAssembly API checks a KV cache and only calls the GPU-backed instance on a miss. Both are available on Akamai’s new Developer Hub, alongside their tutorials and code samples. It also links to Edge Case, their Discord, where four developer advocates architect and deploy a production app live every other Wednesday. If you create a new Akamai Cloud account, you can also get $300 in credits for joining. Join here: That said, this post treats generation as a single 1.5s block, but that block has its own structure, and knowing it well tells you whether a model is slow to start or slow to stream. I wrote a first-principles walkthrough of it, covering the prefill and decode split, KV caching, and where the time actually goes inside each one. Read it below. Thanks to Akamai Cloud for partnering today!

Avi Chawla

21,786 views • 1 month ago

introducing a new, very fun, LLM benchmark- the Game-of-Life Bench! the rules are simple: given an 8x8 grid following Conway's game of life rules, the goal is to create an initial pattern with at most 32 cells that can last the longest number of turns before dying/repeating. some results to highlight (with caveats detailed below): - gpt 5.1 lasts the longest with a 106 step run - claude models are really bad at this! they refuse to reason about this task and score < 25 points - deepseek r1 is the best open model with 102 steps. why? because i wanted to create a benchmark that has (i think) no practicality, but is still fun to look at, cheap, and still measures something interesting. i also am a big fan of the game of life. its absurdly simple rules leading to intractability is extremely cool to me. also, i saw a lot of work with LLMs trying to "predict" the next state in Conway's game of life, I think game-of-life bench is more fun because it's pretty open ended and only asks the LLM for the initial state. I also think this could be an RL env? but idk why you would ever train on this task haha i don't think this is a "serious" benchmark because it doesnt measure anything practical, but i still think it's a hard benchmark exactly because you can't predict what happens with your initial state many turns into the future; this is why i was initially expecting all LLMs to be bad at it, but turns out, some are clearly better than the others (the ordering may surprise you!) reminder: this is still a work-in-progress; (1) i am gpu-poor so could only do 10 runs for each model, even though total running cost is relatively low. maybe with some more credits i can run more seeds for each model. (2) i handpicked models which i think are at the frontier right now, plus some others that were on my mind. so, if you'd like to see a model on here, let me know. (3) i currently only do an 8x8 grid because i thought that by itself would be pretty hard for current LLMs, but of course we can increase grid sizes! (4) the coolest thing is, i dont think we can calculate the max possible number of states (yay undecidability!) you can go without repeating, so this is essentially a no-ceiling task, which is pretty cool! again, i did this mostly out of a desire to make LLMs do something fun. if this keeps me entertained for a few more days, i'd likely release a blog post on it. if it keeps me entertained for a week (and someone sponsors me), i'll put more work into it :P lastly, this is fully open sourced, so feel free to run this on your own!

introducing a new, very fun, LLM benchmark- the Game-of-Life Bench! the rules are simple: given an 8x8 grid following Conway's game of life rules, the goal is to create an initial pattern with at most 32 cells that can last the longest number of turns before dying/repeating. some results to highlight (with caveats detailed below): - gpt 5.1 lasts the longest with a 106 step run - claude models are really bad at this! they refuse to reason about this task and score < 25 points - deepseek r1 is the best open model with 102 steps. why? because i wanted to create a benchmark that has (i think) no practicality, but is still fun to look at, cheap, and still measures something interesting. i also am a big fan of the game of life. its absurdly simple rules leading to intractability is extremely cool to me. also, i saw a lot of work with LLMs trying to "predict" the next state in Conway's game of life, I think game-of-life bench is more fun because it's pretty open ended and only asks the LLM for the initial state. I also think this could be an RL env? but idk why you would ever train on this task haha i don't think this is a "serious" benchmark because it doesnt measure anything practical, but i still think it's a hard benchmark exactly because you can't predict what happens with your initial state many turns into the future; this is why i was initially expecting all LLMs to be bad at it, but turns out, some are clearly better than the others (the ordering may surprise you!) reminder: this is still a work-in-progress; (1) i am gpu-poor so could only do 10 runs for each model, even though total running cost is relatively low. maybe with some more credits i can run more seeds for each model. (2) i handpicked models which i think are at the frontier right now, plus some others that were on my mind. so, if you'd like to see a model on here, let me know. (3) i currently only do an 8x8 grid because i thought that by itself would be pretty hard for current LLMs, but of course we can increase grid sizes! (4) the coolest thing is, i dont think we can calculate the max possible number of states (yay undecidability!) you can go without repeating, so this is essentially a no-ceiling task, which is pretty cool! again, i did this mostly out of a desire to make LLMs do something fun. if this keeps me entertained for a few more days, i'd likely release a blog post on it. if it keeps me entertained for a week (and someone sponsors me), i'll put more work into it :P lastly, this is fully open sourced, so feel free to run this on your own!

Akshit

13,775 views • 7 months ago