@playfast/reform 0.0.8 → 0.0.10

package/src/internal/queryDriver.ts

@@ -10,8 +10,11 @@ import {
   type Scope,
   Stream,
 } from 'effect'
-import { type AnyAsyncData, AsyncData } from '../calc/asyncData'
+import { type AnyAsyncData } from '../calc/asyncData'
+import { empty, type QueryState, toAsyncData } from '../calc/queryState'
+import { Queries, type QueryHandle } from '../runtime/queries'
 import { reuse } from './reuse'
+import { resolveQueryStore } from './queryStore'
 import { resolveScheduler } from './scheduler'
 import {
   type InputsObject,
@@ -20,14 +23,17 @@ import {
   sameKey,
   wireSources,
 } from './sources'
-import { makeStore, type Store } from './store'
+import { makeDerivedStore, makeStore, type Store } from './store'
 import { type AnySource } from '../state/token'
 
 // The query-lifecycle driver shared by `AsyncCalc.live` and `RemoteState.live`:
-// sense the inputs, run the query latest-wins (or trailing-conflated), fold the
-// result into an `AnyAsyncData` store with stale-while-revalidate semantics.
-// Extracted so both primitives run the exact same machinery — the asyncCalc
-// test suite is the driver's regression suite.
+// sense the inputs, run the query latest-wins (or trailing-conflated), and fold
+// the result into a flat `QueryState` cell (data/error/isFetching/isStale). The
+// public store is the `AnyAsyncData` *projection* of that cell, so existing
+// arm-matching consumers and `RemoteState` are unchanged. `invalidate` (flip
+// `isStale`) and `refetch` (force a run) are exposed as separate operations and
+// registered into the `Queries` registry by name. The asyncCalc test suite is the
+// driver's regression suite.
 
 /** `Gated` (whether the `Idle` arm exists) is the inverse of `alwaysOn`. */
 export type GatedOf<AlwaysOn extends boolean> = AlwaysOn extends true ? false : true
@@ -52,7 +58,7 @@ export const revisionZero: Revision = Revision(0)
 export const bumpRevision = (r: Revision): Revision => Revision(r + 1)
 
 export interface QueryDriverOptions<Inputs extends ReadonlyArray<AnySource>, A, E, R> {
-  /** The owning definition's name — only for the defect log line. */
+  /** The owning definition's name — the defect log line and the `Queries` key. */
   readonly name: string
   /** The owning primitive's kind label — only for the defect log line. */
   readonly label: string
@@ -75,6 +81,13 @@ export interface QueryDriverOptions<Inputs extends ReadonlyArray<AnySource>, A,
         readonly subscribe: (listener: () => void) => () => void
       }
     | undefined
+  /**
+   * Persist the `Success` value through the optional `QueryStore`: hydrate the
+   * cell from `key` before the first run (seeded `isStale: true`, so it shows
+   * instantly and still refetches) and write through on each settle. Values
+   * (de)serialize through `schema`, never trusted structurally.
+   */
+  readonly persist?: { readonly key: string; readonly schema: Schema.Schema<A, any> } | undefined
   /**
    * Fired when a run's `Success` value has landed in the store (same scheduler
    * flush — never before the converged value is readable), with the run's
@@ -85,7 +98,7 @@ export interface QueryDriverOptions<Inputs extends ReadonlyArray<AnySource>, A,
 }
 
 export interface QueryDriver<A, E> {
-  /** The lifecycle store (the full union — callers narrow to their arms). */
+  /** The lifecycle store (the `AnyAsyncData` projection — callers narrow to their arms). */
   readonly store: Store<AnyAsyncData<A, E>>
   /**
    * The highest generation requested so far (0 before the first kick).
@@ -97,12 +110,13 @@ export interface QueryDriver<A, E> {
 }
 
 /**
- * Build the driver: store + subscription + request queue + run fiber, all owned
- * by the ambient scope (callers run this under `Layer.scoped`). A change to an
- * input re-runs the query latest-wins (a new run cancels the in-flight one; or,
- * with `coalesce: 'trailing'`, lets it finish and runs one trailing refetch);
- * while a re-run is in flight the last `Success`/`Error` is kept with
- * `refetching: true`.
+ * Build the driver: state cell + projection + subscription + request queue + run
+ * fiber, all owned by the ambient scope (callers run this under `Layer.scoped`). A
+ * change to an input re-runs the query latest-wins (a new run cancels the in-flight
+ * one; or, with `coalesce: 'trailing'`, lets it finish and runs one trailing
+ * refetch); while a re-run is in flight the last `data`/`error` is kept with
+ * `isFetching: true`. `invalidate` flips `isStale`; a stale query with active
+ * readers auto-refetches (the same rule that drives refetch-on-resubscribe).
  */
 export const makeQueryDriver = <Inputs extends ReadonlyArray<AnySource>, A, E, R>(
   options: QueryDriverOptions<Inputs, A, E, R>,
@@ -111,6 +125,8 @@ export const makeQueryDriver = <Inputs extends ReadonlyArray<AnySource>, A, E, R
     const scheduler = yield* resolveScheduler
     const sources = yield* wireSources(options.inputs, options.invalidateBy)
     const extraKey = options.extraKey
+    const persist = options.persist
+    const queryStore = yield* resolveQueryStore
 
     const keyOf = (args: InputsObject<Inputs>): ReadonlyArray<unknown> =>
       extraKey === undefined ? sources.keyOf(args) : [...sources.keyOf(args), extraKey.read()]
@@ -125,74 +141,128 @@ export const makeQueryDriver = <Inputs extends ReadonlyArray<AnySource>, A, E, R
     const disabledNow = (args: InputsObject<Inputs> = sources.snapshot()): boolean =>
       options.gated && options.disabled !== undefined ? options.disabled(args) : false
 
-    const store = makeStore<AnyAsyncData<A, E>>(
-      disabledNow() ? AsyncData.idle : AsyncData.loading,
-      scheduler,
-    )
-    // The last requested key, so a change that doesn't move it (or only churns
-    // an input `invalidateBy` ignores) doesn't re-fetch.
+    // The flat source-of-truth cell. `idle` is a shared reference so re-disabling
+    // an already-idle query is a no-op write (the store's Equal gate suppresses it).
+    const idle: QueryState<A, E> = empty(false)
+    const stateStore = makeStore<QueryState<A, E>>(disabledNow() ? idle : empty(true), scheduler)
+
+    // Active-reader count of the PROJECTION (React components, the RemoteState
+    // overlay). Drives the "stale + active ⇒ refetch" policy and refetch-on-
+    // resubscribe (a 0→1 transition).
+    const readers = MutableRef.make(0)
+
+    // The last requested key, so a change that doesn't move it (or only churns an
+    // input `invalidateBy` ignores) doesn't re-fetch.
     const lastKey = MutableRef.make<ReadonlyArray<unknown> | undefined>(undefined)
-    // The run-generation counter: bumped when a run is REQUESTED (enqueued), so
-    // `requested()` names the newest run that could possibly be in flight.
     const generation = MutableRef.make(0)
     const nextGeneration = (): number => {
       MutableRef.update(generation, (n) => n + 1)
       return MutableRef.get(generation)
     }
 
-    // Mark a re-fetch in flight without dropping the visible value (SWR).
-    const markRefetching = () => {
-      const prev = store.get()
-      if (prev._tag === 'Success') store.set(AsyncData.success(prev.value, true))
-      else if (prev._tag === 'Error') store.set(AsyncData.error(prev.error, true))
-      else store.set(AsyncData.loading)
+    // ── State writers, each touching only the axes it owns. The untouched axes
+    // keep their field references, so a pure `isStale` flip leaves the projection
+    // reference unmoved (see `project`). ──────────────────────────────────────
+    const markFetching = () => {
+      const s = stateStore.get()
+      if (!s.isFetching) stateStore.set({ ...s, isFetching: true })
+    }
+    const settleSuccess = (value: A): A => {
+      const prev = stateStore.get()
+      const shared =
+        options.reuse === true && Option.isSome(prev.data) ? reuse(prev.data.value, value) : value
+      stateStore.set({
+        data: Option.some(shared),
+        error: Option.none(),
+        isFetching: false,
+        isStale: false,
+      })
+      return shared
+    }
+    const settleError = (error: E) => {
+      const prev = stateStore.get()
+      // Keep `data` underneath: `error` wins in the projection (the `Error` arm),
+      // but a consumer reading `QueryState` still has the last good value.
+      stateStore.set({ ...prev, error: Option.some(error), isFetching: false })
     }
 
-    // One run of the query, folded into the store. A failure becomes `Error`; an
-    // interrupt (latest-wins cancel) leaves the state untouched; a defect (a bug
-    // in the body) is logged and isolated — the driver keeps running. A `Success`
-    // additionally reports its generation through `onSettled`, after the write,
-    // so settle-driven consequences observe the converged value.
+    const persistWrite = (value: A): Effect.Effect<void> =>
+      persist === undefined
+        ? Effect.void
+        : Schema.encode(persist.schema)(value).pipe(
+            Effect.flatMap((encoded) => queryStore.set(persist.key, encoded)),
+            // Persistence is best-effort: a serialization or storage failure must
+            // never fail the run nor block the visible write.
+            Effect.ignore,
+          )
+
+    // The projection the public store exposes: `AnyAsyncData`, memoized so a pure
+    // `isStale` change (which the projection ignores) returns the SAME reference
+    // and wakes no `AnyAsyncData` subscriber.
+    const projection = MutableRef.make<
+      { readonly state: QueryState<A, E>; readonly view: AnyAsyncData<A, E> } | undefined
+    >(undefined)
+    const project = (): AnyAsyncData<A, E> => {
+      const state = stateStore.get()
+      const prev = MutableRef.get(projection)
+      // The projection depends only on data/error/isFetching; writers preserve the
+      // refs of untouched axes, so reference identity on those three is exact.
+      if (
+        prev !== undefined &&
+        prev.state.data === state.data &&
+        prev.state.error === state.error &&
+        prev.state.isFetching === state.isFetching
+      )
+        return prev.view
+      const view = toAsyncData(state, options.gated)
+      MutableRef.set(projection, { state, view })
+      return view
+    }
+    const derived = makeDerivedStore(project, stateStore.subscribe, scheduler)
+    yield* Effect.addFinalizer(() => Effect.sync(derived.unsubscribe))
+
+    interface Request {
+      readonly args: InputsObject<Inputs>
+      readonly generation: number
+    }
+
+    // One run of the query, folded into the cell. A failure becomes `Error`; an
+    // interrupt (latest-wins cancel) leaves the state untouched; a defect (a bug in
+    // the body) is logged and isolated. A `Success` reports its generation through
+    // `onSettled` after the write, then persists (best-effort, trailing).
     const runQuery = (request: Request): Effect.Effect<void, never, R> =>
       options.query(request.args).pipe(
         Effect.tapDefect((defect) =>
           Effect.logError(`reform: ${options.label} '${options.name}' query defect`, defect),
         ),
         Effect.matchCause({
-          onSuccess: (value) => {
-            if (!disabledNow()) {
-              // `reuse`: share unchanged subtrees with the previous Success
-              // value, so a refetch that barely moved keeps identities stable.
-              const prev = store.get()
-              const shared =
-                options.reuse === true && prev._tag === 'Success'
-                  ? reuse(prev.value, value)
-                  : value
-              store.set(AsyncData.success(shared, false))
-              options.onSettled?.(request.generation)
-            }
-          },
-          onFailure: (cause) => {
+          onSuccess: (value): Option.Option<A> => Option.some(value),
+          onFailure: (cause): Option.Option<A> => {
             const failure = Cause.failureOption(cause)
-            if (Option.isSome(failure) && !disabledNow()) {
-              store.set(AsyncData.error(failure.value, false))
-            }
+            if (Option.isSome(failure) && !disabledNow()) settleError(failure.value)
+            return Option.none()
           },
         }),
+        Effect.flatMap((ok) =>
+          Option.match(ok, {
+            onNone: () => Effect.void,
+            onSome: (value) =>
+              disabledNow()
+                ? Effect.void
+                : Effect.suspend(() => {
+                    const shared = settleSuccess(value)
+                    options.onSettled?.(request.generation)
+                    return persistWrite(shared)
+                  }),
+          }),
+        ),
       )
 
-    interface Request {
-      readonly args: InputsObject<Inputs>
-      readonly generation: number
-    }
-
-    // The driver. `'switch'` (default): each new request cancels the in-flight
-    // run — the same latest-wins semantics a `latest` channel gives procedures.
+    // The driver. `'switch'` (default): each new request cancels the in-flight run
+    // — the same latest-wins semantics a `latest` channel gives procedures.
     // `'trailing'`: a strictly sequential consumer that, on wake, drains every
-    // request that piled up during the flight and runs the LATEST one —
-    // "exactly one trailing run after settle" by construction. The trailing
-    // run's generation is the max drained (the latest request's), so it
-    // vouches for every request it conflated.
+    // request that piled up during the flight and runs the LATEST one — "exactly
+    // one trailing run after settle" by construction.
     const trailing = options.coalesce === 'trailing'
     const requests = yield* Queue.unbounded<Request>()
     yield* Effect.forkScoped(
@@ -202,14 +272,9 @@ export const makeQueryDriver = <Inputs extends ReadonlyArray<AnySource>, A, E, R
               const first = yield* Queue.take(requests)
               const queued = yield* Queue.takeAll(requests)
               const request = Option.getOrElse(Chunk.last(queued), () => first)
-              // A disable that landed while the request waited: skip the run.
               if (!disabledNow()) yield* runQuery(request)
-              // The settle may have written a stale-key result with
-              // `refetching: false`; if a newer request is already waiting,
-              // restore the syncing flag before the next take — both writes
-              // coalesce into one scheduler flush for subscribers.
               const pending = yield* Queue.size(requests)
-              if (pending > 0 && !disabledNow()) yield* Effect.sync(markRefetching)
+              if (pending > 0 && !disabledNow()) yield* Effect.sync(markFetching)
             }),
           )
         : Stream.fromQueue(requests).pipe(
@@ -218,30 +283,103 @@ export const makeQueryDriver = <Inputs extends ReadonlyArray<AnySource>, A, E, R
           ),
     )
 
-    const trigger = () => {
+    // Enqueue a run of the current key, marking the flight. `force` skips the
+    // no-op-key guard (the refetch path); otherwise an unchanged key is ignored.
+    const enqueue = (force: boolean) => {
       const args = sources.snapshot()
       if (disabledNow(args)) {
         // Switched off: show Idle and forget the key so re-enabling always re-runs.
         MutableRef.set(lastKey, undefined)
-        store.set(AsyncData.idle)
+        stateStore.set(idle)
         return
       }
       const key = keyOf(args)
       const previous = MutableRef.get(lastKey)
-      if (previous !== undefined && sameKey(key, previous)) return
+      if (!force && previous !== undefined && sameKey(key, previous)) return
       MutableRef.set(lastKey, key)
-      markRefetching()
+      markFetching()
       Queue.unsafeOffer(requests, { args, generation: nextGeneration() })
     }
+    const trigger = () => enqueue(false)
+    const refetch = () => enqueue(true)
+
+    // `invalidate`: flip `isStale` only. A stale query with active readers then
+    // auto-refetches — the one place invalidation indirectly fetches.
+    const maybeAutoRefetch = () => {
+      if (stateStore.get().isStale && MutableRef.get(readers) > 0) refetch()
+    }
+    const invalidate = () => {
+      const s = stateStore.get()
+      if (s.isStale) return
+      stateStore.set({ ...s, isStale: true })
+      maybeAutoRefetch()
+    }
+
     const unsubscribe = subscribeAll(trigger)
     yield* Effect.addFinalizer(() => Effect.sync(unsubscribe))
 
+    // Hydrate from the persisted value before the first kick: show it instantly,
+    // marked stale, so the kick refetches over it (stale-while-revalidate).
+    if (persist !== undefined && !disabledNow()) {
+      const cached = yield* queryStore.get(persist.key)
+      yield* Option.match(cached, {
+        onNone: () => Effect.void,
+        onSome: (raw) =>
+          Schema.decodeUnknown(persist.schema)(raw).pipe(
+            Effect.match({
+              // Corrupt/incompatible cache: ignore and fetch fresh.
+              onFailure: () => undefined,
+              onSuccess: (value) =>
+                stateStore.set({
+                  data: Option.some(value),
+                  error: Option.none(),
+                  isFetching: false,
+                  isStale: true,
+                }),
+            }),
+          ),
+      })
+    }
+
     // Kick off the first fetch unless the query starts disabled.
     const initial = sources.snapshot()
     if (!disabledNow(initial)) {
       MutableRef.set(lastKey, keyOf(initial))
+      markFetching()
       Queue.unsafeOffer(requests, { args: initial, generation: nextGeneration() })
     }
 
+    // The public store: the projection, with reader-count tracking wrapped around
+    // `subscribe`, so a 0→1 transition can auto-refetch a stale query.
+    const store: Store<AnyAsyncData<A, E>> = {
+      ...derived.store,
+      subscribe: (listener) => {
+        const before = MutableRef.get(readers)
+        MutableRef.set(readers, before + 1)
+        const off = derived.store.subscribe(listener)
+        if (before === 0) maybeAutoRefetch()
+        return () => {
+          off()
+          MutableRef.update(readers, (n) => Math.max(0, n - 1))
+        }
+      },
+    }
+
+    // Register the handle so `AsyncCalc.invalidate`/`.refetch` and provider layers
+    // can act on this query by name. Optional (`serviceOption`): an absent registry
+    // (a calc wired with no `Engine` in context) just means no imperative control.
+    const handle: QueryHandle = {
+      name: options.name,
+      invalidate,
+      refetch,
+      snapshot: () => stateStore.getSnapshot(),
+      subscribe: (listener) => stateStore.subscribe(listener),
+    }
+    const queries = Option.getOrUndefined(yield* Effect.serviceOption(Queries))
+    if (queries !== undefined) {
+      queries.register(handle)
+      yield* Effect.addFinalizer(() => Effect.sync(() => queries.unregister(handle)))
+    }
+
     return { store, requested: () => MutableRef.get(generation) }
   })

