@origintrail-official/dkg-agent 10.0.19 → 10.0.21

package/dist/internal/local-private-member.js

@@ -0,0 +1,21 @@
+// SPDX-License-Identifier: Apache-2.0
+/** A context graph member identity: a bare agent address or its `did:dkg:agent:` DID. */
+function memberAgentAddress(value) {
+    const match = /^(?:did:dkg:agent:)?(0x[0-9a-fA-F]{40})$/.exec(value.trim());
+    return match?.[1]?.toLowerCase();
+}
+/**
+ * Whether `meta` declares an explicit private policy (#865) and lists one of
+ * `localAgents` among its allowed agents, participants, curators or creators,
+ * and not among its revoked agents.
+ */
+export function isLocalPrivateMember(meta, localAgents) {
+    if (meta.accessPolicy?.trim().toLowerCase() !== 'private')
+        return false;
+    const revoked = new Set(meta.revokedAgents.map(memberAgentAddress));
+    const members = new Set([...meta.allowedAgents, ...meta.participantAgents, ...meta.curators, ...meta.creators]
+        .map(memberAgentAddress)
+        .filter((member) => member !== undefined && !revoked.has(member)));
+    return localAgents.some((local) => (local !== undefined && members.has(memberAgentAddress(local))));
+}
+//# sourceMappingURL=local-private-member.js.map

package/dist/internal/local-private-member.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"local-private-member.js","sourceRoot":"","sources":["../../src/internal/local-private-member.ts"],"names":[],"mappings":"AAAA,sCAAsC;AAItC,yFAAyF;AACzF,SAAS,kBAAkB,CAAC,KAAa;IACvC,MAAM,KAAK,GAAG,0CAA0C,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IAC5E,OAAO,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC;AACnC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAClC,IAOC,EACD,WAA4C;IAE5C,IAAI,IAAI,CAAC,YAAY,EAAE,IAAI,EAAE,CAAC,WAAW,EAAE,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACxE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC;IACpE,MAAM,OAAO,GAAG,IAAI,GAAG,CACrB,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,GAAG,IAAI,CAAC,iBAAiB,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC;SACnF,GAAG,CAAC,kBAAkB,CAAC;SACvB,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CACpE,CAAC;IACF,OAAO,WAAW,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CACjC,KAAK,KAAK,SAAS,IAAI,OAAO,CAAC,GAAG,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC,CAC9D,CAAC,CAAC;AACL,CAAC"}

package/dist/internal/promote/assertion-promote-precommit.d.ts

@@ -16,11 +16,51 @@ type AssertionPromotePreCommitResult = {
     gossipSigner: GossipSigner;
     publisherOptions: PublisherAssertionPromoteOptions;
 };
+/**
+ * The same translation for the root promote's boundary companion, which the
+ * publisher prepares synchronously. Only the retirement fence is transient:
+ * every other refusal from the prepare (unavailable persistence, the head
+ * limit, invalid input) is a hard failure and passes through unchanged.
+ */
+export declare function translateLegacySwmRetirementFence<T>(prepare: () => T): T;
+/** Waits before each repeat of a promote's recipient read. */
+export declare const PROMOTE_RECIPIENT_RETRY_DELAYS_MS: readonly number[];
+/**
+ * No repeat starts later than this after the first read began. It sits below
+ * the chain authority read deadline, so a read that ran into that deadline is
+ * reported at once instead of being asked again.
+ */
+export declare const PROMOTE_RECIPIENT_RETRY_BUDGET_MS = 2000;
+/** The clock and sleep of the recipient repeat, replaceable in tests. */
+export interface PromoteRecipientRetryTiming {
+    now(): number;
+    sleep(delayMs: number): Promise<void>;
+}
+/**
+ * Repeat a promote's recipient read while it fails with a retryable authority
+ * outage and the bound allows.
+ *
+ * The recipient read accepts its roster only while the node-wide authority
+ * facts revision stands still, and it gives up after a few attempts. Work that
+ * has nothing to do with this promote moves that revision: after a Context
+ * Graph is registered the node reconciles the new graph's gossip subscription
+ * several times within a few hundred milliseconds. A share sent straight after
+ * a registration can therefore use up those attempts and report the roster as
+ * temporarily unavailable, although no fact changed and the same read succeeds
+ * moments later.
+ *
+ * Repeating it is safe. It only reads authority and recipient keys, it fails
+ * closed every time, and the publisher asks for it before the attempt claims
+ * an operation id or writes Shared Memory. The bound is short on purpose: each
+ * repeat costs chain reads, and a failure that outlasts the bound is reported
+ * to the caller, which retries the whole promote.
+ */
+export declare function resolvePromoteRecipientsWithinBound<T>(resolve: () => Promise<T>, timing?: PromoteRecipientRetryTiming): Promise<T>;
 /**
  * Resolve agent prerequisites without access to the committing publisher.
  * The publisher receives concrete, pre-wrapped recipient and curator callbacks,
  * not a policy that it could apply to arbitrary commit/finalization failures.
  */
-export declare function prepareAssertionPromote(host: AssertionPromotePreCommitHost, input: AssertionPromotePreCommitInput): Promise<AssertionPromotePreCommitResult>;
+export declare function prepareAssertionPromote(host: AssertionPromotePreCommitHost, input: AssertionPromotePreCommitInput, recipientRetryTiming?: PromoteRecipientRetryTiming): Promise<AssertionPromotePreCommitResult>;
 export {};
 //# sourceMappingURL=assertion-promote-precommit.d.ts.map

