<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: Sarthak Agrawal</title>
    <description>The latest articles on DEV Community by Sarthak Agrawal (@sarthakagrawal927).</description>
    <link>https://dev.to/sarthakagrawal927</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F527567%2F7ee4ae21-6589-422a-bcc2-3ae870e23d85.png</url>
      <title>DEV Community: Sarthak Agrawal</title>
      <link>https://dev.to/sarthakagrawal927</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/sarthakagrawal927"/>
    <language>en</language>
    <item>
      <title>Ship one complete product to learn application engineering</title>
      <dc:creator>Sarthak Agrawal</dc:creator>
      <pubDate>Wed, 30 Sep 2026 04:30:00 +0000</pubDate>
      <link>https://dev.to/sarthakagrawal927/ship-one-complete-product-to-learn-application-engineering-3id4</link>
      <guid>https://dev.to/sarthakagrawal927/ship-one-complete-product-to-learn-application-engineering-3id4</guid>
      <description>&lt;p&gt;Application engineering is often taught as separate lists for backend, frontend, UX, analytics, and distribution. A product forces those lists to meet.&lt;/p&gt;

&lt;p&gt;The 12-week Application Engineering roadmap uses one complete product as the synthesis. The first four weeks cover the request and data path: HTTP, queues, authentication, object modeling, state management, web security, pagination, API design, client engineering, and interface design.&lt;/p&gt;

&lt;p&gt;Those topics become useful when they share a contract. An authenticated action needs a UI state, an API boundary, authorization, a data model, an error path, and a way to retry safely. Pagination affects the API and the interface. A queue changes when the user can expect a result.&lt;/p&gt;

&lt;p&gt;The middle phase adds real-time messaging and interactive systems. The learner has to decide which state is authoritative, how clients reconnect, which updates can be dropped, and how the interface explains delay or conflict. A live feature is not complete when two browser windows happen to update once.&lt;/p&gt;

&lt;p&gt;The final phase covers product analytics, positioning, landing pages, and on-page SEO. This is not a marketing appendix. Analytics checks whether the workflow is used. Positioning explains who the product is for. The landing page and search surface make the product understandable before sign-in.&lt;/p&gt;

&lt;p&gt;The synthesis artifact should be a working product with an end-to-end guest or user journey, measured behavior, and a clear release boundary. That makes the learning legible. Instead of claiming familiarity with a stack, the learner can show how a real requirement moved through interface, API, storage, operations, and distribution.&lt;/p&gt;

&lt;p&gt;The complete roadmap is at &lt;a href="https://learn.significanthobbies.com/curriculum/roadmaps/application-engineering-12w" rel="noopener noreferrer"&gt;https://learn.significanthobbies.com/curriculum/roadmaps/application-engineering-12w&lt;/a&gt;.&lt;/p&gt;

</description>
      <category>webdev</category>
      <category>backend</category>
      <category>programming</category>
      <category>learning</category>
    </item>
    <item>
      <title>Systems foundations should start below the framework</title>
      <dc:creator>Sarthak Agrawal</dc:creator>
      <pubDate>Tue, 29 Sep 2026 04:30:00 +0000</pubDate>
      <link>https://dev.to/sarthakagrawal927/systems-foundations-should-start-below-the-framework-347k</link>
      <guid>https://dev.to/sarthakagrawal927/systems-foundations-should-start-below-the-framework-347k</guid>
      <description>&lt;p&gt;Framework knowledge helps you ship. Systems knowledge helps when the framework becomes slow, unsafe, or surprising.&lt;/p&gt;

&lt;p&gt;The 12-week Systems Foundations roadmap starts below application code. Data representation, program memory, the compute and storage hierarchy, and operating-system mechanics form the first phase. These topics explain why a value has a size, why an allocation moves, why a cache miss matters, and what the kernel does for a process.&lt;/p&gt;

&lt;p&gt;The middle phase connects those mechanics through network protocols and concurrency. A request now crosses buffers, scheduling points, synchronization boundaries, and failure states. The learner has to discuss the production tradeoffs: latency, throughput, contention, cancellation, backpressure, and resource limits.&lt;/p&gt;

&lt;p&gt;The final phase adds runtime performance and security isolation. Performance work begins with a reproducible workload and a profile. Isolation work begins by naming the trust boundary and the resources that cross it. Both need evidence because both invite confident guesses.&lt;/p&gt;

