@cello-protocol/daemon 0.0.167 → 0.0.169

package/dist/document-amendment-store.d.ts

@@ -1,72 +1,120 @@
 /**
- * DOD-MP-AMEND-1 (daemon half) — the append-only amendment store.
+ * SYNC-P1 (daemon half) — the fork-tolerant entry store.
  *
- * One row per epoch per document, holding the amendment AS RECEIVED — the wire bytes, never a
- * re-encode. The bytes are the truth: `chain` decodes them on read, so what replay consumes is
- * exactly what was signed, and a codec asymmetry can never silently rewrite an agreed record
- * (the class of defect TRACE-1 found in the proposal codec).
+ * One row per ENTRY (keyed by entry hash — never by an epoch slot), holding the entry AS
+ * RECEIVED — the wire bytes, never a re-encode. The bytes are the truth: `chain` decodes them on
+ * read, so what the fold consumes is exactly what was signed, and a codec asymmetry can never
+ * silently rewrite an agreed record (the class of defect TRACE-1 found in the proposal codec).
  *
- * The store owns persistence and chain SHAPE:
- * - **Contiguity** — epoch N appends only onto N-1 rows. An out-of-order arrival is refused by
- *   name, not buffered; amendment-lag buffering is DOD-MP-INBOUND-N-1's design, and until it
- *   lands the honest behaviour is a loud refusal the sender retries.
- * - **Fork refusal** — a different amendment at an occupied epoch is `document_amendment_conflict`,
- *   first record kept. Two rivals for one epoch is a governance fork; absorbing either silently
- *   would have two holders replay different arrangements with no error anywhere.
- * - **Idempotent redelivery** — the same bytes again is `recorded: false`, not an error and not a
- *   second row.
+ * The store owns persistence and ANCESTRY CLOSURE:
+ * - **Held until whole (R14)** — an entry lands in `document_entries` only when every parent has
+ *   landed. Otherwise it waits in `document_entries_pending`: recorded, never applied, never in a
+ *   watermark, promoted the moment its ancestry completes — cascade included. The invariant this
+ *   buys: everything in `document_entries` has its FULL ancestry there too.
+ * - **Fork tolerance** — two entries claiming the same epoch or the same author seq are BOTH
+ *   stored. Ruling on conflicts is the causal fold's job (`deriveDocumentState`), not the
+ *   store's; the old chain-gap and epoch-conflict refusals are gone WITH the epoch spine.
+ * - **Idempotent redelivery** — the same bytes again is `recorded: false`, not an error and not
+ *   a second row.
+ * - **Watermarks** — per author, the highest CONTIGUOUS seq with its head hash(es). Two heads at
+ *   one seq is an equivocation made visible for the exchange to resolve, never silently picked.
  *
- * What the store does NOT judge: signatures, policy, subject semantics. `deriveArrangement`
- * (protocol-types) rules on those at every consumption, and the inbound path rules BEFORE
- * appending. A row in this table is a claim to be replayed, not an admitted fact.
+ * What the store does NOT judge: signatures, policy, subject semantics. The fold rules on those
+ * at every consumption, and the inbound path rules BEFORE appending. A row in these tables is a
+ * claim to be folded, not an admitted fact.
  */
 import { type DocumentAmendmentEnvelope } from "@cello-protocol/protocol-types";
 import type { DaemonDatabase } from "./sqlcipher-db.js";
 import type { Logger } from "./types.js";
 /**
- * Shared with `DocumentStore`, which also execs this (the :353 shared-definition precedent there):
- * every epoch producer already holds a DocumentStore, and `currentDocumentEpoch` reads this table
- * through it — so the table must exist whichever module constructs first. Keep the two consumers
- * on THIS one string.
+ * The PRE-PIVOT table, epoch-keyed. Still created because `DocumentStore` execs this too and the
+ * pre-pivot readers live until P4 deletes them (SYNC-D2); the entry store neither reads nor
+ * writes it. Rows predating the pivot stay untouched — old-shape bytes are not decodable by the
+ * v2 codec and are not migrated (no compatibility owed; essentially no documents exist).
+ */
+/**
+ * Shared with `DocumentStore` (the :352 shared-definition precedent): its membership walk and
+ * epoch read consume `document_entries`, so the tables must exist whichever module constructs
+ * first. Keep both consumers on THIS string.
  */
-export declare const DOCUMENT_AMENDMENTS_CREATE_SQL = "\n  CREATE TABLE IF NOT EXISTS document_amendments (\n    owner_agent_id  TEXT    NOT NULL,\n    document_id     TEXT    NOT NULL,\n    epoch_id        INTEGER NOT NULL,\n    amendment_hash  TEXT    NOT NULL,\n    received_bytes  BLOB    NOT NULL,\n    recorded_at     INTEGER NOT NULL,\n    PRIMARY KEY (owner_agent_id, document_id, epoch_id)\n  );\n";
-export interface MembershipVerdict {
-    state: "holder" | "removed" | "untouched";
-    epochId: number | null;
-}
 /**
- * The last membership event naming this agent in an ordered chain — ONE implementation, because
- * two walks (the inbound refusal's and the publish gate's) disagreeing about whether someone was
- * removed is two daemons disagreeing about the arrangement.
+ * D7 — the epoch spine is deleted. A database born before that carries a NOT NULL `epoch_id`
+ * with no default, which would refuse every insert from this build. Dropped in place (SQLite
+ * ≥3.35 / SQLCipher 4.5); a fresh database never has it.
  */