package/src/internal/queryEvents.ts

@@ -0,0 +1,34 @@
+import { Context, Effect, Option } from 'effect'
+
+// `QueryEvents` is the optional host-signal seam invalidation *sources* subscribe
+// to — window focus/visibility and network reconnect. It carries no DOM itself:
+// the concrete `window.addEventListener` implementation lives in an edge package
+// (`@playfast/reform-query-browser`); core only declares the shape. Resolved via
+// `serviceOption` with a no-op fallback, so its absence (SSR, native, proofs) is
+// inert. The subscriptions return an unsubscribe thunk — the synchronous,
+// React-facing shape the rest of reform uses (see `Store.subscribe`).
+
+export interface QueryEventsApi {
+  /** Fires when the window/tab regains focus or visibility. */
+  readonly subscribeFocus: (listener: () => void) => () => void
+  /** Fires when the network comes back online. */
+  readonly subscribeOnline: (listener: () => void) => () => void
+}
+
+const QueryEventsBase: Context.TagClass<QueryEvents, 'reform/QueryEvents', QueryEventsApi> =
+  Context.Tag('reform/QueryEvents')<QueryEvents, QueryEventsApi>()
+export class QueryEvents extends QueryEventsBase {}
+
+const noop = (): (() => void) => () => {}
+
+/** A source that never fires — the fallback when no host provides `QueryEvents`. */
+export const noopQueryEvents: QueryEventsApi = {
+  subscribeFocus: noop,
+  subscribeOnline: noop,
+}
+
+/** Resolve the host's `QueryEvents`, or the no-op source when none is in context. */
+export const resolveQueryEvents: Effect.Effect<QueryEventsApi> = Effect.map(
+  Effect.serviceOption(QueryEvents),
+  Option.getOrElse(() => noopQueryEvents),
+)