&lt;p&gt;The synthesis artifact asks the learner to connect the layers. A useful artifact might trace one request or workload from representation through memory, runtime, network, and isolation, then identify and measure one bottleneck or risk. The exact implementation matters less than whether the causal path is clear.&lt;/p&gt;

&lt;p&gt;This is a good antidote to tool-first learning. A container, event loop, database driver, or runtime is easier to reason about when you can explain the mechanisms it packages. The goal is not to avoid abstractions. It is to know when an abstraction is leaking and what evidence to collect next.&lt;/p&gt;

&lt;p&gt;The complete roadmap is at &lt;a href="https://learn.significanthobbies.com/curriculum/roadmaps/systems-foundations-12w" rel="noopener noreferrer"&gt;https://learn.significanthobbies.com/curriculum/roadmaps/systems-foundations-12w&lt;/a&gt;.&lt;/p&gt;

</description>
      <category>programming</category>
      <category>performance</category>
      <category>architecture</category>
      <category>learning</category>
    </item>
    <item>
      <title>Learn DSA by invariants, not solution memory</title>
      <dc:creator>Sarthak Agrawal</dc:creator>
      <pubDate>Mon, 28 Sep 2026 04:30:00 +0000</pubDate>
      <link>https://dev.to/sarthakagrawal927/learn-dsa-by-invariants-not-solution-memory-5eln</link>
      <guid>https://dev.to/sarthakagrawal927/learn-dsa-by-invariants-not-solution-memory-5eln</guid>
      <description>&lt;p&gt;Recognizing a problem from a screenshot is not the same as recognizing its structure. Interview practice becomes more durable when every solution has an invariant you can explain.&lt;/p&gt;

&lt;p&gt;The 30-day DSA Practice roadmap starts with arrays and strings, then moves through linear structures, trees and heaps, search and greedy methods, graphs, dynamic programming, and bit manipulation. The order is familiar. The rule for completing a problem is more important: solve it without a reference, explain the invariant, and add one edge-case test.&lt;/p&gt;

&lt;p&gt;For a sliding window, the invariant might describe what the current window contains and when the left boundary can move. For binary search, it states where the answer can still exist. For a heap, it explains which candidates have been retained and why. For dynamic programming, it defines the subproblem before writing the recurrence.&lt;/p&gt;

&lt;p&gt;The extra edge-case test forces that explanation to meet code. Empty input, duplicate values, disconnected graphs, overflow, or a one-element boundary often exposes a remembered template that was applied without understanding.&lt;/p&gt;

&lt;p&gt;Complexity analysis belongs in the same loop. State what each pointer, queue entry, recursive call, or table cell can do. Then derive time and space from those operations. This is more reliable than attaching a memorized Big O label at the end.&lt;/p&gt;

&lt;p&gt;Pattern practice still matters, but the pattern is a prompt for reasoning. The goal after 30 days is not a large solved count. It is being able to identify the shape, choose a defensible approach, implement it cleanly, and repair it when the first test breaks the assumption.&lt;/p&gt;

&lt;p&gt;The complete roadmap is at &lt;a href="https://learn.significanthobbies.com/curriculum/roadmaps/dsa-practice" rel="noopener noreferrer"&gt;https://learn.significanthobbies.com/curriculum/roadmaps/dsa-practice&lt;/a&gt;.&lt;/p&gt;

</description>
      <category>algorithms</category>
      <category>programming</category>
      <category>career</category>
      <category>learning</category>
    </item>
    <item>
      <title>Practice system design under a 45-minute clock</title>
      <dc:creator>Sarthak Agrawal</dc:creator>
      <pubDate>Sun, 27 Sep 2026 04:30:00 +0000</pubDate>
      <link>https://dev.to/sarthakagrawal927/practice-system-design-under-a-45-minute-clock-47p1</link>
      <guid>https://dev.to/sarthakagrawal927/practice-system-design-under-a-45-minute-clock-47p1</guid>
      <description>&lt;p&gt;System design practice can become a collection of memorized diagrams. A better target is a repeatable decision process that still works when the prompt changes.&lt;/p&gt;

&lt;p&gt;The 30-day HLD Practice roadmap begins with requirements and capacity, then covers load balancing, consistent hashing, consensus, storage, queues, caching, and rate limiting. These are not boxes to include by default. They are tools whose value depends on scale, failure behavior, and the contract the system must keep.&lt;/p&gt;