-export declare function walkMembership(chain: readonly DocumentAmendmentEnvelope[], agentId: string): MembershipVerdict;
+type ColumnDropper = {
+    exec(sql: string): void;
+    prepare(sql: string): {
+        all(...a: unknown[]): unknown[];
+    };
+};
+/**
+ * Drop columns a previous milestone left behind, birth-gated: only what the table actually still
+ * has is touched, so this is safe on a database created yesterday and on one created before the
+ * column existed. Dead schema is not free — it is the design a future author reads and rebuilds.
+ */
+export declare function dropLegacyColumns(db: ColumnDropper, table: string, columns: readonly string[]): void;
+export declare function dropLegacyEpochColumn(db: ColumnDropper, table: string): void;
+export declare const DOCUMENT_ENTRIES_CREATE_SQL = "\n  CREATE TABLE IF NOT EXISTS document_entries (\n    owner_agent_id  TEXT    NOT NULL,\n    document_id     TEXT    NOT NULL,\n    entry_hash      TEXT    NOT NULL,\n    author_agent_id TEXT    NOT NULL,\n    author_seq      INTEGER NOT NULL,\n    received_bytes  BLOB    NOT NULL,\n    recorded_at     INTEGER NOT NULL,\n    PRIMARY KEY (owner_agent_id, document_id, entry_hash)\n  );\n  CREATE INDEX IF NOT EXISTS idx_document_entries_author\n    ON document_entries (owner_agent_id, document_id, author_agent_id, author_seq);\n  CREATE TABLE IF NOT EXISTS document_entries_pending (\n    owner_agent_id  TEXT    NOT NULL,\n    document_id     TEXT    NOT NULL,\n    entry_hash      TEXT    NOT NULL,\n    author_agent_id TEXT    NOT NULL,\n    received_bytes  BLOB    NOT NULL,\n    recorded_at     INTEGER NOT NULL,\n    PRIMARY KEY (owner_agent_id, document_id, entry_hash)\n  );\n";
 export interface AmendmentAppendResult {
-    /** False on an idempotent redelivery — the row already existed with the same hash. */
+    /** False on an idempotent redelivery — the entry (or its pending row) already existed. */
     recorded: boolean;
-    epochId: number;
-    /** Hex of the amendment's TBS hash. */
-    amendmentHash: string;
+    /** True when the entry is waiting on missing parents (R14) — recorded but not yet applied. */
+    held: boolean;
+    /** Hex of the entry's TBS hash. */
+    entryHash: string;
+    /** Previously-held entries this arrival completed, now applied — envelopes included, so the
+     *  caller can run the same post-apply surfacing it runs for a direct arrival (review F2: the
+     *  held path silently dropped removal notices and lifecycle completion). */
+    promoted: PromotedEntry[];
+}
+export interface PromotedEntry {
+    entryHash: string;
+    envelope: DocumentAmendmentEnvelope;
+}
+export interface PendingEntry {
+    entryHash: string;
+    /** The parents not yet held — the exchange asks for exactly these. */
+    missingParents: string[];
+    recordedAtMs: number;
+}
+/**
+ * Ceiling on HELD entries per (document, author). An honest author's pending set is a short gap
+ * awaiting one delivery; a hostile known author fabricating parents could otherwise grow the
+ * pending table without bound (review F4).
+ */
+export declare const MAX_PENDING_PER_AUTHOR = 64;
+export interface AuthorWatermark {
+    /** Highest CONTIGUOUS seq held from this author. */
+    seq: number;
+    /** Entry hash(es) at that seq — more than one is an equivocation, visible by design. */
+    headHashes: string[];
 }
 export declare class DocumentAmendmentStore {
     #private;
     constructor(db: DaemonDatabase, logger: Logger);
     /**
-     * Append one amendment from its wire bytes. Decodes first — malformed bytes refuse with the
-     * decoder's named reason and nothing is stored.
+     * Append one entry from its wire bytes. Decodes first — malformed bytes refuse with the
+     * decoder's named reason and nothing is stored. An entry with missing parents is HELD; an
+     * arrival that completes held ancestry promotes the whole cascade.
      */
     append(ownerAgentId: string, documentId: string, receivedBytes: Uint8Array, nowMs: number): AmendmentAppendResult;
-    /** The ordered chain, decoded from the stored received bytes. */
+    /** Every applied entry, decoded from the stored received bytes. The set is ancestry-closed. */
     chain(ownerAgentId: string, documentId: string): DocumentAmendmentEnvelope[];
+    /** Held entries and exactly which parents they still wait on (R37's receiver-side record). */
+    pending(ownerAgentId: string, documentId: string): PendingEntry[];
+    /**
+     * This author's applied entries with seq strictly beyond `afterSeq`, as WIRE BYTES in seq
+     * order — what a reconcile reply carries to a peer whose watermark for this author is behind
+     * ours (R10 step 2/3). Forked seqs both ship: the peer's fold rules on them like ours did.
+     */
+    entriesByAuthorAfter(ownerAgentId: string, documentId: string, authorAgentId: string, afterSeq: number): Uint8Array[];
     /**
-     * DOD-MP-REMOVE-1 — this agent's LAST membership event in the recorded chain.
-     * "holder" = admitted (or never touched by any membership amendment — genesis membership is
-     * the CALLER's fact, not this table's); "removed" = the last event naming them was
-     * remove_holder, with the epoch it happened at, so a refusal can name the removal rather than
-     * a generic condition. Reads the recorded chain only — validity was ruled before append
-     * (the standing invariant).
+     * Per-author position: the highest CONTIGUOUS seq held and the head hash(es) at it. A held
+     * (pending) entry is not counted — a gap ends the walk (R13: report contiguous, never highest
+     * received).
      */
-    membershipOf(ownerAgentId: string, documentId: string, agentId: string): MembershipVerdict;
-    /** The highest recorded epoch, or 0 — genesis — when no amendment exists. */
-    currentEpoch(ownerAgentId: string, documentId: string): number;
+    watermarks(ownerAgentId: string, documentId: string): Map<string, AuthorWatermark>;
 }
+export {};
 //# sourceMappingURL=document-amendment-store.d.ts.map

