@optimystic/db-core 0.13.5 → 0.14.1

package/dist/src/reactivity/push-state.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"push-state.js","sourceRoot":"","sources":["../../../src/reactivity/push-state.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,mBAAmB,EAAE,mBAAmB,EAAE,yBAAyB,EAAE,MAAM,+BAA+B,CAAC;AAClJ,OAAO,EAAE,eAAe,EAAE,MAAM,kCAAkC,CAAC;AACnE,OAAO,EAAE,qBAAqB,EAAE,iBAAiB,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAClF,OAAO,EAAE,4BAA4B,EAA6D,MAAM,mBAAmB,CAAC;AAC5H,OAAO,EAAE,iBAAiB,EAA+D,MAAM,iBAAiB,CAAC;AACjH,OAAO,EAAE,kBAAkB,EAAyC,MAAM,aAAa,CAAC;AACxF,OAAO,EAAE,kBAAkB,EAAmE,MAAM,oBAAoB,CAAC;AACzH,OAAO,EAAE,sBAAsB,EAAuB,MAAM,WAAW,CAAC;AAmDxE;;;GAGG;AACH,MAAM,OAAO,SAAS;IACZ,YAAY,CAAS;IACrB,OAAO,CAAS;IACzB,YAAY,CAAS;IACrB,YAAY,CAAa;IACzB,YAAY,CAAc;IACjB,YAAY,CAAe;IAC3B,MAAM,CAAe;IAC9B,YAAY,CAAS;IAErB;;;;;OAKG;IACM,UAAU,CAAoB;IACvC;;;;OAIG;IACM,kBAAkB,CAAyB;IACpD;;;;;;OAMG;IACK,SAAS,CAAqB;IAEtC,YAAY,IAAmB;QAC9B,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;QACtC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;QACtC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;QACtC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,IAAI,EAAE,CAAC;QAC5C,IAAI,CAAC,UAAU,GAAG,IAAI,iBAAiB,CAAC;YACvC,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,IAAI,EAAE,IAAI,CAAC,WAAW;YACtB,aAAa,EAAE,IAAI,CAAC,aAAa;YACjC,IAAI,EAAE,IAAI,CAAC,cAAc;YACzB,cAAc,EAAE,IAAI,CAAC,cAAc;SACnC,CAAC,CAAC;QACH,+FAA+F;QAC/F,oFAAoF;QACpF,IAAI,CAAC,YAAY,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;QAC1G,IAAI,CAAC,MAAM,GAAG,kBAAkB,CAAC,IAAI,CAAC,YAAY,IAAI,qBAAqB,CAAC,CAAC;QAC7E,IAAI,CAAC,kBAAkB,GAAG,4BAA4B,CAAC,IAAI,CAAC,QAAQ,IAAI,iBAAiB,CAAC,CAAC;QAC3F,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;IACxB,CAAC;IAED;;;;OAIG;IACH,qBAAqB,CAAC,aAA+B,EAAE,CAAiB;QACvE,OAAO,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IACzD,CAAC;IAED,yGAAyG;IACzG,IAAI,mBAAmB;QACtB,OAAO,IAAI,CAAC,SAAS,CAAC;IACvB,CAAC;IAED;;;;OAIG;IACH,uBAAuB,CAAC,OAA0B;QACjD,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,IAAI,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC;YACpF,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC;QAC1B,CAAC;IACF,CAAC;IAED;;;;OAIG;IACH,IAAI,gBAAgB;QACnB,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;IAClC,CAAC;IAED,4DAA4D;IAC5D,eAAe;QACd,MAAM,GAAG,GAAsB;YAC9B,CAAC,EAAE,CAAC;YACJ,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,YAAY,EAAE,IAAI,CAAC,YAAY,CAAC,SAAS,EAAE;YAC3C,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE;SAC/B,CAAC;QACF,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;YACrC,GAAG,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;QACtC,CAAC;QACD,OAAO,GAAG,CAAC;IACZ,CAAC;IAED,sGAAsG;IACtG,WAAW,CAAC,CAAoB;QAC/B,IAAI,CAAC,CAAC,YAAY,KAAK,IAAI,CAAC,YAAY,IAAI,CAAC,CAAC,OAAO,KAAK,IAAI,CAAC,OAAO,EAAE,CAAC;YACxE,OAAO,CAAC,+DAA+D;QACxE,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;QACxC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC5B,IAAI,CAAC,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;YACxC,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY,CAAC;QACpC,CAAC;QACD,IAAI,CAAC,CAAC,YAAY,CAAC,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC;YACtD,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY,CAAC;QACpC,CAAC;QACD,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS,IAAI,CAAC,CAAC,YAAY,KAAK,SAAS,EAAE,CAAC;YACrE,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY,CAAC;QACpC,CAAC;IACF,CAAC;CACD;AAED,gFAAgF;AAEhF,SAAS,IAAI,CAAC,OAAe;IAC5B,MAAM,IAAI,eAAe,CAAC,OAAO,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,QAAQ,CAAC,KAAc,EAAE,IAAY;IAC7C,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzE,IAAI,CAAC,GAAG,IAAI,sBAAsB,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,KAAgC,CAAC;AACzC,CAAC;AAED,SAAS,SAAS,CAAC,GAA4B,EAAE,GAAW,EAAE,IAAY;IACzE,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IACvB,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC/B,IAAI,CAAC,GAAG,IAAI,YAAY,GAAG,oBAAoB,CAAC,CAAC;IAClD,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,SAAS,eAAe,CAAC,GAA4B,EAAE,GAAW,EAAE,IAAY;IAC/E,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;IACvB,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1D,IAAI,CAAC,GAAG,IAAI,YAAY,GAAG,2BAA2B,CAAC,CAAC;IACzD,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,SAAS,MAAM,CAAC,KAAa,EAAE,GAAW,EAAE,IAAY;IACvD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9B,IAAI,CAAC,GAAG,IAAI,YAAY,GAAG,6BAA6B,KAAK,EAAE,CAAC,CAAC;IAClE,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,SAAS,WAAW,CAAC,KAAa,EAAE,GAAW,EAAE,IAAY;IAC5D,IAAI,CAAC;QACJ,aAAa,CAAC,KAAK,CAAC,CAAC;IACtB,CAAC;IAAC,MAAM,CAAC;QACR,IAAI,CAAC,GAAG,IAAI,YAAY,GAAG,0BAA0B,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,SAAS,iBAAiB,CAAC,KAAc,EAAE,IAAY;IACtD,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,CAAC,GAAG,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;IACxE,IAAI,GAAG,CAAC,SAAS,CAAC,KAAK,SAAS,EAAE,CAAC;QAClC,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC,SAAS,CAAC,GAAG,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE,CAAC;IAC1F,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,CAAC;AAClB,CAAC;AAED,SAAS,qBAAqB,CAAC,KAAc,EAAE,IAAY;IAC1D,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAClC,OAAO;QACN,QAAQ,EAAE,MAAM,CAAC,eAAe,CAAC,GAAG,EAAE,UAAU,EAAE,IAAI,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC;QAC1E,OAAO,EAAE,sBAAsB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC/C,UAAU,EAAE,eAAe,CAAC,GAAG,EAAE,YAAY,EAAE,IAAI,CAAC;KACpD,CAAC;AACH,CAAC;AAED,SAAS,yBAAyB,CAAC,KAAc,EAAE,IAAY;IAC9D,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAClC,MAAM,OAAO,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC;IAC/B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QAC7B,IAAI,CAAC,GAAG,IAAI,oCAAoC,CAAC,CAAC;IACnD,CAAC;IACD,OAAO;QACN,QAAQ,EAAE,MAAM,CAAC,eAAe,CAAC,GAAG,EAAE,UAAU,EAAE,IAAI,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC;QAC1E,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,qBAAqB,CAAC,CAAC,EAAE,GAAG,IAAI,QAAQ,CAAC,CAAC;KACtE,CAAC;AACH,CAAC;AAED,SAAS,mBAAmB,CAAC,KAAc,EAAE,IAAY;IACxD,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAClC,MAAM,OAAO,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC;IAC/B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QAC7B,IAAI,CAAC,GAAG,IAAI,oCAAoC,CAAC,CAAC;IACnD,CAAC;IACD,OAAO;QACN,eAAe,EAAE,MAAM,CAAC,eAAe,CAAC,GAAG,EAAE,iBAAiB,EAAE,IAAI,CAAC,EAAE,iBAAiB,EAAE,IAAI,CAAC;QAC/F,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAC1B,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,EAAE,GAAG,IAAI,QAAQ,CAAC,CAAC;YACxC,OAAO,EAAE,GAAG,EAAE,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,IAAI,QAAQ,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,eAAe,CAAC,EAAE,EAAE,UAAU,EAAE,GAAG,IAAI,QAAQ,CAAC,EAAE,UAAU,EAAE,GAAG,IAAI,QAAQ,CAAC,EAAE,CAAC;QACxJ,CAAC,CAAC;KACF,CAAC;AACH,CAAC;AAED,2FAA2F;AAC3F,MAAM,UAAU,yBAAyB,CAAC,KAAc;IACvD,MAAM,IAAI,GAAG,mBAAmB,CAAC;IACjC,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAClC,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QACpB,IAAI,CAAC,GAAG,IAAI,2BAA2B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IACpE,CAAC;IACD,MAAM,YAAY,GAAG,GAAG,CAAC,cAAc,CAAC,CAAC;IACzC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,CAAC;QAClC,IAAI,CAAC,GAAG,IAAI,yCAAyC,CAAC,CAAC;IACxD,CAAC;IACD,MAAM,GAAG,GAAsB;QAC9B,CAAC,EAAE,CAAC;QACJ,YAAY,EAAE,WAAW,CAAC,SAAS,CAAC,GAAG,EAAE,cAAc,EAAE,IAAI,CAAC,EAAE,cAAc,EAAE,IAAI,CAAC;QACrF,OAAO,EAAE,WAAW,CAAC,SAAS,CAAC,GAAG,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC;QACtE,YAAY,EAAE,WAAW,CAAC,SAAS,CAAC,GAAG,EAAE,cAAc,EAAE,IAAI,CAAC,EAAE,cAAc,EAAE,IAAI,CAAC;QACrF,YAAY,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,CAAC,EAAE,GAAG,IAAI,cAAc,CAAC,CAAC;QAClF,YAAY,EAAE,MAAM,CAAC,eAAe,CAAC,GAAG,EAAE,cAAc,EAAE,IAAI,CAAC,EAAE,cAAc,EAAE,IAAI,CAAC;QACtF,YAAY,EAAE,yBAAyB,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,GAAG,IAAI,eAAe,CAAC;QACpF,MAAM,EAAE,mBAAmB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,GAAG,IAAI,SAAS,CAAC;KAC5D,CAAC;IACF,IAAI,GAAG,CAAC,cAAc,CAAC,KAAK,SAAS,EAAE,CAAC;QACvC,GAAG,CAAC,YAAY,GAAG,iBAAiB,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,GAAG,IAAI,eAAe,CAAC,CAAC;IACnF,CAAC;IACD,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,uBAAuB,CAAC,GAAsB,EAAE,kBAA0B,yBAAyB;IAClH,OAAO,mBAAmB,CAAC,yBAAyB,CAAC,GAAG,CAAC,EAAE,eAAe,CAAC,CAAC;AAC7E,CAAC;AAED,gEAAgE;AAChE,MAAM,UAAU,uBAAuB,CAAC,KAAiB,EAAE,eAAwB;IAClF,OAAO,yBAAyB,CAAC,mBAAmB,CAAC,KAAK,EAAE,eAAe,CAAC,CAAC,CAAC;AAC/E,CAAC;AAED,0GAA0G;AAC1G,MAAM,UAAU,mBAAmB,CAAC,GAAc;IACjD,OAAO,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AACjC,CAAC;AAED,6EAA6E;AAC7E,MAAM,UAAU,aAAa,CAAC,KAAiB,EAAE,OAAoB;IACpE,OAAO,OAAO,KAAK,SAAS;QAC3B,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,aAAa,CAAC,OAAO,CAAC,EAAE;QAClE,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;AACpC,CAAC"}

