Phase 22 · Lesson 15

Phase Synthesis & Independent Challenge

≈ 2 min core reading · 369 source/companion words
Learning contract

What you should be able to do after this

  • Explain Phase Synthesis & Independent Challenge without relying on framework buzzwords.
  • Connect the lesson to the phase outcome: Use TanStack Query as the owner of asynchronous server state with deliberate query keys, freshness, invalidation, mutations, and pagination behavior.
  • Reproduce the relevant behavior and verify it with evidence.
  • Diagnose at least one representative failure instead of guessing.
Figure 22.15 — TaskFlow boundary map
component
query key/options
cache
HTTP fetch
server
cache update/invalidation
render
This lesson belongs to Phase 22. Keep the full request/data path visible even when today's code changes only one box.
Instructor workflow: predict first → implement the smallest slice → run it → inspect evidence → break one assumption → diagnose → explain it back. Do not copy the whole code block before understanding the first failing boundary.

Phase Synthesis & Independent Challenge — TanStack Query

Mission Rebuild the capability of Phase 22 without following the exact code line-by-line. The goal is transfer: can you use the ideas when the variable names, UI, or route shape changes?

Required outcome Use TanStack Query as the owner of asynchronous server state with deliberate query keys, freshness, invalidation, mutations, and pagination behavior.

Required artifact TaskFlow query/mutation layer with stable keys, list/detail caching, invalidation, filters, and debugging via devtools/logs.

Constraints • Start from the previous phase checkpoint or a fresh branch. • Use the course architecture boundaries, but do not copy the reference implementation until after your first attempt. • Keep changes scoped to the capability. • Preserve validation, authorization, error handling, and observability expectations already earned in earlier phases. • Record any design decision where more than one implementation is reasonable.

Acceptance criteria • Can explain cache freshness vs garbage collection. • Can design stable keys. • Can reconcile mutations. • Can debug stale/wrong cache entries.

Independent build sequence 1. Install/configure one QueryClient at the correct client boundary. 2. Define a query-key factory that includes every parameter affecting the result. 3. Move task-list fetching into query options and observe loading/error/success/cache states. 4. Add task detail query and prove list/detail caches are distinct. 5. Implement create/update mutations and choose between invalidation and direct cache updates deliberately. 6. Add pagination/filter URL state and inspect how query keys prevent cross-filter cache corruption.

Self-review Compare your implementation to the reference only after the acceptance criteria pass. Differences are not automatically mistakes. For each difference, ask: does it preserve the same contract, security boundary, correctness, maintainability, and operational behavior? Keep the alternative when you can justify it with evidence.

Stretch challenge Change one assumption: more users, a second tenant, a slow network, an expired session, a concurrent mutation, a deployment restart, or a failed dependency. Predict whether your design still behaves correctly. If not, document the next architectural improvement rather than adding complexity blindly.

Phase exit Run the relevant checks, inspect Git diff, and write a three-sentence summary: what the system can do now, which boundary owns the new responsibility, and which failure you now know how to diagnose. Only then mark the phase complete.

Executable lesson studio · query

Now turn the explanation into engineering skill.

TanStack Query is a server-state synchronization system, not merely a fetch helper. Cache identity, freshness, invalidation, and mutation semantics are the core model.

By the end, you should be able to

  • Explain Phase Synthesis & Independent Challenge in terms of concrete inputs, ownership, outputs, and evidence.
  • Implement or reproduce the smallest TaskFlow slice that demonstrates this query concept.
  • Diagnose one representative query failure using observable evidence instead of trial-and-error.
Figure 22.15B — Mental model
component
query key
cache state
fetch/mutation
reconciliation
Read left-to-right while implementing. When debugging, walk right-to-left until the first observed fact differs from your prediction.
Code-along sequence

One coherent change at a time

  1. 01

    Restate the goal of “Phase Synthesis & Independent Challenge” as one observable behavior. Write the success signal before touching code.

  2. 02

    Trace the boundary map: component → query key → cache state → fetch/mutation → reconciliation. Mark the one boundary this lesson changes.

  3. 03

    Inspect the current repository state and record the exact files, route, table, or runtime involved. Avoid creating an abstraction before you can name the existing owner.

  4. 04

    Implement the smallest vertical slice. Add one coherent change, run the narrowest verification command, and read the output before continuing.

  5. 05

    Connect the slice to TaskFlow’s phase artifact: TaskFlow query/mutation layer with stable keys, list/detail caching, invalidation, filters, and debugging via devtools/logs.. Verify behavior from the outside as a user or API client would.

  6. 06

    Create one controlled failure that is safe to reproduce. Predict the symptom first, capture evidence, locate the earliest broken boundary, then fix only that cause.

  7. 07

    Close the reference and rebuild or explain the core change from memory. Record what you would monitor or test before trusting the same change in production.

tsCache identity should mirror resource identity
export const taskKeys = {
  all: ["tasks"] as const,
  list: (filters: TaskFilters) => ["tasks", "list", filters] as const,
  detail: (id: string) => ["tasks", "detail", id] as const,
};

Do not copy this as a finished answer. Predict what each boundary does, type the smallest useful slice, run it, then compare the result with your prediction.

Verification

Prove the happy path

  1. Run the narrowest relevant command or request and require a clean exit/status.
  2. Inspect the boundary-specific evidence: terminal output, Network panel, database row/query plan, test report, container health, or deployment logs.
  3. Repeat the behavior once after the change so a one-off cached or stale result cannot masquerade as success.
Break it on purpose

Build debugging memory

  1. Invalidating too broadly or not at all
  2. Change one assumption in the query example—identity, input, configuration, ordering, connectivity, or state—and predict the exact symptom before running it.
SymptomInvestigation path
Expected result does not appear

Return to the nearest observable boundary: input, network, process log, database, or rendered UI. Compare actual evidence with the predicted path.

A shortcut appears to fix it

Change one variable at a time and reproduce the original failure after the fix; otherwise you have correlation, not diagnosis.

Closed-reference challenge

Can you transfer the idea?

Without copying the final source, create a second small scenario that applies “Phase Synthesis & Independent Challenge” to a different TaskFlow resource or input. Write the acceptance criteria first, implement it, and provide the evidence that each criterion is satisfied.

Explain-back

Answer these without reopening the solution

  1. What problem does Phase Synthesis & Independent Challenge solve in TaskFlow, and what would be observably wrong without it?
  2. Which part of the query boundary owns the decision, and which neighboring layer must not own it?
  3. What evidence proves the happy path instead of merely suggesting it worked?
  4. Name one realistic failure or abuse case and the first place you would inspect.
  5. If requirements doubled tomorrow, which part of this design should stay stable and which part is allowed to change?
Lesson studio

Turn the reading into skill

01

Do it

Move task-list fetching into query options and observe loading/error/success/cache states.

Use the smallest change that demonstrates this lesson. Stop after it works and capture evidence.
02

Break it safely

Invalidating too broadly or not at all

Predict the symptom before causing the failure. Then locate the earliest boundary where reality diverges from expectation.
03

Explain it back

Why does this responsibility live here, what input does it trust, what output proves success, and what would go wrong if another layer owned it?

If your explanation is vague, repeat the boundary trace before moving on.
Exit ticket

Before marking complete

Close the reference. Reproduce the core idea from memory or explain the exact request/data flow aloud. Then check your diff or notes for accidental shortcuts that bypass validation, authorization, error handling, or verification earned in earlier phases.