package/src/internal/queryStore.ts

@@ -0,0 +1,36 @@
+import { Context, Effect, Option } from 'effect'
+
+// `QueryStore` is the optional persistence seam an `AsyncCalc` writes through and
+// hydrates from — a key→value cache provided by the host (localStorage,
+// IndexedDB, AsyncStorage, …). Like `Notifications`, it is resolved through
+// `serviceOption`, so a calc that opts into `persist` imposes NO hard requirement:
+// absent host ⇒ the no-op store ⇒ the feature is simply inert (SSR, native,
+// proofs). Values cross the boundary as `unknown` and are (de)serialized through
+// the calc's own `output` schema by the driver, never trusted structurally.
+
+export interface QueryStoreApi {
+  readonly get: (key: string) => Effect.Effect<Option.Option<unknown>>
+  readonly set: (key: string, value: unknown) => Effect.Effect<void>
+  readonly remove: (key: string) => Effect.Effect<void>
+}
+
+const QueryStoreBase: Context.TagClass<QueryStore, 'reform/QueryStore', QueryStoreApi> =
+  Context.Tag('reform/QueryStore')<QueryStore, QueryStoreApi>()
+export class QueryStore extends QueryStoreBase {}
+
+/** A store that persists nothing — the fallback when no host provides `QueryStore`. */
+export const noopQueryStore: QueryStoreApi = {
+  get: () => Effect.succeedNone,
+  set: () => Effect.void,
+  remove: () => Effect.void,
+}
+
+/**
+ * Resolve the host's `QueryStore`, or the no-op store when none is in context.
+ * `serviceOption` keeps it requirement-free — a calc wired as a sibling of the
+ * runtime that provides no persistence simply gets the inert store.
+ */
+export const resolveQueryStore: Effect.Effect<QueryStoreApi> = Effect.map(
+  Effect.serviceOption(QueryStore),
+  Option.getOrElse(() => noopQueryStore),
+)