&lt;p&gt;The first week isolates primitives. Designing a load balancer, hash ring, or leader election mechanism in a small exercise makes its assumptions visible. The second week connects distributed components behind the request path. Queue boundaries, storage choices, and real-time messaging now have to work together.&lt;/p&gt;

&lt;p&gt;The second half uses full cases: news feed, video streaming, ride sharing, collaborative editing, search, and RAG. A 45-minute answer needs an order. Start by classifying functional and non-functional requirements. Estimate the dominant read, write, storage, and bandwidth dimensions. Choose an initial data model and request path. Then find the bottleneck or failure mode that justifies the next component.&lt;/p&gt;

&lt;p&gt;The useful practice happens in the explanations between boxes. Why is this write asynchronous? Which operation needs strong consistency? What becomes stale? Where can an idempotency key stop a duplicate? What metric tells the operator that the design is failing?&lt;/p&gt;

&lt;p&gt;A credible interview design is not the one with the most infrastructure. It is the smallest design that meets the stated load and explains how it degrades.&lt;/p&gt;

&lt;p&gt;The complete roadmap is at &lt;a href="https://learn.significanthobbies.com/curriculum/roadmaps/hld-practice" rel="noopener noreferrer"&gt;https://learn.significanthobbies.com/curriculum/roadmaps/hld-practice&lt;/a&gt;.&lt;/p&gt;

</description>
      <category>architecture</category>
      <category>programming</category>
      <category>career</category>
      <category>learning</category>
    </item>
    <item>
      <title>Build hybrid search with a frozen query set</title>
      <dc:creator>Sarthak Agrawal</dc:creator>
      <pubDate>Sat, 26 Sep 2026 04:30:00 +0000</pubDate>
      <link>https://dev.to/sarthakagrawal927/build-hybrid-search-with-a-frozen-query-set-363a</link>
      <guid>https://dev.to/sarthakagrawal927/build-hybrid-search-with-a-frozen-query-set-363a</guid>
      <description>&lt;p&gt;Hybrid search is easy to describe: combine lexical and vector retrieval. Proving that the combination is better takes a more careful sequence.&lt;/p&gt;

&lt;p&gt;The 30-Day Retrieval Basics roadmap starts with lexical search. The learner builds a tokenizer, inverted index, and BM25 ranker before reaching embeddings. That order matters. Lexical retrieval gives exact terms, inspectable scores, and a strong baseline that is cheap to run.&lt;/p&gt;

&lt;p&gt;Week two freezes the query set and builds an evaluation harness. Ranking metrics now have concrete inputs: queries, relevance judgments, result lists, and a cutoff. Changing the retriever without keeping this set stable would make the comparison harder to trust.&lt;/p&gt;

&lt;p&gt;Week three adds vector retrieval. A brute-force index keeps the first implementation readable. The learner can inspect similarity, top-k behavior, and metadata filters before approximate nearest-neighbor structures introduce another quality and latency tradeoff.&lt;/p&gt;

&lt;p&gt;The final week combines the two result lists and adds reranking. Reciprocal Rank Fusion is useful here because it can merge rankings without pretending the scores from BM25 and vector similarity share one scale. The capstone must show whether the hybrid path improves the frozen queries and where it makes them worse.&lt;/p&gt;

&lt;p&gt;This workflow resists a common search mistake: adding embeddings before defining the failures they are meant to fix. Some queries need semantic recall. Others depend on an exact identifier, name, or phrase. A hybrid system earns its complexity when the evaluation shows that each retriever covers a real weakness in the other.&lt;/p&gt;

&lt;p&gt;The complete roadmap is at &lt;a href="https://learn.significanthobbies.com/curriculum/roadmaps/retrieval-30-day" rel="noopener noreferrer"&gt;https://learn.significanthobbies.com/curriculum/roadmaps/retrieval-30-day&lt;/a&gt;.&lt;/p&gt;

