@jinn-network/client 0.1.7 → 0.1.8-canary.09a3b2f6

package/dist/discovery/types.d.ts

@@ -32,6 +32,22 @@ export interface ClaimableTaskCandidate {
     attemptCount: number;
     operatorAttemptCount: number;
 }
+/**
+ * Per-on-chain-task claim-budget snapshot for a launched SolverNet. Returned by
+ * `getInstanceClaimCounts`, keyed by **on-chain taskId** (decimal string) — NOT
+ * by instance_id, because the on-chain `task`/`attempt` tables carry no
+ * instance_id (only IPFS enrichment does). The generator owns the
+ * taskId → instance_id join via its local `generator-state.json` ledger
+ * (`last_task_id`), so it looks up its known posted taskIds in this map.
+ */
+export interface InstanceClaimCount {
+    /** On-chain taskId (decimal string), matching `task.id` in the indexer. */
+    taskId: string;
+    /** Number of attempt rows recorded for this task = consumed claim slots. */
+    consumed: number;
+    /** maxClaims from the task's TaskCreated event = the one-way claim budget. */
+    maxClaims: number;
+}
 /**
  * Base shape for a builder-published artifact. Discriminated on `artifactType`
  * so future kinds (`harness`) add without breaking consumers.
@@ -114,6 +130,77 @@ export interface BuilderAttributedRun {
  * temporarily unavailable. The `withFallback` wrapper catches these and routes
  * to the floor implementation for the duration of the outage.
  */