package/src/runtime/loop.ts

@@ -7,6 +7,7 @@ import {
 } from '../channel/channel'
 import { notificationsLayer } from '../internal/scheduler'
 import { Bus, busLayer, type Envelope, type Tagged } from './bus'
+import { Queries, queriesLayer } from './queries'
 
 /**
  * A registered reducer, with its target store(s) already captured at
@@ -162,10 +163,16 @@ const drain = Effect.gen(function* () {
  * drain loop. Registration mutates the live collections, so reducers/procedures/
  * channels merged alongside are picked up before the first dispatch (boot).
  */
-export const Engine: Layer.Layer<Bus | Reducers | Channels | Procedures> = Layer.scopedDiscard(
-  drain,
-).pipe(
-  Layer.provideMerge(
-    Layer.mergeAll(busLayer, reducersLayer, channelsLayer, proceduresLayer, notificationsLayer),
-  ),
-)
+export const Engine: Layer.Layer<Bus | Reducers | Channels | Procedures | Queries> =
+  Layer.scopedDiscard(drain).pipe(
+    Layer.provideMerge(
+      Layer.mergeAll(
+        busLayer,
+        reducersLayer,
+        channelsLayer,
+        proceduresLayer,
+        notificationsLayer,
+        queriesLayer,
+      ),
+    ),
+  )