</description>
      <category>search</category>
      <category>machinelearning</category>
      <category>programming</category>
      <category>learning</category>
    </item>
    <item>
      <title>Developer tools need repository context and safe remediation</title>
      <dc:creator>Sarthak Agrawal</dc:creator>
      <pubDate>Fri, 25 Sep 2026 04:30:00 +0000</pubDate>
      <link>https://dev.to/sarthakagrawal927/developer-tools-need-repository-context-and-safe-remediation-42p3</link>
      <guid>https://dev.to/sarthakagrawal927/developer-tools-need-repository-context-and-safe-remediation-42p3</guid>
      <description>&lt;p&gt;A useful developer tool has to understand more than the file currently open. The risk of a change often lives in imports, tests, generated artifacts, build rules, ownership, and runtime behavior elsewhere in the repository.&lt;/p&gt;

&lt;p&gt;The 12-week Developer Tools and Code Intelligence roadmap starts with code review, static and dynamic analysis, and testing infrastructure. These are different evidence sources. Static analysis can trace syntax and data flow without running the program. Dynamic analysis observes an execution. Tests encode selected contracts. None is complete alone.&lt;/p&gt;

&lt;p&gt;The middle phase builds repository context. Codebase graphs expose relationships. Blast-radius analysis asks what depends on a symbol or package. Repository intelligence brings in structure, instructions, history, and conventions. IDE and CLI tooling turn that context into an interaction that fits actual work.&lt;/p&gt;

&lt;p&gt;The final phase adds coding-agent systems, software supply-chain health, and automated debugging or remediation. This is where safety becomes part of product design. A tool that proposes a dependency change should show why it is needed, which manifests it will touch, what compatibility evidence exists, and how the result will be checked. A debugging agent should separate a hypothesis from the command or observation that supports it.&lt;/p&gt;

&lt;p&gt;The synthesis artifact is a repository-aware tool, not a generic code chatbot. Its value should be measurable through findings, false positives, time saved, accepted remediations, or a repeatable benchmark. Its limits should be visible too.&lt;/p&gt;

&lt;p&gt;Good developer tools reduce the distance between a question and trustworthy evidence. Automation helps only when the evidence survives the convenience.&lt;/p&gt;

&lt;p&gt;The complete roadmap is at &lt;a href="https://learn.significanthobbies.com/curriculum/roadmaps/developer-tools-12w" rel="noopener noreferrer"&gt;https://learn.significanthobbies.com/curriculum/roadmaps/developer-tools-12w&lt;/a&gt;.&lt;/p&gt;

</description>
      <category>programming</category>
      <category>devtools</category>
      <category>testing</category>
      <category>learning</category>
    </item>
    <item>
      <title>Study distributed systems through failure, not diagrams</title>
      <dc:creator>Sarthak Agrawal</dc:creator>
      <pubDate>Thu, 24 Sep 2026 04:30:00 +0000</pubDate>
      <link>https://dev.to/sarthakagrawal927/study-distributed-systems-through-failure-not-diagrams-253a</link>
      <guid>https://dev.to/sarthakagrawal927/study-distributed-systems-through-failure-not-diagrams-253a</guid>
      <description>&lt;p&gt;A clean architecture diagram is drawn after the network has behaved. Distributed systems become interesting when a request is retried, a replica lags, a partition appears, or a workflow resumes after a crash.&lt;/p&gt;

&lt;p&gt;The 12-week Distributed Systems roadmap begins with the mechanisms that shape those failures. HTTP lifecycle, idempotency, load balancing, consistent hashing, retries, consensus, replication, sharding, and the CAP tradeoff form the first four weeks.&lt;/p&gt;

&lt;p&gt;Each mechanism has a practical question attached. What makes a retry safe? Which key should choose a shard? What does a stale read look like to the caller? When does jitter prevent a recovery storm? These questions turn vocabulary into behavior.&lt;/p&gt;

&lt;p&gt;The middle phase moves into queues, event streams, caching, and real-time messaging. The focus is on production boundaries: backpressure, ordering, cache stampedes, delivery guarantees, and the point where a synchronous request should become durable work.&lt;/p&gt;

&lt;p&gt;The final four weeks cover distributed infrastructure, durable workflows, and failure recovery. The synthesis artifact asks the learner to test failures and explain recovery, not only present a happy-path design. A credible result names the state owner, retry policy, idempotency boundary, visibility into partial progress, and terminal failure state.&lt;/p&gt;

&lt;p&gt;This is also a better interview habit. When a design includes a queue or replicated store, the next sentence should describe what happens when it is delayed, duplicated, stale, or unavailable. The failure path often reveals whether the component belongs in the design at all.&lt;/p&gt;