+/**
+ * Per-codeDigest network-truth reward aggregate (issue #764). One row per
+ * distinct executor.codeDigest, joining attemptEnvelopeMeta (codeDigest, mode)
+ * to verdictEnvelopeMeta (actualPassed, actualScore) on (requestId, chainId).
+ * `actualPassed` is the source of truth (NOT the on-chain verdictCode, which
+ * defaults to Pass — see verdictEnvelopeMeta JSDoc).
+ */
+/**
+ * Windowed on-chain task-post counts for one scope (chain-wide or a single
+ * SolverNet). Each window is a count of `TaskCreated` events whose block falls
+ * within the last 1h / 6h / 24h, computed backend-side as a block-window
+ * approximation (Base ~2s blocktime: 1h≈1800, 6h≈10800, 24h≈43200 blocks back
+ * from head). The windows nest: `h1 ⊆ h6 ⊆ h24`. Counts are approximate —
+ * blocktime drift and the per-call scan cap mean the 24h figure is a lower
+ * bound on a very high-volume SolverNet. See `DiscoveryAPI.getTaskPostCounts`.
+ */
+export interface TaskPostCounts {
+    /** TaskCreated events in the last ~1h. */
+    h1: number;
+    /** TaskCreated events in the last ~6h (includes h1). */
+    h6: number;
+    /** TaskCreated events in the last ~24h (includes h6). */
+    h24: number;
+    /** Block at the head of the window (Number(getBlockNumber()) on-chain; the latest indexed task block on HTTP). */
+    windowEndBlock: number;
+    /** Unix seconds the window was computed. */
+    windowEndTs: number;
+}
+/**
+ * Block-window thresholds for `getTaskPostCounts`, from Base's ~2s blocktime:
+ * 1h≈1800, 6h≈10800, 24h≈43200 blocks back from the window head. Shared by the
+ * HTTP and on-chain backings so they bucket identically. The windows nest
+ * (h1 ⊆ h6 ⊆ h24); the 24h figure also bounds the on-chain scan range.
+ */
+export declare const TASK_POST_WINDOW_BLOCKS: {
+    readonly h1: 1800;
+    readonly h6: 10800;
+    readonly h24: 43200;
+};
+/**
+ * Bucket a stream of TaskCreated events into chain-wide + per-cid
+ * `TaskPostCounts`, shared by both DiscoveryAPI backings. `events` carry a
+ * `block` (number) and lowercased manifest `digest`; `cidByDigest` maps each
+ * requested digest to its cid. Counts nest (h1 ⊆ h6 ⊆ h24); events older than
+ * the 24h cut are ignored.
+ */
+export declare function bucketTaskPostCounts(windowEndBlock: number, windowEndTs: number, events: Array<{
+    block: number;
+    digest: string;
+}>, cidByDigest: Map<string, string>): {
+    chain: TaskPostCounts;
+    byCid: Record<string, TaskPostCounts>;
+};
+export interface CodeDigestRewardRow {
+    /** The executor.codeDigest, e.g. "sha256:<hex>". */
+    codeDigest: string;
+    /** Count of distinct (requestId, chainId) attempts with a verdict, mode='train'. */
+    attempts: number;
+    /** Count where verdictEnvelopeMeta.actualPassed === true. */
+    passes: number;
+    /** passes / attempts; 0 when attempts === 0. */
+    passRate: number;
+    /** Mean of numeric actualScore over verdicts that carried one; 0 when none. */
+    avgScore: number;
+    /**
+     * Per-attempt graded score (passedCount/totalCount) for in-window verdicts
+     * that carried v2 counts (totalCount > 0). Empty / short when verdicts predate
+     * verdict.v2. Consumed by the learner's Mann-Whitney sensitivity tier (#1019).
+     */
+    gradedScores: number[];
+}
 export interface DiscoveryAPI {
     /**
      * Returns claimable task candidates for a set of SolverNet manifests,
@@ -221,6 +308,154 @@ export interface DiscoveryAPI {
         builderAgentId: string;
         limit?: number;
     }): Promise<PublishedArtifact[]>;
+    /**
+     * Returns network-truth pass counts per swe-rebench-v2 instance_id for a
+     * given SolverNet manifest. Keyed by `instance_id`; the value is the count
+     * of distinct (requestId, chainId) verdictEnvelopeMeta rows where
+     * `solverNetManifestCid` equals `args.manifestCid`, `actualPassed = true`,
+     * `solverType` starts with `swe-rebench-v2`, and `instanceId` is non-empty.
+     *
+     * Per-SolverNet scoping (#669 Finding 2): the indexer enrichment pass reads
+     * the task body's top-level `solverNetManifestCid` (task.v1 schema; see
+     * `client/src/types/task-document.ts`) on the same IPFS round-trip that
+     * resolves `instance_id`, and writes it to `verdictEnvelopeMeta`. The
+     * GraphQL filter pins to that column, so multi-SolverNet operators with
+     * overlapping instance_id pools do NOT cross-tenant over-count — successes
+     * on SolverNet-B can no longer prematurely saturate SolverNet-A's launcher.
+     *
+     * Backed by `verdictEnvelopeMeta` in the indexer. Throws
+     * `DiscoveryUnavailableError` when the backing is unreachable — callers
+     * MUST NOT silently fall through to local-only counts (#669 acceptance
+     * criterion: behave as if the on-chain count is the truth). The
+     * `withFallback` wrapper enforces this by never routing
+     * `getInstanceSuccessCounts` to the floor.
+     *
+     * The on-chain floor implementation (`OnchainDiscoveryAPI`) returns an
+     * empty Map, since the underlying data comes from IPFS enrichment that the
+     * floor cannot reconstruct. The floor's empty Map is therefore not the
+     * runtime path — `withFallback` propagates the error instead.
+     */
+    getInstanceSuccessCounts(args: {
+        manifestCid: string;
+    }): Promise<Map<string, number>>;
+    /**
+     * Returns per-codeDigest reward aggregates (#764) for the given codeDigests,
+     * scoped to mode='train'. Joins attemptEnvelopeMeta (codeDigest) to
+     * verdictEnvelopeMeta (actualPassed, actualScore) on (requestId, chainId).
+     * When `operator` is provided, further restricts to attempts the operator
+     * claimed (via the `attempt` table, joined on requestId). When
+     * `solverNetManifestCid` is provided, scopes the aggregate to a single
+     * SolverNet via `verdictEnvelopeMeta.solverNetManifestCid` (the only table in
+     * this join carrying the column) — attempts whose verdicts belong to other
+     * SolverNets are excluded. Omitted → unscoped across all SolverNets (#764).
+     *
+     * Like getInstanceSuccessCounts (#669), this throws DiscoveryUnavailableError
+     * on a degraded backing and MUST NOT silently fall through to the on-chain
+     * floor (substrate-incident policy) — the floor returns an empty array and
+     * withFallback never routes this method to it. A codeDigest with zero indexed
+     * attempts is simply absent from the result (callers treat absence as
+     * "insufficient samples", not pass-rate zero).
+     *
+     * Rides PR #783's attemptEnvelopeMeta.codeDigest index.
+     *
+     * `window` (#764 C1) caps each codeDigest's aggregate to its most-recent
+     * `window` attempts (by enrichedAtBlock desc). Because Ponder's GraphQL
+     * `limit` is global across all requested codeDigests, the cap is applied
+     * client-side per-digest, not as a query limit. Omitted → no cap (aggregate
+     * over the full paginated history, byte-identical to the prior behaviour).
+     */
+    getCodeDigestRewards(args: {
+        codeDigests: string[];
+        operator?: `0x${string}`;
+        solverNetManifestCid?: string;
+        window?: number;
+    }): Promise<CodeDigestRewardRow[]>;
+    /**
+     * Returns the per-task claim-budget snapshot for every task posted on the
+     * SolverNet identified by `manifestCid`. Keyed by on-chain taskId; each value
+     * carries `consumed` (count of `attempt` rows) and `maxClaims` (the one-way
+     * claim budget from TaskCreated). A task is *exhausted* when
+     * `consumed >= maxClaims`.
+     *
+     * Modelled one-for-one on `getInstanceSuccessCounts`: backed by the indexer's
+     * `task` + `attempt` tables. Throws `DiscoveryUnavailableError` when the
+     * backing is unreachable — on a genuine error the caller MUST abort the tick,
+     * not treat the absence of data as truth. The `withFallback` wrapper enforces
+     * this by never routing `getInstanceClaimCounts` to the floor: a *successful*
+     * empty Map from the floor is indistinguishable from "every task has 0
+     * consumed slots", so on a real outage it would silently mask exhaustion —
+     * exhausted postings would classify `live`, their reposts would be suppressed,
+     * and the SolverNet would under-serve N (#802, mirroring #669).
+     *
+     * Note the generator's own classifier treats a *missing entry for a known
+     * taskId* as `live` (assume not-yet-indexed; the indexer never deletes task
+     * rows, so a finalized/refunded/exhausted task is still present), which is why
+     * the floor must propagate the error rather than return an empty success: a
+     * whole-map empty-success would make every posting inert, not storm.
+     *
+     * The on-chain floor implementation returns an empty Map (the runtime path is
+     * never the floor for this method — `withFallback` propagates the error
+     * instead). The claim data IS reconstructible on-chain, but the floor stays a
+     * no-op to keep the abort-on-outage guarantee symmetric with
+     * `getInstanceSuccessCounts`.
+     */
+    getInstanceClaimCounts(args: {
+        manifestCid: string;
+    }): Promise<Map<string, InstanceClaimCount>>;
+    /**
+     * Returns windowed on-chain task-post counts (last 1h / 6h / 24h) sourced
+     * from `TaskCreated` events on the active chain's JinnRouter / TaskCoordinator.
+     * Always returns the `chain`-wide totals; when `manifestCids` is supplied, also
+     * returns per-SolverNet totals in `byCid` (keyed by manifest CID), joined via
+     * `manifestDigestForCid(cid)` against each event's `manifestDigest`.
+     *
+     * Windowing is a block-window approximation computed backend-side (Base ~2s
+     * blocktime — see `TaskPostCounts`); counts are approximate. Each backing caps
+     * its scan, so on a very high-volume chain the figures are a lower bound.
+     *
+     * This is a *supply signal*, not a correctness gate, so it is NOT
+     * abort-on-outage: like `getSolverNetOperatorCount`, the `withFallback` wrapper
+     * routes it to the on-chain floor when the indexer is unavailable rather than
+     * propagating `DiscoveryUnavailableError`. The on-chain floor reconstructs the
+     * counts directly from `TaskCreated` logs.
+     */
+    getTaskPostCounts(args?: {
+        manifestCids?: string[];
+    }): Promise<{
+        windowEndBlock: number;
+        windowEndTs: number;
+        /** Chain-wide totals (always present). */
+        chain: TaskPostCounts;
+        /** Per-SolverNet totals keyed by manifest CID; empty `{}` when no manifestCids given. */
+        byCid: Record<string, TaskPostCounts>;
+    }>;
+    /**
+     * Returns the most-recently-created task on the SolverNet identified by
+     * `manifestCid` — its on-chain `taskCidDigest` and decimal `taskId` — or
+     * `undefined` when no task has ever been posted for the SolverNet.
+     *
+     * The join key is the same `manifestDigest === keccak256(manifestCid)` used by
+     * `findClaimableTasks` / `getInstanceClaimCounts` (computed via
+     * `manifestDigestForCid`). "Most recent" is by creation order: the HTTP
+     * backing orders the `task` table by `createdAtBlock` desc, limit 1; the
+     * on-chain floor takes the highest-block `TaskCreated` log for the digest.
+     *
+     * This is a PURE indexer/chain read — it returns only the on-chain digest, NOT
+     * any IPFS body. The caller reconstructs the IPFS task CID
+     * (`f01551220 + digestHexWithout0x`, see `adapters/mech/adapter.ts`) and fetches
+     * the body itself. It is the read primitive behind the swe-rebench-v2 fresh-
+     * volume pool recovery (#957): an operator with an empty disk reads a recent
+     * task's eligibility `vettedPoolRef` to re-fetch the published vetted pool.
+     *
+     * This is a *recovery signal*, not a correctness gate, so it is NOT
+     * abort-on-outage: like `getSolverNetOperatorCount` / `getTaskPostCounts`, the
+     * `withFallback` wrapper routes it to the on-chain floor when the indexer is
+     * unavailable rather than propagating `DiscoveryUnavailableError`.
+     */
+    getMostRecentTaskCidDigest(manifestCid: string): Promise<{
+        taskCidDigest: `0x${string}`;
+        taskId: string;
+    } | undefined>;
 }
 /**
  * Thrown by a DiscoveryAPI implementation when it is temporarily unable to

package/dist/discovery/types.js

@@ -9,6 +9,46 @@
  *
  * Spec: spec/2026-05-11-discovery-api-and-shared-indexer.md §5.
  */