package/dist/src/reactivity/recover.d.ts

@@ -0,0 +1,75 @@
+/**
+ * Reactivity — recover RPC envelope (`docs/reactivity.md` §Backfill RPC, §Resume, §Wire formats).
+ *
+ * The db-p2p recover transport runs **one** request-reply protocol
+ * (`/optimystic/reactivity/1.0.0/recover`) carrying either a backfill or a resume exchange. Rather than
+ * disambiguate two payload shapes structurally off the wire, this module owns an explicit discriminated
+ * wrapper so the `kind` discriminant is authoritative: a `kind: "backfill"` frame MUST carry a `backfill`
+ * body and no `resume` body (and vice-versa). db-core owns every reactivity wire codec, so the envelope
+ * lives here next to the {@link import("./backfill.js").BackfillV1} / {@link import("./resume.js").ResumeV1}
+ * payloads it wraps and reuses their per-message validators for the inner branches.
+ *
+ * **Reply-only `"rotated"` kind.** A subscriber only ever *asks* for a backfill or a resume, so
+ * {@link RecoverKind} (the request discriminant) is the narrower `"backfill" | "resume"`. A *reply*,
+ * however, may carry a third kind — `"rotated"`, the drain-window {@link RotationRedirectV1} a serving
+ * cohort hands a request that arrived at an outgoing tail after it rotated (`docs/reactivity.md` §Tail
+ * rotation). The recover reply is the only reactivity surface a subscriber reaches a serving cohort on (a
+ * fresh subscribe rides generic cohort-topic `service.register`, whose walk only understands tier-`Promoted`,
+ * never a topic redirect), so the redirect rides the recover reply rather than registration.
+ *
+ * **Forward-compat (fail-closed).** A decoder that predates the `"rotated"` kind rejects it outright — its
+ * `kind` narrower only admits `backfill`/`resume` — so an older peer cannot misread a redirect; it simply
+ * treats the reply as malformed (no reply / decode failure) and the subscriber falls back to a chain read,
+ * which is always safe. A redirect is therefore an *optional optimization* a newer serving cohort offers,
+ * never a correctness dependency.
+ *
+ * Wire conventions match the rest of reactivity: JSON, byte fields base64url, `v: 1`, per-message
+ * structural validation on decode (a `kind`/branch mismatch is `failWire`).
+ */
+import { type BackfillV1, type BackfillReplyV1 } from "./backfill.js";
+import { type ResumeV1, type ResumeReplyV1 } from "./resume.js";
+import { type RotationRedirectV1 } from "./rotation.js";
+/** The recover RPC **request** discriminant: which of the two recovery exchanges a subscriber asks for. */
+export type RecoverKind = "backfill" | "resume";
+/**
+ * The recover RPC **reply** discriminant. A superset of {@link RecoverKind}: a reply may additionally be a
+ * `"rotated"` {@link RotationRedirectV1} (a subscriber never *asks* for a redirect, so the request kind
+ * stays narrower).
+ */
+export type RecoverReplyKind = RecoverKind | "rotated";
+/** A subscriber's recover request — exactly one of {@link backfill} / {@link resume}, per {@link kind}. */
+export interface RecoverRequestV1 {
+    v: 1;
+    kind: RecoverKind;
+    /** Present iff `kind === "backfill"`. */
+    backfill?: BackfillV1;
+    /** Present iff `kind === "resume"`. */
+    resume?: ResumeV1;
+}
+/**
+ * The cohort's recover reply — exactly one of {@link backfillReply} / {@link resumeReply} / {@link rotated},
+ * per {@link kind}.
+ */
+export interface RecoverReplyV1 {
+    v: 1;
+    kind: RecoverReplyKind;
+    /** Present iff `kind === "backfill"`. */
+    backfillReply?: BackfillReplyV1;
+    /** Present iff `kind === "resume"`. */
+    resumeReply?: ResumeReplyV1;
+    /** Present iff `kind === "rotated"` — the drain-window redirect to the rotated tree. */
+    rotated?: RotationRedirectV1;
+}
+/** Narrow an already-parsed value to {@link RecoverRequestV1}, throwing on any defect or kind/branch mismatch. */
+export declare function validateRecoverRequestV1(value: unknown): RecoverRequestV1;
+/** Narrow an already-parsed value to {@link RecoverReplyV1}, throwing on any defect or kind/branch mismatch. */
+export declare function validateRecoverReplyV1(value: unknown): RecoverReplyV1;
+/** Encode a {@link RecoverRequestV1} as a length-prefixed UTF-8 JSON frame. */
+export declare function encodeRecoverRequestV1(msg: RecoverRequestV1, maxMessageBytes?: number): Uint8Array;
+/** Decode a length-prefixed {@link RecoverRequestV1} frame. */
+export declare function decodeRecoverRequestV1(bytes: Uint8Array, maxMessageBytes?: number): RecoverRequestV1;
+/** Encode a {@link RecoverReplyV1} as a length-prefixed UTF-8 JSON frame. */
+export declare function encodeRecoverReplyV1(msg: RecoverReplyV1, maxMessageBytes?: number): Uint8Array;
+/** Decode a length-prefixed {@link RecoverReplyV1} frame. */
+export declare function decodeRecoverReplyV1(bytes: Uint8Array, maxMessageBytes?: number): RecoverReplyV1;
+//# sourceMappingURL=recover.d.ts.map