package/src/runtime/queries.ts

@@ -0,0 +1,53 @@
+import { Context, Layer } from 'effect'
+import { type QueryState } from '../calc/queryState'
+
+// The `Queries` registry: the runtime-wide index of live query handles, the same
+// shape as `Reducers`/`Channels`/`Procedures` (`loop.ts`, `channel.ts`). Each
+// `AsyncCalc.live` driver registers its handle here scoped — so `AsyncCalc.invalidate`
+// / `AsyncCalc.refetch` (and any provider layer) can act on a calc by name without
+// holding its store tag. A base in-memory registry ships in `Engine`; provider
+// layers (persistence, focus/online managers) build on top by calling the handles.
+//
+// The per-calc generics are erased through function signatures (reads are
+// covariant; `subscribe` is uniform), so the heterogeneous registry needs no cast.
+
+export interface QueryHandle {
+  readonly name: string
+  /** Mark the query's value stale (`isStale := true`). Does not fetch. */
+  readonly invalidate: () => void
+  /** Force a run of the current key, bypassing the no-op-key guard. */
+  readonly refetch: () => void
+  /** Read the current state (erased to the open value type). */
+  readonly snapshot: () => QueryState<unknown, unknown>
+  /** Subscribe to state changes; returns an unsubscribe thunk. */
+  readonly subscribe: (listener: () => void) => () => void
+}
+
+export interface QueryRegistry {
+  readonly byName: Map<string, QueryHandle>
+  readonly register: (handle: QueryHandle) => void
+  readonly unregister: (handle: QueryHandle) => void
+}
+
+const QueriesBase: Context.TagClass<Queries, 'reform/Queries', QueryRegistry> = Context.Tag(
+  'reform/Queries',
+)<Queries, QueryRegistry>()
+export class Queries extends QueriesBase {}
+
+const makeQueryRegistry = (): QueryRegistry => {
+  const byName = new Map<string, QueryHandle>()
+  return {
+    byName,
+    register: (handle) => {
+      byName.set(handle.name, handle)
+    },
+    // Only drop the entry if it is still the one we registered: a same-named
+    // re-registration (re-mount before the old scope's finalizer runs) must not
+    // be clobbered by the stale handle's unregister.
+    unregister: (handle) => {
+      if (byName.get(handle.name) === handle) byName.delete(handle.name)
+    },
+  }
+}
+
+export const queriesLayer: Layer.Layer<Queries> = Layer.sync(Queries, makeQueryRegistry)