&lt;p&gt;The complete roadmap is at &lt;a href="https://learn.significanthobbies.com/curriculum/roadmaps/distributed-systems-12w" rel="noopener noreferrer"&gt;https://learn.significanthobbies.com/curriculum/roadmaps/distributed-systems-12w&lt;/a&gt;.&lt;/p&gt;

</description>
      <category>architecture</category>
      <category>programming</category>
      <category>learning</category>
      <category>backenddevelopment</category>
    </item>
    <item>
      <title>Learn LLM serving as a memory and scheduling problem</title>
      <dc:creator>Sarthak Agrawal</dc:creator>
      <pubDate>Wed, 23 Sep 2026 04:30:00 +0000</pubDate>
      <link>https://dev.to/sarthakagrawal927/learn-llm-serving-as-a-memory-and-scheduling-problem-4nm3</link>
      <guid>https://dev.to/sarthakagrawal927/learn-llm-serving-as-a-memory-and-scheduling-problem-4nm3</guid>
      <description>&lt;p&gt;A language model server is not only a model behind an HTTP endpoint. Its behavior depends on memory layout, token scheduling, kernels, routing, hardware, and the economics of each request.&lt;/p&gt;

&lt;p&gt;The 12-week Inference and Serving roadmap begins with the model mechanics required to reason about that system. Tokenization, attention, transformer blocks, sampling, checkpoints, LoRA, quantization, and structured output establish what the engine must execute and preserve.&lt;/p&gt;

&lt;p&gt;The path then turns those operations into serving mechanisms. Inference engines organize execution. KV caches retain state between generated tokens. Paged attention changes how that state is managed. Continuous batching mixes work from different requests. Model routing chooses a path based on cost or capability rather than sending every query to the same model.&lt;/p&gt;

&lt;p&gt;Weeks five through eight move closer to the hardware. Flash Attention, speculative decoding, GPU utilization, and inference hardware are treated as tradeoffs, not isolated tricks. A faster kernel can still lose at the system level if it increases memory pressure, complicates batching, or only helps a shape the service rarely sees.&lt;/p&gt;

&lt;p&gt;The final phase connects cost and latency with local inference, browser runtimes, and WebGPU. The synthesis requires measurement across the path. Useful evidence includes the workload, model and precision, batch behavior, memory use, latency distribution, throughput, and the quality boundary that the optimization must keep.&lt;/p&gt;

&lt;p&gt;This perspective changes the learning question. Instead of asking which serving framework is fastest, ask which resource is limiting the workload and which scheduling or representation change addresses that limit.&lt;/p&gt;

&lt;p&gt;The complete roadmap is at &lt;a href="https://learn.significanthobbies.com/curriculum/roadmaps/inference-serving-12w" rel="noopener noreferrer"&gt;https://learn.significanthobbies.com/curriculum/roadmaps/inference-serving-12w&lt;/a&gt;.&lt;/p&gt;

</description>
      <category>machinelearning</category>
      <category>performance</category>
      <category>aiops</category>
      <category>learning</category>
    </item>
    <item>
      <title>Build agent systems from bounded loops outward</title>
      <dc:creator>Sarthak Agrawal</dc:creator>
      <pubDate>Tue, 22 Sep 2026 04:30:00 +0000</pubDate>
      <link>https://dev.to/sarthakagrawal927/build-agent-systems-from-bounded-loops-outward-49na</link>
      <guid>https://dev.to/sarthakagrawal927/build-agent-systems-from-bounded-loops-outward-49na</guid>
      <description>&lt;p&gt;Many agent demos begin with a model, a tool list, and a loop. Production problems begin as soon as the loop has authority, state, and time.&lt;/p&gt;

&lt;p&gt;The 12-week Agent Systems roadmap starts with the small mechanics: structured output, tool calling, bounded agent loops, memory, and MCP integrations. The step-limit exercise is deliberately basic. A loop that cannot explain when it stops is not ready for more tools.&lt;/p&gt;

&lt;p&gt;The next phase introduces coordination, explicit communication interfaces, and browser or computer use. These topics are grouped because coordination is not just adding more agents. Each participant needs a contract for messages, ownership, failure, and handoff. Computer use raises the cost of ambiguity because the tool can act on a real interface with state the model may not fully observe.&lt;/p&gt;