package/dist/src/reactivity/recover.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"recover.d.ts","sourceRoot":"","sources":["../../../src/reactivity/recover.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAQH,OAAO,EAA+C,KAAK,UAAU,EAAE,KAAK,eAAe,EAAE,MAAM,eAAe,CAAC;AACnH,OAAO,EAA2C,KAAK,QAAQ,EAAE,KAAK,aAAa,EAAE,MAAM,aAAa,CAAC;AACzG,OAAO,EAA8B,KAAK,kBAAkB,EAAE,MAAM,eAAe,CAAC;AAEpF,2GAA2G;AAC3G,MAAM,MAAM,WAAW,GAAG,UAAU,GAAG,QAAQ,CAAC;AAEhD;;;;GAIG;AACH,MAAM,MAAM,gBAAgB,GAAG,WAAW,GAAG,SAAS,CAAC;AAEvD,2GAA2G;AAC3G,MAAM,WAAW,gBAAgB;IAChC,CAAC,EAAE,CAAC,CAAC;IACL,IAAI,EAAE,WAAW,CAAC;IAClB,yCAAyC;IACzC,QAAQ,CAAC,EAAE,UAAU,CAAC;IACtB,uCAAuC;IACvC,MAAM,CAAC,EAAE,QAAQ,CAAC;CAClB;AAED;;;GAGG;AACH,MAAM,WAAW,cAAc;IAC9B,CAAC,EAAE,CAAC,CAAC;IACL,IAAI,EAAE,gBAAgB,CAAC;IACvB,yCAAyC;IACzC,aAAa,CAAC,EAAE,eAAe,CAAC;IAChC,uCAAuC;IACvC,WAAW,CAAC,EAAE,aAAa,CAAC;IAC5B,wFAAwF;IACxF,OAAO,CAAC,EAAE,kBAAkB,CAAC;CAC7B;AA2BD,kHAAkH;AAClH,wBAAgB,wBAAwB,CAAC,KAAK,EAAE,OAAO,GAAG,gBAAgB,CAWzE;AAED,gHAAgH;AAChH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,OAAO,GAAG,cAAc,CAkBrE;AAED,+EAA+E;AAC/E,wBAAgB,sBAAsB,CAAC,GAAG,EAAE,gBAAgB,EAAE,eAAe,GAAE,MAAkC,GAAG,UAAU,CAE7H;AAED,+DAA+D;AAC/D,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,UAAU,EAAE,eAAe,CAAC,EAAE,MAAM,GAAG,gBAAgB,CAEpG;AAED,6EAA6E;AAC7E,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,cAAc,EAAE,eAAe,GAAE,MAAkC,GAAG,UAAU,CAEzH;AAED,6DAA6D;AAC7D,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,UAAU,EAAE,eAAe,CAAC,EAAE,MAAM,GAAG,cAAc,CAEhG"}

package/dist/src/reactivity/recover.js

@@ -0,0 +1,105 @@
+/**
+ * Reactivity — recover RPC envelope (`docs/reactivity.md` §Backfill RPC, §Resume, §Wire formats).
+ *
+ * The db-p2p recover transport runs **one** request-reply protocol
+ * (`/optimystic/reactivity/1.0.0/recover`) carrying either a backfill or a resume exchange. Rather than
+ * disambiguate two payload shapes structurally off the wire, this module owns an explicit discriminated
+ * wrapper so the `kind` discriminant is authoritative: a `kind: "backfill"` frame MUST carry a `backfill`
+ * body and no `resume` body (and vice-versa). db-core owns every reactivity wire codec, so the envelope
+ * lives here next to the {@link import("./backfill.js").BackfillV1} / {@link import("./resume.js").ResumeV1}
+ * payloads it wraps and reuses their per-message validators for the inner branches.
+ *
+ * **Reply-only `"rotated"` kind.** A subscriber only ever *asks* for a backfill or a resume, so
+ * {@link RecoverKind} (the request discriminant) is the narrower `"backfill" | "resume"`. A *reply*,
+ * however, may carry a third kind — `"rotated"`, the drain-window {@link RotationRedirectV1} a serving
+ * cohort hands a request that arrived at an outgoing tail after it rotated (`docs/reactivity.md` §Tail
+ * rotation). The recover reply is the only reactivity surface a subscriber reaches a serving cohort on (a
+ * fresh subscribe rides generic cohort-topic `service.register`, whose walk only understands tier-`Promoted`,
+ * never a topic redirect), so the redirect rides the recover reply rather than registration.
+ *
+ * **Forward-compat (fail-closed).** A decoder that predates the `"rotated"` kind rejects it outright — its
+ * `kind` narrower only admits `backfill`/`resume` — so an older peer cannot misread a redirect; it simply
+ * treats the reply as malformed (no reply / decode failure) and the subscriber falls back to a chain read,
+ * which is always safe. A redirect is therefore an *optional optimization* a newer serving cohort offers,
+ * never a correctness dependency.
+ *
+ * Wire conventions match the rest of reactivity: JSON, byte fields base64url, `v: 1`, per-message
+ * structural validation on decode (a `kind`/branch mismatch is `failWire`).
+ */
+import { decodeCohortMessage, encodeCohortMessage, DEFAULT_MAX_MESSAGE_BYTES, } from "../cohort-topic/wire/codec.js";
+import { asObject, failWire, requireV1 } from "./wire-validate.js";
+import { validateBackfillV1, validateBackfillReplyV1 } from "./backfill.js";
+import { validateResumeV1, validateResumeReplyV1 } from "./resume.js";
+import { validateRotationRedirectV1 } from "./rotation.js";
+/** Narrow `obj.kind` to a {@link RecoverKind} (request side), throwing on any other value. */
+function reqKind(obj, what) {
+    const kind = obj["kind"];
+    if (kind !== "backfill" && kind !== "resume") {
+        failWire(`${what}: field "kind" must be "backfill" or "resume"`);
+    }
+    return kind;
+}
+/** Narrow `obj.kind` to a {@link RecoverReplyKind} (reply side — also admits `"rotated"`). */
+function reqReplyKind(obj, what) {
+    const kind = obj["kind"];
+    if (kind !== "backfill" && kind !== "resume" && kind !== "rotated") {
+        failWire(`${what}: field "kind" must be "backfill", "resume", or "rotated"`);
+    }
+    return kind;
+}
+/** Reject a frame carrying `branch`, the body that does not belong to the declared `kind`. */
+function rejectStrayBranch(obj, branch, what) {
+    if (obj[branch] !== undefined) {
+        failWire(`${what}: a "${branch}" body is present but does not match the declared kind`);
+    }
+}
+/** Narrow an already-parsed value to {@link RecoverRequestV1}, throwing on any defect or kind/branch mismatch. */
+export function validateRecoverRequestV1(value) {
+    const what = "RecoverRequestV1";
+    const obj = asObject(value, what);
+    requireV1(obj, what);
+    const kind = reqKind(obj, what);
+    if (kind === "backfill") {
+        rejectStrayBranch(obj, "resume", what);
+        return { v: 1, kind, backfill: validateBackfillV1(obj["backfill"]) };
+    }
+    rejectStrayBranch(obj, "backfill", what);
+    return { v: 1, kind, resume: validateResumeV1(obj["resume"]) };
+}
+/** Narrow an already-parsed value to {@link RecoverReplyV1}, throwing on any defect or kind/branch mismatch. */
+export function validateRecoverReplyV1(value) {
+    const what = "RecoverReplyV1";
+    const obj = asObject(value, what);
+    requireV1(obj, what);
+    const kind = reqReplyKind(obj, what);
+    if (kind === "backfill") {
+        rejectStrayBranch(obj, "resumeReply", what);
+        rejectStrayBranch(obj, "rotated", what);
+        return { v: 1, kind, backfillReply: validateBackfillReplyV1(obj["backfillReply"]) };
+    }
+    if (kind === "resume") {
+        rejectStrayBranch(obj, "backfillReply", what);
+        rejectStrayBranch(obj, "rotated", what);
+        return { v: 1, kind, resumeReply: validateResumeReplyV1(obj["resumeReply"]) };
+    }
+    rejectStrayBranch(obj, "backfillReply", what);
+    rejectStrayBranch(obj, "resumeReply", what);
+    return { v: 1, kind, rotated: validateRotationRedirectV1(obj["rotated"]) };
+}
+/** Encode a {@link RecoverRequestV1} as a length-prefixed UTF-8 JSON frame. */
+export function encodeRecoverRequestV1(msg, maxMessageBytes = DEFAULT_MAX_MESSAGE_BYTES) {
+    return encodeCohortMessage(validateRecoverRequestV1(msg), maxMessageBytes);
+}
+/** Decode a length-prefixed {@link RecoverRequestV1} frame. */
+export function decodeRecoverRequestV1(bytes, maxMessageBytes) {
+    return validateRecoverRequestV1(decodeCohortMessage(bytes, maxMessageBytes));
+}
+/** Encode a {@link RecoverReplyV1} as a length-prefixed UTF-8 JSON frame. */
+export function encodeRecoverReplyV1(msg, maxMessageBytes = DEFAULT_MAX_MESSAGE_BYTES) {
+    return encodeCohortMessage(validateRecoverReplyV1(msg), maxMessageBytes);
+}
+/** Decode a length-prefixed {@link RecoverReplyV1} frame. */
+export function decodeRecoverReplyV1(bytes, maxMessageBytes) {
+    return validateRecoverReplyV1(decodeCohortMessage(bytes, maxMessageBytes));
+}
+//# sourceMappingURL=recover.js.map