package/dist/internal/promote/assertion-promote-precommit.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"assertion-promote-precommit.d.ts","sourceRoot":"","sources":["../../../src/internal/promote/assertion-promote-precommit.ts"],"names":[],"mappings":"AAGA,OAAO,EAEL,KAAK,gCAAgC,EACtC,MAAM,qCAAqC,CAAC;AAM7C,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,KAAK,EAAE,uBAAuB,EAAE,MAAM,0BAA0B,CAAC;AACxE,KAAK,YAAY,GAAG,OAAO,CACzB,UAAU,CAAC,QAAQ,CAAC,oCAAoC,CAAC,CAAC,CAC3D,CAAC;AAEF,KAAK,gCAAgC,GAAG,IAAI,CAC1C,uBAAuB,EACrB,cAAc,GACd,iBAAiB,GACjB,qBAAqB,GACrB,cAAc,GACd,cAAc,CACjB,CAAC;AAEF,KAAK,mCAAmC,GACpC,oCAAoC,GACpC,0BAA0B,GAC1B,iCAAiC,GACjC,8BAA8B,GAC9B,2BAA2B,CAAC;AAEhC,KAAK,6BAA6B,GAAG;KAClC,MAAM,IAAI,mCAAmC,GAAG,iBAAiB,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;CACrF,CAAC;AAEF,UAAU,8BAA8B;IACtC,cAAc,EAAE,MAAM,CAAC;IACvB,eAAe,EAAE,MAAM,CAAC;IACxB,OAAO,CAAC,EAAE,gCAAgC,CAAC;CAC5C;AAED,KAAK,+BAA+B,GAAG;IACrC,YAAY,EAAE,YAAY,CAAC;IAC3B,gBAAgB,EAAE,gCAAgC,CAAC;CACpD,CAAC;AAiCF;;;;GAIG;AACH,wBAAsB,uBAAuB,CAC3C,IAAI,EAAE,6BAA6B,EACnC,KAAK,EAAE,8BAA8B,GACpC,OAAO,CAAC,+BAA+B,CAAC,CA4C1C"}
+{"version":3,"file":"assertion-promote-precommit.d.ts","sourceRoot":"","sources":["../../../src/internal/promote/assertion-promote-precommit.ts"],"names":[],"mappings":"AAMA,OAAO,EAEL,KAAK,gCAAgC,EACtC,MAAM,qCAAqC,CAAC;AAM7C,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,KAAK,EAAE,uBAAuB,EAAE,MAAM,0BAA0B,CAAC;AACxE,KAAK,YAAY,GAAG,OAAO,CACzB,UAAU,CAAC,QAAQ,CAAC,oCAAoC,CAAC,CAAC,CAC3D,CAAC;AAEF,KAAK,gCAAgC,GAAG,IAAI,CAC1C,uBAAuB,EACrB,cAAc,GACd,iBAAiB,GACjB,qBAAqB,GACrB,cAAc,GACd,cAAc,CACjB,CAAC;AAEF,KAAK,mCAAmC,GACpC,oCAAoC,GACpC,0BAA0B,GAC1B,iCAAiC,GACjC,8BAA8B,GAC9B,2BAA2B,CAAC;AAEhC,KAAK,6BAA6B,GAAG;KAClC,MAAM,IAAI,mCAAmC,GAAG,iBAAiB,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;CACrF,CAAC;AAEF,UAAU,8BAA8B;IACtC,cAAc,EAAE,MAAM,CAAC;IACvB,eAAe,EAAE,MAAM,CAAC;IACxB,OAAO,CAAC,EAAE,gCAAgC,CAAC;CAC5C;AAED,KAAK,+BAA+B,GAAG;IACrC,YAAY,EAAE,YAAY,CAAC;IAC3B,gBAAgB,EAAE,gCAAgC,CAAC;CACpD,CAAC;AAuBF;;;;;GAKG;AACH,wBAAgB,iCAAiC,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,CASxE;AAED,8DAA8D;AAC9D,eAAO,MAAM,iCAAiC,EAAE,SAAS,MAAM,EAAmC,CAAC;AAEnG;;;;GAIG;AACH,eAAO,MAAM,iCAAiC,OAAQ,CAAC;AAEvD,yEAAyE;AACzE,MAAM,WAAW,2BAA2B;IAC1C,GAAG,IAAI,MAAM,CAAC;IACd,KAAK,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;CACvC;AAOD;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAsB,mCAAmC,CAAC,CAAC,EACzD,OAAO,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,EACzB,MAAM,GAAE,2BAAiE,GACxE,OAAO,CAAC,CAAC,CAAC,CAiBZ;AAED;;;;GAIG;AACH,wBAAsB,uBAAuB,CAC3C,IAAI,EAAE,6BAA6B,EACnC,KAAK,EAAE,8BAA8B,EACrC,oBAAoB,CAAC,EAAE,2BAA2B,GACjD,OAAO,CAAC,+BAA+B,CAAC,CA+C1C"}

package/dist/internal/promote/assertion-promote-precommit.js

@@ -1,41 +1,98 @@
 // SPDX-License-Identifier: Apache-2.0
-import { createOperationContext } from '@origintrail-official/dkg-core';
+import { createOperationContext, isRfc64LegacySwmBoundaryRetirementInProgressError, } from '@origintrail-official/dkg-core';
 import { createPromoteRetryableFailure, } from '@origintrail-official/dkg-publisher';
