Video wird geladen...

Video konnte nicht geladen werden

Zur Startseite

Another WTF moment. A developer just open-sourced a coding agent harness that boots 245x faster than Claude Code. It's called jcode. You launch it and the first frame renders in 14 milliseconds. Claude Code takes 3,436. One active session uses 27.8 MB of RAM. Claude Code uses 386.6. Run...

207,858 Aufrufe • vor 1 Monat •via X (Twitter)

0 Kommentare

Keine Kommentare verfügbar

Kommentare vom Original-Post werden hier angezeigt

Ähnliche Videos

EVERYONE'S TRYING TO SOLVE AI TEAM MEMORY WITH SERVERS, VECTOR DATABASES, AND ORCHESTRATION PLATFORMS. THIS OPEN SOURCE TOOL DOES IT WITH ONE FOLDER IN YOUR REPO. Every dev on your team runs Claude Code. When one agent screws something up, the rest have no idea. They just repeat the mistake next week. It's called teamlore. When your agent gets corrected or breaks something, it writes a small lore file into a .lore/ folder. That file ships with your PR, gets reviewed like normal code, and after merge every teammate's agent automatically recalls it when they touch that part of the repo. No server. No datab No accounts. No SaaS bill. Just a folder in git. Which means code review catches bad lessons before they poison the team, git blame tells you when a rule was added and why, and the whole thing works offline. One command to install: npx teamlore init Companion command: npx teamlore scarmap. Turns your team's history of mistakes into a visual heat map of the codebase. Every red zone is a place your team has been burned before. Which means every red zone is a place your agents should slow down. Here's the wildest part. The teamlore repo's own .lore/ folder contains every mistake Claude made while building teamlore itself. Dogfooded end-to-end. You can literally open the folder and read the receipts. The author's public invitation: "Would love for someone to try and break it." Available on npm. Repo just launched. 100% open source. (link in the comments)

Harman

35,140 Aufrufe • vor 1 Monat

I just built a Meta Ads diagnostic in Claude Code that tells you WHY your account broke, not just what changed 🤯 It spins up a team of agents that each investigate a different reason performance dropped, then argue against each other to kill the wrong answer before it ever reaches you. All inside Claude Code. Perfect for DTC brands and agencies who panic-kill creative the second CPA spikes. If you've watched ROAS fall off a cliff and opened Ads Manager with ten tabs going, you already know what happens next. Your gut says "creative fatigue." You kill your best-performing ad. A week later performance is still broken, because that was never the problem. Guessing wrong is the most expensive move in paid social. This workflow ends the guessing: → One agent investigates each competing theory — creative fatigue, budget and delivery changes, traffic quality, offer and seasonality → Each one is blind to the others, reasoning only from its own slice of the data so they can't bias each other → A refuter agent then attacks every surviving theory and tries to kill it → A theory only stands if the data can't disprove it → You get a ranked diagnosis: the real cause, the evidence for and against it, and the one move to make this week No anchoring on the first obvious answer. No killing winning creative on a hunch. No "here's what happened" reports that never tell you why. What you get: → Every theory tested in parallel instead of one biased guess → An adversarial pass that kills the wrong answer before you act on it → A ranked diagnosis with confidence levels and evidence both ways → A reusable workflow you drop next month's export into and re-run Built 100% in Claude Code with the new dynamic workflows. The first account I ran it on looked like textbook creative fatigue. The workflow disagreed, and traced the real cause to a budget change that had doubled spend and flooded delivery with junk traffic. I put together a full playbook with the exact workflow, the prompt, and how to run it on your own account. Want it for free? > Like this post > Comment "META" And I'll send it over (must be following so I can DM)

Mike Futia

12,847 Aufrufe • vor 3 Monaten

Claude Code Agent Teams are f*cking ridiculous 🤯 One prompt → a team lead breaks your project into pieces, spins up multiple AI agents, and they all work on different parts simultaneously. Research, builds, reviews, and debugging: all happening at the same time. All inside Claude Code. If you're running complex projects where every step waits on the last one... Agent teams eliminate the entire bottleneck: → Tell Claude what you need and describe the team structure in plain English → A lead agent breaks the work into a shared task list → It spawns 3-5 teammates — each with their own context and workspace → Teammates research, build, test, and review in parallel → They message each other, share findings, and challenge each other's work → The lead synthesizes everything into a finished deliverable No managing agents yourself. No waiting for step 1 to finish before step 2 starts. No single-lens reviews that miss half the issues. What you get: → Competitive research across 5 brands done in minutes instead of hours → Multi-component builds where frontend, backend, and data layers happen simultaneously → Creative reviews from 3 different angles at once — brand voice, conversion, differentiation → Funnel debugging where 4 agents investigate 4 theories and debate until they find the real answer Built 100% in Claude Code with one settings change. I put together a full DTC playbook: 5 workflows with copy-paste prompts, the exact setup process, token management tips, and honest guidance on when agent teams are worth it vs. when a simpler approach is the better move. Want it for free? > Like this post > Comment "AGENTS" And I'll send it over (must be following so I can DM)