package/dist/src/reactivity/recover.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"recover.js","sourceRoot":"","sources":["../../../src/reactivity/recover.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAEH,OAAO,EACN,mBAAmB,EACnB,mBAAmB,EACnB,yBAAyB,GACzB,MAAM,+BAA+B,CAAC;AACvC,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AACnE,OAAO,EAAE,kBAAkB,EAAE,uBAAuB,EAAyC,MAAM,eAAe,CAAC;AACnH,OAAO,EAAE,gBAAgB,EAAE,qBAAqB,EAAqC,MAAM,aAAa,CAAC;AACzG,OAAO,EAAE,0BAA0B,EAA2B,MAAM,eAAe,CAAC;AAqCpF,8FAA8F;AAC9F,SAAS,OAAO,CAAC,GAA4B,EAAE,IAAY;IAC1D,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;IACzB,IAAI,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC9C,QAAQ,CAAC,GAAG,IAAI,+CAA+C,CAAC,CAAC;IAClE,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED,8FAA8F;AAC9F,SAAS,YAAY,CAAC,GAA4B,EAAE,IAAY;IAC/D,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;IACzB,IAAI,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACpE,QAAQ,CAAC,GAAG,IAAI,2DAA2D,CAAC,CAAC;IAC9E,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED,8FAA8F;AAC9F,SAAS,iBAAiB,CAAC,GAA4B,EAAE,MAAc,EAAE,IAAY;IACpF,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,SAAS,EAAE,CAAC;QAC/B,QAAQ,CAAC,GAAG,IAAI,QAAQ,MAAM,wDAAwD,CAAC,CAAC;IACzF,CAAC;AACF,CAAC;AAED,kHAAkH;AAClH,MAAM,UAAU,wBAAwB,CAAC,KAAc;IACtD,MAAM,IAAI,GAAG,kBAAkB,CAAC;IAChC,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAClC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IACrB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IAChC,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;QACzB,iBAAiB,CAAC,GAAG,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;QACvC,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,kBAAkB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC;IACtE,CAAC;IACD,iBAAiB,CAAC,GAAG,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;IACzC,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;AAChE,CAAC;AAED,gHAAgH;AAChH,MAAM,UAAU,sBAAsB,CAAC,KAAc;IACpD,MAAM,IAAI,GAAG,gBAAgB,CAAC;IAC9B,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAClC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IACrB,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IACrC,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;QACzB,iBAAiB,CAAC,GAAG,EAAE,aAAa,EAAE,IAAI,CAAC,CAAC;QAC5C,iBAAiB,CAAC,GAAG,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;QACxC,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,uBAAuB,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC;IACrF,CAAC;IACD,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;QACvB,iBAAiB,CAAC,GAAG,EAAE,eAAe,EAAE,IAAI,CAAC,CAAC;QAC9C,iBAAiB,CAAC,GAAG,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;QACxC,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,qBAAqB,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC;IAC/E,CAAC;IACD,iBAAiB,CAAC,GAAG,EAAE,eAAe,EAAE,IAAI,CAAC,CAAC;IAC9C,iBAAiB,CAAC,GAAG,EAAE,aAAa,EAAE,IAAI,CAAC,CAAC;IAC5C,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,0BAA0B,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC;AAC5E,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,sBAAsB,CAAC,GAAqB,EAAE,kBAA0B,yBAAyB;IAChH,OAAO,mBAAmB,CAAC,wBAAwB,CAAC,GAAG,CAAC,EAAE,eAAe,CAAC,CAAC;AAC5E,CAAC;AAED,+DAA+D;AAC/D,MAAM,UAAU,sBAAsB,CAAC,KAAiB,EAAE,eAAwB;IACjF,OAAO,wBAAwB,CAAC,mBAAmB,CAAC,KAAK,EAAE,eAAe,CAAC,CAAC,CAAC;AAC9E,CAAC;AAED,6EAA6E;AAC7E,MAAM,UAAU,oBAAoB,CAAC,GAAmB,EAAE,kBAA0B,yBAAyB;IAC5G,OAAO,mBAAmB,CAAC,sBAAsB,CAAC,GAAG,CAAC,EAAE,eAAe,CAAC,CAAC;AAC1E,CAAC;AAED,6DAA6D;AAC7D,MAAM,UAAU,oBAAoB,CAAC,KAAiB,EAAE,eAAwB;IAC/E,OAAO,sBAAsB,CAAC,mBAAmB,CAAC,KAAK,EAAE,eAAe,CAAC,CAAC,CAAC;AAC5E,CAAC"}

package/dist/src/reactivity/replay-buffer.d.ts