&lt;p&gt;The final four weeks focus on durability and control. Long-running work needs persisted state, resumable execution, scheduled triggers, permission boundaries, and safe recovery after partial failure. A sandbox limits what an agent can touch. Durable execution limits what a crash can erase. Both are part of correctness.&lt;/p&gt;

&lt;p&gt;The synthesis artifact asks the learner to combine these pieces into one system and test its failure modes. A useful result should show what the agent can do, which actions require authority, where state lives, how retries behave, and how an operator can stop or inspect the run.&lt;/p&gt;

&lt;p&gt;Starting with bounded loops keeps the design honest. Autonomy is not the number of iterations a model can run. It is the amount of useful work the system can complete while its scope, state, and failure behavior remain legible.&lt;/p&gt;

&lt;p&gt;The roadmap is at &lt;a href="https://learn.significanthobbies.com/curriculum/roadmaps/agent-systems-12w" rel="noopener noreferrer"&gt;https://learn.significanthobbies.com/curriculum/roadmaps/agent-systems-12w&lt;/a&gt;.&lt;/p&gt;

</description>
      <category>ai</category>
      <category>programming</category>
      <category>architecture</category>
      <category>learning</category>
    </item>
    <item>
      <title>Build AI evaluations that survive a model change</title>
      <dc:creator>Sarthak Agrawal</dc:creator>
      <pubDate>Mon, 21 Sep 2026 04:30:00 +0000</pubDate>
      <link>https://dev.to/sarthakagrawal927/build-ai-evaluations-that-survive-a-model-change-23m9</link>
      <guid>https://dev.to/sarthakagrawal927/build-ai-evaluations-that-survive-a-model-change-23m9</guid>
      <description>&lt;p&gt;An AI evaluation is easy to trust when it confirms the release you already want. The harder test is whether it still helps after the prompt, model, tool, or traffic mix changes.&lt;/p&gt;

&lt;p&gt;The 12-week Evaluation and AI Reliability roadmap begins below the evaluation layer. It covers enough model mechanics, probability, and descriptive statistics to explain what a metric measures and what it misses. It then moves into LLM evaluations, coding-agent benchmarks, and tool-use evaluations.&lt;/p&gt;

&lt;p&gt;That foundation matters because different tasks fail differently. Exact match may fit a constrained output. A tool-using agent needs checks for action selection, arguments, side effects, recovery, and final evidence. A coding benchmark can reward a patch that passes a narrow test while missing the requested behavior.&lt;/p&gt;

&lt;p&gt;The middle four weeks move from a local score to a production evaluation system. Prompt versions are explicit. Regression tests use frozen cases. Hallucination and failure detection become named behaviors. Quality, cost, and latency are measured together, because a release that improves one dimension can quietly damage another.&lt;/p&gt;

&lt;p&gt;The final phase adds agent observability, tracing and replay, evidence-backed verification, and human review. The synthesis artifact is not a leaderboard. It is an evaluation and observability system that can reproduce a failure, compare a candidate with a baseline, and show where human judgment still enters.&lt;/p&gt;

&lt;p&gt;A useful evaluation should make a bad release harder to justify. It should also make a good release easier to explain without stretching one number into a general claim.&lt;/p&gt;

&lt;p&gt;The complete roadmap is at &lt;a href="https://learn.significanthobbies.com/curriculum/roadmaps/ai-reliability-12w" rel="noopener noreferrer"&gt;https://learn.significanthobbies.com/curriculum/roadmaps/ai-reliability-12w&lt;/a&gt;.&lt;/p&gt;

</description>
      <category>ai</category>
      <category>testing</category>
      <category>machinelearning</category>
      <category>learning</category>
    </item>
    <item>
      <title>A coding agent needs a harness, not a longer prompt</title>
      <dc:creator>Sarthak Agrawal</dc:creator>
      <pubDate>Sun, 20 Sep 2026 04:30:00 +0000</pubDate>
      <link>https://dev.to/sarthakagrawal927/a-coding-agent-needs-a-harness-not-a-longer-prompt-1o2i</link>
      <guid>https://dev.to/sarthakagrawal927/a-coding-agent-needs-a-harness-not-a-longer-prompt-1o2i</guid>
      <description>&lt;p&gt;A coding agent can produce a plausible patch with a good prompt. Reliable progress across a real repository needs more than prompt quality.&lt;/p&gt;

