Congratulations to Sam Pasupalak, not Sam Altman. Sam Pasupalak's team just beat Sam Altman's team in engineering design at the Wrobench.
It's 100x faster and 150x cheaper than GPT-6 Astra.
Introducing SKY-001, the first Engineering World Model.
On CAD and BIM tasks, it beats GPT-6 Astra and every frontier model we tested:
-> 51-125x faster
- > 150-210x cheaper
-> Higher IOU than all frontier models
SKY-001 lets you dream a physical object before you build it.
18 months of work. Built by the team out of Maluuba's deep learning lab (acq. by @MSRResearch).
The first โAI General Engineerโ will be the backbone for Autonomous Manufacturing.
๐ฟ๐ฎ๐บ๐ฎ๐ธ๐ฟ๐๐๐ต๐ป๐ฎโ ๐ฒ/๐ฎ๐ฐ๐ฐ retweeted
๐ฉ๐ฒ๐ฐ๐๐ผ๐ฟ ๐ฅ๐๐ ๐๐ ๐ฉ๐ฒ๐ฐ๐๐ผ๐ฟ๐น๐ฒ๐๐ ๐ฅ๐๐ ๐๐ ๐๐ด๐ฒ๐ป๐๐ถ๐ฐ ๐ฅ๐๐
RAG tutorials teach you one pattern: chunk the document, embed it, store the vectors, search by similarity.
It works. Until someone asks a question where the answer depends on where something sits in the document, not just what it says.
Hereโs how three approaches handle the same problem, and why the field is slowly moving from searching text to navigating structure.
๐ฉ๐ฒ๐ฐ๐๐ผ๐ฟ ๐ฅ๐๐: find what looks similar. You take a long document, split it into fixed-size chunks, turn each chunk into a vector with an embedding model and store them in a vector database. When a question comes in, it gets embedded with the same model, and the system pulls back the top-k chunks that sit closest to it in vector space. The LLM writes an answer from those chunks.
๐ฉ๐ฒ๐ฐ๐๐ผ๐ฟ๐น๐ฒ๐๐ ๐ฅ๐๐: navigate the document like a person would. Vectorless RAG does exactly that. Instead of chunks and embeddings, it builds a hierarchical index of the document: root, chapters, sections, pages. When a question arrives, the LLM reads that tree, works out whatโs being asked and walks down the branches to the most relevant section.
๐๐ด๐ฒ๐ป๐๐ถ๐ฐ ๐ฅ๐๐: reason your way to the answer. Agentic RAG keeps the tree index and puts an agent in charge of it.
The question is usually complex or multi-step, the kind a single lookup canโt resolve. The agent first plans how to approach it. Then it explores the tree level by level:
โ Understand the intent behind the question
โ Explore the chapters that might be relevant
โ Evaluate the context at each level before going deeper
โ Follow the right branch down to the exact node
โ Check cross-references to other sections before committing to an answer
The result is grounded evidence: a specific page and section, verified against the rest of the document, and an answer that cites it.
The trade-off: itโs the slowest and most expensive of the three, and it needs good guardrails so the agent knows when to stop exploring.
So which one should you use?
๐ฉ๐ฒ๐ฐ๐๐ผ๐ฟ ๐ฅ๐๐ ๐๐ ๐ฉ๐ฒ๐ฐ๐๐ผ๐ฟ๐น๐ฒ๐๐ ๐ฅ๐๐ ๐๐ ๐๐ด๐ฒ๐ป๐๐ถ๐ฐ ๐ฅ๐๐
RAG tutorials teach you one pattern: chunk the document, embed it, store the vectors, search by similarity.
It works. Until someone asks a question where the answer depends on where something sits in the document, not just what it says.
Hereโs how three approaches handle the same problem, and why the field is slowly moving from searching text to navigating structure.
๐ฉ๐ฒ๐ฐ๐๐ผ๐ฟ ๐ฅ๐๐: find what looks similar. You take a long document, split it into fixed-size chunks, turn each chunk into a vector with an embedding model and store them in a vector database. When a question comes in, it gets embedded with the same model, and the system pulls back the top-k chunks that sit closest to it in vector space. The LLM writes an answer from those chunks.
๐ฉ๐ฒ๐ฐ๐๐ผ๐ฟ๐น๐ฒ๐๐ ๐ฅ๐๐: navigate the document like a person would. Vectorless RAG does exactly that. Instead of chunks and embeddings, it builds a hierarchical index of the document: root, chapters, sections, pages. When a question arrives, the LLM reads that tree, works out whatโs being asked and walks down the branches to the most relevant section.
๐๐ด๐ฒ๐ป๐๐ถ๐ฐ ๐ฅ๐๐: reason your way to the answer. Agentic RAG keeps the tree index and puts an agent in charge of it.
The question is usually complex or multi-step, the kind a single lookup canโt resolve. The agent first plans how to approach it. Then it explores the tree level by level:
โ Understand the intent behind the question
โ Explore the chapters that might be relevant
โ Evaluate the context at each level before going deeper
โ Follow the right branch down to the exact node
โ Check cross-references to other sections before committing to an answer
The result is grounded evidence: a specific page and section, verified against the rest of the document, and an answer that cites it.
The trade-off: itโs the slowest and most expensive of the three, and it needs good guardrails so the agent knows when to stop exploring.
So which one should you use?
Teslaโs new Roadster runs on SpaceX-style cold gas thrusters.
It's crazy to live. Isn't it?
We just saw a car fly, literally. What goes behind the tech actually?
I tried to explain in 1 minute. Let me know your views.
๐ฟ๐ฎ๐บ๐ฎ๐ธ๐ฟ๐๐๐ต๐ป๐ฎโ ๐ฒ/๐ฎ๐ฐ๐ฐ retweeted
Making an Action-Taking AI Agent Production-Ready
Imagine you are working at a food delivery company.
A customer receives cold biryani and requests a refund. Your payment API times out, so your code retries the request, assuming the first attempt failed.
But the first request actually succeeded.
The retry triggers another refund. And another.
One cold biryani. One API timeout. Three refunds to the same customer.
Now multiply this by thousands of orders.
The model didnโt fail. The system around it did.
I wrote a full breakdown of making an action-taking AI agent production-ready. Check it out here:
growtechie.substack.com/p/maโฆ
Making an Action-Taking AI Agent Production-Ready
Imagine you are working at a food delivery company.
A customer receives cold biryani and requests a refund. Your payment API times out, so your code retries the request, assuming the first attempt failed.
But the first request actually succeeded.
The retry triggers another refund. And another.
One cold biryani. One API timeout. Three refunds to the same customer.
Now multiply this by thousands of orders.
The model didnโt fail. The system around it did.
I wrote a full breakdown of making an action-taking AI agent production-ready. Check it out here:
growtechie.substack.com/p/maโฆ
๐ฟ๐ฎ๐บ๐ฎ๐ธ๐ฟ๐๐๐ต๐ป๐ฎโ ๐ฒ/๐ฎ๐ฐ๐ฐ retweeted
I keep seeing the same pattern with RAG projects.
Someone builds a prototype over a weekend. They connect a vector database, add a few PDFs, write a prompt, and ask it ten questions. Every answer looks right, the demo goes well, and everyone is happy.
Then it goes to real users, and within a week the complaints start.
โIt gave me the old refund policy.โ
โIt couldnโt find the error code I searched for.โ
โIt answered confidently, but the answer was completely made up.โ
The first reaction is usually to blame the model and switch to a bigger LLM. Most of the time that changes nothing, because the model was never the problem.
The real issue sits before the model ever sees the question. The right chunk was never retrieved, or it was cut in half during chunking, or it was buried under four passages that only looked relevant. The LLM did exactly what it was told and answered from bad context.
Reliable RAG is not about a smarter model. Itโs about giving the model the right information and keeping it honest about what that information says.
Hereโs the pipeline Iโd build today:
Chunk by structure : Split on headings, not token counts, and add the section heading to every chunk so it keeps its context.
Use hybrid retrieval : Vector search understands meaning but misses exact terms like product codes. BM25 catches those. Run both and merge the results with RRF.
Rerank 50 down to 5 : Retrieve wide for recall, then use a cross-encoder to keep only the best matches. If nothing passes the threshold, donโt force an answer.
Ground every answer : Tell the model to answer only from the sources, cite each claim, and clearly say when the docs donโt have the answer.
Evaluate both halves separately : Measure retrieval and generation on their own. Otherwise youโll never know which part actually broke.
Guard and monitor
Filter chunks by user permissions, re-index when documents change, and log every request so real failures become new test cases.
None of this is fancy. Itโs just the steady engineering work that turns a nice demo into something people can actually trust.
I keep seeing the same pattern with RAG projects.
Someone builds a prototype over a weekend. They connect a vector database, add a few PDFs, write a prompt, and ask it ten questions. Every answer looks right, the demo goes well, and everyone is happy.
Then it goes to real users, and within a week the complaints start.
โIt gave me the old refund policy.โ
โIt couldnโt find the error code I searched for.โ
โIt answered confidently, but the answer was completely made up.โ
The first reaction is usually to blame the model and switch to a bigger LLM. Most of the time that changes nothing, because the model was never the problem.
The real issue sits before the model ever sees the question. The right chunk was never retrieved, or it was cut in half during chunking, or it was buried under four passages that only looked relevant. The LLM did exactly what it was told and answered from bad context.
Reliable RAG is not about a smarter model. Itโs about giving the model the right information and keeping it honest about what that information says.
Hereโs the pipeline Iโd build today:
Chunk by structure : Split on headings, not token counts, and add the section heading to every chunk so it keeps its context.
Use hybrid retrieval : Vector search understands meaning but misses exact terms like product codes. BM25 catches those. Run both and merge the results with RRF.
Rerank 50 down to 5 : Retrieve wide for recall, then use a cross-encoder to keep only the best matches. If nothing passes the threshold, donโt force an answer.
Ground every answer : Tell the model to answer only from the sources, cite each claim, and clearly say when the docs donโt have the answer.
Evaluate both halves separately : Measure retrieval and generation on their own. Otherwise youโll never know which part actually broke.
Guard and monitor
Filter chunks by user permissions, re-index when documents change, and log every request so real failures become new test cases.
None of this is fancy. Itโs just the steady engineering work that turns a nice demo into something people can actually trust.
๐ฟ๐ฎ๐บ๐ฎ๐ธ๐ฟ๐๐๐ต๐ป๐ฎโ ๐ฒ/๐ฎ๐ฐ๐ฐ retweeted
This Claude Code is a skill that turns any idea into a live, interactive plate you can turn, light, and look inside. Attention, the heart, a power grid, and a hash map are some examples you can see.
GitHub repo: github.com/Ramakm/folio-anatโฆ
Just install and bring your own ideas into life in just secs.
- Install - Prompt: /folio explains how an electric motor turns
- It will create a single-page file to view in SVG, 3D, and WebGL formats. With lots more details.
- No crazy prompting - Just your ideas live in secs.
Inspired by the anatomy skill of Ryan.
This Claude Code is a skill that turns any idea into a live, interactive plate you can turn, light, and look inside. Attention, the heart, a power grid, and a hash map are some examples you can see.
GitHub repo: github.com/Ramakm/folio-anatโฆ
Just install and bring your own ideas into life in just secs.
- Install - Prompt: /folio explains how an electric motor turns
- It will create a single-page file to view in SVG, 3D, and WebGL formats. With lots more details.
- No crazy prompting - Just your ideas live in secs.
Inspired by the anatomy skill of Ryan.
๐ฟ๐ฎ๐บ๐ฎ๐ธ๐ฟ๐๐๐ต๐ป๐ฎโ ๐ฒ/๐ฎ๐ฐ๐ฐ retweeted
๐ฅ๐๐ ๐๐ ๐ข๐๐ ๐๐
๐ฝ๐น๐ฎ๐ถ๐ป๐ฒ๐ฑ
Ask your RAG chatbot โwhatโs our refund policy?โ & it might give you the right answer. Or it might give you last yearโs version, because that chunk happened to score 0.83 instead of 0.81.
Thatโs the quiet problem with RAG. It finds whatโs similar, not necessarily whatโs true. Google Cloud released something in June that takes a different approach. Itโs called OKF, the ๐ข๐ฝ๐ฒ๐ป ๐๐ป๐ผ๐๐น๐ฒ๐ฑ๐ด๐ฒ ๐๐ผ๐ฟ๐บ๐ฎ๐, and itโs almost boring in how simple it is.
There are no embeddings and no vector database. Itโs just a folder of Markdown files, one concept per file. Your refund policy lives in policies/refund. md. Your revenue definition lives in metrics/revenue. md. Each file has a small header saying what it is, and files link to each other like a wiki.
When an agent needs a fact, it doesnโt search. It opens the index, goes straight to the right file and reads it. If the policy changes, you edit one file and commit it to Git. You get a version history, an owner and a date, and nothing has to be re-embedded.
๐ฆ๐ผ ๐ถ๐ ๐ฅ๐๐ ๐ฑ๐ฒ๐ฎ๐ฑ? No.
OKF works for the small set of things that must be exactly right: definitions, rules, schemas. Nobody is hand-writing a Markdown file for 50,000 support tickets. Thatโs still RAGโs job.
The setup that makes sense to me is both, with a router in front. Known facts go to OKF and everything messy goes to RAG.
Search what you canโt curate. Curate what you canโt afford to get wrong.
๐ฅ๐๐ ๐๐ ๐ข๐๐ ๐๐
๐ฝ๐น๐ฎ๐ถ๐ป๐ฒ๐ฑ
Ask your RAG chatbot โwhatโs our refund policy?โ & it might give you the right answer. Or it might give you last yearโs version, because that chunk happened to score 0.83 instead of 0.81.
Thatโs the quiet problem with RAG. It finds whatโs similar, not necessarily whatโs true. Google Cloud released something in June that takes a different approach. Itโs called OKF, the ๐ข๐ฝ๐ฒ๐ป ๐๐ป๐ผ๐๐น๐ฒ๐ฑ๐ด๐ฒ ๐๐ผ๐ฟ๐บ๐ฎ๐, and itโs almost boring in how simple it is.
There are no embeddings and no vector database. Itโs just a folder of Markdown files, one concept per file. Your refund policy lives in policies/refund. md. Your revenue definition lives in metrics/revenue. md. Each file has a small header saying what it is, and files link to each other like a wiki.
When an agent needs a fact, it doesnโt search. It opens the index, goes straight to the right file and reads it. If the policy changes, you edit one file and commit it to Git. You get a version history, an owner and a date, and nothing has to be re-embedded.
๐ฆ๐ผ ๐ถ๐ ๐ฅ๐๐ ๐ฑ๐ฒ๐ฎ๐ฑ? No.
OKF works for the small set of things that must be exactly right: definitions, rules, schemas. Nobody is hand-writing a Markdown file for 50,000 support tickets. Thatโs still RAGโs job.
The setup that makes sense to me is both, with a router in front. Known facts go to OKF and everything messy goes to RAG.
Search what you canโt curate. Curate what you canโt afford to get wrong.
๐ฟ๐ฎ๐บ๐ฎ๐ธ๐ฟ๐๐๐ต๐ป๐ฎโ ๐ฒ/๐ฎ๐ฐ๐ฐ retweeted
๐๐ฎ๐บ๐ฒ ๐ง๐ต๐ฒ๐ผ๐ฟ๐ ๐ฏ๐ ๐๐ถ๐ฎ๐ฐ๐ผ๐บ๐ผ ๐๐ผ๐ป๐ฎ๐ป๐ป๐ผ
Probably one of the best book on Game Theory.
Access the PDF here: arxiv.org/pdf/1512.06808
๐๐ฎ๐บ๐ฒ ๐ง๐ต๐ฒ๐ผ๐ฟ๐ ๐ฏ๐ ๐๐ถ๐ฎ๐ฐ๐ผ๐บ๐ผ ๐๐ผ๐ป๐ฎ๐ป๐ป๐ผ
Probably one of the best book on Game Theory.
Access the PDF here: arxiv.org/pdf/1512.06808
๐ฟ๐ฎ๐บ๐ฎ๐ธ๐ฟ๐๐๐ต๐ป๐ฎโ ๐ฒ/๐ฎ๐ฐ๐ฐ retweeted
๐ฃ๐ฟ๐ผ๐ฑ๐๐ฐ๐๐ถ๐ผ๐ป ๐๐ฟ๐ฎ๐ฑ๐ฒ ๐ฅ๐๐ ๐ฆ๐๐๐๐ฒ๐บ
what every request goes through before you see an answer:
- Input guardrails block prompt injection, jailbreaks, and PII before any model runs.
- A router (an LLM call) decides which tools the question needs.
- Tools to fetch evidence: web search for fresh facts, hybrid search (keyword + vector) over your docs, and external APIs for live data.
- A reranker scores every chunk and keeps only the top few.
- Output guardrails check grounding, safety, and policy, with an LLM as the judge.
The answer generator writes from the reranked context only, with citations.
And the parts nobody demos, but every production system needs:
โ An audit trail. Every request, tool call, and answer is logged to PostgreSQL.
โ Observability. Trace spans stream into a pipeline so you can see exactly where a bad answer came from.
โ Evals. A fixed eval dataset scores faithfulness, relevance, and latency on every release.
Retrieval gets you an answer. Everything around it is what makes the answer trustworthy.