package/dist/document-amendment-store.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"document-amendment-store.d.ts","sourceRoot":"","sources":["../src/document-amendment-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,EAGL,KAAK,yBAAyB,EAC/B,MAAM,gCAAgC,CAAC;AACxC,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACxD,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAEzC;;;;;GAKG;AACH,eAAO,MAAM,8BAA8B,oWAU1C,CAAC;AAEF,MAAM,WAAW,iBAAiB;IAChC,KAAK,EAAE,QAAQ,GAAG,SAAS,GAAG,WAAW,CAAC;IAC1C,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;CACxB;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,SAAS,yBAAyB,EAAE,EAC3C,OAAO,EAAE,MAAM,GACd,iBAAiB,CAcnB;AAED,MAAM,WAAW,qBAAqB;IACpC,sFAAsF;IACtF,QAAQ,EAAE,OAAO,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,uCAAuC;IACvC,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,qBAAa,sBAAsB;;gBAIrB,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,MAAM;IAM9C;;;OAGG;IACH,MAAM,CACJ,YAAY,EAAE,MAAM,EACpB,UAAU,EAAE,MAAM,EAClB,aAAa,EAAE,UAAU,EACzB,KAAK,EAAE,MAAM,GACZ,qBAAqB;IAmExB,iEAAiE;IACjE,KAAK,CAAC,YAAY,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,yBAAyB,EAAE;IAW5E;;;;;;;OAOG;IACH,YAAY,CACV,YAAY,EAAE,MAAM,EACpB,UAAU,EAAE,MAAM,EAClB,OAAO,EAAE,MAAM,GACd,iBAAiB;IAIpB,6EAA6E;IAC7E,YAAY,CAAC,YAAY,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM;CAS/D"}
+{"version":3,"file":"document-amendment-store.d.ts","sourceRoot":"","sources":["../src/document-amendment-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,EAGL,KAAK,yBAAyB,EAC/B,MAAM,gCAAgC,CAAC;AACxC,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACxD,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAEzC;;;;;GAKG;AACH;;;;GAIG;AACH;;;;GAIG;AACH,KAAK,aAAa,GAAG;IAAE,IAAI,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;IAAC,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG;QAAE,GAAG,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE,CAAA;KAAE,CAAA;CAAE,CAAC;AAE5G;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,EAAE,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CAOpG;AAED,wBAAgB,qBAAqB,CAAC,EAAE,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAE5E;AAED,eAAO,MAAM,2BAA2B,63BAsBvC,CAAC;AAEF,MAAM,WAAW,qBAAqB;IACpC,0FAA0F;IAC1F,QAAQ,EAAE,OAAO,CAAC;IAClB,8FAA8F;IAC9F,IAAI,EAAE,OAAO,CAAC;IACd,mCAAmC;IACnC,SAAS,EAAE,MAAM,CAAC;IAClB;;gFAE4E;IAC5E,QAAQ,EAAE,aAAa,EAAE,CAAC;CAC3B;AAED,MAAM,WAAW,aAAa;IAC5B,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,yBAAyB,CAAC;CACrC;AAED,MAAM,WAAW,YAAY;IAC3B,SAAS,EAAE,MAAM,CAAC;IAClB,sEAAsE;IACtE,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,YAAY,EAAE,MAAM,CAAC;CACtB;AAED;;;;GAIG;AACH,eAAO,MAAM,sBAAsB,KAAK,CAAC;AAEzC,MAAM,WAAW,eAAe;IAC9B,oDAAoD;IACpD,GAAG,EAAE,MAAM,CAAC;IACZ,wFAAwF;IACxF,UAAU,EAAE,MAAM,EAAE,CAAC;CACtB;AAED,qBAAa,sBAAsB;;gBAIrB,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,MAAM;IAW9C;;;;OAIG;IACH,MAAM,CACJ,YAAY,EAAE,MAAM,EACpB,UAAU,EAAE,MAAM,EAClB,aAAa,EAAE,UAAU,EACzB,KAAK,EAAE,MAAM,GACZ,qBAAqB;IA0DxB,+FAA+F;IAC/F,KAAK,CAAC,YAAY,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,yBAAyB,EAAE;IAW5E,8FAA8F;IAC9F,OAAO,CAAC,YAAY,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,YAAY,EAAE;IAwBjE;;;;OAIG;IACH,oBAAoB,CAClB,YAAY,EAAE,MAAM,EACpB,UAAU,EAAE,MAAM,EAClB,aAAa,EAAE,MAAM,EACrB,QAAQ,EAAE,MAAM,GACf,UAAU,EAAE;IAaf;;;;OAIG;IACH,UAAU,CAAC,YAAY,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,eAAe,CAAC;CAqInF"}

package/dist/document-amendment-store.js

@@ -1,76 +1,90 @@
 /**
- * DOD-MP-AMEND-1 (daemon half) — the append-only amendment store.
+ * SYNC-P1 (daemon half) — the fork-tolerant entry store.
  *
- * One row per epoch per document, holding the amendment AS RECEIVED — the wire bytes, never a
- * re-encode. The bytes are the truth: `chain` decodes them on read, so what replay consumes is
- * exactly what was signed, and a codec asymmetry can never silently rewrite an agreed record
- * (the class of defect TRACE-1 found in the proposal codec).
+ * One row per ENTRY (keyed by entry hash — never by an epoch slot), holding the entry AS
+ * RECEIVED — the wire bytes, never a re-encode. The bytes are the truth: `chain` decodes them on
+ * read, so what the fold consumes is exactly what was signed, and a codec asymmetry can never
+ * silently rewrite an agreed record (the class of defect TRACE-1 found in the proposal codec).
  *
- * The store owns persistence and chain SHAPE:
- * - **Contiguity** — epoch N appends only onto N-1 rows. An out-of-order arrival is refused by
- *   name, not buffered; amendment-lag buffering is DOD-MP-INBOUND-N-1's design, and until it
- *   lands the honest behaviour is a loud refusal the sender retries.
- * - **Fork refusal** — a different amendment at an occupied epoch is `document_amendment_conflict`,
- *   first record kept. Two rivals for one epoch is a governance fork; absorbing either silently
- *   would have two holders replay different arrangements with no error anywhere.
- * - **Idempotent redelivery** — the same bytes again is `recorded: false`, not an error and not a
- *   second row.
+ * The store owns persistence and ANCESTRY CLOSURE:
+ * - **Held until whole (R14)** — an entry lands in `document_entries` only when every parent has
+ *   landed. Otherwise it waits in `document_entries_pending`: recorded, never applied, never in a
+ *   watermark, promoted the moment its ancestry completes — cascade included. The invariant this
+ *   buys: everything in `document_entries` has its FULL ancestry there too.
+ * - **Fork tolerance** — two entries claiming the same epoch or the same author seq are BOTH
+ *   stored. Ruling on conflicts is the causal fold's job (`deriveDocumentState`), not the
+ *   store's; the old chain-gap and epoch-conflict refusals are gone WITH the epoch spine.
+ * - **Idempotent redelivery** — the same bytes again is `recorded: false`, not an error and not
+ *   a second row.
+ * - **Watermarks** — per author, the highest CONTIGUOUS seq with its head hash(es). Two heads at
+ *   one seq is an equivocation made visible for the exchange to resolve, never silently picked.
  *
- * What the store does NOT judge: signatures, policy, subject semantics. `deriveArrangement`
- * (protocol-types) rules on those at every consumption, and the inbound path rules BEFORE
- * appending. A row in this table is a claim to be replayed, not an admitted fact.
+ * What the store does NOT judge: signatures, policy, subject semantics. The fold rules on those
+ * at every consumption, and the inbound path rules BEFORE appending. A row in these tables is a
+ * claim to be folded, not an admitted fact.
  */
 import { decodeDocumentAmendment, documentAmendmentHash, } from "@cello-protocol/protocol-types";
 /**
- * Shared with `DocumentStore`, which also execs this (the :353 shared-definition precedent there):
- * every epoch producer already holds a DocumentStore, and `currentDocumentEpoch` reads this table
- * through it — so the table must exist whichever module constructs first. Keep the two consumers
- * on THIS one string.
+ * Drop columns a previous milestone left behind, birth-gated: only what the table actually still
+ * has is touched, so this is safe on a database created yesterday and on one created before the
+ * column existed. Dead schema is not free — it is the design a future author reads and rebuilds.
  */
-export const DOCUMENT_AMENDMENTS_CREATE_SQL = `
-  CREATE TABLE IF NOT EXISTS document_amendments (
+export function dropLegacyColumns(db, table, columns) {
+    const held = new Set(db.prepare(`PRAGMA table_info(${table})`).all().map((c) => c.name));
+    for (const column of columns) {
+        if (held.has(column))
+            db.exec(`ALTER TABLE ${table} DROP COLUMN ${column}`);
+    }
+}
+export function dropLegacyEpochColumn(db, table) {
+    dropLegacyColumns(db, table, ["epoch_id"]);
+}
+export const DOCUMENT_ENTRIES_CREATE_SQL = `
+  CREATE TABLE IF NOT EXISTS document_entries (
+    owner_agent_id  TEXT    NOT NULL,
+    document_id     TEXT    NOT NULL,
+    entry_hash      TEXT    NOT NULL,
+    author_agent_id TEXT    NOT NULL,
+    author_seq      INTEGER NOT NULL,
+    received_bytes  BLOB    NOT NULL,
+    recorded_at     INTEGER NOT NULL,
+    PRIMARY KEY (owner_agent_id, document_id, entry_hash)
+  );
+  CREATE INDEX IF NOT EXISTS idx_document_entries_author
+    ON document_entries (owner_agent_id, document_id, author_agent_id, author_seq);
+  CREATE TABLE IF NOT EXISTS document_entries_pending (
     owner_agent_id  TEXT    NOT NULL,
     document_id     TEXT    NOT NULL,
-    epoch_id        INTEGER NOT NULL,
-    amendment_hash  TEXT    NOT NULL,
+    entry_hash      TEXT    NOT NULL,
+    author_agent_id TEXT    NOT NULL,
     received_bytes  BLOB    NOT NULL,
     recorded_at     INTEGER NOT NULL,
-    PRIMARY KEY (owner_agent_id, document_id, epoch_id)
+    PRIMARY KEY (owner_agent_id, document_id, entry_hash)
   );
 `;
 /**
- * The last membership event naming this agent in an ordered chain — ONE implementation, because
- * two walks (the inbound refusal's and the publish gate's) disagreeing about whether someone was
- * removed is two daemons disagreeing about the arrangement.
+ * Ceiling on HELD entries per (document, author). An honest author's pending set is a short gap
+ * awaiting one delivery; a hostile known author fabricating parents could otherwise grow the
+ * pending table without bound (review F4).
  */
-export function walkMembership(chain, agentId) {
-    let state = "untouched";
-    let epochId = null;
-    for (const env of chain) {
-        if (env.body.subject_agent_id !== agentId)
-            continue;
-        if (env.body.kind === "add_holder") {
-            state = "holder";
-            epochId = env.body.epoch_id;
-        }
-        else if (env.body.kind === "remove_holder") {
-            state = "removed";
-            epochId = env.body.epoch_id;
-        }
-    }
-    return { state, epochId };
-}
+export const MAX_PENDING_PER_AUTHOR = 64;
 export class DocumentAmendmentStore {
     #db;
     #logger;
     constructor(db, logger) {
         this.#db = db;
         this.#logger = logger;
-        this.#db.exec(DOCUMENT_AMENDMENTS_CREATE_SQL);
+        // D7/D9 residue sweep (review F5/F6): the epoch-keyed legacy table and the withdrawals
+        // table have no reader or writer left — never born on a fresh database, dropped in place
+        // on one that predates the pivot.
+        this.#db.exec(`DROP TABLE IF EXISTS document_amendments`);
+        this.#db.exec(DOCUMENT_ENTRIES_CREATE_SQL);
+        dropLegacyEpochColumn(this.#db, "document_entries");
     }
     /**
-     * Append one amendment from its wire bytes. Decodes first — malformed bytes refuse with the
-     * decoder's named reason and nothing is stored.
+     * Append one entry from its wire bytes. Decodes first — malformed bytes refuse with the
+     * decoder's named reason and nothing is stored. An entry with missing parents is HELD; an
+     * arrival that completes held ancestry promotes the whole cascade.
      */
     append(ownerAgentId, documentId, receivedBytes, nowMs) {
         const env = decodeDocumentAmendment(receivedBytes);
@@ -78,74 +92,175 @@ export class DocumentAmendmentStore {
             throw new Error(`document_amendment_wrong_document: the bytes name ${env.body.document_id}, appending ` +
                 `under ${documentId}`);
         }
-        const epochId = env.body.epoch_id;
         const hash = Buffer.from(documentAmendmentHash(env.body)).toString("hex");
-        const existing = this.#db
-            .prepare(`SELECT amendment_hash FROM document_amendments
-          WHERE owner_agent_id = ? AND document_id = ? AND epoch_id = ?`)
-            .get(ownerAgentId, documentId, epochId);
-        if (existing) {
-            if (existing.amendment_hash === hash) {
-                return { recorded: false, epochId, amendmentHash: hash };
+        if (this.#hasEntry(ownerAgentId, documentId, hash)) {
+            return { recorded: false, held: false, entryHash: hash, promoted: [] };
+        }
+        if (this.#hasPending(ownerAgentId, documentId, hash)) {
+            return { recorded: false, held: true, entryHash: hash, promoted: [] };
+        }
+        const missing = env.body.parents.filter((p) => !this.#hasEntry(ownerAgentId, documentId, p));
+        if (missing.length > 0) {
+            const author = env.body.author_agent_id;
+            const backlog = this.#db
+                .prepare(`SELECT COUNT(*) AS n FROM document_entries_pending
+            WHERE owner_agent_id = ? AND document_id = ? AND author_agent_id = ?`)
+                .get(ownerAgentId, documentId, author);
+            if (backlog.n >= MAX_PENDING_PER_AUTHOR) {
+                throw new Error(`document_pending_cap: ${author} already has ${backlog.n} entries held awaiting ` +
+                    `parents — the ceiling is ${MAX_PENDING_PER_AUTHOR}, and an honest gap is never ` +
+                    `this deep; deliver the missing ancestry first`);
             }
-            this.#logger.error("document.amendment.conflict", {
+            this.#db
+                .prepare(`INSERT INTO document_entries_pending
+             (owner_agent_id, document_id, entry_hash, author_agent_id, received_bytes, recorded_at)
+           VALUES (?, ?, ?, ?, ?, ?)`)
+                .run(ownerAgentId, documentId, hash, author, Buffer.from(receivedBytes), nowMs);
+            this.#logger.info("document.entry.held", {
                 documentId,
-                epochId,
-                storedHash: existing.amendment_hash,
-                rivalHash: hash,
+                entryHash: hash,
+                author: env.body.author_agent_id,
+                authorSeq: env.body.author_seq,
+                kind: env.body.kind,
+                missingParents: missing,
             });
-            throw new Error(`document_amendment_conflict: epoch ${epochId} of ${documentId} already holds ` +
-                `${existing.amendment_hash} and a rival amendment ${hash} arrived — a governance fork, ` +
-                `refused with the first record kept`);
-        }
-        const prior = this.currentEpoch(ownerAgentId, documentId);
-        if (epochId !== prior + 1) {
-            throw new Error(`document_amendment_chain_gap: epoch ${epochId} cannot append onto epoch ${prior} — ` +
-                `amendments land contiguously, and an out-of-order arrival is retried by its sender, ` +
-                `never buffered silently`);
+            return { recorded: true, held: true, entryHash: hash, promoted: [] };
         }
-        this.#db
-            .prepare(`INSERT INTO document_amendments
-           (owner_agent_id, document_id, epoch_id, amendment_hash, received_bytes, recorded_at)
-         VALUES (?, ?, ?, ?, ?, ?)`)
-            .run(ownerAgentId, documentId, epochId, hash, 
-        // Copied — the caller may reuse or zero its buffer after we return.
-        Buffer.from(receivedBytes), nowMs);
-        this.#logger.info("document.amendment.recorded", {
-            documentId,
-            epochId,
-            amendmentHash: hash,
-            kind: env.body.kind,
-        });
-        return { recorded: true, epochId, amendmentHash: hash };
+        this.#insertEntry(ownerAgentId, documentId, hash, env, receivedBytes, nowMs);
+        const promoted = this.#promoteReady(ownerAgentId, documentId, nowMs);
+        return { recorded: true, held: false, entryHash: hash, promoted };
     }
-    /** The ordered chain, decoded from the stored received bytes. */
+    /** Every applied entry, decoded from the stored received bytes. The set is ancestry-closed. */
     chain(ownerAgentId, documentId) {
         const rows = this.#db
-            .prepare(`SELECT received_bytes FROM document_amendments
+            .prepare(`SELECT received_bytes FROM document_entries
           WHERE owner_agent_id = ? AND document_id = ?
-          ORDER BY epoch_id ASC`)
+          ORDER BY author_seq ASC, entry_hash ASC`)
             .all(ownerAgentId, documentId);
         return rows.map((r) => decodeDocumentAmendment(new Uint8Array(r.received_bytes)));
     }
+    /** Held entries and exactly which parents they still wait on (R37's receiver-side record). */
+    pending(ownerAgentId, documentId) {
+        const rows = this.#db
+            .prepare(`SELECT entry_hash, received_bytes, recorded_at FROM document_entries_pending
+          WHERE owner_agent_id = ? AND document_id = ?
+          ORDER BY recorded_at ASC, entry_hash ASC`)
+            .all(ownerAgentId, documentId);
+        return rows.map((r) => {
+            const env = decodeDocumentAmendment(new Uint8Array(r.received_bytes));
+            return {
+                entryHash: r.entry_hash,
+                missingParents: env.body.parents.filter((p) => !this.#hasEntry(ownerAgentId, documentId, p)),
+                recordedAtMs: r.recorded_at,
+            };
+        });
+    }
+    /**
+     * This author's applied entries with seq strictly beyond `afterSeq`, as WIRE BYTES in seq
+     * order — what a reconcile reply carries to a peer whose watermark for this author is behind
+     * ours (R10 step 2/3). Forked seqs both ship: the peer's fold rules on them like ours did.
+     */
+    entriesByAuthorAfter(ownerAgentId, documentId, authorAgentId, afterSeq) {
+        const rows = this.#db
+            .prepare(`SELECT received_bytes FROM document_entries
+          WHERE owner_agent_id = ? AND document_id = ? AND author_agent_id = ? AND author_seq > ?
+          ORDER BY author_seq ASC, entry_hash ASC`)
+            .all(ownerAgentId, documentId, authorAgentId, afterSeq);
+        return rows.map((r) => new Uint8Array(r.received_bytes));
+    }
     /**
-     * DOD-MP-REMOVE-1 — this agent's LAST membership event in the recorded chain.
-     * "holder" = admitted (or never touched by any membership amendment — genesis membership is
-     * the CALLER's fact, not this table's); "removed" = the last event naming them was
-     * remove_holder, with the epoch it happened at, so a refusal can name the removal rather than
-     * a generic condition. Reads the recorded chain only — validity was ruled before append
-     * (the standing invariant).
+     * Per-author position: the highest CONTIGUOUS seq held and the head hash(es) at it. A held
+     * (pending) entry is not counted — a gap ends the walk (R13: report contiguous, never highest
+     * received).
      */
-    membershipOf(ownerAgentId, documentId, agentId) {
-        return walkMembership(this.chain(ownerAgentId, documentId), agentId);
+    watermarks(ownerAgentId, documentId) {
+        const rows = this.#db
+            .prepare(`SELECT author_agent_id, author_seq, entry_hash FROM document_entries
+          WHERE owner_agent_id = ? AND document_id = ?
+          ORDER BY author_agent_id ASC, author_seq ASC, entry_hash ASC`)
+            .all(ownerAgentId, documentId);
+        const byAuthor = new Map();
+        for (const r of rows) {
+            let seqs = byAuthor.get(r.author_agent_id);
+            if (!seqs) {
+                seqs = new Map();
+                byAuthor.set(r.author_agent_id, seqs);
+            }
+            const at = seqs.get(r.author_seq);
+            if (at)
+                at.push(r.entry_hash);
+            else
+                seqs.set(r.author_seq, [r.entry_hash]);
+        }
+        const out = new Map();
+        for (const [author, seqs] of byAuthor) {
+            let seq = 0;
+            while (seqs.has(seq + 1))
+                seq++;
+            if (seq === 0)
+                continue;
+            out.set(author, { seq, headHashes: seqs.get(seq) });
+        }
+        return out;
+    }
+    #hasEntry(ownerAgentId, documentId, hash) {
+        return (this.#db
+            .prepare(`SELECT 1 FROM document_entries
+            WHERE owner_agent_id = ? AND document_id = ? AND entry_hash = ?`)
+            .get(ownerAgentId, documentId, hash) !== undefined);
+    }
+    #hasPending(ownerAgentId, documentId, hash) {
+        return (this.#db
+            .prepare(`SELECT 1 FROM document_entries_pending
+            WHERE owner_agent_id = ? AND document_id = ? AND entry_hash = ?`)
+            .get(ownerAgentId, documentId, hash) !== undefined);
     }
-    /** The highest recorded epoch, or 0 — genesis — when no amendment exists. */
-    currentEpoch(ownerAgentId, documentId) {
-        const r = this.#db
-            .prepare(`SELECT MAX(epoch_id) AS max_epoch FROM document_amendments
-          WHERE owner_agent_id = ? AND document_id = ?`)
-            .get(ownerAgentId, documentId);
-        return r?.max_epoch ?? 0;
+    #insertEntry(ownerAgentId, documentId, hash, env, bytes, nowMs) {
+        this.#db
+            .prepare(`INSERT INTO document_entries
+           (owner_agent_id, document_id, entry_hash, author_agent_id, author_seq,
+            received_bytes, recorded_at)
+         VALUES (?, ?, ?, ?, ?, ?, ?)`)
+            .run(ownerAgentId, documentId, hash, env.body.author_agent_id, env.body.author_seq, 
+        // Copied — the caller may reuse or zero its buffer after we return.
+        Buffer.from(bytes), nowMs);
+        this.#logger.info("document.entry.recorded", {
+            documentId,
+            entryHash: hash,
+            author: env.body.author_agent_id,
+            authorSeq: env.body.author_seq,
+            kind: env.body.kind,
+        });
+    }
+    /** Move every pending entry whose ancestry is now complete — repeated until a pass moves none. */
+    #promoteReady(ownerAgentId, documentId, nowMs) {
+        const promoted = [];
+        for (;;) {
+            const rows = this.#db
+                .prepare(`SELECT entry_hash, received_bytes FROM document_entries_pending
+            WHERE owner_agent_id = ? AND document_id = ?`)
+                .all(ownerAgentId, documentId);
+            let movedThisPass = false;
+            for (const row of rows) {
+                const env = decodeDocumentAmendment(new Uint8Array(row.received_bytes));
+                const ready = env.body.parents.every((p) => this.#hasEntry(ownerAgentId, documentId, p));
+                if (!ready)
+                    continue;
+                this.#insertEntry(ownerAgentId, documentId, row.entry_hash, env, new Uint8Array(row.received_bytes), nowMs);
+                this.#db
+                    .prepare(`DELETE FROM document_entries_pending
+              WHERE owner_agent_id = ? AND document_id = ? AND entry_hash = ?`)
+                    .run(ownerAgentId, documentId, row.entry_hash);
+                this.#logger.info("document.entry.promoted", {
+                    documentId,
+                    entryHash: row.entry_hash,
+                });
+                promoted.push({ entryHash: row.entry_hash, envelope: env });
+                movedThisPass = true;
+            }
+            if (!movedThisPass)
+                return promoted;
+        }
     }
 }
 //# sourceMappingURL=document-amendment-store.js.map

package/dist/document-amendment-store.js.map

@@ -1 +1 @@
-{"version":3,"file":"document-amendment-store.js","sourceRoot":"","sources":["../src/document-amendment-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,EACL,uBAAuB,EACvB,qBAAqB,GAEtB,MAAM,gCAAgC,CAAC;AAIxC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,8BAA8B,GAAG;;;;;;;;;;CAU7C,CAAC;AAOF;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAC5B,KAA2C,EAC3C,OAAe;IAEf,IAAI,KAAK,GAA+B,WAAW,CAAC;IACpD,IAAI,OAAO,GAAkB,IAAI,CAAC;IAClC,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;QACxB,IAAI,GAAG,CAAC,IAAI,CAAC,gBAAgB,KAAK,OAAO;YAAE,SAAS;QACpD,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;YACnC,KAAK,GAAG,QAAQ,CAAC;YACjB,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC;QAC9B,CAAC;aAAM,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;YAC7C,KAAK,GAAG,SAAS,CAAC;YAClB,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC;QAC9B,CAAC;IACH,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;AAC5B,CAAC;AAUD,MAAM,OAAO,sBAAsB;IACxB,GAAG,CAAiB;IACpB,OAAO,CAAS;IAEzB,YAAY,EAAkB,EAAE,MAAc;QAC5C,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;QACd,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,8BAA8B,CAAC,CAAC;IAChD,CAAC;IAED;;;OAGG;IACH,MAAM,CACJ,YAAoB,EACpB,UAAkB,EAClB,aAAyB,EACzB,KAAa;QAEb,MAAM,GAAG,GAAG,uBAAuB,CAAC,aAAa,CAAC,CAAC;QACnD,IAAI,GAAG,CAAC,IAAI,CAAC,WAAW,KAAK,UAAU,EAAE,CAAC;YACxC,MAAM,IAAI,KAAK,CACb,qDAAqD,GAAG,CAAC,IAAI,CAAC,WAAW,cAAc;gBACrF,SAAS,UAAU,EAAE,CACxB,CAAC;QACJ,CAAC;QACD,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC;QAClC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAE1E,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG;aACtB,OAAO,CACN;wEACgE,CACjE;aACA,GAAG,CAAC,YAAY,EAAE,UAAU,EAAE,OAAO,CAA4C,CAAC;QACrF,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,QAAQ,CAAC,cAAc,KAAK,IAAI,EAAE,CAAC;gBACrC,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC;YAC3D,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,6BAA6B,EAAE;gBAChD,UAAU;gBACV,OAAO;gBACP,UAAU,EAAE,QAAQ,CAAC,cAAc;gBACnC,SAAS,EAAE,IAAI;aAChB,CAAC,CAAC;YACH,MAAM,IAAI,KAAK,CACb,sCAAsC,OAAO,OAAO,UAAU,iBAAiB;gBAC7E,GAAG,QAAQ,CAAC,cAAc,0BAA0B,IAAI,gCAAgC;gBACxF,oCAAoC,CACvC,CAAC;QACJ,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;QAC1D,IAAI,OAAO,KAAK,KAAK,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,KAAK,CACb,uCAAuC,OAAO,6BAA6B,KAAK,KAAK;gBACnF,sFAAsF;gBACtF,yBAAyB,CAC5B,CAAC;QACJ,CAAC;QAED,IAAI,CAAC,GAAG;aACL,OAAO,CACN;;mCAE2B,CAC5B;aACA,GAAG,CACF,YAAY,EACZ,UAAU,EACV,OAAO,EACP,IAAI;QACJ,oEAAoE;QACpE,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,EAC1B,KAAK,CACN,CAAC;QACJ,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,6BAA6B,EAAE;YAC/C,UAAU;YACV,OAAO;YACP,aAAa,EAAE,IAAI;YACnB,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI;SACpB,CAAC,CAAC;QACH,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC;IAC1D,CAAC;IAED,iEAAiE;IACjE,KAAK,CAAC,YAAoB,EAAE,UAAkB;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG;aAClB,OAAO,CACN;;gCAEwB,CACzB;aACA,GAAG,CAAC,YAAY,EAAE,UAAU,CAA0C,CAAC;QAC1E,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,uBAAuB,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;IACpF,CAAC;IAED;;;;;;;OAOG;IACH,YAAY,CACV,YAAoB,EACpB,UAAkB,EAClB,OAAe;QAEf,OAAO,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,UAAU,CAAC,EAAE,OAAO,CAAC,CAAC;IACvE,CAAC;IAED,6EAA6E;IAC7E,YAAY,CAAC,YAAoB,EAAE,UAAkB;QACnD,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG;aACf,OAAO,CACN;uDAC+C,CAChD;aACA,GAAG,CAAC,YAAY,EAAE,UAAU,CAA8C,CAAC;QAC9E,OAAO,CAAC,EAAE,SAAS,IAAI,CAAC,CAAC;IAC3B,CAAC;CACF"}
+{"version":3,"file":"document-amendment-store.js","sourceRoot":"","sources":["../src/document-amendment-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,EACL,uBAAuB,EACvB,qBAAqB,GAEtB,MAAM,gCAAgC,CAAC;AAsBxC;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,EAAiB,EAAE,KAAa,EAAE,OAA0B;IAC5F,MAAM,IAAI,GAAG,IAAI,GAAG,CACjB,EAAE,CAAC,OAAO,CAAC,qBAAqB,KAAK,GAAG,CAAC,CAAC,GAAG,EAA+B,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CACjG,CAAC;IACF,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,EAAE,CAAC,IAAI,CAAC,eAAe,KAAK,gBAAgB,MAAM,EAAE,CAAC,CAAC;IAC9E,CAAC;AACH,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,EAAiB,EAAE,KAAa;IACpE,iBAAiB,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC;AAC7C,CAAC;AAED,MAAM,CAAC,MAAM,2BAA2B,GAAG;;;;;;;;;;;;;;;;;;;;;;CAsB1C,CAAC;AA2BF;;;;GAIG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,EAAE,CAAC;AASzC,MAAM,OAAO,sBAAsB;IACxB,GAAG,CAAiB;IACpB,OAAO,CAAS;IAEzB,YAAY,EAAkB,EAAE,MAAc;QAC5C,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;QACd,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,uFAAuF;QACvF,yFAAyF;QACzF,kCAAkC;QAClC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,0CAA0C,CAAC,CAAC;QAC1D,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;QAC3C,qBAAqB,CAAC,IAAI,CAAC,GAAG,EAAE,kBAAkB,CAAC,CAAC;IACtD,CAAC;IAED;;;;OAIG;IACH,MAAM,CACJ,YAAoB,EACpB,UAAkB,EAClB,aAAyB,EACzB,KAAa;QAEb,MAAM,GAAG,GAAG,uBAAuB,CAAC,aAAa,CAAC,CAAC;QACnD,IAAI,GAAG,CAAC,IAAI,CAAC,WAAW,KAAK,UAAU,EAAE,CAAC;YACxC,MAAM,IAAI,KAAK,CACb,qDAAqD,GAAG,CAAC,IAAI,CAAC,WAAW,cAAc;gBACrF,SAAS,UAAU,EAAE,CACxB,CAAC;QACJ,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAE1E,IAAI,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,UAAU,EAAE,IAAI,CAAC,EAAE,CAAC;YACnD,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;QACzE,CAAC;QACD,IAAI,IAAI,CAAC,WAAW,CAAC,YAAY,EAAE,UAAU,EAAE,IAAI,CAAC,EAAE,CAAC;YACrD,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;QACxE,CAAC;QAED,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CACrC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,UAAU,EAAE,CAAC,CAAC,CACpD,CAAC;QACF,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,eAAe,CAAC;YACxC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG;iBACrB,OAAO,CACN;iFACuE,CACxE;iBACA,GAAG,CAAC,YAAY,EAAE,UAAU,EAAE,MAAM,CAAkB,CAAC;YAC1D,IAAI,OAAO,CAAC,CAAC,IAAI,sBAAsB,EAAE,CAAC;gBACxC,MAAM,IAAI,KAAK,CACb,yBAAyB,MAAM,gBAAgB,OAAO,CAAC,CAAC,yBAAyB;oBAC/E,4BAA4B,sBAAsB,+BAA+B;oBACjF,+CAA+C,CAClD,CAAC;YACJ,CAAC;YACD,IAAI,CAAC,GAAG;iBACL,OAAO,CACN;;qCAE2B,CAC5B;iBACA,GAAG,CAAC,YAAY,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,KAAK,CAAC,CAAC;YAClF,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,qBAAqB,EAAE;gBACvC,UAAU;gBACV,SAAS,EAAE,IAAI;gBACf,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,eAAe;gBAChC,SAAS,EAAE,GAAG,CAAC,IAAI,CAAC,UAAU;gBAC9B,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI;gBACnB,cAAc,EAAE,OAAO;aACxB,CAAC,CAAC;YACH,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;QACvE,CAAC;QAED,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,EAAE,KAAK,CAAC,CAAC;QAC7E,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,YAAY,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;QACrE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;IACpE,CAAC;IAED,+FAA+F;IAC/F,KAAK,CAAC,YAAoB,EAAE,UAAkB;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG;aAClB,OAAO,CACN;;kDAE0C,CAC3C;aACA,GAAG,CAAC,YAAY,EAAE,UAAU,CAA0C,CAAC;QAC1E,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,uBAAuB,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;IACpF,CAAC;IAED,8FAA8F;IAC9F,OAAO,CAAC,YAAoB,EAAE,UAAkB;QAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG;aAClB,OAAO,CACN;;mDAE2C,CAC5C;aACA,GAAG,CAAC,YAAY,EAAE,UAAU,CAI7B,CAAC;QACH,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACpB,MAAM,GAAG,GAAG,uBAAuB,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC;YACtE,OAAO;gBACL,SAAS,EAAE,CAAC,CAAC,UAAU;gBACvB,cAAc,EAAE,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CACrC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,UAAU,EAAE,CAAC,CAAC,CACpD;gBACD,YAAY,EAAE,CAAC,CAAC,WAAW;aAC5B,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,oBAAoB,CAClB,YAAoB,EACpB,UAAkB,EAClB,aAAqB,EACrB,QAAgB;QAEhB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG;aAClB,OAAO,CACN;;kDAE0C,CAC3C;aACA,GAAG,CAAC,YAAY,EAAE,UAAU,EAAE,aAAa,EAAE,QAAQ,CAEtD,CAAC;QACH,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED;;;;OAIG;IACH,UAAU,CAAC,YAAoB,EAAE,UAAkB;QACjD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG;aAClB,OAAO,CACN;;uEAE+D,CAChE;aACA,GAAG,CAAC,YAAY,EAAE,UAAU,CAI7B,CAAC;QACH,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAiC,CAAC;QAC1D,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC;YAC3C,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;gBACjB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,EAAE,IAAI,CAAC,CAAC;YACxC,CAAC;YACD,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;YAClC,IAAI,EAAE;gBAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;;gBACzB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;QAC9C,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,GAAG,EAA2B,CAAC;QAC/C,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,QAAQ,EAAE,CAAC;YACtC,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;gBAAE,GAAG,EAAE,CAAC;YAChC,IAAI,GAAG,KAAK,CAAC;gBAAE,SAAS;YACxB,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,GAAG,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAE,EAAE,CAAC,CAAC;QACvD,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,SAAS,CAAC,YAAoB,EAAE,UAAkB,EAAE,IAAY;QAC9D,OAAO,CACL,IAAI,CAAC,GAAG;aACL,OAAO,CACN;4EACkE,CACnE;aACA,GAAG,CAAC,YAAY,EAAE,UAAU,EAAE,IAAI,CAAC,KAAK,SAAS,CACrD,CAAC;IACJ,CAAC;IAED,WAAW,CAAC,YAAoB,EAAE,UAAkB,EAAE,IAAY;QAChE,OAAO,CACL,IAAI,CAAC,GAAG;aACL,OAAO,CACN;4EACkE,CACnE;aACA,GAAG,CAAC,YAAY,EAAE,UAAU,EAAE,IAAI,CAAC,KAAK,SAAS,CACrD,CAAC;IACJ,CAAC;IAED,YAAY,CACV,YAAoB,EACpB,UAAkB,EAClB,IAAY,EACZ,GAA8B,EAC9B,KAAiB,EACjB,KAAa;QAEb,IAAI,CAAC,GAAG;aACL,OAAO,CACN;;;sCAG8B,CAC/B;aACA,GAAG,CACF,YAAY,EACZ,UAAU,EACV,IAAI,EACJ,GAAG,CAAC,IAAI,CAAC,eAAe,EACxB,GAAG,CAAC,IAAI,CAAC,UAAU;QACnB,oEAAoE;QACpE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAClB,KAAK,CACN,CAAC;QACJ,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,yBAAyB,EAAE;YAC3C,UAAU;YACV,SAAS,EAAE,IAAI;YACf,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,eAAe;YAChC,SAAS,EAAE,GAAG,CAAC,IAAI,CAAC,UAAU;YAC9B,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI;SACpB,CAAC,CAAC;IACL,CAAC;IAED,kGAAkG;IAClG,aAAa,CAAC,YAAoB,EAAE,UAAkB,EAAE,KAAa;QACnE,MAAM,QAAQ,GAAoB,EAAE,CAAC;QACrC,SAAS,CAAC;YACR,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG;iBAClB,OAAO,CACN;yDAC+C,CAChD;iBACA,GAAG,CAAC,YAAY,EAAE,UAAU,CAG7B,CAAC;YACH,IAAI,aAAa,GAAG,KAAK,CAAC;YAC1B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,MAAM,GAAG,GAAG,uBAAuB,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC;gBACxE,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CACzC,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,UAAU,EAAE,CAAC,CAAC,CAC5C,CAAC;gBACF,IAAI,CAAC,KAAK;oBAAE,SAAS;gBACrB,IAAI,CAAC,YAAY,CACf,YAAY,EACZ,UAAU,EACV,GAAG,CAAC,UAAU,EACd,GAAG,EACH,IAAI,UAAU,CAAC,GAAG,CAAC,cAAc,CAAC,EAClC,KAAK,CACN,CAAC;gBACF,IAAI,CAAC,GAAG;qBACL,OAAO,CACN;8EACkE,CACnE;qBACA,GAAG,CAAC,YAAY,EAAE,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;gBACjD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,yBAAyB,EAAE;oBAC3C,UAAU;oBACV,SAAS,EAAE,GAAG,CAAC,UAAU;iBAC1B,CAAC,CAAC;gBACH,QAAQ,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,GAAG,CAAC,UAAU,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC5D,aAAa,GAAG,IAAI,CAAC;YACvB,CAAC;YACD,IAAI,CAAC,aAAa;gBAAE,OAAO,QAAQ,CAAC;QACtC,CAAC;IACH,CAAC;CACF"}