@@ -0,0 +1,57 @@
+/**
+ * Reactivity — replay window (`docs/reactivity.md` §Replay window).
+ *
+ * Each forwarder and the tail cohort keep a per-collection ring buffer of the last `W` notifications
+ * (default 256). Entries are gossiped across the cohort ({@link ReplayBuffer.serialize} /
+ * {@link ReplayBuffer.merge}) so **any** cohort member — not just the primary — can serve a replay if
+ * the primary is unavailable. This buffer is the substrate the backfill/resume ticket reads from; this
+ * ticket owns its construction, ring semantics, gossip replication, and the any-member-serves property.
+ *
+ * The ring is keyed by revision, not by insertion slot, so a retransmit that arrives out of order (the
+ * recovery case the dedupe window admits) lands at its correct revision. Capacity `W` bounds the number
+ * of *distinct revisions* retained; the lowest revision is dropped when a new one overflows the ring.
+ */
+import type { NotificationV1 } from "./wire.js";
+/** One replay-buffer entry: the full signed notification plus its local receive time. */
+export interface RevisionEntry {
+    readonly revision: number;
+    /** The full signed notification (retains the original threshold signature; backfills verify end-to-end). */
+    readonly payload: NotificationV1;
+    /** Unix ms. */
+    readonly receivedAt: number;
+}
+/** Serializable replay-buffer state for intra-cohort gossip replication. */
+export interface ReplayBufferStateV1 {
+    readonly capacity: number;
+    readonly entries: readonly RevisionEntry[];
+}
+/** A per-collection ring buffer of the last `W` notifications, gossip-replicated across the cohort. */
+export interface ReplayBuffer {
+    /** Configured ring capacity `W`. */
+    readonly capacity: number;
+    /** Number of distinct revisions currently retained. */
+    readonly size: number;
+    /** Lowest retained revision, or `undefined` when empty. */
+    readonly lowRevision: number | undefined;
+    /** Highest retained revision, or `undefined` when empty. */
+    readonly highRevision: number | undefined;
+    /** Append (or replace, on a retransmit) the entry for its revision, evicting the lowest on overflow. */
+    append(entry: RevisionEntry): void;
+    /** The entry for `revision`, or `undefined` if not in the window. */
+    get(revision: number): RevisionEntry | undefined;
+    /** Entries with `from <= revision <= to`, ascending — the intersection with the window. */
+    range(from: number, to: number): RevisionEntry[];
+    /** All retained entries, ascending by revision. */
+    entries(): RevisionEntry[];
+    /** Snapshot for gossip. */
+    serialize(): ReplayBufferStateV1;
+    /** Merge another member's gossiped buffer (newer `receivedAt` wins a per-revision tie). */
+    merge(state: ReplayBufferStateV1): void;
+}
+/**
+ * Build a {@link ReplayBuffer} with capacity `W` (default {@link W_DEFAULT}). `onEvict`, when supplied, is
+ * invoked with each entry retired from the ring's low edge (the {@link PushState} wires it to the rolling
+ * checkpoint so revisions leaving the replay window roll into the parent-checkpoint summary).
+ */
+export declare function createReplayBuffer(capacity?: number, onEvict?: (entry: RevisionEntry) => void): ReplayBuffer;
+//# sourceMappingURL=replay-buffer.d.ts.map

package/dist/src/reactivity/replay-buffer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"replay-buffer.d.ts","sourceRoot":"","sources":["../../../src/reactivity/replay-buffer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAGH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AAEhD,yFAAyF;AACzF,MAAM,WAAW,aAAa;IAC7B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,4GAA4G;IAC5G,QAAQ,CAAC,OAAO,EAAE,cAAc,CAAC;IACjC,eAAe;IACf,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC5B;AAED,4EAA4E;AAC5E,MAAM,WAAW,mBAAmB;IACnC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,SAAS,aAAa,EAAE,CAAC;CAC3C;AAED,uGAAuG;AACvG,MAAM,WAAW,YAAY;IAC5B,oCAAoC;IACpC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,uDAAuD;IACvD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,2DAA2D;IAC3D,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,SAAS,CAAC;IACzC,4DAA4D;IAC5D,QAAQ,CAAC,YAAY,EAAE,MAAM,GAAG,SAAS,CAAC;IAC1C,wGAAwG;IACxG,MAAM,CAAC,KAAK,EAAE,aAAa,GAAG,IAAI,CAAC;IACnC,qEAAqE;IACrE,GAAG,CAAC,QAAQ,EAAE,MAAM,GAAG,aAAa,GAAG,SAAS,CAAC;IACjD,2FAA2F;IAC3F,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,aAAa,EAAE,CAAC;IACjD,mDAAmD;IACnD,OAAO,IAAI,aAAa,EAAE,CAAC;IAC3B,2BAA2B;IAC3B,SAAS,IAAI,mBAAmB,CAAC;IACjC,2FAA2F;IAC3F,KAAK,CAAC,KAAK,EAAE,mBAAmB,GAAG,IAAI,CAAC;CACxC;AA+ED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,QAAQ,GAAE,MAAkB,EAAE,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,aAAa,KAAK,IAAI,GAAG,YAAY,CAEvH"}

package/dist/src/reactivity/replay-buffer.js

@@ -0,0 +1,88 @@
+/**
+ * Reactivity — replay window (`docs/reactivity.md` §Replay window).
+ *
+ * Each forwarder and the tail cohort keep a per-collection ring buffer of the last `W` notifications
+ * (default 256). Entries are gossiped across the cohort ({@link ReplayBuffer.serialize} /
+ * {@link ReplayBuffer.merge}) so **any** cohort member — not just the primary — can serve a replay if
+ * the primary is unavailable. This buffer is the substrate the backfill/resume ticket reads from; this
+ * ticket owns its construction, ring semantics, gossip replication, and the any-member-serves property.
+ *
+ * The ring is keyed by revision, not by insertion slot, so a retransmit that arrives out of order (the
+ * recovery case the dedupe window admits) lands at its correct revision. Capacity `W` bounds the number
+ * of *distinct revisions* retained; the lowest revision is dropped when a new one overflows the ring.
+ */
+import { W_DEFAULT } from "./config.js";
+class RingReplayBuffer {
+    capacity;
+    /** revision → entry; trimmed to the highest `capacity` revisions. */
+    byRevision = new Map();
+    onEvict;
+    constructor(capacity, onEvict) {
+        if (!Number.isInteger(capacity) || capacity < 1) {
+            throw new RangeError(`reactivity replay buffer: capacity must be an integer >= 1, got ${capacity}`);
+        }
+        this.capacity = capacity;
+        this.onEvict = onEvict;
+    }
+    get size() {
+        return this.byRevision.size;
+    }
+    get lowRevision() {
+        return this.size === 0 ? undefined : Math.min(...this.byRevision.keys());
+    }
+    get highRevision() {
+        return this.size === 0 ? undefined : Math.max(...this.byRevision.keys());
+    }
+    append(entry) {
+        this.byRevision.set(entry.revision, entry);
+        this.trim();
+    }
+    get(revision) {
+        return this.byRevision.get(revision);
+    }
+    range(from, to) {
+        // Iterate the retained entries (≤ capacity) rather than every integer in `[from, to]`: a backfill
+        // request carries a subscriber-supplied range that may be arbitrarily wide, so a per-integer scan
+        // would be an unbounded loop on attacker-controlled input. The intersection with the window is
+        // bounded by `capacity` regardless.
+        return this.entries().filter((e) => e.revision >= from && e.revision <= to);
+    }
+    entries() {
+        return [...this.byRevision.values()].sort((a, b) => a.revision - b.revision);
+    }
+    serialize() {
+        return { capacity: this.capacity, entries: this.entries() };
+    }
+    merge(state) {
+        for (const entry of state.entries) {
+            const existing = this.byRevision.get(entry.revision);
+            // Per-revision convergence: the freshest receiver's copy wins (they carry the same end-to-end
+            // signature, so this only breaks ties on `receivedAt`, never trusts a forged payload).
+            if (existing === undefined || entry.receivedAt > existing.receivedAt) {
+                this.byRevision.set(entry.revision, entry);
+            }
+        }
+        this.trim();
+    }
+    /** Evict the lowest revisions until at most `capacity` distinct revisions remain. */
+    trim() {
+        while (this.byRevision.size > this.capacity) {
+            const lowest = Math.min(...this.byRevision.keys());
+            const evicted = this.byRevision.get(lowest);
+            this.byRevision.delete(lowest);
+            // Hand the retired revision to the (optional) observer — the rolling parent checkpoint
+            // (`docs/reactivity.md` §Parent checkpoint summaries) feeds on exactly these evictions so its
+            // span tracks the window immediately below the ring's low edge.
+            this.onEvict?.(evicted);
+        }
+    }
+}
+/**
+ * Build a {@link ReplayBuffer} with capacity `W` (default {@link W_DEFAULT}). `onEvict`, when supplied, is
+ * invoked with each entry retired from the ring's low edge (the {@link PushState} wires it to the rolling
+ * checkpoint so revisions leaving the replay window roll into the parent-checkpoint summary).
+ */
+export function createReplayBuffer(capacity = W_DEFAULT, onEvict) {
+    return new RingReplayBuffer(capacity, onEvict);
+}
+//# sourceMappingURL=replay-buffer.js.map