-import { isContextGraphAuthorityUnavailableMarker, } from '../context-graph-authority/context-graph-authority.js';
-const CONTEXT_GRAPH_AUTHORITY_PROMOTE_RETRY = {
-    'finalized-name-absence-unaccepted': true,
-    'chain-name-binding-unavailable': true,
-    // A cooldown ends on its own; the promote is worth retrying.
-    'authority-circuit-open': true,
-    'local-chain-binding-unavailable': true,
-    'local-existence-unavailable': true,
-    'chain-access-policy-unavailable': true,
-    'chain-access-policy-timeout': true,
-    'chain-access-policy-unknown': false,
-    'chain-participant-authority-unsupported': false,
-    'chain-participant-authority-unavailable': true,
-    'chain-participant-authority-invalid': false,
-    'rfc64-private-read-roster-unavailable': true,
-};
-/** Retry translation belongs to these concrete agent prerequisite callbacks. */
+import { isContextGraphAuthorityUnavailableMarker, isRetryableContextGraphAuthorityUnavailableReason, } from '../context-graph-authority/context-graph-authority.js';
+/** An authority failure that can heal on its own (the shared classification). */
+function isRetryableAuthorityUnavailable(error) {
+    return isContextGraphAuthorityUnavailableMarker(error)
+        && isRetryableContextGraphAuthorityUnavailableReason(error.reason);
+}
+/**
+ * Retry translation belongs to these concrete agent prerequisite callbacks;
+ * which reasons are retryable is the shared authority classification.
+ */
 async function resolvePromoteAuthority(resolve) {
     try {
         return await resolve();
     }
     catch (error) {
-        if (isContextGraphAuthorityUnavailableMarker(error)
-            && CONTEXT_GRAPH_AUTHORITY_PROMOTE_RETRY[error.reason]) {
+        if (isRetryableAuthorityUnavailable(error)) {
+            throw createPromoteRetryableFailure(error);
+        }
+        throw error;
+    }
+}
+/**
+ * The same translation for the root promote's boundary companion, which the
+ * publisher prepares synchronously. Only the retirement fence is transient:
+ * every other refusal from the prepare (unavailable persistence, the head
+ * limit, invalid input) is a hard failure and passes through unchanged.
+ */
+export function translateLegacySwmRetirementFence(prepare) {
+    try {
+        return prepare();
+    }
+    catch (error) {
+        if (isRfc64LegacySwmBoundaryRetirementInProgressError(error)) {
             throw createPromoteRetryableFailure(error);
         }
         throw error;
     }
 }
+/** Waits before each repeat of a promote's recipient read. */
+export const PROMOTE_RECIPIENT_RETRY_DELAYS_MS = Object.freeze([100, 300, 700]);
+/**
+ * No repeat starts later than this after the first read began. It sits below
+ * the chain authority read deadline, so a read that ran into that deadline is
+ * reported at once instead of being asked again.
+ */
+export const PROMOTE_RECIPIENT_RETRY_BUDGET_MS = 2_000;
+const REAL_PROMOTE_RECIPIENT_RETRY_TIMING = Object.freeze({
+    now: () => performance.now(),
+    sleep: (delayMs) => new Promise((resolve) => { setTimeout(resolve, delayMs); }),
+});
+/**
+ * Repeat a promote's recipient read while it fails with a retryable authority
+ * outage and the bound allows.
+ *
+ * The recipient read accepts its roster only while the node-wide authority
+ * facts revision stands still, and it gives up after a few attempts. Work that
+ * has nothing to do with this promote moves that revision: after a Context
+ * Graph is registered the node reconciles the new graph's gossip subscription
+ * several times within a few hundred milliseconds. A share sent straight after
+ * a registration can therefore use up those attempts and report the roster as
+ * temporarily unavailable, although no fact changed and the same read succeeds
+ * moments later.
+ *
+ * Repeating it is safe. It only reads authority and recipient keys, it fails
+ * closed every time, and the publisher asks for it before the attempt claims
+ * an operation id or writes Shared Memory. The bound is short on purpose: each
+ * repeat costs chain reads, and a failure that outlasts the bound is reported
+ * to the caller, which retries the whole promote.
+ */
+export async function resolvePromoteRecipientsWithinBound(resolve, timing = REAL_PROMOTE_RECIPIENT_RETRY_TIMING) {
+    const startedAt = timing.now();
+    for (let attempt = 0;; attempt += 1) {
+        try {
+            return await resolve();
+        }
+        catch (error) {
+            const delayMs = PROMOTE_RECIPIENT_RETRY_DELAYS_MS[attempt];
+            if (delayMs === undefined
+                || !isRetryableAuthorityUnavailable(error)
+                || timing.now() - startedAt + delayMs > PROMOTE_RECIPIENT_RETRY_BUDGET_MS) {
+                throw error;
+            }
+            await timing.sleep(delayMs);
+        }
+    }
+}
 /**
  * Resolve agent prerequisites without access to the committing publisher.
  * The publisher receives concrete, pre-wrapped recipient and curator callbacks,
  * not a policy that it could apply to arbitrary commit/finalization failures.
  */
-export async function prepareAssertionPromote(host, input) {
+export async function prepareAssertionPromote(host, input, recipientRetryTiming) {
     return resolvePromoteAuthority(async () => {
         const gossipSigner = await host.resolveWorkspaceGossipSigningAgent(input.contextGraphId);
         const confirmBeforeCommit = await host.buildCuratorAckConfirmer(input.contextGraphId, gossipSigner, {
@@ -64,7 +121,7 @@ export async function prepareAssertionPromote(host, input) {
                 confirmBeforeCommit: confirmBeforeCommit === undefined
                     ? undefined
                     : (message) => resolvePromoteAuthority(() => confirmBeforeCommit(message)),
-                resolveWorkspaceRecipients: (request) => resolvePromoteAuthority(() => host.resolveWorkspaceRecipientsGated(request)),
+                resolveWorkspaceRecipients: (request) => resolvePromoteAuthority(() => resolvePromoteRecipientsWithinBound(() => host.resolveWorkspaceRecipientsGated(request), recipientRetryTiming)),
                 ...(shareAccessPolicy !== undefined ? { accessPolicy: shareAccessPolicy } : {}),
                 ...(input.options?.allowedPeers !== undefined
                     ? { allowedPeers: [...input.options.allowedPeers] }

package/dist/internal/promote/assertion-promote-precommit.js.map

@@ -1 +1 @@
-{"version":3,"file":"assertion-promote-precommit.js","sourceRoot":"","sources":["../../../src/internal/promote/assertion-promote-precommit.ts"],"names":[],"mappings":"AAAA,sCAAsC;AAEtC,OAAO,EAAE,sBAAsB,EAAE,MAAM,gCAAgC,CAAC;AACxE,OAAO,EACL,6BAA6B,GAE9B,MAAM,qCAAqC,CAAC;AAE7C,OAAO,EACL,wCAAwC,GAEzC,MAAM,uDAAuD,CAAC;AAsC/D,MAAM,qCAAqC,GAAG;IAC5C,mCAAmC,EAAE,IAAI;IACzC,gCAAgC,EAAE,IAAI;IACtC,6DAA6D;IAC7D,wBAAwB,EAAE,IAAI;IAC9B,iCAAiC,EAAE,IAAI;IACvC,6BAA6B,EAAE,IAAI;IACnC,iCAAiC,EAAE,IAAI;IACvC,6BAA6B,EAAE,IAAI;IACnC,6BAA6B,EAAE,KAAK;IACpC,yCAAyC,EAAE,KAAK;IAChD,yCAAyC,EAAE,IAAI;IAC/C,qCAAqC,EAAE,KAAK;IAC5C,uCAAuC,EAAE,IAAI;CAC6B,CAAC;AAE7E,gFAAgF;AAChF,KAAK,UAAU,uBAAuB,CAAI,OAAyB;IACjE,IAAI,CAAC;QACH,OAAO,MAAM,OAAO,EAAE,CAAC;IACzB,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IACE,wCAAwC,CAAC,KAAK,CAAC;eAC5C,qCAAqC,CAAC,KAAK,CAAC,MAAM,CAAC,EACtD,CAAC;YACD,MAAM,6BAA6B,CAAC,KAAK,CAAC,CAAC;QAC7C,CAAC;QACD,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,uBAAuB,CAC3C,IAAmC,EACnC,KAAqC;IAErC,OAAO,uBAAuB,CAAC,KAAK,IAAI,EAAE;QACxC,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,kCAAkC,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;QACzF,MAAM,mBAAmB,GAAG,MAAM,IAAI,CAAC,wBAAwB,CAC7D,KAAK,CAAC,cAAc,EACpB,YAAY,EACZ;YACE,eAAe,EAAE,KAAK,CAAC,OAAO,EAAE,eAAe;YAC/C,mBAAmB,EAAE,KAAK,CAAC,OAAO,EAAE,mBAAmB;SACxD,EACD,sBAAsB,CAAC,OAAO,CAAC,CAChC,CAAC;QAEF,IAAI,iBAAiB,GAAG,KAAK,CAAC,OAAO,EAAE,YAAY,CAAC;QACpD,IAAI,iBAAiB,KAAK,SAAS,EAAE,CAAC;YACpC,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,4BAA4B,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;YAClF,IAAI,WAAW,CAAC,YAAY,KAAK,CAAC;gBAAE,iBAAiB,GAAG,WAAW,CAAC;iBAC/D,IAAI,WAAW,CAAC,YAAY,KAAK,CAAC;gBAAE,iBAAiB,GAAG,QAAQ,CAAC;iBACjE,IAAI,MAAM,IAAI,CAAC,yBAAyB,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC1E,iBAAiB,GAAG,WAAW,CAAC;YAClC,CAAC;QACH,CAAC;QAED,OAAO;YACL,YAAY;YACZ,gBAAgB,EAAE;gBAChB,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,YAAY,KAAK,SAAS;oBAC3C,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,OAAO,CAAC,YAAY,EAAE;oBAC9C,CAAC,CAAC,EAAE,CAAC;gBACP,eAAe,EAAE,KAAK,CAAC,eAAe;gBACtC,kBAAkB,EAAE,YAAY,EAAE,YAAY;gBAC9C,mBAAmB,EAAE,mBAAmB,KAAK,SAAS;oBACpD,CAAC,CAAC,SAAS;oBACX,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,uBAAuB,CAAC,GAAG,EAAE,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAC;gBAC5E,0BAA0B,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,uBAAuB,CAC9D,GAAG,EAAE,CAAC,IAAI,CAAC,+BAA+B,CAAC,OAAO,CAAC,CACpD;gBACD,GAAG,CAAC,iBAAiB,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,iBAAiB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC/E,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,YAAY,KAAK,SAAS;oBAC3C,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE;oBACnD,CAAC,CAAC,EAAE,CAAC;aACR;SACF,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC"}
+{"version":3,"file":"assertion-promote-precommit.js","sourceRoot":"","sources":["../../../src/internal/promote/assertion-promote-precommit.ts"],"names":[],"mappings":"AAAA,sCAAsC;AAEtC,OAAO,EACL,sBAAsB,EACtB,iDAAiD,GAClD,MAAM,gCAAgC,CAAC;AACxC,OAAO,EACL,6BAA6B,GAE9B,MAAM,qCAAqC,CAAC;AAE7C,OAAO,EACL,wCAAwC,EACxC,iDAAiD,GAClD,MAAM,uDAAuD,CAAC;AAsC/D,iFAAiF;AACjF,SAAS,+BAA+B,CAAC,KAAc;IACrD,OAAO,wCAAwC,CAAC,KAAK,CAAC;WACjD,iDAAiD,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;AACvE,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,uBAAuB,CAAI,OAAyB;IACjE,IAAI,CAAC;QACH,OAAO,MAAM,OAAO,EAAE,CAAC;IACzB,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,+BAA+B,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3C,MAAM,6BAA6B,CAAC,KAAK,CAAC,CAAC;QAC7C,CAAC;QACD,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iCAAiC,CAAI,OAAgB;IACnE,IAAI,CAAC;QACH,OAAO,OAAO,EAAE,CAAC;IACnB,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,iDAAiD,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7D,MAAM,6BAA6B,CAAC,KAAK,CAAC,CAAC;QAC7C,CAAC;QACD,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED,8DAA8D;AAC9D,MAAM,CAAC,MAAM,iCAAiC,GAAsB,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;AAEnG;;;;GAIG;AACH,MAAM,CAAC,MAAM,iCAAiC,GAAG,KAAK,CAAC;AAQvD,MAAM,mCAAmC,GAAgC,MAAM,CAAC,MAAM,CAAC;IACrF,GAAG,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;IAC5B,KAAK,EAAE,CAAC,OAAe,EAAE,EAAE,CAAC,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,EAAE,GAAG,UAAU,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;CAC9F,CAAC,CAAC;AAEH;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,CAAC,KAAK,UAAU,mCAAmC,CACvD,OAAyB,EACzB,SAAsC,mCAAmC;IAEzE,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC;IAC/B,KAAK,IAAI,OAAO,GAAG,CAAC,GAAI,OAAO,IAAI,CAAC,EAAE,CAAC;QACrC,IAAI,CAAC;YACH,OAAO,MAAM,OAAO,EAAE,CAAC;QACzB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,OAAO,GAAG,iCAAiC,CAAC,OAAO,CAAC,CAAC;YAC3D,IACE,OAAO,KAAK,SAAS;mBAClB,CAAC,+BAA+B,CAAC,KAAK,CAAC;mBACvC,MAAM,CAAC,GAAG,EAAE,GAAG,SAAS,GAAG,OAAO,GAAG,iCAAiC,EACzE,CAAC;gBACD,MAAM,KAAK,CAAC;YACd,CAAC;YACD,MAAM,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,uBAAuB,CAC3C,IAAmC,EACnC,KAAqC,EACrC,oBAAkD;IAElD,OAAO,uBAAuB,CAAC,KAAK,IAAI,EAAE;QACxC,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,kCAAkC,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;QACzF,MAAM,mBAAmB,GAAG,MAAM,IAAI,CAAC,wBAAwB,CAC7D,KAAK,CAAC,cAAc,EACpB,YAAY,EACZ;YACE,eAAe,EAAE,KAAK,CAAC,OAAO,EAAE,eAAe;YAC/C,mBAAmB,EAAE,KAAK,CAAC,OAAO,EAAE,mBAAmB;SACxD,EACD,sBAAsB,CAAC,OAAO,CAAC,CAChC,CAAC;QAEF,IAAI,iBAAiB,GAAG,KAAK,CAAC,OAAO,EAAE,YAAY,CAAC;QACpD,IAAI,iBAAiB,KAAK,SAAS,EAAE,CAAC;YACpC,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,4BAA4B,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;YAClF,IAAI,WAAW,CAAC,YAAY,KAAK,CAAC;gBAAE,iBAAiB,GAAG,WAAW,CAAC;iBAC/D,IAAI,WAAW,CAAC,YAAY,KAAK,CAAC;gBAAE,iBAAiB,GAAG,QAAQ,CAAC;iBACjE,IAAI,MAAM,IAAI,CAAC,yBAAyB,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC1E,iBAAiB,GAAG,WAAW,CAAC;YAClC,CAAC;QACH,CAAC;QAED,OAAO;YACL,YAAY;YACZ,gBAAgB,EAAE;gBAChB,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,YAAY,KAAK,SAAS;oBAC3C,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,OAAO,CAAC,YAAY,EAAE;oBAC9C,CAAC,CAAC,EAAE,CAAC;gBACP,eAAe,EAAE,KAAK,CAAC,eAAe;gBACtC,kBAAkB,EAAE,YAAY,EAAE,YAAY;gBAC9C,mBAAmB,EAAE,mBAAmB,KAAK,SAAS;oBACpD,CAAC,CAAC,SAAS;oBACX,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,uBAAuB,CAAC,GAAG,EAAE,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAC;gBAC5E,0BAA0B,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,uBAAuB,CAC9D,GAAG,EAAE,CAAC,mCAAmC,CACvC,GAAG,EAAE,CAAC,IAAI,CAAC,+BAA+B,CAAC,OAAO,CAAC,EACnD,oBAAoB,CACrB,CACF;gBACD,GAAG,CAAC,iBAAiB,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,iBAAiB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC/E,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,YAAY,KAAK,SAAS;oBAC3C,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE;oBACnD,CAAC,CAAC,EAAE,CAAC;aACR;SACF,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/internal/storage-ack-owned-request.d.ts

@@ -0,0 +1,16 @@
+import { type ACKCollectorDeps } from '@origintrail-official/dkg-publisher';
+interface ACKReliableMessenger {
+    sendRequestOwned(peerId: string, protocol: string, data: Uint8Array, opts: {
+        timeoutMs: number;
+    }): Promise<{
+        delivered: boolean;
+        error?: unknown;
+        response?: Uint8Array;
+    }>;
+}
+export declare function createACKSendP2P(input: {
+    messenger: ACKReliableMessenger;
+    timeoutMs: number;
+}): ACKCollectorDeps['sendP2P'];
+export {};
+//# sourceMappingURL=storage-ack-owned-request.d.ts.map

package/dist/internal/storage-ack-owned-request.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"storage-ack-owned-request.d.ts","sourceRoot":"","sources":["../../src/internal/storage-ack-owned-request.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,KAAK,gBAAgB,EAAE,MAAM,qCAAqC,CAAC;AAE5E,UAAU,oBAAoB;IAC5B,gBAAgB,CACd,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,MAAM,EAChB,IAAI,EAAE,UAAU,EAChB,IAAI,EAAE;QAAE,SAAS,EAAE,MAAM,CAAA;KAAE,GAC1B,OAAO,CAAC;QAAE,SAAS,EAAE,OAAO,CAAC;QAAC,KAAK,CAAC,EAAE,OAAO,CAAC;QAAC,QAAQ,CAAC,EAAE,UAAU,CAAA;KAAE,CAAC,CAAC;CAC5E;AAED,wBAAgB,gBAAgB,CAAC,KAAK,EAAE;IACtC,SAAS,EAAE,oBAAoB,CAAC;IAChC,SAAS,EAAE,MAAM,CAAC;CACnB,GAAG,gBAAgB,CAAC,SAAS,CAAC,CAa9B"}

package/dist/internal/storage-ack-owned-request.js

@@ -0,0 +1,16 @@
+// SPDX-License-Identifier: Apache-2.0
+export function createACKSendP2P(input) {
+    return async (peerId, protocol, data) => {
+        const sendResult = await input.messenger.sendRequestOwned(peerId, protocol, data, {
+            timeoutMs: input.timeoutMs,
+        });
+        if (!sendResult.delivered) {
+            throw new Error(`substrate send already in flight (transport): ${sendResult.error}`);
+        }
+        if (!sendResult.response) {
+            throw new Error('substrate delivered (transport) without response');
+        }
+        return sendResult.response;
+    };
+}
+//# sourceMappingURL=storage-ack-owned-request.js.map

package/dist/internal/storage-ack-owned-request.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"storage-ack-owned-request.js","sourceRoot":"","sources":["../../src/internal/storage-ack-owned-request.ts"],"names":[],"mappings":"AAAA,sCAAsC;AAatC,MAAM,UAAU,gBAAgB,CAAC,KAGhC;IACC,OAAO,KAAK,EAAE,MAAc,EAAE,QAAgB,EAAE,IAAgB,EAAE,EAAE;QAClE,MAAM,UAAU,GAAG,MAAM,KAAK,CAAC,SAAS,CAAC,gBAAgB,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE;YAChF,SAAS,EAAE,KAAK,CAAC,SAAS;SAC3B,CAAC,CAAC;QACH,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC;YAC1B,MAAM,IAAI,KAAK,CAAC,iDAAiD,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC;QACvF,CAAC;QACD,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CAAC,kDAAkD,CAAC,CAAC;QACtE,CAAC;QACD,OAAO,UAAU,CAAC,QAAQ,CAAC;IAC7B,CAAC,CAAC;AACJ,CAAC"}

package/dist/internal/vm-reconcile-local-admission-wait.d.ts

@@ -0,0 +1,96 @@
+/**
+ * Graphs waiting for node-local sync admission, served in turn.
+ *
+ * A reconcile pass that the node's own sync admission refused has nothing to
+ * gain from running again while that capacity is still in use: every repeat
+ * costs the pass's chain reads and is refused the same way, and every waiting
+ * graph pays them at once. This component owns the wait instead. A refused
+ * graph is kept in arrival order and nudged once the admission can take its
+ * fetch, one graph at a time.
+ *
+ * A pass that could not start its work at all, because the source it had to
+ * ask did not answer, waits here too (see {@link VmReconcileLocalAdmissionWait.defer}).
+ *
+ * It owns no sync lease and no VM worker. A nudge re-enters the ordinary
+ * bounded dispatcher, and the periodic sweep still visits a waiting graph.
+ */
+export interface LocalAdmissionWaitOptions {
+    signal?: AbortSignal;
+    isCurrent: () => boolean;
+    /** Whether the node's sync admission would take this graph's fetch right now. */
+    canAdmit: () => boolean;
+}
+/** One pass of a graph, from the moment it started. */
+export interface LocalAdmissionPass {
+    readonly key: string;
+    /** The graph's place in the wait when the pass started, if it had one. */
+    readonly waiting: object | undefined;
+}
+export interface VmReconcileLocalAdmissionWaitDeps {
+    /**
+     * Nudge one graph and return its pass's completion. Undefined when the
+     * nudge was not admitted (held after a failed pass, or no queue room).
+     * `deferred` says the graph was parked by `defer`, so the hold a failed
+     * pass leaves is its own and this nudge is the retry.
+     */
+    readonly nudge: (key: string, deferred: boolean) => Promise<unknown> | undefined;
+    /** Bound on retained waiters. */
+    readonly maxWaiters: number;
+}
+export declare class VmReconcileLocalAdmissionWait {
+    private readonly deps;
+    /** Waiting graphs, in the order they are served. */
+    private readonly waiters;
+    /** The waiter nudged last, until its pass settles. */
+    private turn;
+    /** No waiter is nudged before this time: a nudged pass was refused all the same. */
+    private holdUntil;
+    private timer;
+    private closed;
+    constructor(deps: VmReconcileLocalAdmissionWaitDeps);
+    /**
+     * The node's sync admission refused this graph's fetch. `canAdmit` reads the
+     * admission the fetch will ask. Every waiter uses this readiness contract.
+     */
+    retry(key: string, options: LocalAdmissionWaitOptions): void;
+    /**
+     * A graph that just used the node's sync admission and has more to fetch
+     * goes behind the graphs already waiting for it. Returns false, and parks
+     * nothing, when no other graph is waiting.
+     */
+    yieldTurn(key: string, options: LocalAdmissionWaitOptions): boolean;
+    /**
+     * A pass ended before its work started: the source it had to ask gave no
+     * answer. Nothing here can read when it will, so the graph goes behind the
+     * others and no waiter is nudged for one delay. A graph that keeps getting
+     * no answer then costs one short pass per delay, in turn with the rest.
+     * `canAdmit` is the same readiness contract as for a refused fetch: the
+     * graph is not asked again while its fetch could not start anyway.
+     *
+     * Returns `again` when the pass was this wait's own nudge, `parked` when it
+     * came from elsewhere, and undefined when the graph was not taken.
+     */
+    defer(key: string, options: LocalAdmissionWaitOptions): 'parked' | 'again' | undefined;
+    /** A pass of this graph is starting. Hand the result to {@link passEnded}. */
+    passStarted(key: string): LocalAdmissionPass;
+    /**
+     * The pass ended. A graph whose place in the wait is still the one it had
+     * when the pass started was not refused again, so it is no longer waiting.
+     * Whatever the pass used is free now, so this is also when the next waiter
+     * can go.
+     */
+    passEnded(pass: LocalAdmissionPass): void;
+    close(): void;
+    private park;
+    private remove;
+    /**
+     * Nudge the longest waiter the node's sync admission can take, unless a
+     * nudged pass is still out. Waiters are read in arrival order and one that
+     * cannot be admitted yet is passed over, so a graph with capacity of its own
+     * is not held behind one without.
+     */
+    private wake;
+    /** One timer for the whole wait: the next delay to run out, else a capacity re-read per interval. */
+    private armTimer;
+}
+//# sourceMappingURL=vm-reconcile-local-admission-wait.d.ts.map

package/dist/internal/vm-reconcile-local-admission-wait.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vm-reconcile-local-admission-wait.d.ts","sourceRoot":"","sources":["../../src/internal/vm-reconcile-local-admission-wait.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAYH,MAAM,WAAW,yBAAyB;IACxC,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,SAAS,EAAE,MAAM,OAAO,CAAC;IACzB,iFAAiF;IACjF,QAAQ,EAAE,MAAM,OAAO,CAAC;CACzB;AAQD,uDAAuD;AACvD,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,0EAA0E;IAC1E,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,SAAS,CAAC;CACtC;AAED,MAAM,WAAW,iCAAiC;IAChD;;;;;OAKG;IACH,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,KAAK,OAAO,CAAC,OAAO,CAAC,GAAG,SAAS,CAAC;IACjF,iCAAiC;IACjC,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAWD,qBAAa,6BAA6B;IAU5B,OAAO,CAAC,QAAQ,CAAC,IAAI;IATjC,oDAAoD;IACpD,OAAO,CAAC,QAAQ,CAAC,OAAO,CAA6B;IACrD,sDAAsD;IACtD,OAAO,CAAC,IAAI,CAAiD;IAC7D,oFAAoF;IACpF,OAAO,CAAC,SAAS,CAAK;IACtB,OAAO,CAAC,KAAK,CAA4C;IACzD,OAAO,CAAC,MAAM,CAAS;gBAEM,IAAI,EAAE,iCAAiC;IAEpE;;;OAGG;IACH,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,yBAAyB,GAAG,IAAI;IAY5D;;;;OAIG;IACH,SAAS,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,yBAAyB,GAAG,OAAO;IAYnE;;;;;;;;;;OAUG;IACH,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,yBAAyB,GAAG,QAAQ,GAAG,OAAO,GAAG,SAAS;IAStF,8EAA8E;IAC9E,WAAW,CAAC,GAAG,EAAE,MAAM,GAAG,kBAAkB;IAI5C;;;;;OAKG;IACH,SAAS,CAAC,IAAI,EAAE,kBAAkB,GAAG,IAAI;IAOzC,KAAK,IAAI,IAAI;IAOb,OAAO,CAAC,IAAI;IAkCZ,OAAO,CAAC,MAAM;IAOd;;;;;OAKG;IACH,OAAO,CAAC,IAAI;IA6BZ,qGAAqG;IACrG,OAAO,CAAC,QAAQ;CAejB"}

package/dist/internal/vm-reconcile-local-admission-wait.js

@@ -0,0 +1,226 @@
+/**
+ * Graphs waiting for node-local sync admission, served in turn.
+ *
+ * A reconcile pass that the node's own sync admission refused has nothing to
+ * gain from running again while that capacity is still in use: every repeat
+ * costs the pass's chain reads and is refused the same way, and every waiting
+ * graph pays them at once. This component owns the wait instead. A refused
+ * graph is kept in arrival order and nudged once the admission can take its
+ * fetch, one graph at a time.
+ *
+ * A pass that could not start its work at all, because the source it had to
+ * ask did not answer, waits here too (see {@link VmReconcileLocalAdmissionWait.defer}).
+ *
+ * It owns no sync lease and no VM worker. A nudge re-enters the ordinary
+ * bounded dispatcher, and the periodic sweep still visits a waiting graph.
+ */
+/** A refused nudge's hold, and how often the queue re-reads capacity. */
+const RETRY_MS = 2_500;
+/**
+ * How long a nudged pass holds the next waiter back when it has not settled:
+ * long enough to reach its own admission, after which the capacity read
+ * accounts for it. Without the bound a long fetch on a node with several sync
+ * slots would keep its free ones idle.
+ */
+const TURN_MAX_MS = 15_000;
+/** A capacity read that cannot answer falls back to the plain bounded retry. */
+function admissionAvailable(waiter) {
+    try {
+        return waiter.canAdmit();
+    }
+    catch {
+        return true;
+    }
+}
+export class VmReconcileLocalAdmissionWait {
+    deps;
+    /** Waiting graphs, in the order they are served. */
+    waiters = new Map();
+    /** The waiter nudged last, until its pass settles. */
+    turn;
+    /** No waiter is nudged before this time: a nudged pass was refused all the same. */
+    holdUntil = 0;
+    timer;
+    closed = false;
+    constructor(deps) {
+        this.deps = deps;
+    }
+    /**
+     * The node's sync admission refused this graph's fetch. `canAdmit` reads the
+     * admission the fetch will ask. Every waiter uses this readiness contract.
+     */
+    retry(key, options) {
+        if (this.closed || options.signal?.aborted || !options.isCurrent())
+            return;
+        const refusedTurn = this.turn?.key === key;
+        // The nudged graph was refused all the same, so the capacity read was
+        // wrong or capacity went elsewhere first. It keeps its place at the head,
+        // and nothing is nudged for one delay so a wrong read cannot spin passes.
+        if (this.park(key, options, refusedTurn ? 'front' : 'keep') && refusedTurn) {
+            this.holdUntil = Date.now() + RETRY_MS;
+        }
+        this.armTimer();
+    }
+    /**
+     * A graph that just used the node's sync admission and has more to fetch
+     * goes behind the graphs already waiting for it. Returns false, and parks
+     * nothing, when no other graph is waiting.
+     */
+    yieldTurn(key, options) {
+        if (this.closed || options.signal?.aborted || !options.isCurrent())
+            return false;
+        let othersWaiting = false;
+        for (const waiting of this.waiters.keys()) {
+            if (waiting !== key) {
+                othersWaiting = true;
+                break;
+            }
+        }
+        if (!othersWaiting)
+            return false;
+        const parked = this.park(key, options, 'back');
+        this.armTimer();
+        return parked;
+    }
+    /**
+     * A pass ended before its work started: the source it had to ask gave no
+     * answer. Nothing here can read when it will, so the graph goes behind the
+     * others and no waiter is nudged for one delay. A graph that keeps getting
+     * no answer then costs one short pass per delay, in turn with the rest.
+     * `canAdmit` is the same readiness contract as for a refused fetch: the
+     * graph is not asked again while its fetch could not start anyway.
+     *
+     * Returns `again` when the pass was this wait's own nudge, `parked` when it
+     * came from elsewhere, and undefined when the graph was not taken.
+     */
+    defer(key, options) {
+        if (this.closed || options.signal?.aborted || !options.isCurrent())
+            return undefined;
+        const nudged = this.turn?.key === key;
+        if (!this.park(key, options, 'back', true))
+            return undefined;
+        this.holdUntil = Date.now() + RETRY_MS;
+        this.armTimer();
+        return nudged ? 'again' : 'parked';
+    }
+    /** A pass of this graph is starting. Hand the result to {@link passEnded}. */
+    passStarted(key) {
+        return { key, waiting: this.waiters.get(key) };
+    }
+    /**
+     * The pass ended. A graph whose place in the wait is still the one it had
+     * when the pass started was not refused again, so it is no longer waiting.
+     * Whatever the pass used is free now, so this is also when the next waiter
+     * can go.
+     */
+    passEnded(pass) {
+        if (pass.waiting !== undefined && this.waiters.get(pass.key) === pass.waiting) {
+            this.remove(pass.key);
+        }
+        this.wake();
+    }
+    close() {
+        this.closed = true;
+        for (const key of this.waiters.keys())
+            this.remove(key);
+        this.armTimer();
+        this.turn = undefined;
+    }
+    park(key, options, position, deferred = false) {
+        const existing = this.waiters.get(key);
+        if (!existing && this.waiters.size >= this.deps.maxWaiters)
+            return false;
+        const waiter = {
+            deferred,
+            canAdmit: options.canAdmit,
+            isCurrent: options.isCurrent,
+            ...(options.signal ? { signal: options.signal } : {}),
+            onAbort: () => {
+                if (this.waiters.get(key) !== waiter)
+                    return;
+                this.remove(key);
+                this.armTimer();
+            },
+        };
+        existing?.signal?.removeEventListener('abort', existing.onAbort);
+        if (position === 'front') {
+            const behind = [...this.waiters].filter(([waiting]) => waiting !== key);
+            this.waiters.clear();
+            this.waiters.set(key, waiter);
+            for (const [waiting, entry] of behind)
+                this.waiters.set(waiting, entry);
+        }
+        else {
+            // Setting an existing key keeps its place; `back` gives it up first.
+            if (position === 'back')
+                this.waiters.delete(key);
+            this.waiters.set(key, waiter);
+        }
+        options.signal?.addEventListener('abort', waiter.onAbort, { once: true });
+        return true;
+    }
+    remove(key) {
+        const waiter = this.waiters.get(key);
+        if (!waiter)
+            return;
+        waiter.signal?.removeEventListener('abort', waiter.onAbort);
+        this.waiters.delete(key);
+    }
+    /**
+     * Nudge the longest waiter the node's sync admission can take, unless a
+     * nudged pass is still out. Waiters are read in arrival order and one that
+     * cannot be admitted yet is passed over, so a graph with capacity of its own
+     * is not held behind one without.
+     */
+    wake() {
+        if (this.closed)
+            return;
+        const now = Date.now();
+        const turnIsOut = this.turn !== undefined && now - this.turn.startedAt < TURN_MAX_MS;
+        if (!turnIsOut && now >= this.holdUntil) {
+            // Removing the entry being visited is safe on a Map.
+            for (const [key, waiter] of this.waiters) {
+                if (waiter.signal?.aborted || !waiter.isCurrent()) {
+                    this.remove(key);
+                    continue;
+                }
+                if (!admissionAvailable(waiter))
+                    continue;
+                this.remove(key);
+                const completion = this.deps.nudge(key, waiter.deferred);
+                // Not admitted: the periodic sweep owns the graph.
+                if (!completion)
+                    continue;
+                const started = { key, startedAt: now };
+                this.turn = started;
+                const settle = () => {
+                    if (this.turn === started)
+                        this.turn = undefined;
+                    this.wake();
+                };
+                completion.then(settle, settle);
+                break;
+            }
+        }
+        this.armTimer();
+    }
+    /** One timer for the whole wait: the next delay to run out, else a capacity re-read per interval. */
+    armTimer() {
+        if (this.timer !== undefined)
+            clearTimeout(this.timer);
+        this.timer = undefined;
+        if (this.closed || this.waiters.size === 0)
+            return;
+        const now = Date.now();
+        let delay = RETRY_MS;
+        if (this.holdUntil > now) {
+            delay = this.holdUntil - now;
+        }
+        this.timer = setTimeout(() => {
+            this.timer = undefined;
+            this.wake();
+        }, delay);
+        this.timer.unref?.();
+    }
+}
+//# sourceMappingURL=vm-reconcile-local-admission-wait.js.map

package/dist/internal/vm-reconcile-local-admission-wait.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vm-reconcile-local-admission-wait.js","sourceRoot":"","sources":["../../src/internal/vm-reconcile-local-admission-wait.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,yEAAyE;AACzE,MAAM,QAAQ,GAAG,KAAK,CAAC;AACvB;;;;;GAKG;AACH,MAAM,WAAW,GAAG,MAAM,CAAC;AAkC3B,gFAAgF;AAChF,SAAS,kBAAkB,CAAC,MAAc;IACxC,IAAI,CAAC;QACH,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,MAAM,OAAO,6BAA6B;IAUX;IAT7B,oDAAoD;IACnC,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IACrD,sDAAsD;IAC9C,IAAI,CAAiD;IAC7D,oFAAoF;IAC5E,SAAS,GAAG,CAAC,CAAC;IACd,KAAK,CAA4C;IACjD,MAAM,GAAG,KAAK,CAAC;IAEvB,YAA6B,IAAuC;QAAvC,SAAI,GAAJ,IAAI,CAAmC;IAAG,CAAC;IAExE;;;OAGG;IACH,KAAK,CAAC,GAAW,EAAE,OAAkC;QACnD,IAAI,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE;YAAE,OAAO;QAC3E,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,EAAE,GAAG,KAAK,GAAG,CAAC;QAC3C,sEAAsE;QACtE,0EAA0E;QAC1E,0EAA0E;QAC1E,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;YAC3E,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ,CAAC;QACzC,CAAC;QACD,IAAI,CAAC,QAAQ,EAAE,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACH,SAAS,CAAC,GAAW,EAAE,OAAkC;QACvD,IAAI,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE;YAAE,OAAO,KAAK,CAAC;QACjF,IAAI,aAAa,GAAG,KAAK,CAAC;QAC1B,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YAC1C,IAAI,OAAO,KAAK,GAAG,EAAE,CAAC;gBAAC,aAAa,GAAG,IAAI,CAAC;gBAAC,MAAM;YAAC,CAAC;QACvD,CAAC;QACD,IAAI,CAAC,aAAa;YAAE,OAAO,KAAK,CAAC;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;QAC/C,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;OAUG;IACH,KAAK,CAAC,GAAW,EAAE,OAAkC;QACnD,IAAI,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE;YAAE,OAAO,SAAS,CAAC;QACrF,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE,GAAG,KAAK,GAAG,CAAC;QACtC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7D,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ,CAAC;QACvC,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChB,OAAO,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC;IACrC,CAAC;IAED,8EAA8E;IAC9E,WAAW,CAAC,GAAW;QACrB,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;IACjD,CAAC;IAED;;;;;OAKG;IACH,SAAS,CAAC,IAAwB;QAChC,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,OAAO,EAAE,CAAC;YAC9E,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxB,CAAC;QACD,IAAI,CAAC,IAAI,EAAE,CAAC;IACd,CAAC;IAED,KAAK;QACH,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACnB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACxD,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;IACxB,CAAC;IAEO,IAAI,CACV,GAAW,EACX,OAAkC,EAClC,QAAmC,EACnC,QAAQ,GAAG,KAAK;QAEhB,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU;YAAE,OAAO,KAAK,CAAC;QACzE,MAAM,MAAM,GAAW;YACrB,QAAQ;YACR,QAAQ,EAAE,OAAO,CAAC,QAAQ;YAC1B,SAAS,EAAE,OAAO,CAAC,SAAS;YAC5B,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACrD,OAAO,EAAE,GAAG,EAAE;gBACZ,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,MAAM;oBAAE,OAAO;gBAC7C,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACjB,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,CAAC;SACF,CAAC;QACF,QAAQ,EAAE,MAAM,EAAE,mBAAmB,CAAC,OAAO,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAC;QACjE,IAAI,QAAQ,KAAK,OAAO,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC,OAAO,KAAK,GAAG,CAAC,CAAC;YACxE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YACrB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YAC9B,KAAK,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,MAAM;gBAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC1E,CAAC;aAAM,CAAC;YACN,qEAAqE;YACrE,IAAI,QAAQ,KAAK,MAAM;gBAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAClD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAChC,CAAC;QACD,OAAO,CAAC,MAAM,EAAE,gBAAgB,CAAC,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;QAC1E,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,MAAM,CAAC,GAAW;QACxB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM;YAAE,OAAO;QACpB,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;QAC5D,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED;;;;;OAKG;IACK,IAAI;QACV,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,WAAW,CAAC;QACrF,IAAI,CAAC,SAAS,IAAI,GAAG,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACxC,qDAAqD;YACrD,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACzC,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;oBAClD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;oBACjB,SAAS;gBACX,CAAC;gBACD,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC;oBAAE,SAAS;gBAC1C,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACjB,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;gBACzD,mDAAmD;gBACnD,IAAI,CAAC,UAAU;oBAAE,SAAS;gBAC1B,MAAM,OAAO,GAAG,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC;gBACxC,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;gBACpB,MAAM,MAAM,GAAG,GAAG,EAAE;oBAClB,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;wBAAE,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;oBACjD,IAAI,CAAC,IAAI,EAAE,CAAC;gBACd,CAAC,CAAC;gBACF,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBAChC,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,CAAC,QAAQ,EAAE,CAAC;IAClB,CAAC;IAED,qGAAqG;IAC7F,QAAQ;QACd,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAAE,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO;QACnD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,IAAI,KAAK,GAAG,QAAQ,CAAC;QACrB,IAAI,IAAI,CAAC,SAAS,GAAG,GAAG,EAAE,CAAC;YACzB,KAAK,GAAG,IAAI,CAAC,SAAS,GAAG,GAAG,CAAC;QAC/B,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE;YAC3B,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;YACvB,IAAI,CAAC,IAAI,EAAE,CAAC;QACd,CAAC,EAAE,KAAK,CAAC,CAAC;QACV,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;IACvB,CAAC;CACF"}

package/dist/internal/vm-reconcile-read-authority.d.ts

@@ -0,0 +1,27 @@
+/**
+ * What a VM reconcile pass makes of a read-authority check that was not
+ * allowed.
+ *
+ * A denial closes the pass, and so does an authority source that answered
+ * "unknown". A chain read that was never answered is different: the node's own
+ * RPC budget did not admit it, or the endpoint did not reply in time. That
+ * says nothing about the graph, and the same question may be answered a
+ * moment later, so the pass is told apart and its graph can be asked again
+ * without waiting for the periodic sweep.
+ */
+import type { ContextGraphReadAuthorityDecision, UnavailableContextGraphReadAuthorityDecision } from '../context-graph-read-authority.js';
+import { ContextGraphNotFoundError } from '../dkg-agent-types.js';
+/** Whether the decision is "no answer from the chain" rather than a refusal. */
+export declare function isUnansweredVmReconcileReadAuthority(decision: ContextGraphReadAuthorityDecision | undefined): decision is UnavailableContextGraphReadAuthorityDecision;
+/**
+ * The pass could not confirm read authority because the chain read behind the
+ * check got no answer. To a caller it is the refusal it always was, a
+ * {@link ContextGraphNotFoundError} with the same message; reconcile
+ * scheduling tells it apart by class.
+ */
+export declare class VmReconcileReadAuthorityUnansweredError extends ContextGraphNotFoundError {
+    /** `source/reason/dependency` of the unanswered decision, for the node's log. */
+    readonly readAuthority: string;
+    constructor(contextGraphId: string, decision: Pick<UnavailableContextGraphReadAuthorityDecision, 'source' | 'reason' | 'dependency'>);
+}
+//# sourceMappingURL=vm-reconcile-read-authority.d.ts.map