package/src/scene/scene.ts

@@ -1,8 +1,10 @@
 import { Layer } from 'effect'
 import type { CompositionClass, CompositionService } from '../compose/composition'
 import type { UiContract } from '../compose/ui'
+import type { EventOf } from '../event/event'
 import { CurrentSeedOverrides } from '../internal/seeds'
-import type { Bus, Tagged } from '../runtime/bus'
+import type { SeedsOf } from '../state/stateGroup'
+import type { Bus } from '../runtime/bus'
 
 // A scene is a VALUE — a composition plus the closed wiring that runs it: the
 // layers that supply its logic/views (each seeding its own live state) and the
@@ -23,27 +25,37 @@ import type { Bus, Tagged } from '../runtime/bus'
  */
 export type MountedServices = CompositionService | Bus
 
-export interface Scene<C extends UiContract = UiContract> {
+// A scene's boot list holds CONSTRUCTED events (`Event.construct(E, payload)`),
+// not bare tagged objects — a lightweight nudge toward the real builder. It is
+// not a guarantee the event is handled by the wiring (reform carries no
+// type-level union of handled tags), only that it came from an event definition.
+type BootEvent = EventOf<string, unknown>
+
+export interface Scene<
+  C extends UiContract = UiContract,
+  S extends ReadonlyArray<unknown> = ReadonlyArray<unknown>,
+> {
   readonly kind: 'Scene'
-  /** The composition to run, with its contract preserved for typed consumers. */
-  readonly composition: CompositionClass<unknown, C>
+  /** The composition to run, with its contract + states preserved for typed consumers. */
+  readonly composition: CompositionClass<unknown, C, S>
   /** Closed wiring (logic + views), each layer seeding its own live state. */
   readonly provide: ReadonlyArray<Layer.Layer<MountedServices, never, never>>
   /** Events dispatched once the runtime is live (e.g. `RequestedTodos`). */
-  readonly boot?: ReadonlyArray<Tagged>
+  readonly boot?: ReadonlyArray<BootEvent>
 }
 
 /**
  * Define a scene — `scene(TodoApp, { provide: [makeTestApp(client, seeds)] })`.
- * The composition's contract flows through `C`, so consumers stay typed.
+ * The composition's contract `C` and state tuple `S` flow through, so consumers
+ * (the facade, `seedScene`) stay typed.
  */
-export const scene = <C extends UiContract>(
-  composition: CompositionClass<unknown, C>,
+export const scene = <C extends UiContract, S extends ReadonlyArray<unknown>>(
+  composition: CompositionClass<unknown, C, S>,
   config: {
     readonly provide: ReadonlyArray<Layer.Layer<MountedServices, never, never>>
-    readonly boot?: ReadonlyArray<Tagged>
+    readonly boot?: ReadonlyArray<BootEvent>
   },
-): Scene<C> => ({
+): Scene<C, S> => ({
   kind: 'Scene',
   composition,
   provide: config.provide,
@@ -63,10 +75,10 @@ export const scene = <C extends UiContract>(
  * an invalid value silently falls back to the authored seed. `StateFamily`
  * entries are not covered.
  */
-export const seedScene = <C extends UiContract>(
-  base: Scene<C>,
-  seeds: Readonly<Record<string, unknown>>,
-): Scene<C> =>
+export const seedScene = <C extends UiContract, S extends ReadonlyArray<unknown>>(
+  base: Scene<C, S>,
+  seeds: SeedsOf<S>,
+): Scene<C, S> =>
   Object.keys(seeds).length === 0
     ? base
     : { ...base, provide: base.provide.map(Layer.locally(CurrentSeedOverrides, seeds)) }