@optimystic/db-p2p 0.24.1 → 0.25.0

package/dist/src/testing/mesh-harness.d.ts

@@ -1,6 +1,7 @@
 import type { PeerId, PrivateKey } from '@libp2p/interface';
-import type { IKeyNetwork, ITransactor } from '@optimystic/db-core';
-import { ClusterMember } from '../cluster/cluster-repo.js';
+import type { IKeyNetwork, BlockId, ITransactor, ITransactionValidator } from '@optimystic/db-core';
+import { ClusterMember, type ExpectedClusterView } from '../cluster/cluster-repo.js';
+import { type ClusterPolicyOptions, type ResolvedClusterPolicy } from '../cluster/cluster-policy.js';
 import { StorageRepo } from '../storage/storage-repo.js';
 import type { IRawStorage } from '../storage/i-raw-storage.js';
 import type { CoordinatorRepo } from '../repo/coordinator-repo.js';
@@ -13,8 +14,24 @@ export interface MeshNode {
 }
 export interface MeshOptions {
     responsibilityK: number;
+    /**
+     * Replication factor. OMITTED now means what it means in production: the operator declared
+     * nothing, so it resolves to `DEFAULT_CLUSTER_SIZE` (10) — NOT to `nodeCount`. An undeclared
+     * two-node mesh therefore measures its repair corroboration floor against 10 and can never
+     * repair (see `resolveClusterPolicy` in `cluster/cluster-policy.ts`); a mesh that genuinely is
+     * its node count must say so, exactly as a real deployment must.
+     */
     clusterSize?: number;
+    /**
+     * Passed through to `resolveClusterPolicy` verbatim; this is how a mesh declares its real
+     * cohort size (`assumedClusterSize`), downsize policy, or small-cluster opt-in. When both a
+     * legacy top-level field and the matching entry here are given, the entry here wins — it is
+     * the production-shaped one.
+     */
+    clusterPolicy?: ClusterPolicyOptions['clusterPolicy'];
+    /** Legacy shorthand for `clusterPolicy.superMajorityThreshold`. */
     superMajorityThreshold?: number;
+    /** Legacy shorthand for `clusterPolicy.allowDownsize`. */
     allowClusterDownsize?: boolean;
     /**
      * Optional per-node raw-storage factory. Invoked once per node (indexed from 0)
@@ -23,6 +40,40 @@ export interface MeshOptions {
      * with a crashing proxy, or by restart tests to rebuild over preserved state.
      */
     rawStorageFactory?: (index: number) => IRawStorage;
+    /**
+     * Per-node member-side cluster derivation for the membership admission gate — the harness
+     * analogue of `libp2p-node-base`'s `deriveExpectedCluster` (findCluster + FRET confidence).
+     * Omitted → each member gets the production-shaped derivation over its own self-including
+     * key-network view (partition-aware, see `MeshFailureConfig.partitionSides`) with confidence
+     * from `meshConfidence` (default 1).
+     */
+    deriveExpectedCluster?: (node: MeshNode, blockId: BlockId) => Promise<ExpectedClusterView>;
+    /**
+     * Per-node transaction validator — the harness analogue of `NodeOptions.validator`, which
+     * `libp2p-node-base` forwards straight into `clusterMember({ … validator })`. Invoked once per
+     * node (indexed from 0, in the order `Mesh.nodes` ends up in) during assembly.
+     *
+     * Omitted → no validator, and `ClusterMember.validatePendOperations` skips the whole validation
+     * step (signatures, schema hash, operations hash) — today's harness behaviour, preserved as the
+     * default so existing meshes do not suddenly re-validate transactions they were never built to
+     * satisfy. That is also production's current posture: no composition root supplies
+     * `NodeOptions.validator` yet (backlog `feat-no-deployment-validates-transactions-at-pend`).
+     *
+     * A FACTORY rather than one shared instance because enforcement is a per-node decision, and a
+     * mixed mesh — some members enforcing, some not — is exactly the case worth testing.
+     *
+     * A mesh that arms validators can also set `clusterPolicy.unvalidatablePendPolicy: 'reject'` to
+     * refuse pends that carry no `validation` payload (the single-collection `Collection.sync`
+     * shape, which a validator cannot re-check); the default 'accept' admits them unchecked.
+     */
+    validatorFactory?: (index: number, peerId: PeerId) => ITransactionValidator;
+    /**
+     * Per-node network-size confidence (0..1) fed to the default derivation — the FRET stand-in.
+     * Default 1 (confident). Evaluated per vote, so a spec may flip it mid-test (e.g. collapse a
+     * partition side's confidence after the mesh is built). The gate's check is STRICTLY greater
+     * than its threshold (0.5), so returning the threshold itself lands on the fail-closed side.
+     */
+    meshConfidence?: (node: MeshNode) => number;
 }
 export interface MeshFailureConfig {
     /** Peers that should fail on cluster update (simulate unreachable) */
@@ -36,12 +87,34 @@ export interface MeshFailureConfig {
      * them as a source. Distinct from `failingPeers`, which fails cluster (write) updates.
      */
     silentPeers?: Set<string>;
+    /**
+     * Simulated network partition: each entry is one side of the split, as a set of peer-id
+     * strings. While set, a node's own key-network view (`findCluster`) answers a caller on side S
+     * with only the members of S that would otherwise be in the cohort — an UNAUTHENTICATED
+     * shrunken view, exactly what the membership admission gate exists to refuse. Callers not in
+     * any listed side see the unpartitioned cohort.
+     *
+     * This shapes cluster VIEWS (what a coordinator declares and what a member derives), not
+     * transport reachability — combine with `failingPeers`/`silentPeers` to also sever traffic.
+     * On the write path that rarely matters: a partitioned coordinator only contacts the cohort
+     * it declared, which is already its own side.
+     */
+    partitionSides?: Set<string>[];
 }
 export interface Mesh {
     nodes: MeshNode[];
     failures: MeshFailureConfig;
     keyNetwork: IKeyNetwork;
 }
+/**
+ * Fold the mesh's operator-facing knobs into the numbers every node runs on, through the SAME
+ * resolver a real node's composition root uses (`libp2p-node-base.ts`). Named and exported rather
+ * than inlined in `createMesh` so the precedence rule below is assertable without building a mesh.
+ *
+ * Precedence: an explicit `clusterPolicy` entry wins over the matching legacy top-level field — the
+ * entry is the production-shaped one.
+ */
+export declare function resolveMeshPolicy(options: MeshOptions): ResolvedClusterPolicy;
 /**
  * Creates N interconnected mesh nodes with real components and mock transport.
  * ClusterClient calls route directly to target ClusterMember instances.

package/dist/src/testing/mesh-harness.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"mesh-harness.d.ts","sourceRoot":"","sources":["../../../src/testing/mesh-harness.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC5D,OAAO,KAAK,EAAE,WAAW,EAA4F,WAAW,EAAsB,MAAM,qBAAqB,CAAC;AAMlL,OAAO,EAAE,aAAa,EAA8C,MAAM,4BAA4B,CAAC;AACvG,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AAGzD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAE/D,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAInE,MAAM,WAAW,QAAQ;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,UAAU,CAAC;IACvB,WAAW,EAAE,WAAW,CAAC;IACzB,aAAa,EAAE,aAAa,CAAC;IAC7B,eAAe,EAAE,eAAe,CAAC;CACjC;AAED,MAAM,WAAW,WAAW;IAC3B,eAAe,EAAE,MAAM,CAAC;IACxB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,sBAAsB,CAAC,EAAE,MAAM,CAAC;IAChC,oBAAoB,CAAC,EAAE,OAAO,CAAC;IAC/B;;;;;OAKG;IACH,iBAAiB,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,WAAW,CAAC;CACnD;AAED,MAAM,WAAW,iBAAiB;IACjC,sEAAsE;IACtE,YAAY,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC3B,2DAA2D;IAC3D,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B;;;;;OAKG;IACH,WAAW,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CAC1B;AA2DD,MAAM,WAAW,IAAI;IACpB,KAAK,EAAE,QAAQ,EAAE,CAAC;IAClB,QAAQ,EAAE,iBAAiB,CAAC;IAC5B,UAAU,EAAE,WAAW,CAAC;CACxB;AA+BD;;;GAGG;AACH,wBAAsB,UAAU,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CA2IvF;AAED;;;;;;;;GAQG;AACH,wBAAsB,mBAAmB,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC,CAG1F;AAED,MAAM,WAAW,sBAAsB;IACtC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,sBAAsB,CAAC,EAAE,MAAM,CAAC;CAChC;AAED;;;;;GAKG;AACH,eAAO,MAAM,sBAAsB,GAAI,MAAM,IAAI,EAAE,UAAS,sBAA2B,KAAG,WAezF,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,uBAAuB,GAAI,MAAM,IAAI,EAAE,UAAS,sBAA2B,KAAG,GAAG,CAAC,MAAM,EAAE,WAAW,CAMjH,CAAC"}
+{"version":3,"file":"mesh-harness.d.ts","sourceRoot":"","sources":["../../../src/testing/mesh-harness.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC5D,OAAO,KAAK,EAAE,WAAW,EAAgD,OAAO,EAAa,WAAW,EAAE,qBAAqB,EAAsB,MAAM,qBAAqB,CAAC;AAMjL,OAAO,EAAE,aAAa,EAAkF,KAAK,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AAErK,OAAO,EAAwB,KAAK,oBAAoB,EAAE,KAAK,qBAAqB,EAAE,MAAM,8BAA8B,CAAC;AAC3H,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AAGzD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAI/D,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAInE,MAAM,WAAW,QAAQ;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,UAAU,CAAC;IACvB,WAAW,EAAE,WAAW,CAAC;IACzB,aAAa,EAAE,aAAa,CAAC;IAC7B,eAAe,EAAE,eAAe,CAAC;CACjC;AAED,MAAM,WAAW,WAAW;IAC3B,eAAe,EAAE,MAAM,CAAC;IACxB;;;;;;OAMG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;;;OAKG;IACH,aAAa,CAAC,EAAE,oBAAoB,CAAC,eAAe,CAAC,CAAC;IACtD,mEAAmE;IACnE,sBAAsB,CAAC,EAAE,MAAM,CAAC;IAChC,0DAA0D;IAC1D,oBAAoB,CAAC,EAAE,OAAO,CAAC;IAC/B;;;;;OAKG;IACH,iBAAiB,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,WAAW,CAAC;IACnD;;;;;;OAMG;IACH,qBAAqB,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,KAAK,OAAO,CAAC,mBAAmB,CAAC,CAAC;IAC3F;;;;;;;;;;;;;;;;;OAiBG;IACH,gBAAgB,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,KAAK,qBAAqB,CAAC;IAC5E;;;;;OAKG;IACH,cAAc,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,KAAK,MAAM,CAAC;CAC5C;AAED,MAAM,WAAW,iBAAiB;IACjC,sEAAsE;IACtE,YAAY,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC3B,2DAA2D;IAC3D,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B;;;;;OAKG;IACH,WAAW,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC1B;;;;;;;;;;;OAWG;IACH,cAAc,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;CAC/B;AA2DD,MAAM,WAAW,IAAI;IACpB,KAAK,EAAE,QAAQ,EAAE,CAAC;IAClB,QAAQ,EAAE,iBAAiB,CAAC;IAC5B,UAAU,EAAE,WAAW,CAAC;CACxB;AAgCD;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,WAAW,GAAG,qBAAqB,CAiB7E;AAED;;;GAGG;AACH,wBAAsB,UAAU,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CAgOvF;AAED;;;;;;;;GAQG;AACH,wBAAsB,mBAAmB,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC,CAG1F;AAED,MAAM,WAAW,sBAAsB;IACtC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,sBAAsB,CAAC,EAAE,MAAM,CAAC;CAChC;AAED;;;;;GAKG;AACH,eAAO,MAAM,sBAAsB,GAAI,MAAM,IAAI,EAAE,UAAS,sBAA2B,KAAG,WAezF,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,uBAAuB,GAAI,MAAM,IAAI,EAAE,UAAS,sBAA2B,KAAG,GAAG,CAAC,MAAM,EAAE,WAAW,CAMjH,CAAC"}

package/dist/src/testing/mesh-harness.js

@@ -1,10 +1,13 @@
-import { NetworkTransactor, DEFAULT_SUPER_MAJORITY_THRESHOLD } from '@optimystic/db-core';
+import { NetworkTransactor } from '@optimystic/db-core';
 import { peerIdFromPrivateKey } from '@libp2p/peer-id';
 import { generateKeyPair } from '@libp2p/crypto/keys';
 import { ClusterMember, clusterMember } from '../cluster/cluster-repo.js';
+import { createReconcileBlock } from '../cluster/reconcile-block.js';
+import { resolveClusterPolicy } from '../cluster/cluster-policy.js';
 import { StorageRepo } from '../storage/storage-repo.js';
 import { MemoryRawStorage } from '../storage/memory-storage.js';
 import { BlockStorage } from '../storage/block-storage.js';
+import { serveBlockArchive, servableProof } from '../storage/block-archive.js';
 import { coordinatorRepo } from '../repo/coordinator-repo.js';
 import { sortPeersByDistance } from '../routing/responsibility.js';
 import { toString as u8ToString } from 'uint8arrays';
@@ -62,42 +65,83 @@ class MockMeshKeyNetwork {
     }
 }
 /**
- * Pull a block's committed content from a sibling cohort node into `storageRepo` — the mesh analogue
- * of `libp2p-node-base`'s `createReconcileBlock` (SyncClient archive fetch + `saveReplicatedBlock`).
+ * One cohort peer's archive for a block, read straight from the sibling's `StorageRepo` — the mesh
+ * analogue of `libp2p-node-base`'s `fetchArchiveFromPeer` (a SyncClient round trip). The archive
+ * itself comes from `serveBlockArchive`, the same function `SyncService` answers a real fetch with,
+ * so the harness cannot serve a shape production would not — including the case that used to
+ * differ: a peer holding a revision whose content it cannot materialize still votes on
+ * `(rev, actionId)` here, exactly as it does over the wire.
  *
- * Deliberately shared by BOTH callers, exactly as the live node shares one callback between them: the
- * commit path (`clusterMember.reconcileBlock`, for a block committed without a materializable base)
- * and the read path (`CoordinatorRepo.acquireBlockFromCohort`, for a corroborated revision the reader
- * cannot promote locally). Stateless, so it is simply rebuilt per caller.
+ * A silent peer serves no bytes either. `undefined` is the right answer: reconcile's `no-archive`
+ * outcome deliberately conflates unreachable with holds-nothing, and the production
+ * `fetchArchiveFromPeer` swallows every dial failure into the same `undefined`. (Contrast the read
+ * path's latest-revision consult, where silence REJECTS — the coordinator counts "did not answer"
+ * separately from "holds nothing".)
  *
- * `nodes` is captured by reference and is fully populated by the time either caller invokes it.
+ * `nodes` is captured by reference and is fully populated by the time this is invoked.
+ *
+ * NOTE: the archive served here always carries exactly ONE revision — the peer's current latest —
+ * because that is all a repo read surfaces. Enough for repair, which only ever targets one
+ * `(rev, actionId)`. If a spec ever needs a gap-fill across a revision RANGE, `serveBlockArchive`
+ * has to grow a real range and both callers get it at once.
  */
-const makeReconcileBlock = (nodes, selfPeerId, storageRepo, failures) => async (blockId, committed, cohortPeerIds) => {
-    for (const peerIdStr of cohortPeerIds) {
-        if (peerIdStr === selfPeerId)
-            continue;
-        // A silent peer cannot serve bytes either — without this, a test that silenced a
-        // peer's consult could still accidentally converge THROUGH that peer.
-        if (failures.silentPeers?.has(peerIdStr))
-            continue;
-        const target = nodes.find(n => n.peerId.toString() === peerIdStr);
-        if (!target)
-            continue;
-        const result = await target.storageRepo.get({ blockIds: [blockId] }, { skipClusterFetch: true });
-        const entry = result[blockId];
-        const latest = entry?.state?.latest;
-        if (!latest || !entry?.block || latest.rev < committed.rev)
-            continue;
-        await storageRepo.saveReplicatedBlock(blockId, entry.block, latest);
-        return;
-    }
+const makeFetchArchive = (nodes, selfPeerId, failures) => async (peerIdStr, blockId) => {
+    if (peerIdStr === selfPeerId)
+        return undefined;
+    if (failures.silentPeers?.has(peerIdStr))
+        return undefined;
+    const target = nodes.find(n => n.peerId.toString() === peerIdStr);
+    if (!target)
+        return undefined;
+    return await serveBlockArchive(target.storageRepo, blockId);
 };
+/**
+ * Fold the mesh's operator-facing knobs into the numbers every node runs on, through the SAME
+ * resolver a real node's composition root uses (`libp2p-node-base.ts`). Named and exported rather
+ * than inlined in `createMesh` so the precedence rule below is assertable without building a mesh.
+ *
+ * Precedence: an explicit `clusterPolicy` entry wins over the matching legacy top-level field — the
+ * entry is the production-shaped one.
+ */
+export function resolveMeshPolicy(options) {
+    return resolveClusterPolicy({
+        clusterSize: options.clusterSize,
+        clusterPolicy: {
+            ...options.clusterPolicy,
+            superMajorityThreshold: options.clusterPolicy?.superMajorityThreshold ?? options.superMajorityThreshold,
+            allowDownsize: options.clusterPolicy?.allowDownsize ?? options.allowClusterDownsize
+            // `allowUnvalidatedSmallCluster` passes through UNTOUCHED and so defaults to `false`, same
+            // as `resolveClusterPolicy` — the membership admission gate is ARMED in the harness. A mesh
+            // that must transact below the safe floor says so at its own call site:
+            //   createMesh(1, { responsibilityK: 1, clusterPolicy: { allowUnvalidatedSmallCluster: true } })
+            // No harness-wide re-default: a disarmed gate has to be visible where the test is read.
+            // (Solo cohorts never reach the gate anyway — CoordinatorRepo short-circuits peerCount <= 1
+            // straight to local storage — so only a genuinely undersized MULTI-peer cohort needs the
+            // opt-in.)
+        }
+    });
+}
 /**
  * Creates N interconnected mesh nodes with real components and mock transport.
  * ClusterClient calls route directly to target ClusterMember instances.
  */
 export async function createMesh(nodeCount, options) {
+    // NOTE: a mesh is never shut down — `Mesh` exposes no disposal seam, so each node's
+    // `ClusterMember.dispose()` is never called and its two cleanup intervals tick for the rest of
+    // the process. Harmless today: both handles are `.unref()`ed (the process still exits) and the
+    // callbacks are no-ops on an idle member, at ~40 `createMesh` sites across db-p2p's suite. If a
+    // mesh ever holds something a timer keeps alive — a real socket, a file handle, a fake clock a
+    // spec advances — give `Mesh` a `dispose()` that walks the nodes, and make the specs use it.
     const failures = {};
+    // NOTE: one policy for the whole mesh, so every node necessarily agrees on cluster size and
+    // thresholds. That is right for repair tests, where disagreement is not the variable. A test
+    // that needs nodes to DISAGREE about the cluster (a partition where each side derives its own
+    // view — see ticket `mesh-harness-admission-gate`) has to resolve per node instead; it cannot
+    // be expressed with a single shared object.
+    //
+    // Resolved once per mesh rather than per node for a second reason: the resolver's one-line
+    // `repair-fault-tolerance` advisory then fires once instead of N times.
+    const policy = resolveMeshPolicy(options);
     // Generate key pairs for all nodes
     const keyPairs = await Promise.all(Array.from({ length: nodeCount }, async () => {
         const privateKey = await generateKeyPair('Ed25519');
@@ -106,46 +150,115 @@ export async function createMesh(nodeCount, options) {
     // Build nodes array (partially — coordinatorRepo added after keyNetwork is ready)
     const nodes = [];
     const peerNetwork = new MockPeerNetwork();
+    // One real reconcile callback per node, shared between the member's commit-path `reconcileBlock`
+    // and the coordinator's read-path `acquireBlockFromCohort` — production shares one instance
+    // (`libp2p-node-base.ts`), and a spec must not be able to tell the two paths apart. Built in
+    // phase 1 (with the member), consumed again in phase 2 (by the coordinator), so it is stashed
+    // here keyed by peer id rather than widened onto the public `MeshNode` type.
+    const reconcileByPeer = new Map();
+    // The mesh key network is built BEFORE the members: each member's `deriveExpectedCluster` (the
+    // admission gate's view) needs a per-node key network in phase 1, and constructing it here beats
+    // a late-bound slot a closure could fire on before it is filled. Safe because `nodes` is captured
+    // by reference and only consulted at call time, after the array is fully populated.
+    const keyNetwork = new MockMeshKeyNetwork(nodes, options.responsibilityK, failures);
+    /**
+     * One node's own view of the key network — what `Libp2pKeyPeerNetwork` gives a real node:
+     *  - `findCluster` always includes self, so a responsible member's derived view is never empty
+     *    (see the empty-view guard in `cluster-repo.admitMembership`);
+     *  - under a simulated partition (`failures.partitionSides`), a caller inside a side sees only
+     *    its side's members of the cohort — the caller-aware filtering lives here, in the per-node
+     *    wrapper, precisely so `IKeyNetwork` itself needs no "who is asking" parameter.
+     * The SAME instance serves both the member's admission derivation (phase 1) and the node's
+     * coordinator (phase 2), so the two sides of a node can never see different topologies.
+     */
+    const makeNodeKeyNetwork = (selfPeerId) => {
+        const selfStr = selfPeerId.toString();
+        return {
+            findCoordinator: (key, opts) => keyNetwork.findCoordinator(key, opts),
+            async findCluster(key) {
+                const peers = await keyNetwork.findCluster(key);
+                const side = failures.partitionSides?.find(s => s.has(selfStr));
+                if (side) {
+                    for (const id of Object.keys(peers)) {
+                        if (!side.has(id))
+                            delete peers[id];
+                    }
+                }
+                if (!(selfStr in peers)) {
+                    peers[selfStr] = {
+                        multiaddrs: ['/ip4/127.0.0.1/tcp/8000'],
+                        publicKey: u8ToString(selfPeerId.publicKey.raw, 'base64url')
+                    };
+                }
+                return peers;
+            }
+        };
+    };
+    const nodeKeyNetworkByPeer = new Map();
     // Phase 1: create storage + cluster members
     let nodeIndex = 0;
     for (const { peerId, privateKey } of keyPairs) {
+        const index = nodeIndex++;
         const rawStorage = options.rawStorageFactory
-            ? options.rawStorageFactory(nodeIndex)
+            ? options.rawStorageFactory(index)
             : new MemoryRawStorage();
-        nodeIndex++;
         const storageRepo = new StorageRepo((blockId) => new BlockStorage(blockId, rawStorage));
-        const consensusConfig = {
-            superMajorityThreshold: options.superMajorityThreshold ?? DEFAULT_SUPER_MAJORITY_THRESHOLD,
-            simpleMajorityThreshold: 0.51,
-            minAbsoluteClusterSize: 2,
-            allowClusterDownsize: options.allowClusterDownsize ?? true,
-            clusterSizeTolerance: 0.5,
-            partitionDetectionWindow: 60000,
-            // Harness spins up small/single-node meshes on purpose; opt into running
-            // below the safe floor without a confident network-size estimate.
-            allowUnvalidatedSmallCluster: true
+        // Active reconciliation: when a member commits a block it never pended (cohort drift), or a
+        // reader holds a corroborated revision it cannot promote locally, pull the committed revision
+        // from the cohort — through the PRODUCTION quorum rules (`createReconcileBlock`): a quorum of
+        // distinct peers must agree on the target `(rev, actionId)` AND on the block content, or the
+        // pass declines, persisting nothing. `reputation` is omitted — no reputation subsystem in the
+        // harness.
+        const reconcileBlock = createReconcileBlock({
+            selfPeerId: peerId.toString(),
+            fetchArchive: makeFetchArchive(nodes, peerId.toString(), failures),
+            // Production shape: a proof reconcile verified against the agreed bytes is persisted so
+            // the repaired replica serves it onward.
+            saveReplicatedBlock: (blockId, block, source, verifiedProof) => storageRepo.saveReplicatedBlock(blockId, block, source, verifiedProof),
+            simpleMajorityThreshold: policy.simpleMajorityThreshold,
+            superMajorityThreshold: policy.superMajorityThreshold,
+            repairCorroborationClusterSize: policy.repairCorroborationClusterSize
+        });
+        reconcileByPeer.set(peerId.toString(), reconcileBlock);
+        const nodeKeyNetwork = makeNodeKeyNetwork(peerId);
+        nodeKeyNetworkByPeer.set(peerId.toString(), nodeKeyNetwork);
+        // The node object exists before its member so the admission derivation below can hand the
+        // finished MeshNode to spec-supplied callbacks; `clusterMember`/`coordinatorRepo` are
+        // assigned as they are built (member just below, coordinator in phase 2) and the closures
+        // only run at vote time, long after both are in place.
+        const meshNode = {
+            peerId,
+            privateKey,
+            storageRepo,
+            clusterMember: undefined,
+            coordinatorRepo: undefined
         };
-        // Active reconciliation: when a member commits a block it never pended (cohort drift),
-        // pull the committed revision from a sibling cohort node that holds it.
-        const reconcileBlock = makeReconcileBlock(nodes, peerId.toString(), storageRepo, failures);
-        const member = clusterMember({
+        // Member-side cluster derivation for the membership admission gate — the production shape
+        // (`libp2p-node-base.deriveExpectedCluster`): the SAME per-node key network the coordinator
+        // selects its cohort from, plus a network-size confidence. The self-including wrapper keeps a
+        // responsible member's view non-empty; `meshConfidence` is the FRET stand-in (default 1, i.e.
+        // confident — a partition spec collapses it per side).
+        const deriveExpectedCluster = options.deriveExpectedCluster
+            ? (blockId) => options.deriveExpectedCluster(meshNode, blockId)
+            : async (blockId) => ({
+                peers: await nodeKeyNetwork.findCluster(new TextEncoder().encode(blockId)) ?? {},
+                confidence: options.meshConfidence?.(meshNode) ?? 1
+            });
+        meshNode.clusterMember = clusterMember({
             storageRepo,
             peerNetwork,
             peerId,
             privateKey,
-            consensusConfig,
-            reconcileBlock
-        });
-        nodes.push({
-            peerId,
-            privateKey,
-            storageRepo,
-            clusterMember: member,
-            coordinatorRepo: undefined // filled in phase 2
+            consensusConfig: policy,
+            reconcileBlock,
+            deriveExpectedCluster,
+            // Absent by default: `undefined` here is identical to omitting the field, and
+            // `validatePendOperations` then skips the validation step entirely.
+            validator: options.validatorFactory?.(index, peerId)
         });
+        nodes.push(meshNode);
     }
-    // Phase 2: create key network and coordinator repos (needs all nodes for routing)
-    const keyNetwork = new MockMeshKeyNetwork(nodes, options.responsibilityK, failures);
+    // Phase 2: coordinator repos (needs all nodes for routing; key network built in phase 1)
     const createClusterClient = (targetPeerId) => {
         const target = nodes.find(n => n.peerId.equals(targetPeerId));
         if (!target) {
@@ -178,39 +291,38 @@ export async function createMesh(nodeCount, options) {
             if (!target)
                 return undefined;
             const result = await target.storageRepo.get({ blockIds: [blockId], context }, { skipClusterFetch: true });
-            return result[blockId]?.state?.latest;
-        };
-        // Wrap key network to include self in findCluster (matches real Libp2pKeyPeerNetwork behavior)
-        const nodeKeyNetwork = {
-            findCoordinator: (key, opts) => keyNetwork.findCoordinator(key, opts),
-            async findCluster(key) {
-                const peers = await keyNetwork.findCluster(key);
-                const selfStr = node.peerId.toString();
-                if (!(selfStr in peers)) {
-                    peers[selfStr] = {
-                        multiaddrs: ['/ip4/127.0.0.1/tcp/8000'],
-                        publicKey: u8ToString(node.peerId.publicKey.raw, 'base64url')
-                    };
-                }
-                return peers;
-            }
+            const latest = result[blockId]?.state?.latest;
+            if (!latest)
+                return undefined;
+            // The commit proof rides along exactly as it does in production, and through the SAME
+            // lookup `serveBlockArchive` uses (`servableProof`) rather than a hand-rolled one — a
+            // harness that attached proofs by its own rule would let every mesh-tier test exercise a
+            // certification path real peers do not have, or miss one they do. Production reads the
+            // proof out of the served archive; the harness reads the sibling's repo directly, so
+            // sharing the lookup is what keeps the two answers identical.
+            const proof = await servableProof(target.storageRepo, blockId, latest);
+            return proof ? { ...latest, proof } : latest;
         };
-        const factory = coordinatorRepo(nodeKeyNetwork, createClusterClient, {
-            clusterSize: options.clusterSize ?? nodeCount,
-            superMajorityThreshold: options.superMajorityThreshold ?? DEFAULT_SUPER_MAJORITY_THRESHOLD,
-            allowClusterDownsize: options.allowClusterDownsize ?? true,
-            // Harness meshes run below the safe floor on purpose; opt the coordinator
-            // side into that so validateSmallCluster admits them (fails closed by default).
-            allowUnvalidatedSmallCluster: true
-        });
+        // The node's own self-including (and partition-aware) key-network view, built in phase 1 —
+        // the SAME instance the member's admission derivation reads, matching real
+        // Libp2pKeyPeerNetwork behavior.
+        const nodeKeyNetwork = nodeKeyNetworkByPeer.get(node.peerId.toString());
+        const factory = coordinatorRepo(nodeKeyNetwork, createClusterClient, 
+        // The SAME resolved policy the member above was built from, spread the way
+        // `libp2p-node-base` spreads it into its coordinator factory — carrying
+        // `repairCorroborationClusterSize` (the repair floor's yardstick, DEFAULT_CLUSTER_SIZE
+        // when the mesh declared nothing), the production `minAbsoluteClusterSize` (2, not the
+        // coordinator's own fallback of 3), and the `allowUnvalidatedSmallCluster` gate —
+        // ARMED (false) unless the mesh opted out at its call site.
+        { ...policy });
         node.coordinatorRepo = factory({
             storageRepo: node.storageRepo,
             localCluster: node.clusterMember,
             localPeerId: node.peerId,
             clusterLatestCallback,
-            // The read path's transfer mechanism — the same callback the member uses on the commit path,
-            // mirroring how `libp2p-node-base` shares one `reconcileBlock` between both.
-            acquireBlockFromCohort: makeReconcileBlock(nodes, node.peerId.toString(), node.storageRepo, failures)
+            // The read path's transfer mechanism — the SAME instance the member uses on the commit
+            // path, mirroring how `libp2p-node-base` shares one `reconcileBlock` between both.
+            acquireBlockFromCohort: reconcileByPeer.get(node.peerId.toString())
         });
     }
     return { nodes, failures, keyNetwork };

package/dist/src/testing/mesh-harness.js.map

@@ -1 +1 @@
-{"version":3,"file":"mesh-harness.js","sourceRoot":"","sources":["../../../src/testing/mesh-harness.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,iBAAiB,EAAE,gCAAgC,EAAE,MAAM,qBAAqB,CAAC;AAC1F,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,EAAE,aAAa,EAAE,aAAa,EAA+B,MAAM,4BAA4B,CAAC;AACvG,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AACzD,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAChE,OAAO,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAE3D,OAAO,EAAE,eAAe,EAA8B,MAAM,6BAA6B,CAAC;AAE1F,OAAO,EAAE,mBAAmB,EAAkB,MAAM,8BAA8B,CAAC;AACnF,OAAO,EAAE,QAAQ,IAAI,UAAU,EAAE,MAAM,aAAa,CAAC;AAsCrD,MAAM,eAAe;IACpB,KAAK,CAAC,OAAO,CAAC,OAAe,EAAE,SAAiB;QAC/C,OAAO,EAAE,CAAC;IACX,CAAC;CACD;AAED;;;;GAIG;AACH,MAAM,kBAAkB;IAEL;IACA;IACA;IAHlB,YACkB,KAAiB,EACjB,eAAuB,EACvB,WAA8B,EAAE;QAFhC,UAAK,GAAL,KAAK,CAAY;QACjB,oBAAe,GAAf,eAAe,CAAQ;QACvB,aAAQ,GAAR,QAAQ,CAAwB;IAC/C,CAAC;IAEJ,KAAK,CAAC,eAAe,CAAC,GAAe,EAAE,OAAyC;QAC/E,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,OAAO,EAAE,aAAa,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAChF,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC1C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAClE,IAAI,CAAC,IAAI,EAAE,CAAC;YACX,MAAM,IAAI,KAAK,CAAC,4DAA4D,CAAC,CAAC;QAC/E,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAC;IACpB,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,GAAe;QAChC,IAAI,IAAI,CAAC,QAAQ,CAAC,gBAAgB,EAAE,CAAC;YACpC,OAAO,EAAkB,CAAC;QAC3B,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,eAAe,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QACxD,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEpC,MAAM,KAAK,GAAiB,EAAE,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG;gBAC/B,UAAU,EAAE,CAAC,yBAAyB,CAAC;gBACvC,SAAS,EAAE,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,SAAU,CAAC,GAAG,EAAE,WAAW,CAAC;aAC9D,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAEO,gBAAgB,CAAC,GAAe;QACvC,MAAM,UAAU,GAAgB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACpD,EAAE,EAAE,CAAC,CAAC,MAAM;YACZ,KAAK,EAAE,CAAC,yBAAyB,CAAC;SAClC,CAAC,CAAC,CAAC;QACJ,MAAM,MAAM,GAAG,mBAAmB,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;QACpD,OAAO,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAE,CAAC,CAAC;IACxE,CAAC;CACD;AAQD;;;;;;;;;;GAUG;AACH,MAAM,kBAAkB,GAAG,CAAC,KAAiB,EAAE,UAAkB,EAAE,WAAwB,EAAE,QAA2B,EAA0B,EAAE,CACnJ,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,EAAE;IAC3C,KAAK,MAAM,SAAS,IAAI,aAAa,EAAE,CAAC;QACvC,IAAI,SAAS,KAAK,UAAU;YAAE,SAAS;QACvC,iFAAiF;QACjF,sEAAsE;QACtE,IAAI,QAAQ,CAAC,WAAW,EAAE,GAAG,CAAC,SAAS,CAAC;YAAE,SAAS;QACnD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,SAAS,CAAC,CAAC;QAClE,IAAI,CAAC,MAAM;YAAE,SAAS;QACtB,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,gBAAgB,EAAE,IAAI,EAAS,CAAC,CAAC;QACxG,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;QAC9B,MAAM,MAAM,GAAG,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC;QACpC,IAAI,CAAC,MAAM,IAAI,CAAC,KAAK,EAAE,KAAK,IAAI,MAAM,CAAC,GAAG,GAAG,SAAS,CAAC,GAAG;YAAE,SAAS;QACrE,MAAM,WAAW,CAAC,mBAAmB,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACpE,OAAO;IACR,CAAC;AACF,CAAC,CAAC;AAEH;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,SAAiB,EAAE,OAAoB;IACvE,MAAM,QAAQ,GAAsB,EAAE,CAAC;IAEvC,mCAAmC;IACnC,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,GAAG,CACjC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,KAAK,IAAI,EAAE;QAC5C,MAAM,UAAU,GAAG,MAAM,eAAe,CAAC,SAAS,CAAC,CAAC;QACpD,OAAO,EAAE,MAAM,EAAE,oBAAoB,CAAC,UAAU,CAAC,EAAE,UAAU,EAAE,CAAC;IACjE,CAAC,CAAC,CACF,CAAC;IAEF,kFAAkF;IAClF,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,MAAM,WAAW,GAAG,IAAI,eAAe,EAAE,CAAC;IAE1C,4CAA4C;IAC5C,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,QAAQ,EAAE,CAAC;QAC/C,MAAM,UAAU,GAAG,OAAO,CAAC,iBAAiB;YAC3C,CAAC,CAAC,OAAO,CAAC,iBAAiB,CAAC,SAAS,CAAC;YACtC,CAAC,CAAC,IAAI,gBAAgB,EAAE,CAAC;QAC1B,SAAS,EAAE,CAAC;QACZ,MAAM,WAAW,GAAG,IAAI,WAAW,CAClC,CAAC,OAAgB,EAAE,EAAE,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,UAAU,CAAC,CAC3D,CAAC;QAEF,MAAM,eAAe,GAA2B;YAC/C,sBAAsB,EAAE,OAAO,CAAC,sBAAsB,IAAI,gCAAgC;YAC1F,uBAAuB,EAAE,IAAI;YAC7B,sBAAsB,EAAE,CAAC;YACzB,oBAAoB,EAAE,OAAO,CAAC,oBAAoB,IAAI,IAAI;YAC1D,oBAAoB,EAAE,GAAG;YACzB,wBAAwB,EAAE,KAAK;YAC/B,yEAAyE;YACzE,kEAAkE;YAClE,4BAA4B,EAAE,IAAI;SAClC,CAAC;QAEF,uFAAuF;QACvF,wEAAwE;QACxE,MAAM,cAAc,GAAG,kBAAkB,CAAC,KAAK,EAAE,MAAM,CAAC,QAAQ,EAAE,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;QAE3F,MAAM,MAAM,GAAG,aAAa,CAAC;YAC5B,WAAW;YACX,WAAW;YACX,MAAM;YACN,UAAU;YACV,eAAe;YACf,cAAc;SACd,CAAC,CAAC;QAEH,KAAK,CAAC,IAAI,CAAC;YACV,MAAM;YACN,UAAU;YACV,WAAW;YACX,aAAa,EAAE,MAAM;YACrB,eAAe,EAAE,SAAgB,CAAC,oBAAoB;SACtD,CAAC,CAAC;IACJ,CAAC;IAED,kFAAkF;IAClF,MAAM,UAAU,GAAG,IAAI,kBAAkB,CAAC,KAAK,EAAE,OAAO,CAAC,eAAe,EAAE,QAAQ,CAAC,CAAC;IAEpF,MAAM,mBAAmB,GAAG,CAAC,YAAoB,EAAY,EAAE;QAC9D,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC;QAC9D,IAAI,CAAC,MAAM,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CAAC,iBAAiB,YAAY,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAC7D,CAAC;QACD,OAAO;YACN,KAAK,CAAC,MAAM,CAAC,MAAqB;gBACjC,IAAI,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC;oBACzD,MAAM,IAAI,KAAK,CAAC,QAAQ,YAAY,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC;gBACnE,CAAC;gBACD,OAAO,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC5C,CAAC;SACD,CAAC;IACH,CAAC,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,8FAA8F;QAC9F,0FAA0F;QAC1F,+FAA+F;QAC/F,+FAA+F;QAC/F,+EAA+E;QAC/E,oEAAoE;QACpE,MAAM,qBAAqB,GAA0B,KAAK,EAAE,MAAc,EAAE,OAAgB,EAAE,OAAQ,EAAkC,EAAE;YACzI,sFAAsF;YACtF,sFAAsF;YACtF,wFAAwF;YACxF,IAAI,QAAQ,CAAC,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC;gBAClD,MAAM,IAAI,KAAK,CAAC,QAAQ,MAAM,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;YACxD,CAAC;YACD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YACxD,IAAI,CAAC,MAAM;gBAAE,OAAO,SAAS,CAAC;YAC9B,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,WAAW,CAAC,GAAG,CAC1C,EAAE,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,EAChC,EAAE,gBAAgB,EAAE,IAAI,EAAS,CACjC,CAAC;YACF,OAAO,MAAM,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC;QACvC,CAAC,CAAC;QACF,+FAA+F;QAC/F,MAAM,cAAc,GAAgB;YACnC,eAAe,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,eAAe,CAAC,GAAG,EAAE,IAAI,CAAC;YACrE,KAAK,CAAC,WAAW,CAAC,GAAG;gBACpB,MAAM,KAAK,GAAG,MAAM,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;gBAChD,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACvC,IAAI,CAAC,CAAC,OAAO,IAAI,KAAK,CAAC,EAAE,CAAC;oBACzB,KAAK,CAAC,OAAO,CAAC,GAAG;wBAChB,UAAU,EAAE,CAAC,yBAAyB,CAAC;wBACvC,SAAS,EAAE,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,SAAU,CAAC,GAAG,EAAE,WAAW,CAAC;qBAC9D,CAAC;gBACH,CAAC;gBACD,OAAO,KAAK,CAAC;YACd,CAAC;SACD,CAAC;QACF,MAAM,OAAO,GAAG,eAAe,CAC9B,cAAc,EACd,mBAAmB,EACnB;YACC,WAAW,EAAE,OAAO,CAAC,WAAW,IAAI,SAAS;YAC7C,sBAAsB,EAAE,OAAO,CAAC,sBAAsB,IAAI,gCAAgC;YAC1F,oBAAoB,EAAE,OAAO,CAAC,oBAAoB,IAAI,IAAI;YAC1D,0EAA0E;YAC1E,gFAAgF;YAChF,4BAA4B,EAAE,IAAI;SAClC,CACD,CAAC;QACF,IAAI,CAAC,eAAe,GAAG,OAAO,CAAC;YAC9B,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,YAAY,EAAE,IAAI,CAAC,aAAa;YAChC,WAAW,EAAE,IAAI,CAAC,MAAM;YACxB,qBAAqB;YACrB,6FAA6F;YAC7F,6EAA6E;YAC7E,sBAAsB,EAAE,kBAAkB,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,WAAW,EAAE,QAAQ,CAAC;SACrG,CAAC,CAAC;IACJ,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC;AACxC,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CAAC,IAAU,EAAE,OAAe;IACpE,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;IACpF,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,MAAM,CAAC,CAAC,CAAC;AACvE,CAAC;AAOD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,IAAU,EAAE,UAAkC,EAAE,EAAe,EAAE;IACvG,MAAM,UAAU,GAAG,IAAI,GAAG,EAAiB,CAAC;IAC5C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC/B,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,eAAmC,CAAC,CAAC;IAClF,CAAC;IACD,OAAO,IAAI,iBAAiB,CAAC;QAC5B,SAAS,EAAE,OAAO,CAAC,SAAS,IAAI,KAAK;QACrC,sBAAsB,EAAE,OAAO,CAAC,sBAAsB,IAAI,KAAK;QAC/D,UAAU,EAAE,IAAI,CAAC,UAAU;QAC3B,OAAO,EAAE,CAAC,MAAgB,EAAE,EAAE;YAC7B,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC;YAC/C,IAAI,CAAC,IAAI;gBAAE,MAAM,IAAI,KAAK,CAAC,gBAAgB,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YAChE,OAAO,IAAI,CAAC;QACb,CAAC;KACD,CAAC,CAAC;AACJ,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG,CAAC,IAAU,EAAE,UAAkC,EAAE,EAA4B,EAAE;IACrH,MAAM,WAAW,GAAG,IAAI,GAAG,EAAuB,CAAC;IACnD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC/B,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,sBAAsB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;IAChF,CAAC;IACD,OAAO,WAAW,CAAC;AACpB,CAAC,CAAC"}
+{"version":3,"file":"mesh-harness.js","sourceRoot":"","sources":["../../../src/testing/mesh-harness.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,EAAE,aAAa,EAAE,aAAa,EAA6F,MAAM,4BAA4B,CAAC;AACrK,OAAO,EAAE,oBAAoB,EAAE,MAAM,+BAA+B,CAAC;AACrE,OAAO,EAAE,oBAAoB,EAAyD,MAAM,8BAA8B,CAAC;AAC3H,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AACzD,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAChE,OAAO,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAG3D,OAAO,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,6BAA6B,CAAC;AAC/E,OAAO,EAAE,eAAe,EAAuD,MAAM,6BAA6B,CAAC;AAEnH,OAAO,EAAE,mBAAmB,EAAkB,MAAM,8BAA8B,CAAC;AACnF,OAAO,EAAE,QAAQ,IAAI,UAAU,EAAE,MAAM,aAAa,CAAC;AAqGrD,MAAM,eAAe;IACpB,KAAK,CAAC,OAAO,CAAC,OAAe,EAAE,SAAiB;QAC/C,OAAO,EAAE,CAAC;IACX,CAAC;CACD;AAED;;;;GAIG;AACH,MAAM,kBAAkB;IAEL;IACA;IACA;IAHlB,YACkB,KAAiB,EACjB,eAAuB,EACvB,WAA8B,EAAE;QAFhC,UAAK,GAAL,KAAK,CAAY;QACjB,oBAAe,GAAf,eAAe,CAAQ;QACvB,aAAQ,GAAR,QAAQ,CAAwB;IAC/C,CAAC;IAEJ,KAAK,CAAC,eAAe,CAAC,GAAe,EAAE,OAAyC;QAC/E,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,OAAO,EAAE,aAAa,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAChF,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC1C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAClE,IAAI,CAAC,IAAI,EAAE,CAAC;YACX,MAAM,IAAI,KAAK,CAAC,4DAA4D,CAAC,CAAC;QAC/E,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAC;IACpB,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,GAAe;QAChC,IAAI,IAAI,CAAC,QAAQ,CAAC,gBAAgB,EAAE,CAAC;YACpC,OAAO,EAAkB,CAAC;QAC3B,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,eAAe,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QACxD,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEpC,MAAM,KAAK,GAAiB,EAAE,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG;gBAC/B,UAAU,EAAE,CAAC,yBAAyB,CAAC;gBACvC,SAAS,EAAE,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,SAAU,CAAC,GAAG,EAAE,WAAW,CAAC;aAC9D,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAEO,gBAAgB,CAAC,GAAe;QACvC,MAAM,UAAU,GAAgB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACpD,EAAE,EAAE,CAAC,CAAC,MAAM;YACZ,KAAK,EAAE,CAAC,yBAAyB,CAAC;SAClC,CAAC,CAAC,CAAC;QACJ,MAAM,MAAM,GAAG,mBAAmB,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;QACpD,OAAO,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAE,CAAC,CAAC;IACxE,CAAC;CACD;AAQD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,gBAAgB,GAAG,CAAC,KAAiB,EAAE,UAAkB,EAAE,QAA2B,EAAE,EAAE,CAC/F,KAAK,EAAE,SAAiB,EAAE,OAAgB,EAAqC,EAAE;IAChF,IAAI,SAAS,KAAK,UAAU;QAAE,OAAO,SAAS,CAAC;IAC/C,IAAI,QAAQ,CAAC,WAAW,EAAE,GAAG,CAAC,SAAS,CAAC;QAAE,OAAO,SAAS,CAAC;IAC3D,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,SAAS,CAAC,CAAC;IAClE,IAAI,CAAC,MAAM;QAAE,OAAO,SAAS,CAAC;IAC9B,OAAO,MAAM,iBAAiB,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;AAC7D,CAAC,CAAC;AAEH;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,OAAoB;IACrD,OAAO,oBAAoB,CAAC;QAC3B,WAAW,EAAE,OAAO,CAAC,WAAW;QAChC,aAAa,EAAE;YACd,GAAG,OAAO,CAAC,aAAa;YACxB,sBAAsB,EAAE,OAAO,CAAC,aAAa,EAAE,sBAAsB,IAAI,OAAO,CAAC,sBAAsB;YACvG,aAAa,EAAE,OAAO,CAAC,aAAa,EAAE,aAAa,IAAI,OAAO,CAAC,oBAAoB;YACnF,2FAA2F;YAC3F,4FAA4F;YAC5F,wEAAwE;YACxE,iGAAiG;YACjG,wFAAwF;YACxF,4FAA4F;YAC5F,yFAAyF;YACzF,WAAW;SACX;KACD,CAAC,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,SAAiB,EAAE,OAAoB;IACvE,oFAAoF;IACpF,+FAA+F;IAC/F,+FAA+F;IAC/F,gGAAgG;IAChG,+FAA+F;IAC/F,6FAA6F;IAC7F,MAAM,QAAQ,GAAsB,EAAE,CAAC;IAEvC,4FAA4F;IAC5F,6FAA6F;IAC7F,8FAA8F;IAC9F,8FAA8F;IAC9F,4CAA4C;IAC5C,EAAE;IACF,2FAA2F;IAC3F,wEAAwE;IACxE,MAAM,MAAM,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC;IAE1C,mCAAmC;IACnC,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,GAAG,CACjC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,KAAK,IAAI,EAAE;QAC5C,MAAM,UAAU,GAAG,MAAM,eAAe,CAAC,SAAS,CAAC,CAAC;QACpD,OAAO,EAAE,MAAM,EAAE,oBAAoB,CAAC,UAAU,CAAC,EAAE,UAAU,EAAE,CAAC;IACjE,CAAC,CAAC,CACF,CAAC;IAEF,kFAAkF;IAClF,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,MAAM,WAAW,GAAG,IAAI,eAAe,EAAE,CAAC;IAC1C,iGAAiG;IACjG,4FAA4F;IAC5F,6FAA6F;IAC7F,8FAA8F;IAC9F,6EAA6E;IAC7E,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkC,CAAC;IAElE,+FAA+F;IAC/F,iGAAiG;IACjG,kGAAkG;IAClG,oFAAoF;IACpF,MAAM,UAAU,GAAG,IAAI,kBAAkB,CAAC,KAAK,EAAE,OAAO,CAAC,eAAe,EAAE,QAAQ,CAAC,CAAC;IAEpF;;;;;;;;;OASG;IACH,MAAM,kBAAkB,GAAG,CAAC,UAAkB,EAAe,EAAE;QAC9D,MAAM,OAAO,GAAG,UAAU,CAAC,QAAQ,EAAE,CAAC;QACtC,OAAO;YACN,eAAe,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,eAAe,CAAC,GAAG,EAAE,IAAI,CAAC;YACrE,KAAK,CAAC,WAAW,CAAC,GAAG;gBACpB,MAAM,KAAK,GAAG,MAAM,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;gBAChD,MAAM,IAAI,GAAG,QAAQ,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;gBAChE,IAAI,IAAI,EAAE,CAAC;oBACV,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;wBACrC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;4BAAE,OAAO,KAAK,CAAC,EAAE,CAAC,CAAC;oBACrC,CAAC;gBACF,CAAC;gBACD,IAAI,CAAC,CAAC,OAAO,IAAI,KAAK,CAAC,EAAE,CAAC;oBACzB,KAAK,CAAC,OAAO,CAAC,GAAG;wBAChB,UAAU,EAAE,CAAC,yBAAyB,CAAC;wBACvC,SAAS,EAAE,UAAU,CAAC,UAAU,CAAC,SAAU,CAAC,GAAG,EAAE,WAAW,CAAC;qBAC7D,CAAC;gBACH,CAAC;gBACD,OAAO,KAAK,CAAC;YACd,CAAC;SACD,CAAC;IACH,CAAC,CAAC;IACF,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAAuB,CAAC;IAE5D,4CAA4C;IAC5C,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,QAAQ,EAAE,CAAC;QAC/C,MAAM,KAAK,GAAG,SAAS,EAAE,CAAC;QAC1B,MAAM,UAAU,GAAG,OAAO,CAAC,iBAAiB;YAC3C,CAAC,CAAC,OAAO,CAAC,iBAAiB,CAAC,KAAK,CAAC;YAClC,CAAC,CAAC,IAAI,gBAAgB,EAAE,CAAC;QAC1B,MAAM,WAAW,GAAG,IAAI,WAAW,CAClC,CAAC,OAAgB,EAAE,EAAE,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,UAAU,CAAC,CAC3D,CAAC;QAEF,4FAA4F;QAC5F,8FAA8F;QAC9F,8FAA8F;QAC9F,6FAA6F;QAC7F,8FAA8F;QAC9F,WAAW;QACX,MAAM,cAAc,GAAG,oBAAoB,CAAC;YAC3C,UAAU,EAAE,MAAM,CAAC,QAAQ,EAAE;YAC7B,YAAY,EAAE,gBAAgB,CAAC,KAAK,EAAE,MAAM,CAAC,QAAQ,EAAE,EAAE,QAAQ,CAAC;YAClE,wFAAwF;YACxF,yCAAyC;YACzC,mBAAmB,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,EAAE,CAC9D,WAAW,CAAC,mBAAmB,CAAC,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,aAAa,CAAC;YACvE,uBAAuB,EAAE,MAAM,CAAC,uBAAuB;YACvD,sBAAsB,EAAE,MAAM,CAAC,sBAAsB;YACrD,8BAA8B,EAAE,MAAM,CAAC,8BAA8B;SACrE,CAAC,CAAC;QACH,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,cAAc,CAAC,CAAC;QAEvD,MAAM,cAAc,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;QAClD,oBAAoB,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,cAAc,CAAC,CAAC;QAE5D,0FAA0F;QAC1F,sFAAsF;QACtF,0FAA0F;QAC1F,uDAAuD;QACvD,MAAM,QAAQ,GAAa;YAC1B,MAAM;YACN,UAAU;YACV,WAAW;YACX,aAAa,EAAE,SAAgB;YAC/B,eAAe,EAAE,SAAgB;SACjC,CAAC;QAEF,0FAA0F;QAC1F,4FAA4F;QAC5F,8FAA8F;QAC9F,8FAA8F;QAC9F,uDAAuD;QACvD,MAAM,qBAAqB,GAAkC,OAAO,CAAC,qBAAqB;YACzF,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,qBAAsB,CAAC,QAAQ,EAAE,OAAO,CAAC;YAChE,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC;gBACrB,KAAK,EAAE,MAAM,cAAc,CAAC,WAAW,CAAC,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE;gBAChF,UAAU,EAAE,OAAO,CAAC,cAAc,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC;aACnD,CAAC,CAAC;QAEJ,QAAQ,CAAC,aAAa,GAAG,aAAa,CAAC;YACtC,WAAW;YACX,WAAW;YACX,MAAM;YACN,UAAU;YACV,eAAe,EAAE,MAAM;YACvB,cAAc;YACd,qBAAqB;YACrB,8EAA8E;YAC9E,oEAAoE;YACpE,SAAS,EAAE,OAAO,CAAC,gBAAgB,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC;SACpD,CAAC,CAAC;QAEH,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACtB,CAAC;IAED,yFAAyF;IACzF,MAAM,mBAAmB,GAAG,CAAC,YAAoB,EAAY,EAAE;QAC9D,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC;QAC9D,IAAI,CAAC,MAAM,EAAE,CAAC;YACb,MAAM,IAAI,KAAK,CAAC,iBAAiB,YAAY,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAC7D,CAAC;QACD,OAAO;YACN,KAAK,CAAC,MAAM,CAAC,MAAqB;gBACjC,IAAI,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC;oBACzD,MAAM,IAAI,KAAK,CAAC,QAAQ,YAAY,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC;gBACnE,CAAC;gBACD,OAAO,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC5C,CAAC;SACD,CAAC;IACH,CAAC,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,8FAA8F;QAC9F,0FAA0F;QAC1F,+FAA+F;QAC/F,+FAA+F;QAC/F,+EAA+E;QAC/E,oEAAoE;QACpE,MAAM,qBAAqB,GAA0B,KAAK,EAAE,MAAc,EAAE,OAAgB,EAAE,OAAQ,EAA2C,EAAE;YAClJ,sFAAsF;YACtF,sFAAsF;YACtF,wFAAwF;YACxF,IAAI,QAAQ,CAAC,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC;gBAClD,MAAM,IAAI,KAAK,CAAC,QAAQ,MAAM,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;YACxD,CAAC;YACD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YACxD,IAAI,CAAC,MAAM;gBAAE,OAAO,SAAS,CAAC;YAC9B,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,WAAW,CAAC,GAAG,CAC1C,EAAE,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,EAChC,EAAE,gBAAgB,EAAE,IAAI,EAAS,CACjC,CAAC;YACF,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC;YAC9C,IAAI,CAAC,MAAM;gBAAE,OAAO,SAAS,CAAC;YAC9B,sFAAsF;YACtF,sFAAsF;YACtF,yFAAyF;YACzF,uFAAuF;YACvF,qFAAqF;YACrF,8DAA8D;YAC9D,MAAM,KAAK,GAAG,MAAM,aAAa,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;YACvE,OAAO,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;QAC9C,CAAC,CAAC;QACF,2FAA2F;QAC3F,2EAA2E;QAC3E,iCAAiC;QACjC,MAAM,cAAc,GAAG,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAE,CAAC;QACzE,MAAM,OAAO,GAAG,eAAe,CAC9B,cAAc,EACd,mBAAmB;QACnB,2EAA2E;QAC3E,wEAAwE;QACxE,uFAAuF;QACvF,uFAAuF;QACvF,kFAAkF;QAClF,4DAA4D;QAC5D,EAAE,GAAG,MAAM,EAAE,CACb,CAAC;QACF,IAAI,CAAC,eAAe,GAAG,OAAO,CAAC;YAC9B,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,YAAY,EAAE,IAAI,CAAC,aAAa;YAChC,WAAW,EAAE,IAAI,CAAC,MAAM;YACxB,qBAAqB;YACrB,uFAAuF;YACvF,mFAAmF;YACnF,sBAAsB,EAAE,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAE;SACpE,CAAC,CAAC;IACJ,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC;AACxC,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CAAC,IAAU,EAAE,OAAe;IACpE,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;IACpF,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,MAAM,CAAC,CAAC,CAAC;AACvE,CAAC;AAOD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,IAAU,EAAE,UAAkC,EAAE,EAAe,EAAE;IACvG,MAAM,UAAU,GAAG,IAAI,GAAG,EAAiB,CAAC;IAC5C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC/B,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,eAAmC,CAAC,CAAC;IAClF,CAAC;IACD,OAAO,IAAI,iBAAiB,CAAC;QAC5B,SAAS,EAAE,OAAO,CAAC,SAAS,IAAI,KAAK;QACrC,sBAAsB,EAAE,OAAO,CAAC,sBAAsB,IAAI,KAAK;QAC/D,UAAU,EAAE,IAAI,CAAC,UAAU;QAC3B,OAAO,EAAE,CAAC,MAAgB,EAAE,EAAE;YAC7B,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC;YAC/C,IAAI,CAAC,IAAI;gBAAE,MAAM,IAAI,KAAK,CAAC,gBAAgB,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YAChE,OAAO,IAAI,CAAC;QACb,CAAC;KACD,CAAC,CAAC;AACJ,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG,CAAC,IAAU,EAAE,UAAkC,EAAE,EAA4B,EAAE;IACrH,MAAM,WAAW,GAAG,IAAI,GAAG,EAAuB,CAAC;IACnD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC/B,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,sBAAsB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;IAChF,CAAC;IACD,OAAO,WAAW,CAAC;AACpB,CAAC,CAAC"}

package/dist/src/testing/raw-storage-conformance.d.ts

@@ -1,3 +1,4 @@
+import type { BlockCommitProof } from '../cluster/commit-proof.js';
 import type { IRawStorage } from '../storage/i-raw-storage.js';
 /**
  * What `makeStorage` hands each conformance case: a fresh `IRawStorage` and a
@@ -8,6 +9,13 @@ export interface ConformanceHarness {
     storage: IRawStorage;
     cleanup: () => Promise<void>;
 }
+/**
+ * A structurally-valid {@link BlockCommitProof} carrying a recognizable marker. Storage-level
+ * suites never VERIFY a proof (that is `commit-proof.spec.ts`); they only assert the proofs
+ * store round-trips a proof-shaped object and keeps it in its own keyspace, so the votes are
+ * deliberately empty. Exported so every proofs-store suite shares one shape.
+ */
+export declare const makeProof: (marker: string) => BlockCommitProof;
 /**
  * Registers a `describe(name, ...)` block asserting that a raw-storage backend
  * behaves identically to every other backend. This is the ONE maintained parity

package/dist/src/testing/raw-storage-conformance.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"raw-storage-conformance.d.ts","sourceRoot":"","sources":["../../../src/testing/raw-storage-conformance.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAK/D;;;;GAIG;AACH,MAAM,WAAW,kBAAkB;IAClC,OAAO,EAAE,WAAW,CAAC;IACrB,OAAO,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC;CAC7B;AAyBD;;;;;;;;;;;;GAYG;AACH,wBAAgB,wBAAwB,CACvC,IAAI,EAAE,MAAM,EACZ,WAAW,EAAE,MAAM,OAAO,CAAC,kBAAkB,CAAC,GAC5C,IAAI,CA4YN"}
+{"version":3,"file":"raw-storage-conformance.d.ts","sourceRoot":"","sources":["../../../src/testing/raw-storage-conformance.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AACnE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAM/D;;;;GAIG;AACH,MAAM,WAAW,kBAAkB;IAClC,OAAO,EAAE,WAAW,CAAC;IACrB,OAAO,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC;CAC7B;AAmBD;;;;;GAKG;AACH,eAAO,MAAM,SAAS,GAAI,QAAQ,MAAM,KAAG,gBASzC,CAAC;AAQH;;;;;;;;;;;;GAYG;AACH,wBAAgB,wBAAwB,CACvC,IAAI,EAAE,MAAM,EACZ,WAAW,EAAE,MAAM,OAAO,CAAC,kBAAkB,CAAC,GAC5C,IAAI,CAyeN"}