Mike Futia

46,478 Aufrufe • vor 6 Monaten

this is worth more than most five figure courses 16 claude agents audit an entire repo at once, a second fleet re-checks every finding on fresh context, and the whole thing runs off one diagram instead of a prompt i ran it against my own code and got back 11 endpoints where i never checked who was logged in, 3 of which the verifier threw out before they ever reached me this is Graph Engineering, the layer above prompting, and it runs on the agent you already pay for: - write your plan out, then ask one question at every "and then": does the next step actually read what the previous one produced - the seams that fail that question were never dependencies, so those jobs run at the same time - the arrows that survive are your real edges, and the longest chain of them is your floor that no number of agents shortens - want it faster, cut a false edge instead of adding a worker - fan the independent work out, one agent per item, no shared state between them - send every finding to a separate agent on fresh context, because a model recognises its own writing 73.5% of the time and grades it kinder once it does - make that verifier check a real signal like a passing test, never the worker's own word that it finished - shard the fleet across worktrees so parallel workers stop overwriting each other, one rule frozen into every worker: never git stash, never git reset - merge only what came back verified, into one report instead of twenty open chats the catch is the ceiling. at 95% independent work 16 agents return 9.14x rather than the 16 you would guess, and even 256 only reach 18.6x, because the merge and the verify stay serial however wide you fan coordination itself is free plain code and every agent underneath it is billed, so start at twenty files and widen once it works bookmark this, the whole method with all six ready-to-run graphs is written out in the article ↓

Argona

157,312 Aufrufe • vor 1 Monat

somebody explain this because i refuse to accept it someone ran 48 scored trials and one agent beat a whole fleet of them on all 6 task families, at 0.93 cents a run against 1.9, while openai's best fleet shape was paying $0.008 for every single point of accuracy it bought i read it expecting a hit piece and found the opposite: the fleets that partitioned the dependency graph properly lifted pass rate 14% and cut wall-clock 2.10x on the same tasks, and one of them beat claude code with agent teams the thing that decides it has a name, Graph Engineering, and it is a property of the diagram rather than the model: - partition on the real dependency graph pulled from static analysis, never by folder or by file, because the gains land hardest on the most dependency-dense projects - isolate the structural hub files first, since those are the nodes every partition would otherwise have to share - measure the critical path and treat it as the floor, because a chain that genuinely feeds itself cannot be replaced by more workers and wrapping it in a scheduler does not shorten it - match the topology to the coupling instead of defaulting to parallel: on coupled work a static parallel shape drops below a single agent, so the mismatch is worse than no orchestration - remember each worker serialises its own subtasks, which adds edges inside every agent that were never in your plan - budget the fan-out before you fire it, because three agents already burn roughly three times the tokens and the multiplier compounds across sessions - check worker count against your rate limit, since fifteen workers at ten requests a second walk straight through a hundred-per-second ceiling and cascade - put a script gate in front of the planner: it costs 0.15 seconds and zero tokens, and it lets the expensive model skip 43 to 63% of the steps for at most 1.4 points of accuracy the catch is the coordination tax, and it scales with how clever the shape looks: 58% extra reasoning turns for independent workers, 263% decentralised, 285% centralised, and 515% for the hybrid setup everyone reaches for first the same paper found that hybrid then collapses hardest on tool-heavy work at a 0.452 success rate, while the plainer decentralised shape beat centralised outright despite carrying more overhead, because parallel efficiency is what survives bookmark this, the whole build sits in the article ↓

Argona

32,932 Aufrufe • vor 1 Monat