+/**
+ * Block-window thresholds for `getTaskPostCounts`, from Base's ~2s blocktime:
+ * 1h≈1800, 6h≈10800, 24h≈43200 blocks back from the window head. Shared by the
+ * HTTP and on-chain backings so they bucket identically. The windows nest
+ * (h1 ⊆ h6 ⊆ h24); the 24h figure also bounds the on-chain scan range.
+ */
+export const TASK_POST_WINDOW_BLOCKS = { h1: 1_800, h6: 10_800, h24: 43_200 };
+/**
+ * Bucket a stream of TaskCreated events into chain-wide + per-cid
+ * `TaskPostCounts`, shared by both DiscoveryAPI backings. `events` carry a
+ * `block` (number) and lowercased manifest `digest`; `cidByDigest` maps each
+ * requested digest to its cid. Counts nest (h1 ⊆ h6 ⊆ h24); events older than
+ * the 24h cut are ignored.
+ */
+export function bucketTaskPostCounts(windowEndBlock, windowEndTs, events, cidByDigest) {
+    const h1Cut = windowEndBlock - TASK_POST_WINDOW_BLOCKS.h1;
+    const h6Cut = windowEndBlock - TASK_POST_WINDOW_BLOCKS.h6;
+    const h24Cut = windowEndBlock - TASK_POST_WINDOW_BLOCKS.h24;
+    const blank = () => ({ h1: 0, h6: 0, h24: 0, windowEndBlock, windowEndTs });
+    const chain = blank();
+    const byCid = {};
+    for (const cid of cidByDigest.values())
+        byCid[cid] = blank();
+    const bucket = (target, block) => {
+        if (block < h24Cut)
+            return;
+        target.h24 += 1;
+        if (block >= h6Cut)
+            target.h6 += 1;
+        if (block >= h1Cut)
+            target.h1 += 1;
+    };
+    for (const e of events) {
+        bucket(chain, e.block);
+        const cid = cidByDigest.get(e.digest);
+        if (cid)
+            bucket(byCid[cid], e.block);
+    }
+    return { chain, byCid };
+}
 export class DiscoveryUnavailableError extends Error {
     cause;
     /**

package/dist/discovery/types.js.map

@@ -1 +1 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/discovery/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAkRH,MAAM,OAAO,yBAA0B,SAAQ,KAAK;IAChC,KAAK,CAAW;IAClC;;;;OAIG;IACM,IAAI,CAA4B;IAEzC,YAAY,OAAe,EAAE,KAAe,EAAE,IAA+B;QAC3E,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,2BAA2B,CAAC;QACxC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;CACF"}
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/discovery/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AA0LH;;;;;GAKG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAW,CAAC;AAEvF;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB,CAClC,cAAsB,EACtB,WAAmB,EACnB,MAAgD,EAChD,WAAgC;IAEhC,MAAM,KAAK,GAAG,cAAc,GAAG,uBAAuB,CAAC,EAAE,CAAC;IAC1D,MAAM,KAAK,GAAG,cAAc,GAAG,uBAAuB,CAAC,EAAE,CAAC;IAC1D,MAAM,MAAM,GAAG,cAAc,GAAG,uBAAuB,CAAC,GAAG,CAAC;IAE5D,MAAM,KAAK,GAAG,GAAmB,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,cAAc,EAAE,WAAW,EAAE,CAAC,CAAC;IAC5F,MAAM,KAAK,GAAG,KAAK,EAAE,CAAC;IACtB,MAAM,KAAK,GAAmC,EAAE,CAAC;IACjD,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,MAAM,EAAE;QAAE,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC;IAE7D,MAAM,MAAM,GAAG,CAAC,MAAsB,EAAE,KAAa,EAAQ,EAAE;QAC7D,IAAI,KAAK,GAAG,MAAM;YAAE,OAAO;QAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC;QAChB,IAAI,KAAK,IAAI,KAAK;YAAE,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC;QACnC,IAAI,KAAK,IAAI,KAAK;YAAE,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC;IAEF,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QACvB,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,GAAG;YAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AAC1B,CAAC;AAmTD,MAAM,OAAO,yBAA0B,SAAQ,KAAK;IAChC,KAAK,CAAW;IAClC;;;;OAIG;IACM,IAAI,CAA4B;IAEzC,YAAY,OAAe,EAAE,KAAe,EAAE,IAA+B;QAC3E,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,2BAA2B,CAAC;QACxC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;CACF"}

package/dist/discovery/with-fallback.js

@@ -167,6 +167,47 @@ export function withFallback(primary, floor, opts = {}) {
         listBuilderArtifacts(args) {
             return dispatch(() => primary.listBuilderArtifacts(args), () => floor.listBuilderArtifacts(args));
         },
+        getInstanceSuccessCounts(args) {
+            // Never fall through to the floor for this method — an empty Map from
+            // the floor is indistinguishable from "all instances have 0 successes",
+            // which is the under-count bug this method was introduced to fix (#669).
+            // If the primary is degraded, propagate the error so the launcher aborts
+            // its tick rather than silently posting against local-only counters.
+            // The DiscoveryAPI.getInstanceSuccessCounts JSDoc encodes this contract
+            // ("callers MUST NOT silently fall through to local-only counts").
+            return primary.getInstanceSuccessCounts(args);
+        },
+        getCodeDigestRewards(args) {
+            // Never fall through to the floor — an empty array from the floor is
+            // indistinguishable from "no successes", the exact failure mode #764's
+            // revert logic must avoid. Propagate the error so the Consolidator skips
+            // reverts on degraded data (substrate-incident policy; mirrors #669).
+            return primary.getCodeDigestRewards(args);
+        },
+        getInstanceClaimCounts(args) {
+            // Never fall through to the floor for this method — a *successful* empty
+            // Map from the floor is indistinguishable from "every task has 0 consumed
+            // slots", so on a real outage it would mask exhaustion: exhausted
+            // postings would classify `live`, their reposts would be suppressed, and
+            // the SolverNet would under-serve N (#802, mirroring the #669 contract on
+            // getInstanceSuccessCounts). Propagate the error so the launcher aborts
+            // its tick rather than treating absent data as truth.
+            return primary.getInstanceClaimCounts(args);
+        },
+        getTaskPostCounts(args) {
+            // Supply signal (not a correctness gate): fall through to the floor on an
+            // indexer outage like getSolverNetOperatorCount. The on-chain floor
+            // reconstructs the windowed counts directly from TaskCreated logs, so a
+            // floor result is meaningful (unlike the abort-on-outage methods above).
+            return dispatch(() => primary.getTaskPostCounts(args), () => floor.getTaskPostCounts(args));
+        },
+        getMostRecentTaskCidDigest(manifestCid) {
+            // Recovery signal (not a correctness gate): fall through to the floor on
+            // an indexer outage like getTaskPostCounts. The on-chain floor reads the
+            // newest TaskCreated log for the manifest directly, so a floor result is
+            // meaningful (#957).
+            return dispatch(() => primary.getMostRecentTaskCidDigest(manifestCid), () => floor.getMostRecentTaskCidDigest(manifestCid));
+        },
     };
 }
 //# sourceMappingURL=with-fallback.js.map

package/dist/discovery/with-fallback.js.map

@@ -1 +1 @@
-{"version":3,"file":"with-fallback.js","sourceRoot":"","sources":["../../src/discovery/with-fallback.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAGH,OAAO,EAAE,yBAAyB,EAAE,MAAM,YAAY,CAAC;AAEvD,gFAAgF;AAEhF;;;;;GAKG;AACH,SAAS,cAAc,CAAC,KAAc;IACpC,IAAI,KAAK,YAAY,yBAAyB;QAAE,OAAO,IAAI,CAAC;IAC5D,IAAI,CAAC,CAAC,KAAK,YAAY,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAE5C,8EAA8E;IAC9E,qFAAqF;IACrF,MAAM,IAAI,GAAI,KAA2B,CAAC,IAAI,CAAC;IAC/C,IAAI,IAAI,KAAK,cAAc,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,eAAe,EAAE,CAAC;QAC9E,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;IAExC,IACE,GAAG,CAAC,QAAQ,CAAC,cAAc,CAAC;QAC5B,GAAG,CAAC,QAAQ,CAAC,eAAe,CAAC;QAC7B,GAAG,CAAC,QAAQ,CAAC,YAAY,CAAC;QAC1B,GAAG,CAAC,QAAQ,CAAC,WAAW,CAAC;QACzB,GAAG,CAAC,QAAQ,CAAC,gBAAgB,CAAC;QAC9B,GAAG,CAAC,QAAQ,CAAC,oBAAoB,CAAC;QAClC,GAAG,CAAC,QAAQ,CAAC,iBAAiB,CAAC;QAC/B,GAAG,CAAC,QAAQ,CAAC,mBAAmB,CAAC;QACjC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,EACvB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IACE,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC;QACnB,GAAG,CAAC,QAAQ,CAAC,YAAY,CAAC;QAC1B,GAAG,CAAC,QAAQ,CAAC,mBAAmB,CAAC;QACjC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC;QACnB,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC;QACnB,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC;QAC3B,GAAG,CAAC,QAAQ,CAAC,qBAAqB,CAAC,EACnC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IACE,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC;QACtB,GAAG,CAAC,QAAQ,CAAC,yBAAyB,CAAC;QACvC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,EACtB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAmBD,gFAAgF;AAEhF;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAC1B,OAAqB,EACrB,KAAmB,EACnB,OAA4B,EAAE;IAE9B,MAAM,kBAAkB,GAAG,IAAI,CAAC,kBAAkB,IAAI,CAAC,CAAC;IACxD,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,IAAI,MAAM,CAAC;IAEjD,IAAI,mBAAmB,GAAG,CAAC,CAAC;IAC5B,IAAI,aAAa,GAAkB,IAAI,CAAC;IACxC,2EAA2E;IAC3E,+EAA+E;IAC/E,4EAA4E;IAC5E,0EAA0E;IAC1E,wEAAwE;IACxE,6EAA6E;IAC7E,qDAAqD;IACrD,IAAI,eAAe,GAAG,KAAK,CAAC;IAE5B,SAAS,gBAAgB;QACvB,IAAI,aAAa,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QACxC,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,aAAa,IAAI,YAAY,EAAE,CAAC;YAC/C,gEAAgE;YAChE,aAAa,GAAG,IAAI,CAAC;YACrB,mBAAmB,GAAG,CAAC,CAAC;YACxB,eAAe,GAAG,IAAI,CAAC;YACvB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,SAAS,oBAAoB;QAC3B,mBAAmB,IAAI,CAAC,CAAC;QACzB,MAAM,QAAQ,GAAG,eAAe,CAAC;QACjC,eAAe,GAAG,KAAK,CAAC;QACxB,IAAI,aAAa,KAAK,IAAI;YAAE,OAAO;QACnC,2EAA2E;QAC3E,0EAA0E;QAC1E,0CAA0C;QAC1C,IAAI,QAAQ,IAAI,mBAAmB,IAAI,kBAAkB,EAAE,CAAC;YAC1D,aAAa,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC3B,OAAO,CAAC,IAAI,CACV,2DAA2D,mBAAmB,yBAAyB;gBACvG,GAAG,QAAQ,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,yCAAyC,YAAY,KAAK,CAC/F,CAAC;QACJ,CAAC;IACH,CAAC;IAED,SAAS,oBAAoB;QAC3B,mBAAmB,GAAG,CAAC,CAAC;QACxB,aAAa,GAAG,IAAI,CAAC;QACrB,eAAe,GAAG,KAAK,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,KAAK,UAAU,QAAQ,CACrB,SAA2B,EAC3B,OAAyB;QAEzB,IAAI,gBAAgB,EAAE,EAAE,CAAC;YACvB,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;gBACjC,oBAAoB,EAAE,CAAC;gBACvB,OAAO,MAAM,CAAC;YAChB,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,IAAI,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC;oBACxB,oBAAoB,EAAE,CAAC;oBACvB,OAAO,OAAO,EAAE,CAAC;gBACnB,CAAC;gBACD,MAAM,GAAG,CAAC;YACZ,CAAC;QACH,CAAC;QACD,OAAO,OAAO,EAAE,CAAC;IACnB,CAAC;IAED,OAAO;QACL,kBAAkB,CAAC,IAAI;YACrB,OAAO,QAAQ,CACb,GAAG,EAAE,CAAC,OAAO,CAAC,kBAAkB,CAAC,IAAI,CAAC,EACtC,GAAG,EAAE,CAAC,KAAK,CAAC,kBAAkB,CAAC,IAAI,CAAC,CACrC,CAAC;QACJ,CAAC;QAED,sBAAsB,CAAC,IAAI;YACzB,OAAO,QAAQ,CACb,GAAG,EAAE,CAAC,OAAO,CAAC,sBAAsB,CAAC,IAAI,CAAC,EAC1C,GAAG,EAAE,CAAC,KAAK,CAAC,sBAAsB,CAAC,IAAI,CAAC,CACzC,CAAC;QACJ,CAAC;QAED,kBAAkB,CAAC,WAAW;YAC5B,OAAO,QAAQ,CACb,GAAG,EAAE,CAAC,OAAO,CAAC,kBAAkB,CAAC,WAAW,CAAC,EAC7C,GAAG,EAAE,CAAC,KAAK,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAC5C,CAAC;QACJ,CAAC;QAED,yBAAyB,CAAC,WAAW;YACnC,OAAO,QAAQ,CACb,GAAG,EAAE,CAAC,OAAO,CAAC,yBAAyB,CAAC,WAAW,CAAC,EACpD,GAAG,EAAE,CAAC,KAAK,CAAC,yBAAyB,CAAC,WAAW,CAAC,CACnD,CAAC;QACJ,CAAC;QAED,cAAc,CAAC,KAAK;YAClB,OAAO,QAAQ,CACb,GAAG,EAAE,CAAC,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,EACnC,GAAG,EAAE,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,CAClC,CAAC;QACJ,CAAC;QAED,sBAAsB,CAAC,IAAI;YACzB,OAAO,QAAQ,CACb,GAAG,EAAE,CAAC,OAAO,CAAC,sBAAsB,CAAC,IAAI,CAAC,EAC1C,GAAG,EAAE,CAAC,KAAK,CAAC,sBAAsB,CAAC,IAAI,CAAC,CACzC,CAAC;QACJ,CAAC;QAED,eAAe,CAAC,IAAI;YAClB,OAAO,QAAQ,CACb,GAAG,EAAE,CAAC,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,EACnC,GAAG,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,CAClC,CAAC;QACJ,CAAC;QAED,oBAAoB,CAAC,IAAI;YACvB,OAAO,QAAQ,CACb,GAAG,EAAE,CAAC,OAAO,CAAC,oBAAoB,CAAC,IAAI,CAAC,EACxC,GAAG,EAAE,CAAC,KAAK,CAAC,oBAAoB,CAAC,IAAI,CAAC,CACvC,CAAC;QACJ,CAAC;KACF,CAAC;AACJ,CAAC"}
+{"version":3,"file":"with-fallback.js","sourceRoot":"","sources":["../../src/discovery/with-fallback.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAGH,OAAO,EAAE,yBAAyB,EAAE,MAAM,YAAY,CAAC;AAEvD,gFAAgF;AAEhF;;;;;GAKG;AACH,SAAS,cAAc,CAAC,KAAc;IACpC,IAAI,KAAK,YAAY,yBAAyB;QAAE,OAAO,IAAI,CAAC;IAC5D,IAAI,CAAC,CAAC,KAAK,YAAY,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAE5C,8EAA8E;IAC9E,qFAAqF;IACrF,MAAM,IAAI,GAAI,KAA2B,CAAC,IAAI,CAAC;IAC/C,IAAI,IAAI,KAAK,cAAc,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,eAAe,EAAE,CAAC;QAC9E,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;IAExC,IACE,GAAG,CAAC,QAAQ,CAAC,cAAc,CAAC;QAC5B,GAAG,CAAC,QAAQ,CAAC,eAAe,CAAC;QAC7B,GAAG,CAAC,QAAQ,CAAC,YAAY,CAAC;QAC1B,GAAG,CAAC,QAAQ,CAAC,WAAW,CAAC;QACzB,GAAG,CAAC,QAAQ,CAAC,gBAAgB,CAAC;QAC9B,GAAG,CAAC,QAAQ,CAAC,oBAAoB,CAAC;QAClC,GAAG,CAAC,QAAQ,CAAC,iBAAiB,CAAC;QAC/B,GAAG,CAAC,QAAQ,CAAC,mBAAmB,CAAC;QACjC,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,EACvB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IACE,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC;QACnB,GAAG,CAAC,QAAQ,CAAC,YAAY,CAAC;QAC1B,GAAG,CAAC,QAAQ,CAAC,mBAAmB,CAAC;QACjC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC;QACnB,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC;QACnB,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC;QAC3B,GAAG,CAAC,QAAQ,CAAC,qBAAqB,CAAC,EACnC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IACE,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC;QACtB,GAAG,CAAC,QAAQ,CAAC,yBAAyB,CAAC;QACvC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,EACtB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAmBD,gFAAgF;AAEhF;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAC1B,OAAqB,EACrB,KAAmB,EACnB,OAA4B,EAAE;IAE9B,MAAM,kBAAkB,GAAG,IAAI,CAAC,kBAAkB,IAAI,CAAC,CAAC;IACxD,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,IAAI,MAAM,CAAC;IAEjD,IAAI,mBAAmB,GAAG,CAAC,CAAC;IAC5B,IAAI,aAAa,GAAkB,IAAI,CAAC;IACxC,2EAA2E;IAC3E,+EAA+E;IAC/E,4EAA4E;IAC5E,0EAA0E;IAC1E,wEAAwE;IACxE,6EAA6E;IAC7E,qDAAqD;IACrD,IAAI,eAAe,GAAG,KAAK,CAAC;IAE5B,SAAS,gBAAgB;QACvB,IAAI,aAAa,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QACxC,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,aAAa,IAAI,YAAY,EAAE,CAAC;YAC/C,gEAAgE;YAChE,aAAa,GAAG,IAAI,CAAC;YACrB,mBAAmB,GAAG,CAAC,CAAC;YACxB,eAAe,GAAG,IAAI,CAAC;YACvB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,SAAS,oBAAoB;QAC3B,mBAAmB,IAAI,CAAC,CAAC;QACzB,MAAM,QAAQ,GAAG,eAAe,CAAC;QACjC,eAAe,GAAG,KAAK,CAAC;QACxB,IAAI,aAAa,KAAK,IAAI;YAAE,OAAO;QACnC,2EAA2E;QAC3E,0EAA0E;QAC1E,0CAA0C;QAC1C,IAAI,QAAQ,IAAI,mBAAmB,IAAI,kBAAkB,EAAE,CAAC;YAC1D,aAAa,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC3B,OAAO,CAAC,IAAI,CACV,2DAA2D,mBAAmB,yBAAyB;gBACvG,GAAG,QAAQ,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,yCAAyC,YAAY,KAAK,CAC/F,CAAC;QACJ,CAAC;IACH,CAAC;IAED,SAAS,oBAAoB;QAC3B,mBAAmB,GAAG,CAAC,CAAC;QACxB,aAAa,GAAG,IAAI,CAAC;QACrB,eAAe,GAAG,KAAK,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,KAAK,UAAU,QAAQ,CACrB,SAA2B,EAC3B,OAAyB;QAEzB,IAAI,gBAAgB,EAAE,EAAE,CAAC;YACvB,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;gBACjC,oBAAoB,EAAE,CAAC;gBACvB,OAAO,MAAM,CAAC;YAChB,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,IAAI,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC;oBACxB,oBAAoB,EAAE,CAAC;oBACvB,OAAO,OAAO,EAAE,CAAC;gBACnB,CAAC;gBACD,MAAM,GAAG,CAAC;YACZ,CAAC;QACH,CAAC;QACD,OAAO,OAAO,EAAE,CAAC;IACnB,CAAC;IAED,OAAO;QACL,kBAAkB,CAAC,IAAI;YACrB,OAAO,QAAQ,CACb,GAAG,EAAE,CAAC,OAAO,CAAC,kBAAkB,CAAC,IAAI,CAAC,EACtC,GAAG,EAAE,CAAC,KAAK,CAAC,kBAAkB,CAAC,IAAI,CAAC,CACrC,CAAC;QACJ,CAAC;QAED,sBAAsB,CAAC,IAAI;YACzB,OAAO,QAAQ,CACb,GAAG,EAAE,CAAC,OAAO,CAAC,sBAAsB,CAAC,IAAI,CAAC,EAC1C,GAAG,EAAE,CAAC,KAAK,CAAC,sBAAsB,CAAC,IAAI,CAAC,CACzC,CAAC;QACJ,CAAC;QAED,kBAAkB,CAAC,WAAW;YAC5B,OAAO,QAAQ,CACb,GAAG,EAAE,CAAC,OAAO,CAAC,kBAAkB,CAAC,WAAW,CAAC,EAC7C,GAAG,EAAE,CAAC,KAAK,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAC5C,CAAC;QACJ,CAAC;QAED,yBAAyB,CAAC,WAAW;YACnC,OAAO,QAAQ,CACb,GAAG,EAAE,CAAC,OAAO,CAAC,yBAAyB,CAAC,WAAW,CAAC,EACpD,GAAG,EAAE,CAAC,KAAK,CAAC,yBAAyB,CAAC,WAAW,CAAC,CACnD,CAAC;QACJ,CAAC;QAED,cAAc,CAAC,KAAK;YAClB,OAAO,QAAQ,CACb,GAAG,EAAE,CAAC,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,EACnC,GAAG,EAAE,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,CAClC,CAAC;QACJ,CAAC;QAED,sBAAsB,CAAC,IAAI;YACzB,OAAO,QAAQ,CACb,GAAG,EAAE,CAAC,OAAO,CAAC,sBAAsB,CAAC,IAAI,CAAC,EAC1C,GAAG,EAAE,CAAC,KAAK,CAAC,sBAAsB,CAAC,IAAI,CAAC,CACzC,CAAC;QACJ,CAAC;QAED,eAAe,CAAC,IAAI;YAClB,OAAO,QAAQ,CACb,GAAG,EAAE,CAAC,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,EACnC,GAAG,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,CAClC,CAAC;QACJ,CAAC;QAED,oBAAoB,CAAC,IAAI;YACvB,OAAO,QAAQ,CACb,GAAG,EAAE,CAAC,OAAO,CAAC,oBAAoB,CAAC,IAAI,CAAC,EACxC,GAAG,EAAE,CAAC,KAAK,CAAC,oBAAoB,CAAC,IAAI,CAAC,CACvC,CAAC;QACJ,CAAC;QAED,wBAAwB,CAAC,IAAI;YAC3B,sEAAsE;YACtE,wEAAwE;YACxE,yEAAyE;YACzE,yEAAyE;YACzE,qEAAqE;YACrE,wEAAwE;YACxE,mEAAmE;YACnE,OAAO,OAAO,CAAC,wBAAwB,CAAC,IAAI,CAAC,CAAC;QAChD,CAAC;QAED,oBAAoB,CAAC,IAAI;YACvB,qEAAqE;YACrE,uEAAuE;YACvE,yEAAyE;YACzE,sEAAsE;YACtE,OAAO,OAAO,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC;QAC5C,CAAC;QAED,sBAAsB,CAAC,IAAI;YACzB,yEAAyE;YACzE,0EAA0E;YAC1E,kEAAkE;YAClE,yEAAyE;YACzE,0EAA0E;YAC1E,wEAAwE;YACxE,sDAAsD;YACtD,OAAO,OAAO,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;QAC9C,CAAC;QAED,iBAAiB,CAAC,IAAI;YACpB,0EAA0E;YAC1E,oEAAoE;YACpE,wEAAwE;YACxE,yEAAyE;YACzE,OAAO,QAAQ,CACb,GAAG,EAAE,CAAC,OAAO,CAAC,iBAAiB,CAAC,IAAI,CAAC,EACrC,GAAG,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,CACpC,CAAC;QACJ,CAAC;QAED,0BAA0B,CAAC,WAAW;YACpC,yEAAyE;YACzE,yEAAyE;YACzE,yEAAyE;YACzE,qBAAqB;YACrB,OAAO,QAAQ,CACb,GAAG,EAAE,CAAC,OAAO,CAAC,0BAA0B,CAAC,WAAW,CAAC,EACrD,GAAG,EAAE,CAAC,KAAK,CAAC,0BAA0B,CAAC,WAAW,CAAC,CACpD,CAAC;QACJ,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/earning/bootstrap.d.ts

@@ -4,6 +4,7 @@
  * Phase 1 (master): generate mnemonic → fund master EOA
  * Phase 2 (per-service): derive agent → stake → deploy mech
  */
+import { type Hex } from 'viem';
 import type { FleetState, FleetBootstrapResult, StakingMode } from './types.js';
 import { requestTestnetFunding } from './faucet.js';
 import { type JinnOnchainNetwork } from './viem-clients.js';
@@ -132,8 +133,9 @@ export interface FleetBootstrapperOptions {
     /** Optional Safe ETH target override (wei). */
     minSafeEthWei?: string;
     /**
-     * When `masterEthDailyEstimateWei` is unset, blends a conservative daily estimate
-     * from poll frequency (config.pollIntervalMs).
+     * Daemon poll interval. Currently unused by the master-daily-estimate path
+     * (the poll-based blend was removed in #288); kept on the options bag so
+     * existing callers compile unchanged.
      */
     pollIntervalMs?: number;
     /**
@@ -161,6 +163,11 @@ export interface FleetBootstrapperOptions {
      * (~1.5 Base Sepolia blocks). Tests pass 0 to skip the sleep entirely.
      */
     safeBindingRetryDelayMs?: number;
+    /**
+     * Backoff before retrying a transient CDP faucet 429 (issue #984 work unit 1).
+     * Defaults to 15000 ms. Tests pass 0 to skip the sleep entirely.
+     */
+    faucetRateLimitBackoffMs?: number;
 }
 export declare class FleetBootstrapper {
     private readonly store;
@@ -178,6 +185,7 @@ export declare class FleetBootstrapper {
     private readonly autoTestnetFaucet;
     private readonly safeBindingMaxAttempts;
     private readonly safeBindingRetryDelayMs;
+    private readonly faucetRateLimitBackoffMs;
     constructor(options?: FleetBootstrapperOptions);
     getStatus(): Promise<FleetState>;
     /**
@@ -209,7 +217,11 @@ export declare class FleetBootstrapper {
      */
     private bindAgentWalletWithRetry;
     /**
-     * Conservative daily master gas (wei): max(DEFAULT, rough tx count from poll interval × cost).
+     * Conservative daily master gas (wei). Returns the floor; operators who
+     * want a more aggressive estimate can still set `JINN_MASTER_ETH_DAILY_WEI`.
+     * See DEFAULT_MASTER_ETH_DAILY_WEI for rationale (#288). The
+     * `pollIntervalMs` parameter is vestigial since the poll-based blend was
+     * removed; kept so the constructor call site stays unchanged.
      */
     private estimateMasterDailyGasWei;
     /**
@@ -366,6 +378,22 @@ export interface RecoverEvictedServiceOptions {
     chain: JinnOnchainNetwork;
     mnemonic: string;
 }
+/**
+ * Inspect a mined reStake receipt and log the correct outcome (#916).
+ *
+ * Pure + I/O-free so it can be unit-tested without a chain client. On a
+ * `success` receipt it logs `reStake confirmed`. On a `reverted` receipt it
+ * logs `reStake reverted` at error level (with the decoded reason if the
+ * caller could obtain one) and throws so the recovery attempt re-queues.
+ */
+export declare function handleReStakeReceipt(args: {
+    receipt: {
+        status: 'success' | 'reverted';
+    };
+    serviceDisplayIndex: number;
+    reStakeHash: Hex;
+    revertReason?: string;
+}): void;
 /**
  * Re-stake an evicted service by calling `distributor.reStake(stakingProxy, serviceId)`.
  *