# Chapter 3 · Offline reading, updates and queued work · brief · 10 September 2026

The third and last chapter of the _Meet Lilith_ track, rewritten in the Eve
edition on 10 September 2026. It follows the plan in `EVE-V1-REDESIGN-TODOS.md`
and the track brief in [meet-lilith-track.md](meet-lilith-track.md). The receipt
is under `verification/`.

## The job

This is where the note from chapter one is finally resolved — or is not. A
member reads in Nisaba, the connection goes, they come back through the
installed app, and five layers can each answer part of what survived while none
of them can answer all of it. The failure it teaches against is reading any one
layer's answer as the answer.

**Running example.** The Nisaba reading from chapter one, taken all the way: the
connection goes, the member comes back, and every layer between the device and
the server gets asked what it actually kept.

## Three learning promises (the cover)

1. **Coming back is four decisions** — which worker is active, whether to
   reload, where to land, and what the route was.
2. **Cached is a policy, not a promise** — an allowlist, a freshness rule, a
   fallback chain and caps that measure entries.
3. **A queued change has three answers** — the helper returned, the worker
   persisted, and the endpoint accepted, or did not.

## Three things to remember (the close)

1. **Cached is a policy with an order.** An allowlist, a header rule and a
   fallback chain — not a page.
2. **Submitted is not persisted or accepted.** Three states, and the helper's
   return value knows only the first.
3. **Two queues; trace the caller.** Retry budgets and dead letters belong to
   one of them, not both.

**Bridge.** The room guides, for what each feature offers offline — and the
native guide, for who actually calls the queue.

## Sections

Four sections of five slides each, opened by a `section-divider` that names all
four.

| Section                          | Slides                                                                     |
| -------------------------------- | -------------------------------------------------------------------------- |
| Coming back at all               | the return, two queues, the worker lifecycle, the update, the route        |
| What is actually cached          | the policy order, the freshness rule, the fallback chain, warming, caps    |
| The queue that carries a change  | enqueue, replay, the library, the record, the retry schedule               |
| Ordering, failure and the return | object ordering, replay position, the crash boundary, the purge, the check |

## Treatment decisions

- **The cache policy stayed a comparison, not a grid.** Six request classes read
  in the order the worker tries them is exactly a two-column comparison, and the
  order is the teaching: the first rule that matches decides, so a familiar file
  extension proves nothing. The verdict says what the six add up to.
- **The retry table became a timeline.** "Four failed attempts produce three
  scheduled delays" is a sequence with a clock, and the fourth point is the one
  readers get wrong — the budget ends where an eight-second retry would have
  been scheduled, which is why the thirty-second cap never applies by default.
- **The recovery map became a state machine** with one initial state and three
  terminal documents. The last of them returns a success status while saying
  nothing was found, which is why it carries the emphasis.
- **Both gates became decision trees with a third outcome.** The freshness gate
  gained the response served with no provable age — the branch a
  "twenty-four-hour cache" summary hides. The update gate gained the reload
  armed by a sibling tab, which saves no scroll snapshot in this tab.
- **Five case studies and two record specimens were kept**, as the plan asked,
  and reworded rather than re-treated.
- **One of those cases became the chapter's capture.** The treatment line for
  the warming slide asked for a case paired with a capture "where the case has a
  surface", and this one has the only surface in the chapter:
  `PwaOfflineFallback` is where a recent-content entry is actually shown to a
  member. Rendering the shipped component over a seeded index turns the abstract
  claim — an entry is navigation metadata, not a receipt — into four numbered
  parts of a card the reader will meet in the product. The capture is
  `assets/offline-continuity/offline-card.png`, taken by
  `tools/presentations/tests/offline-continuity-capture.mjs`, and the callout
  coordinates are measured from the rendered geometry rather than guessed.

## What this chapter has to keep correcting

Both pinned units this chapter is assigned to describe a single offline
substrate that the web and mobile surfaces "ride on", with retry and sync
behaving consistently across both. The code does not: the service worker
implements its own store and fetch loop, and neither it nor its helper
instantiates the reusable queue class. The chapter's job is to explain that
difference rather than repeat the prose, and every rebinding note says so
explicitly, because the correction is the reason the assignment exists.

The manifest carries the same shape of correction: the pinned unit still names
OSHUN and six domain shortcuts, and the current manifest names Lilith with four.