package/dist/src/reactivity/replay-buffer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"replay-buffer.js","sourceRoot":"","sources":["../../../src/reactivity/replay-buffer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AA0CxC,MAAM,gBAAgB;IACZ,QAAQ,CAAS;IAC1B,qEAAqE;IACpD,UAAU,GAAG,IAAI,GAAG,EAAyB,CAAC;IAC9C,OAAO,CAAkC;IAE1D,YAAY,QAAgB,EAAE,OAAwC;QACrE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YACjD,MAAM,IAAI,UAAU,CAAC,mEAAmE,QAAQ,EAAE,CAAC,CAAC;QACrG,CAAC;QACD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACxB,CAAC;IAED,IAAI,IAAI;QACP,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;IAC7B,CAAC;IAED,IAAI,WAAW;QACd,OAAO,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;IAC1E,CAAC;IAED,IAAI,YAAY;QACf,OAAO,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;IAC1E,CAAC;IAED,MAAM,CAAC,KAAoB;QAC1B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;QAC3C,IAAI,CAAC,IAAI,EAAE,CAAC;IACb,CAAC;IAED,GAAG,CAAC,QAAgB;QACnB,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACtC,CAAC;IAED,KAAK,CAAC,IAAY,EAAE,EAAU;QAC7B,kGAAkG;QAClG,kGAAkG;QAClG,+FAA+F;QAC/F,oCAAoC;QACpC,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,IAAI,IAAI,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC;IAC7E,CAAC;IAED,OAAO;QACN,OAAO,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IAC9E,CAAC;IAED,SAAS;QACR,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;IAC7D,CAAC;IAED,KAAK,CAAC,KAA0B;QAC/B,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YACrD,8FAA8F;YAC9F,uFAAuF;YACvF,IAAI,QAAQ,KAAK,SAAS,IAAI,KAAK,CAAC,UAAU,GAAG,QAAQ,CAAC,UAAU,EAAE,CAAC;gBACtE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC5C,CAAC;QACF,CAAC;QACD,IAAI,CAAC,IAAI,EAAE,CAAC;IACb,CAAC;IAED,qFAAqF;IAC7E,IAAI;QACX,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;YACnD,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YAC7C,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC/B,uFAAuF;YACvF,8FAA8F;YAC9F,gEAAgE;YAChE,IAAI,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,CAAC;QACzB,CAAC;IACF,CAAC;CACD;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,WAAmB,SAAS,EAAE,OAAwC;IACxG,OAAO,IAAI,gBAAgB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;AAChD,CAAC"}

package/dist/src/reactivity/resume.d.ts