&lt;p&gt;The Harness Engineering roadmap treats the environment around the agent as a system. The first build turns implicit expectations into scoped repository instructions and executable checks. The second makes the workspace readable from a fresh checkout: structure, setup, readiness, and permissions should be discoverable without private history.&lt;/p&gt;

&lt;p&gt;Continuity arrives in the third build. A later session needs the goal, current progress, evidence, blockers, and next action. Without that durable state, long-running work becomes a series of confident restarts.&lt;/p&gt;

&lt;p&gt;The fourth build adds scope control and runtime feedback. The agent needs a bounded authority surface and evidence that tells it whether to continue, replan, complete, or escalate. This is where a harness starts to look less like a prompt wrapper and more like an operating system for work.&lt;/p&gt;

&lt;p&gt;The fifth build separates maker and checker. The checker reconstructs the contract and gathers fresh evidence instead of accepting the maker's claim that the task is done. The final two builds connect initialization, execution, recovery, verification, and terminal states, then compare the automated loop with a baseline and remove one component to see whether it mattered.&lt;/p&gt;

&lt;p&gt;This sequence makes one distinction clear: agent capability and agent reliability are different properties. A strong model can still fail in an unreadable workspace, lose state between sessions, exceed its scope, or verify its own assumptions.&lt;/p&gt;

&lt;p&gt;The seven-build roadmap is at &lt;a href="https://learn.significanthobbies.com/curriculum/roadmaps/harness-engineering" rel="noopener noreferrer"&gt;https://learn.significanthobbies.com/curriculum/roadmaps/harness-engineering&lt;/a&gt;.&lt;/p&gt;

</description>
      <category>ai</category>
      <category>programming</category>
      <category>testing</category>
      <category>learning</category>
    </item>
    <item>
      <title>Trace one tensor from model math to serving cost</title>
      <dc:creator>Sarthak Agrawal</dc:creator>
      <pubDate>Sat, 19 Sep 2026 04:30:00 +0000</pubDate>
      <link>https://dev.to/sarthakagrawal927/trace-one-tensor-from-model-math-to-serving-cost-3m23</link>
      <guid>https://dev.to/sarthakagrawal927/trace-one-tensor-from-model-math-to-serving-cost-3m23</guid>
      <description>&lt;p&gt;AI systems material often splits into separate subjects: model math, GPU kernels, runtimes, and production serving. That makes each topic easier to name and harder to connect.&lt;/p&gt;

&lt;p&gt;Trace a Tensor uses one workload as the thread. The first week starts with data representation and backpropagation. The point is to explain what a tensor contains, how its shape affects a computation, and what work a forward pass creates for the backward pass.&lt;/p&gt;

&lt;p&gt;The second week follows the same data through the compute, memory, and storage hierarchy. Before changing a kernel, the learner has to profile the runtime and identify where time or bandwidth is actually going. That prevents an interesting optimization from becoming a substitute for diagnosis.&lt;/p&gt;

&lt;p&gt;The third week changes the work. Flash Attention and quantization are studied as different ways to reduce movement or numerical cost. Both come with a quality or correctness boundary, so the exercise is not complete when the faster path runs. It must preserve the behavior the system needs.&lt;/p&gt;

&lt;p&gt;The final week moves into engines, continuous batching, and serving economics. Latency, throughput, utilization, quality, and cost now sit in the same decision. The capstone asks for a reproducible workload or performance model, a measured bottleneck, a before-and-after comparison, and a defended optimization.&lt;/p&gt;

&lt;p&gt;That shape is more useful than memorizing a stack diagram. It gives every abstraction a place in one causal chain: values become tensors, tensors create work, the machine schedules that work, and the serving system pays for the result.&lt;/p&gt;

&lt;p&gt;The complete roadmap is at &lt;a href="https://learn.significanthobbies.com/curriculum/roadmaps/trace-a-tensor" rel="noopener noreferrer"&gt;https://learn.significanthobbies.com/curriculum/roadmaps/trace-a-tensor&lt;/a&gt;.&lt;/p&gt;

</description>
      <category>machinelearning</category>
      <category>performance</category>
      <category>learning</category>
      <category>ai</category>
    </item>
  </channel>
</rss>