whoever leaked this has bigger balls than sense Google Research and MIT ran the same agent jobs 260 different ways for Nature last month: they held the prompts, the tools and the compute budget identical and moved nothing but the wiring between the agents, and the same work swung from 70% worse than a single agent to 80.8% better, averaging out at 0.0% i ran my own single agent against the task list first and it cleared 6 of 10 alone, already past the line where a crew starts subtracting this is Graph Engineering, the layer that decides whether a crew is worth 80% more or 70% less, and it installs into the agent you already pay for: - score your solo agent on the real task first: above roughly 45% success that study predicts zero to negative returns from any crew you put around it - under that line, put one supervisor over the fan out: crews with no correction step amplified their own errors to 17.2x the single agent rate, supervised aggregation held it to 4.4x - give every worker one output and let none of them read a peer's draft, so a wrong step reaches the supervisor instead of four other agents - run the comparison again after every model upgrade, because a better model raises your baseline and a higher baseline is what makes a crew stop paying - keep the single agent alive as the control, the only number that says the wiring is earning its calls turns out the shape does not travel: the biggest win came off a finance task under one supervisor and the worst collapse off a planning task with independent agents my position, and it is the arguable one: a crew is a bet on your own diagram, and the model you pick moves that bet less than one arrow does bookmark this, the three moves that draw those arrows before you pay for one extra call are in the post below ↓

Argona

891,053 Aufrufe • vor 1 Monat

I just built a Meta ad policy checker in Claude Code that catches rejections BEFORE Meta does 🤯 Drop in your ad copy → it pulls Meta's LIVE Advertising Standards, checks every line against the actual policy text, and hands each ad a verdict: Cleared for launch, Fix before launch, or Grounded. All inside Claude Code. Perfect for media buyers and DTC brands who've had ads bounced — or an account restricted — and never got a straight answer why. If you're finding out about policy problems only after the rejection email, resubmitting the same ad and praying, losing days of delivery while the appeal sits in review, and every bounce quietly teaches Meta to trust your account a little less... This runs the review before Meta ever sees the ad: → Drop in your ad copy (one ad or a whole batch) → It reads each ad and figures out which of Meta's policies apply → Scrapes the live policy pages from Meta's Transparency Center → Flags the exact phrase that violates, with Meta's own policy quoted next to it → Rewrites the risky lines so the message survives but the violation doesn't → Renders a dashboard: every ad, every finding, every fix in one place No guessing which word killed the ad. No resubmit-and-pray loops. No stacking rejections on your account history. What you get: → A verdict on every ad before you spend a dollar → The violating phrase + the policy citation, side by side → Rewrites that keep the selling intent → A report you can hand straight to your team or client Built 100% in Claude Code. No API keys, no Meta login. I'm giving away the complete Claude skill file. Want the skill for free? > Like this post > Comment "META" And I'll send it over (must be following so I can DM)

Mike Futia

17,478 Aufrufe • vor 2 Monaten

Introducing fx, a tiny, open, native coding agent from Vercel Labs. Originally an internal tool, fx is a harness and CLI written in Zig, optimized for research and embedding in larger systems. Today, we're open sourcing it. fx is built on three principles: 1. Fast. A single native binary, no runtime to install. It cold starts in 10µs and does no unnecessary work or I/O before accepting input. fx is the answer to "how fast can a coding agent be?" 2. Light. The 6.3MiB binary uses single-digit megabytes of memory at baseline, made for instant installation and embedding in resource-constrained environments and agent sandboxes. 3. Open. Apache-2.0, model and provider agnostic, suitable for local and cloud inference. Its small core extends through skills, plugins, and MCP. Minimalism is an obsession throughout the entire harness: system prompt, tools, features, binary. The goal was to keep context usage and time to first token low, and make fx optimal for model benchmarking, sandboxing, evals, and gyms. You can use fx directly or embed it as infrastructure. The CLI feels more like a Unix shell than an IDE in the terminal: it preserves scroll history, produces minimal output, and uses complex TUI rendering very, very sparingly. Programmatically, 𝚏𝚡 𝚊𝚜𝚔 --𝚓𝚜𝚘𝚗 gives structured output, 𝚏𝚡 𝚊𝚌𝚙 connects to editors and other clients, and WebAssembly can even run the whole thing inside the browser (see: Privacy is a design constraint: no product telemetry, sessions and usage stay local, and no source code or prompts are shared with any endpoint other than inference. With local inference and auto-updates off, fx is fully hermetic. fx is experimental. Use at your own risk and expect frequent changes. Chat with us on X ( or file issues ( 𝚌𝚞𝚛𝚕 -𝚏𝚜𝚂𝙻 𝚏𝚡.𝚜𝚑/𝚜𝚎𝚝𝚞𝚙.𝚜𝚑 | 𝚋𝚊𝚜𝚑

Vercel Developers

957,125 Aufrufe • vor 26 Tagen