@@ -0,0 +1,214 @@
+/**
+ * Reactivity — Resume RPC: classification, serving, and subscriber-side apply
+ * (`docs/reactivity.md` §Resume, §Parent checkpoint summaries, §Wire formats Resume).
+ *
+ * A subscriber waking from sleep sends one {@link ResumeV1} to its cached primary (or any cohort member).
+ * The serving cohort classifies the request against its **stacked** recovery windows — the `W`-deep replay
+ * ring sits on top of the `W_checkpoint`-span parent checkpoint immediately below it, so a single round
+ * trip recovers `W + W_checkpoint` revisions — and answers with one of four {@link ResumeReplyV1} variants
+ * (`docs/reactivity.md` §Replay window, the authoritative stacked semantics):
+ *
+ *  - **Backfill** — `fromRevision` is within the replay ring (`fromRevision ≥ ringLow`). Returns the
+ *    `[fromRevision, currentRevision]` slice + `currentRevision`. One RT.
+ *  - **CheckpointWindow** — `fromRevision` is below the ring but within the parent checkpoint span
+ *    (`chain low ≤ fromRevision < ringLow`). Returns an ordered, contiguous **chain** of
+ *    {@link CheckpointSummary}s (`checkpoints`, low→high) + the ring's `recentEntries`. The subscriber
+ *    verifies every link's endpoints, applies each link's merged digest, advances its contiguity head past
+ *    the whole chain, then replays the recent entries deduped against `lastRevision`. One RT. The chain is a
+ *    single link in steady state; a new tail that took over across a rotation serves a **two-link**
+ *    `[inherited, rolling]` chain when a `fromRevision` below both the ring and the rolling checkpoint falls
+ *    inside the inherited handoff window — so the full stacked range recovers in one reply regardless of
+ *    where the new tail's own rolling checkpoint has formed (`docs/reactivity.md` §Tail rotation step 5 —
+ *    "the new tail holds the old checkpoint").
+ *  - **OutOfWindow** — older than even the checkpoint. Returns `currentTailId` + `currentRevision`; the
+ *    subscriber falls back to a chain read, then a fresh subscribe.
+ *  - **TailRotated** — the request's `latestKnownTailId` does not match the cohort's current tail (the
+ *    subscriber slept across a rotation). Returns `newTailId` + `newRevisionAtRotation`; the subscriber
+ *    re-registers under the new tail. This is checked **first**: a stale tail means the whole tree moved,
+ *    so the lag-against-windows classification is moot. The rotation *lifecycle* is owned by
+ *    [reactivity-rotation-backpressure-policy]; this module only **detects** the stale tail and emits the
+ *    reply so resume composes with rotation.
+ *
+ * Wire conventions match the rest of reactivity: JSON, byte fields base64url, unix-ms timestamps, `v: 1`,
+ * per-message structural validation on decode. `ResumeV1` is signed by the subscriber's peer key
+ * (`signature`); replay protection rides the request envelope as elsewhere in the substrate.
+ */
+import { type CheckpointSummary, type RollingCheckpoint } from "./checkpoint.js";
+import type { ReplayBuffer } from "./replay-buffer.js";
+import type { ReactivitySubscriber } from "./subscriber.js";
+import type { NotificationVerifier } from "./verify.js";
+import { type NotificationV1 } from "./wire.js";
+/** The four resume classifications (`docs/reactivity.md` §Resume). */
+export type ResumeResult = "backfill" | "checkpoint_window" | "out_of_window" | "tail_rotated";
+/** A subscriber's resume request after waking from sleep. */
+export interface ResumeV1 {
+    v: 1;
+    /** Collection id, base64url. */
+    collectionId: string;
+    /** First revision the subscriber still needs (`lastRevision + 1`). */
+    fromRevision: number;
+    /** Tail block id the subscriber believes is current, base64url (the stale-tail detector). */
+    latestKnownTailId: string;
+    /** The subscriber's ring coordinate, base64url (for the cohort to route the reply). */
+    subscriberCoord: string;
+    /** Unix ms. */
+    timestamp: number;
+    /** Subscriber peer-key signature over the request. */
+    signature: string;
+}
+/** The cohort's classified reply. Fields are populated per the `result` discriminant. */
+export interface ResumeReplyV1 {
+    v: 1;
+    result: ResumeResult;
+    /** The `[fromRevision, currentRevision]` slice held in the replay ring (backfill). */
+    entries?: NotificationV1[];
+    /** Highest committed revision the serving cohort knows (backfill / checkpoint_window / out_of_window). */
+    currentRevision?: number;
+    /**
+     * The parent-checkpoint chain spanning `[chain[0].fromRevision, ringLow − 1]` (checkpoint_window), ordered
+     * low→high and **contiguous**: each `checkpoints[i].fromRevision === checkpoints[i-1].toRevision + 1`. A
+     * single link in steady state; a cross-rotation resume carries the two-link `[inherited, rolling]` bridge.
+     * The subscriber verifies and applies every link in sequence (see {@link applyResumeReply}).
+     */
+    checkpoints?: CheckpointSummary[];
+    /** The replay ring's entries, replayed deduped against `lastRevision` after the digests apply. */
+    recentEntries?: NotificationV1[];
+    /** Current tail block id, base64url — the subscriber re-subscribes after a chain read (out_of_window). */
+    currentTailId?: string;
+    /** New tail block id the topic rotated to, base64url (tail_rotated). */
+    newTailId?: string;
+    /** Revision at which the rotation took effect (tail_rotated). */
+    newRevisionAtRotation?: number;
+}
+/** Narrow an already-parsed value to {@link ResumeV1}, throwing on any defect. */
+export declare function validateResumeV1(value: unknown): ResumeV1;
+/** Narrow an already-parsed value to {@link ResumeReplyV1}, throwing on any defect. */
+export declare function validateResumeReplyV1(value: unknown): ResumeReplyV1;
+/** A {@link ResumeV1} minus its `signature` — the canonical bytes the subscriber peer-key-signs. */
+export type ResumeSignable = Omit<ResumeV1, "signature">;
+/**
+ * Canonical signed byte image of a {@link ResumeV1} (every field except `signature`). Mirrors
+ * {@link import("./backfill.js").backfillSigningPayload}: an explicitly-ordered, type-tagged JSON array
+ * encoded as UTF-8. The `"ResumeV1"` tag means a resume image can never collide with the `"BackfillV1"`
+ * image. `subscriberCoord` is part of the image, so a verifier recomputes over whatever coordinate the
+ * request carries — the field order is the byte-for-byte contract between signer and verifier.
+ */
+export declare function resumeSigningPayload(body: ResumeSignable): Uint8Array;
+/** Encode a {@link ResumeV1} as a length-prefixed UTF-8 JSON frame. */
+export declare function encodeResumeV1(msg: ResumeV1, maxMessageBytes?: number): Uint8Array;
+/** Decode a length-prefixed {@link ResumeV1} frame. */
+export declare function decodeResumeV1(bytes: Uint8Array, maxMessageBytes?: number): ResumeV1;
+/** Encode a {@link ResumeReplyV1} as a length-prefixed UTF-8 JSON frame. */
+export declare function encodeResumeReplyV1(msg: ResumeReplyV1, maxMessageBytes?: number): Uint8Array;
+/** Decode a length-prefixed {@link ResumeReplyV1} frame. */
+export declare function decodeResumeReplyV1(bytes: Uint8Array, maxMessageBytes?: number): ResumeReplyV1;
+/**
+ * Classify a resume request against the serving cohort's stacked windows. The decision order is:
+ *
+ *  1. **tail_rotated** — `req.latestKnownTailId !== currentTailId`. A stale tail means the tree migrated,
+ *     so the lag classification below is moot.
+ *  2. **backfill** — `fromRevision` is at/above the replay ring's low edge (within, or already current).
+ *  3. **checkpoint_window** — below the ring but a gap-free {@link resumeCheckpointChain} covers it: the
+ *     rolling checkpoint (steady state), the inherited cross-rotation handoff (`docs/reactivity.md` §Tail
+ *     rotation step 5 — "the new tail holds the old checkpoint"), or the two-link `[inherited, rolling]`
+ *     bridge spanning both when the new tail's own rolling checkpoint has formed between the handoff and the
+ *     ring.
+ *  4. **out_of_window** — older than even the deepest window, or a gap leaves no contiguous chain to the
+ *     ring (a chain read), or every window is empty/absent.
+ */
+export declare function classifyResume(req: ResumeV1, buffer: ReplayBuffer, checkpoint: RollingCheckpoint | undefined, currentTailId: string, inherited?: CheckpointSummary): ResumeResult;
+/** Construction inputs for {@link serveResume}. */
+export interface ResumeServingDeps {
+    /** The cohort's replay ring (the live `PushState.replayBuffer`). */
+    readonly buffer: ReplayBuffer;
+    /** The cohort's rolling parent checkpoint (the live `PushState.checkpoint`). */
+    readonly checkpoint?: RollingCheckpoint;
+    /**
+     * The checkpoint migrated from the **outgoing** tail when this cohort became the new tail across a
+     * rotation (the live `PushState.inheritedCheckpoint`). Consulted when the rolling {@link checkpoint} does
+     * not cover `fromRevision`: a resume whose span crosses the rotation is answered from the inherited window
+     * — either alone (it abuts the ring directly) or as the lower link of the two-link `[inherited, rolling]`
+     * bridge when the new tail's own rolling checkpoint has formed between the handoff and the ring (see
+     * {@link resumeCheckpointChain}) — instead of falling to `out_of_window` (`docs/reactivity.md` §Tail
+     * rotation step 5).
+     */
+    readonly inheritedCheckpoint?: CheckpointSummary;
+    /** The cohort's current tail block id, base64url. */
+    readonly currentTailId: string;
+    /** Highest committed revision the cohort knows (the live `PushState.lastRevision`). */
+    readonly currentRevision: number;
+    /** Revision the current tail became effective (for a tail_rotated reply); defaults to `currentRevision`. */
+    readonly rotationRevision?: number;
+    /** Collection this cohort serves, base64url — a foreign-collection request is rejected. */
+    readonly expectedCollectionId: string;
+}
+/**
+ * Serve a {@link ResumeV1} from a cohort's stacked windows, producing the classified {@link ResumeReplyV1}.
+ * Pure over the supplied snapshot — no I/O, no clock. A request whose `collectionId` does not match
+ * `expectedCollectionId` is rejected (a resume is collection-scoped).
+ */
+export declare function serveResume(req: ResumeV1, deps: ResumeServingDeps): ResumeReplyV1;
+/** The outcome of applying a {@link ResumeReplyV1} subscriber-side. */
+export type ResumeApplyOutcome = 
+/** Backfill entries were replayed through the delivery path; the subscriber is current. */
+"backfilled"
+/** Checkpoint endpoints verified, digest applied, recent entries replayed; the subscriber is current. */
+ | "checkpoint_applied"
+/** Checkpoint bracketing endpoints failed to verify (forged/tampered) — the subscriber must chain-read. */
+ | "checkpoint_untrusted"
+/** Out of every window — the subscriber must chain-read then re-subscribe. */
+ | "out_of_window"
+/** Tail rotated — the subscriber must re-register under the new tail. */
+ | "tail_rotated";
+/** Sinks for {@link applyResumeReply} — each non-backfill variant escalates to the application. */
+export interface ResumeApplyDeps {
+    /** Feeds replayed entries through the verify → contiguity → deliver path (closing the gap, deduping). */
+    readonly subscriber: ReactivitySubscriber;
+    /** Verifies a checkpoint's bracketing endpoints are real committed revisions. */
+    readonly verifier: NotificationVerifier;
+    /** Apply a verified checkpoint's merged digest (e.g. invalidate the changed keys). */
+    readonly onCheckpointDigest?: (summary: CheckpointSummary) => void;
+    /** Fall back to a chain read + fresh subscribe (out_of_window, or an untrusted checkpoint). */
+    readonly onChainRead?: (currentTailId: string | undefined, currentRevision: number | undefined) => void;
+    /** Re-register under the rotated tail (tail_rotated). */
+    readonly onTailRotated?: (newTailId: string, newRevisionAtRotation: number) => void;
+}
+/**
+ * Apply a {@link ResumeReplyV1} on the subscriber side, returning the {@link ResumeApplyOutcome}. Backfill
+ * and checkpoint-window entries re-enter through {@link ReactivitySubscriber.onNotification} (so they are
+ * verified, contiguity-checked, and deduped exactly like live notifications); the other variants escalate
+ * to the application via the supplied sinks. A checkpoint whose bracketing endpoints do not verify is
+ * **not** applied — the subscriber chain-reads instead (a forged checkpoint must never advance state).
+ */
+export declare function applyResumeReply(reply: ResumeReplyV1, deps: ResumeApplyDeps): Promise<ResumeApplyOutcome>;
+/**
+ * A cached cohort hint for fast reactivity re-attach (`docs/reactivity.md` §Edge profile: "`cohortHint`
+ * is sticky-cached across reconnects so brief network flaps don't trigger re-walk"). Distinct from the
+ * cohort-topic `CohortHint` (the full resolved cohort) — this is the minimal sticky-cached slice the
+ * subscriber dials a resume at directly. All ids base64url.
+ */
+export interface ReactivityCohortHint {
+    /** The collection's tail-anchored topic id at cache time. */
+    readonly topicId: string;
+    /** The cached serving primary. */
+    readonly primary: string;
+    /** The cohort member set for fast re-attach. */
+    readonly cohortHint: readonly string[];
+}
+/**
+ * A sticky per-collection cache of the last-known serving cohort, keyed by collection id. **Sticky** means
+ * it survives reconnects — a brief network flap reuses the cached primary so resume is one round trip
+ * instead of a re-walk from `d_max`. It is invalidated only on an explicit signal (a `TailRotated` reply,
+ * or a confirmed-stale primary), never merely on a transient failure.
+ */
+export interface StickyCohortHintCache {
+    /** The cached hint for `collectionId`, or `undefined` if none. */
+    get(collectionId: string): ReactivityCohortHint | undefined;
+    /** Cache (or refresh) the hint for `collectionId`. */
+    set(collectionId: string, hint: ReactivityCohortHint): void;
+    /** Drop the cached hint for `collectionId` (on rotation / confirmed staleness). */
+    invalidate(collectionId: string): void;
+}
+/** Build a {@link StickyCohortHintCache} (a plain per-collection map; sticky across reconnects). */
+export declare function createStickyCohortHintCache(): StickyCohortHintCache;
+//# sourceMappingURL=resume.d.ts.map

package/dist/src/reactivity/resume.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"resume.d.ts","sourceRoot":"","sources":["../../../src/reactivity/resume.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AAgBH,OAAO,EAAwD,KAAK,iBAAiB,EAAE,KAAK,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAEvI,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AAC5D,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AACxD,OAAO,EAA6B,KAAK,cAAc,EAAE,MAAM,WAAW,CAAC;AAE3E,sEAAsE;AACtE,MAAM,MAAM,YAAY,GAAG,UAAU,GAAG,mBAAmB,GAAG,eAAe,GAAG,cAAc,CAAC;AAE/F,6DAA6D;AAC7D,MAAM,WAAW,QAAQ;IACxB,CAAC,EAAE,CAAC,CAAC;IACL,gCAAgC;IAChC,YAAY,EAAE,MAAM,CAAC;IACrB,sEAAsE;IACtE,YAAY,EAAE,MAAM,CAAC;IACrB,6FAA6F;IAC7F,iBAAiB,EAAE,MAAM,CAAC;IAC1B,uFAAuF;IACvF,eAAe,EAAE,MAAM,CAAC;IACxB,eAAe;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,sDAAsD;IACtD,SAAS,EAAE,MAAM,CAAC;CAClB;AAED,yFAAyF;AACzF,MAAM,WAAW,aAAa;IAC7B,CAAC,EAAE,CAAC,CAAC;IACL,MAAM,EAAE,YAAY,CAAC;IAErB,sFAAsF;IACtF,OAAO,CAAC,EAAE,cAAc,EAAE,CAAC;IAC3B,0GAA0G;IAC1G,eAAe,CAAC,EAAE,MAAM,CAAC;IAEzB;;;;;OAKG;IACH,WAAW,CAAC,EAAE,iBAAiB,EAAE,CAAC;IAClC,kGAAkG;IAClG,aAAa,CAAC,EAAE,cAAc,EAAE,CAAC;IAEjC,0GAA0G;IAC1G,aAAa,CAAC,EAAE,MAAM,CAAC;IAEvB,wEAAwE;IACxE,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,iEAAiE;IACjE,qBAAqB,CAAC,EAAE,MAAM,CAAC;CAC/B;AAID,kFAAkF;AAClF,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,QAAQ,CAazD;AAED,uFAAuF;AACvF,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,OAAO,GAAG,aAAa,CAmCnE;AA8BD,oGAAoG;AACpG,MAAM,MAAM,cAAc,GAAG,IAAI,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;AAEzD;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,cAAc,GAAG,UAAU,CAUrE;AAID,uEAAuE;AACvE,wBAAgB,cAAc,CAAC,GAAG,EAAE,QAAQ,EAAE,eAAe,GAAE,MAAkC,GAAG,UAAU,CAE7G;AAED,uDAAuD;AACvD,wBAAgB,cAAc,CAAC,KAAK,EAAE,UAAU,EAAE,eAAe,CAAC,EAAE,MAAM,GAAG,QAAQ,CAEpF;AAED,4EAA4E;AAC5E,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,aAAa,EAAE,eAAe,GAAE,MAAkC,GAAG,UAAU,CAEvH;AAED,4DAA4D;AAC5D,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,UAAU,EAAE,eAAe,CAAC,EAAE,MAAM,GAAG,aAAa,CAE9F;AAmED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,cAAc,CAC7B,GAAG,EAAE,QAAQ,EACb,MAAM,EAAE,YAAY,EACpB,UAAU,EAAE,iBAAiB,GAAG,SAAS,EACzC,aAAa,EAAE,MAAM,EACrB,SAAS,CAAC,EAAE,iBAAiB,GAC3B,YAAY,CAWd;AAED,mDAAmD;AACnD,MAAM,WAAW,iBAAiB;IACjC,oEAAoE;IACpE,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC;IAC9B,gFAAgF;IAChF,QAAQ,CAAC,UAAU,CAAC,EAAE,iBAAiB,CAAC;IACxC;;;;;;;;OAQG;IACH,QAAQ,CAAC,mBAAmB,CAAC,EAAE,iBAAiB,CAAC;IACjD,qDAAqD;IACrD,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,uFAAuF;IACvF,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,4GAA4G;IAC5G,QAAQ,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;IACnC,2FAA2F;IAC3F,QAAQ,CAAC,oBAAoB,EAAE,MAAM,CAAC;CACtC;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,iBAAiB,GAAG,aAAa,CAgCjF;AAID,uEAAuE;AACvE,MAAM,MAAM,kBAAkB;AAC7B,2FAA2F;AACzF,YAAY;AACd,yGAAyG;GACvG,oBAAoB;AACtB,2GAA2G;GACzG,sBAAsB;AACxB,8EAA8E;GAC5E,eAAe;AACjB,yEAAyE;GACvE,cAAc,CAAC;AAElB,mGAAmG;AACnG,MAAM,WAAW,eAAe;IAC/B,yGAAyG;IACzG,QAAQ,CAAC,UAAU,EAAE,oBAAoB,CAAC;IAC1C,iFAAiF;IACjF,QAAQ,CAAC,QAAQ,EAAE,oBAAoB,CAAC;IACxC,sFAAsF;IACtF,QAAQ,CAAC,kBAAkB,CAAC,EAAE,CAAC,OAAO,EAAE,iBAAiB,KAAK,IAAI,CAAC;IACnE,+FAA+F;IAC/F,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC,aAAa,EAAE,MAAM,GAAG,SAAS,EAAE,eAAe,EAAE,MAAM,GAAG,SAAS,KAAK,IAAI,CAAC;IACxG,yDAAyD;IACzD,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,qBAAqB,EAAE,MAAM,KAAK,IAAI,CAAC;CACpF;AAED;;;;;;GAMG;AACH,wBAAsB,gBAAgB,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,eAAe,GAAG,OAAO,CAAC,kBAAkB,CAAC,CA8D/G;AAID;;;;;GAKG;AACH,MAAM,WAAW,oBAAoB;IACpC,6DAA6D;IAC7D,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,kCAAkC;IAClC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,gDAAgD;IAChD,QAAQ,CAAC,UAAU,EAAE,SAAS,MAAM,EAAE,CAAC;CACvC;AAED;;;;;GAKG;AACH,MAAM,WAAW,qBAAqB;IACrC,kEAAkE;IAClE,GAAG,CAAC,YAAY,EAAE,MAAM,GAAG,oBAAoB,GAAG,SAAS,CAAC;IAC5D,sDAAsD;IACtD,GAAG,CAAC,YAAY,EAAE,MAAM,EAAE,IAAI,EAAE,oBAAoB,GAAG,IAAI,CAAC;IAC5D,mFAAmF;IACnF,UAAU,CAAC,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;CACvC;AAkBD,oGAAoG;AACpG,wBAAgB,2BAA2B,IAAI,qBAAqB,CAEnE"}