@platforma-open/platforma-open.titeseq-analysis 2.3.1 → 2.5.0

package/dist/index.js

@@ -1,4 +1,23 @@
 import { r as __toESM, t as __commonJSMin } from "./rolldown-runtime-DC62tzP2.js";
+//#region ../model/dist/fitSettings.js
+/** The read coverage both equations require, at the values each fit used on its own. */
+const READ_COVERAGE_DEFAULTS = {
+	minReadsPerConcentration: 3,
+	minConcentrationPoints: 5
+};
+/** The settings only `hill_gate_index` reads, at the values the block shipped through 2.4.0. */
+const HILL_GATE_INDEX_DEFAULTS = {
+	r2ThresholdGood: .8,
+	r2ThresholdFailed: .5,
+	nMin: .5,
+	nMax: 2,
+	hookEffectThresholdBin: .2,
+	hookEffectThresholdNoBin: .02,
+	hookEffectMinReads: 20
+};
+/** Adams 2016's floor, two thirds of the gate range, to three decimals. */
+const DEFAULT_PLATEAU_FLOOR = .667;
+//#endregion
 //#region ../model/dist/templateParams.js
 /**
 * What a project template carries out of a configured block — the mirror image of
@@ -11,11 +30,23 @@ import { r as __toESM, t as __commonJSMin } from "./rolldown-runtime-DC62tzP2.js
 function deriveTemplateParams(data) {
 	return {
 		abundanceRef: data.abundanceRef,
+		filterRef: data.filterRef,
 		concentrationColumnRef: data.concentrationColumnRef,
 		binColumnRef: data.binColumnRef,
 		antigenColumnRef: data.antigenColumnRef,
 		sortFractionColumnRef: data.sortFractionColumnRef,
+		binFluorescenceColumnRef: data.binFluorescenceColumnRef,
 		targetAntigen: data.targetAntigen,
+		equation: data.equation,
+		plateauFloor: data.plateauFloor,
+		r2GateMin: data.r2GateMin,
+		kdSeGateMax: data.kdSeGateMax,
+		requireAllConcentrations: data.requireAllConcentrations,
+		replicateColumnRef: data.replicateColumnRef,
+		replicateErrorModel: data.replicateErrorModel,
+		replicateFitErrorCutoff: data.replicateFitErrorCutoff,
+		replicateR2Floor: data.replicateR2Floor,
+		replicateCensoredMajority: data.replicateCensoredMajority,
 		minReadsPerConcentration: data.minReadsPerConcentration,
 		minConcentrationPoints: data.minConcentrationPoints,
 		r2ThresholdGood: data.r2ThresholdGood,
@@ -31,7 +62,7 @@ function deriveTemplateParams(data) {
 //#endregion
 //#region ../kind/dist/package.js
 var name = "@platforma-open/platforma-open.titeseq-analysis.kind";
-var version$1 = "1.0.0";
+var version$1 = "1.2.0";
 //#endregion
 //#region ../node_modules/.pnpm/@platforma-sdk+block-kind@1.1.0/node_modules/@platforma-sdk/block-kind/dist/params.js
 /**
@@ -123,14 +154,14 @@ function defineBlockKind(meta) {
 	});
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/plugin_handle.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/plugin_handle.js
 const PLUGIN_OUTPUT_PREFIX = "plugin-output#";
 /** Construct the output key for a plugin output in the block outputs map. */
 function pluginOutputKey(handle, outputKey) {
 	return `${PLUGIN_OUTPUT_PREFIX}${handle}#${outputKey}`;
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/block_storage.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/block_storage.js
 /**
 * Discriminator key for BlockStorage format detection.
 * This unique hash-based key identifies data as BlockStorage vs legacy formats.
@@ -3947,7 +3978,7 @@ objectType({
 	content: stringType()
 });
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/bmodel/block_kind_ref.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/bmodel/block_kind_ref.js
 /**
 * Compose a {@link BlockKindReference} from a kind's `name`/`version`.
 *
@@ -3963,7 +3994,7 @@ objectType({
 	to: numberType().min(1)
 });
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/util.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/util.js
 function assertNever(x) {
 	throw new Error("Unexpected object: " + x);
 }
@@ -3975,7 +4006,7 @@ function uniqueBy(array, makeId) {
 	return [...new Map(array.map((e) => [makeId(e), e])).values()];
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/data_info.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/data_info.js
 /**
 * Type guard function that checks if the given value is a valid DataInfo.
 *
@@ -4164,7 +4195,7 @@ function entriesToDataInfo(dataInfoEntries) {
 	}
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/errors.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/errors.js
 var ServiceError = class extends Error {
 	name = "ServiceError";
 };
@@ -4188,7 +4219,7 @@ function ensureError(value) {
 	return new Error(stringifyValue(value));
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/json.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/json.js
 var import_canonicalize = /* @__PURE__ */ __toESM((/* @__PURE__ */ __commonJSMin(((exports, module) => {
 	module.exports = function serialize(object) {
 		if (typeof object === "number" && isNaN(object)) throw new Error("NaN is not allowed");
@@ -4221,7 +4252,7 @@ function parseJsonSafely(value, fallback) {
 	}
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/spec/spec.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/spec/spec.js
 function readMetadata(metadata, key) {
 	return metadata?.[key];
 }
@@ -4549,7 +4580,7 @@ function matchAxisId(query, target) {
 	return query.name === target.name && matchDomain$1(query.domain, target.domain) && matchDomain$1(query.contextDomain, target.contextDomain);
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/query/utils.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/query/utils.js
 const BOOLEAN_TYPES = /* @__PURE__ */ new Set([
 	"numericComparison",
 	"stringEquals",
@@ -4654,7 +4685,7 @@ function collectSpecQueryColumns(query) {
 	return result;
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/table_calculate.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/table_calculate.js
 function mapPTableDef(def, cb) {
 	return {
 		...def,
@@ -4697,7 +4728,7 @@ function mapJoinEntry(entry, cb) {
 	}
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/table_common.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/table_common.js
 function getPTableColumnId(spec) {
 	switch (spec.type) {
 		case "axis": return {
@@ -4711,7 +4742,7 @@ function getPTableColumnId(spec) {
 	}
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/spec/filtered_column.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/spec/filtered_column.js
 function stringifyColumnFilteredId(key) {
 	return canonicalizeJson(createColumnFilteredKey(key));
 }
@@ -4744,7 +4775,7 @@ function applyAxisFilters(spec, axisFilters) {
 	};
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/pool/spec.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/pool/spec.js
 function isPObjectId(value) {
 	if (typeof value !== "string") return false;
 	return isPObjectKey(parseJsonSafely(value));
@@ -4779,6 +4810,10 @@ function isGlobalPObjectKey(value) {
 	if (typeof value !== "object" || value === null) return false;
 	return "__isRef" in value && "blockId" in value && "name" in value;
 }
+function isGlobalPObjectId(value) {
+	if (typeof value !== "string") return false;
+	return isGlobalPObjectKey(parseJsonSafely(value));
+}
 function isPObject(obj) {
 	return typeof obj === "object" && obj !== null && "id" in obj && "spec" in obj && "data" in obj;
 }
@@ -4827,7 +4862,7 @@ function extractAllColumns(entry) {
 	return [...columns.values()];
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+helpers@1.14.5/node_modules/@milaboratories/helpers/dist/utils.js
+//#region ../node_modules/.pnpm/@milaboratories+helpers@1.14.6/node_modules/@milaboratories/helpers/dist/utils.js
 function isNil$1(v) {
 	return v === null || v === void 0;
 }
@@ -4860,13 +4895,13 @@ function isPlainObject$1(value) {
 	return prototype === null || prototype === Object.prototype || Object.getPrototypeOf(prototype) === null;
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+helpers@1.14.5/node_modules/@milaboratories/helpers/dist/error.js
+//#region ../node_modules/.pnpm/@milaboratories+helpers@1.14.6/node_modules/@milaboratories/helpers/dist/error.js
 function throwError(v) {
 	if (typeof v === "string") throw new Error(v);
 	else throw v;
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/spec/discovered_column.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/spec/discovered_column.js
 function isColumnDiscoveredKey(obj) {
 	return typeof obj === "object" && obj !== null && "__isDiscovered" in obj;
 }
@@ -4941,7 +4976,7 @@ function isString$1(value) {
 	return typeof value === "string";
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/spec/ids.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/spec/ids.js
 /**
 * Canonically serializes a column key to a branded string id. Accepts both
 * the new {@link ColumnUniversalKey} and the deprecated {@link UniversalPColumnId}
@@ -5115,7 +5150,7 @@ function extractPObjectId(id) {
 	throw new Error(`extractPObjectId: unrecognized column id structure: ${JSON.stringify(id)}`);
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/spec/overridden.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/spec/overridden.js
 function isColumnOverriddenKey(obj) {
 	return typeof obj === "object" && obj !== null && "__isOverridden" in obj;
 }
@@ -5237,7 +5272,7 @@ function mergeRecord(a, b) {
 	};
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/spec/anchored.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/spec/anchored.js
 function axisKey(axis) {
 	return (0, import_canonicalize.default)(getAxisId(axis));
 }
@@ -5483,7 +5518,7 @@ function isAnchorAxisRef(value) {
 	return typeof value === "object" && "anchor" in value;
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/spec/selectors.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/spec/selectors.js
 /**
 * Determines if an axis ID matches an axis selector.
 *
@@ -5563,8 +5598,53 @@ function legacyColumnSelectorsToPredicate(predicateOrSelectors) {
 	if (Array.isArray(predicateOrSelectors)) return (spec) => predicateOrSelectors.some((selector) => isPColumnSpec(spec) && matchPColumn(spec, selector));
 	else return (spec) => isPColumnSpec(spec) && matchPColumn(spec, predicateOrSelectors);
 }
+function matchString(matcher, value) {
+	return matcher.type === "exact" ? value === matcher.value : new RegExp(matcher.value).test(value);
+}
+function matchMatcherMap(map, target) {
+	const t = target ?? {};
+	for (const [key, matchers] of Object.entries(map)) {
+		const v = t[key];
+		if (v === void 0) return false;
+		if (!matchers.some((m) => matchString(m, v))) return false;
+	}
+	return true;
+}
+function matchMultiAxis(selector, axis) {
+	if (selector.type !== void 0 && !selector.type.includes(axis.type)) return false;
+	if (selector.name !== void 0 && !selector.name.some((m) => matchString(m, axis.name))) return false;
+	if (selector.domain !== void 0 && !matchMatcherMap(selector.domain, axis.domain)) return false;
+	if (selector.contextDomain !== void 0 && !matchMatcherMap(selector.contextDomain, axis.contextDomain)) return false;
+	return true;
+}
+/** Match a {@link PColumnSpec} against a {@link MultiColumnSelector}. */
+function matchMultiColumnSelector(spec, selector) {
+	if (selector.type !== void 0 && !selector.type.includes(spec.valueType)) return false;
+	if (selector.name !== void 0 && !selector.name.some((m) => matchString(m, spec.name))) return false;
+	if (selector.domain !== void 0 && !matchMatcherMap(selector.domain, spec.domain)) return false;
+	if (selector.contextDomain !== void 0 && !matchMatcherMap(selector.contextDomain, spec.contextDomain)) return false;
+	if (selector.annotations !== void 0 && !matchMatcherMap(selector.annotations, spec.annotations)) return false;
+	if (selector.axes !== void 0) {
+		const columnAxes = spec.axesSpec.map(getAxisId);
+		if (selector.partialAxesMatch ?? true) {
+			for (const axisSelector of selector.axes) if (!columnAxes.some((axis) => matchMultiAxis(axisSelector, axis))) return false;
+		} else {
+			if (columnAxes.length !== selector.axes.length) return false;
+			for (let i = 0; i < selector.axes.length; i++) if (!matchMultiAxis(selector.axes[i], columnAxes[i])) return false;
+		}
+	}
+	return true;
+}
+/**
+* Convert a {@link MultiColumnSelector} (or array; selectors OR-ed) to a predicate.
+* Non-PColumn specs always return false.
+*/
+function multiColumnSelectorsToPredicate(selectors) {
+	const arr = Array.isArray(selectors) ? selectors : [selectors];
+	return (spec) => isPColumnSpec(spec) && arr.some((sel) => matchMultiColumnSelector(spec, sel));
+}
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/spec/native_id.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/spec/native_id.js
 function deriveNativeId(spec) {
 	const result = {
 		kind: spec.kind,
@@ -5576,7 +5656,7 @@ function deriveNativeId(spec) {
 	return (0, import_canonicalize.default)(result);
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/linker_columns.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/drivers/pframe/linker_columns.js
 var LinkerMap = class LinkerMap {
 	/** Graph of linkers connected by axes (single or grouped by parents) */
 	data;
@@ -5753,7 +5833,7 @@ var LinkerMap = class LinkerMap {
 	}
 };
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/flags/block_flags.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/flags/block_flags.js
 /**
 * Required PFrames version. Bump this in lockstep with the `@milaboratories/pframes-rs-*`
 * version in `pnpm-workspace.yaml` so blocks built against the new SDK refuse to load on
@@ -5795,12 +5875,21 @@ function withEnrichments(ref, requireEnrichments = true) {
 		return rest;
 	}
 }
+function createEnrichmentRef(hit, options = {}) {
+	const { path, qualifications } = options;
+	return {
+		__isEnrichment: "v1",
+		hit,
+		...path !== void 0 && path.length > 0 ? { path } : {},
+		...qualifications !== void 0 && qualifications.length > 0 ? { qualifications } : {}
+	};
+}
 /** Compare two PlRefs and returns true if they are qual */
 function plRefsEqual(ref1, ref2, ignoreEnrichments = false) {
 	return ref1.blockId === ref2.blockId && ref1.name === ref2.name && (ignoreEnrichments || ref1.requireEnrichments === ref2.requireEnrichments);
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/value_or_error.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/value_or_error.js
 function mapValueInVOE(voe, cb) {
 	return voe.ok ? {
 		ok: true,
@@ -5808,7 +5897,7 @@ function mapValueInVOE(voe, cb) {
 	} : voe;
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/resource_types.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/resource_types.js
 /** Well-known resource type names used across the platform. */
 const ResourceTypeName = {
 	StreamManager: "StreamManager",
@@ -5824,6 +5913,7 @@ const ResourceTypeName = {
 	BlobMap: "BlobMap",
 	BResolveSingle: "BResolveSingle",
 	BResolveSingleNoResult: "BResolveSingleNoResult",
+	BResolveChoice: "BResolveChoice",
 	BQueryResult: "BQueryResult",
 	TengoTemplate: "TengoTemplate",
 	TengoLib: "TengoLib",
@@ -5835,9 +5925,13 @@ const ResourceTypeName = {
 	JsonString: "json/string",
 	JsonArray: "json/array",
 	JsonNumber: "json/number",
+	JsonBool: "json/bool",
+	JsonNull: "json/null",
+	JsonErrorTrace: "json/errorTrace",
 	BContextEnd: "BContextEnd",
 	FrontendFromUrl: "Frontend/FromUrl",
 	FrontendFromFolder: "Frontend/FromFolder",
+	FrontendFromLocalTgz: "Frontend/FromLocalTgz",
 	BObjectSpec: "BObjectSpec",
 	Blob: "Blob",
 	Null: "Null",
@@ -5852,7 +5946,7 @@ const ResourceTypeName = {
 	SharedEnvelope: "SharedEnvelope"
 };
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/services/service_types.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/services/service_types.js
 const SERVICE_ID_PATTERN = /^[a-zA-Z][a-zA-Z0-9]*$/;
 const { service, isNodeService, isWasmService, isMainService, getServiceKind, getServiceModelMethods, getServiceUiMethods } = (() => {
 	const typeMap = /* @__PURE__ */ new Map();
@@ -5891,7 +5985,7 @@ const { service, isNodeService, isWasmService, isMainService, getServiceKind, ge
 	};
 })();
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/services/service_declarations.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/services/service_declarations.js
 const Services = {
 	PFrameSpec: service()({
 		type: "wasm",
@@ -5985,7 +6079,7 @@ function resolveRequiredServices(flags) {
 }
 Object.fromEntries(Object.keys(Services).map((key) => [`requires${key}`, true]));
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/services/service_injectors.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/services/service_injectors.js
 function buildMethodMap(pick) {
 	const result = {};
 	for (const id of Object.values(Services)) result[id] = [...pick(id)];
@@ -5994,7 +6088,7 @@ function buildMethodMap(pick) {
 buildMethodMap(getServiceUiMethods);
 buildMethodMap(getServiceModelMethods);
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/columns/accessor_traversal.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/columns/accessor_traversal.js
 /** Resource types that hold column collections — DFS stops here and collects. */
 const COLLECT_TYPES = [ResourceTypeName.PFrame];
 /** Resource types DFS descends through when looking for PFrames. */
@@ -6102,7 +6196,7 @@ function indexPoolBlock(block) {
 	return result;
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/columns/column_registry.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/columns/column_registry.js
 /**
 * Id-index over a set of {@link ColumnEntriesProvider}s. Sole job:
 * {@link PObjectId} → {@link LeafEntry}. Generic over the accessor flavour, so
@@ -6139,7 +6233,7 @@ var ColumnRegistry = class {
 	}
 };
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/columns/dedup.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/columns/dedup.js
 /**
 * Two-track dedup over an item stream keyed by `ColumnUniversalId`:
 *
@@ -6180,7 +6274,7 @@ function dedupColumns(items, getId, getSpec) {
 	return out;
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/columns/providers.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/columns/providers.js
 /**
 * Generic entries provider over a single accessor root. Walks `<root>` once
 * from the supplied `rootPath`, builds an id → {@link LeafEntry} map and
@@ -6237,7 +6331,7 @@ var ResultPoolEntriesProvider = class {
 	}
 };
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/template/template_ref_form.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/template/template_ref_form.js
 /**
 * Whether `value` is a reference in the readable spelling.
 *
@@ -6306,7 +6400,7 @@ function expandTemplatePlRef(ref) {
 	};
 }
 //#endregion
-//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.51.0/node_modules/@milaboratories/pl-model-common/dist/template/template_relocate.js
+//#region ../node_modules/.pnpm/@milaboratories+pl-model-common@1.54.1/node_modules/@milaboratories/pl-model-common/dist/template/template_relocate.js
 /**
 * Point every column identifier in a block's params at the blocks of the project being built.
 *
@@ -6366,7 +6460,7 @@ function relocateBlockIds(params, blockIds) {
 	return walk(params);
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/block_migrations.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/block_migrations.js
 /** Create a DataVersioned wrapper with correct shape */
 function makeVersionedData(version, data) {
 	return {
@@ -6678,9 +6772,10 @@ var DataModelInitialChain = class extends DataModelMigrationChain {
 			if (data !== null && typeof data === "object" && "args" in data) return fn(data);
 			return data;
 		};
+		const initialVersion = this.versionChain[0];
 		const step = {
 			fromVersion: DATA_MODEL_LEGACY_VERSION,
-			toVersion: this.versionChain[0],
+			toVersion: initialVersion,
 			migrate: wrappedFn
 		};
 		return new DataModelMigrationChainWithRecover({
@@ -6944,7 +7039,7 @@ var DataModel = class DataModel {
 	}
 };
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/internal.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/internal.js
 /** Utility code helping to identify whether the code is running in actual UI environment */
 function isInUI() {
 	return typeof globalThis.getPlatforma !== "undefined" || typeof globalThis.platforma !== "undefined";
@@ -7014,7 +7109,7 @@ function registerFutureAwait(handle, onResolve) {
 	futureResolves.get(handle).push(onResolve);
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/block_storage_facade.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/block_storage_facade.js
 /**
 * All facade callback names as constants.
 * These are the source of truth - the interface is derived from these.
@@ -7052,7 +7147,7 @@ function registerFacadeCallbacks(callbacks) {
 	for (const key of Object.values(BlockStorageFacadeCallbacks)) tryRegisterCallback(key, callbacks[key]);
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/services/block_services.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/services/block_services.js
 /**
 * Services required by all V3 blocks by default.
 * Edit this when a new service should be available to all blocks.
@@ -7068,7 +7163,7 @@ const BLOCK_SERVICE_FLAGS = {
 };
 resolveRequiredServices(BLOCK_SERVICE_FLAGS);
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/render/future.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/render/future.js
 var FutureRef = class FutureRef {
 	handle;
 	postProcess;
@@ -7096,7 +7191,7 @@ var FutureRef = class FutureRef {
 	}
 };
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/render/accessor.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/render/accessor.js
 function ifDef(value, cb) {
 	return value === void 0 ? void 0 : cb(value);
 }
@@ -7346,11 +7441,11 @@ var TreeNodeAccessor = class TreeNodeAccessor {
 	}
 };
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/render/internal.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/render/internal.js
 const MainAccessorName = "main";
 const StagingAccessorName = "staging";
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/render/util/axis_filtering.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/render/util/axis_filtering.js
 function filterDataInfoEntries(dataInfoEntries, axisFilters) {
 	const sortedFilters = [...axisFilters].sort((a, b) => b[0] - a[0]);
 	const { type } = dataInfoEntries;
@@ -7414,7 +7509,7 @@ function filterDataInfoEntries(dataInfoEntries, axisFilters) {
 	}
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/labels/linked_column_postfix.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/labels/linked_column_postfix.js
 /**
 * Structural postfix derivation for linked columns (phase 2 of `deriveDistinctLabels`).
 *
@@ -7586,7 +7681,10 @@ function resolveGroup(entries, indices, format) {
 * linked columns by the difference between their sources.
 */
 function derivePostfixes(entries, format = defaultLinkerFormatter) {
-	const postfix = [...entries.reduce((acc, e, idx) => acc.set(e.stem, [...acc.get(e.stem) ?? [], idx]), /* @__PURE__ */ new Map()).values()].reduce((acc, idxs) => {
+	const postfix = [...entries.reduce((acc, e, idx) => {
+		const key = `${e.stem}\u0000${e.marker ?? ""}`;
+		return acc.set(key, [...acc.get(key) ?? [], idx]);
+	}, /* @__PURE__ */ new Map()).values()].reduce((acc, idxs) => {
 		if (idxs.length < 2) return acc;
 		const resolved = resolveGroup(idxs.map((i) => entries[i]), idxs, format);
 		return idxs.reduce((m, i, k) => m.set(i, resolved[k]), acc);
@@ -7597,7 +7695,7 @@ function derivePostfixes(entries, format = defaultLinkerFormatter) {
 	});
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/labels/derive_distinct_labels.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/labels/derive_distinct_labels.js
 const DISTANCE_PENALTY = .001;
 const LABEL_TYPE = "__LABEL__";
 const LABEL_TYPE_FULL = "__LABEL__@1";
@@ -7619,9 +7717,10 @@ function isSyntheticType(t) {
 function deriveDistinctLabels(values, options = {}) {
 	const stems = deriveStems(values, options);
 	return derivePostfixes(values.map((v, i) => {
-		const { spec, linkerPath } = extractEntryParts(v);
+		const { spec, linkerPath, marker } = extractEntryParts(v);
 		return {
 			stem: stems[i],
+			marker,
 			hit: spec,
 			linkers: (linkerPath ?? []).map((s) => s.spec)
 		};
@@ -7639,6 +7738,7 @@ function deriveStems(values, options) {
 	if (labelForced) forcedSet.add(LABEL_TYPE_FULL);
 	const { mainTypes, secondaryTypes } = classifyTypes(stats, values.length);
 	const build = (typeSet, force) => buildLabels(records, typeSet, forceTraceElements, separator, force);
+	const finalize = (minimized, rendered) => repairBareLabels(rendered, minimized, records, stats, forceTraceElements, separator);
 	if (mainTypes.length === 0) {
 		if (secondaryTypes.length !== 0) throw new Error("Non-empty secondary types list while main types list is empty.");
 		return build(/* @__PURE__ */ new Set([LABEL_TYPE_FULL]), true) ?? throwError("Failed to derive labels using native column labels");
@@ -7652,7 +7752,7 @@ function deriveStems(values, options) {
 		const candidateResult = build(currentSet, false);
 		if (candidateResult !== void 0 && countUniqueLabels(candidateResult) === values.length) {
 			const minimized = minimizeTypeSet(currentSet, records, stats, forceTraceElements, forcedSet, separator);
-			return repairBareByPresence(build(minimized, false) ?? throwError("Failed to derive unique labels"), minimized, records, stats, forcedSet, forceTraceElements, separator);
+			return finalize(minimized, build(minimized, false) ?? throwError("Failed to derive unique labels"));
 		}
 		additionalType++;
 		if (additionalType >= mainTypes.length) {
@@ -7665,20 +7765,22 @@ function deriveStems(values, options) {
 		...mainTypes,
 		...secondaryTypes
 	]), records, stats, forceTraceElements, forcedSet, separator);
-	return repairBareByPresence(build(minimized, true) ?? throwError("Failed to derive unique labels"), minimized, records, stats, forcedSet, forceTraceElements, separator);
+	return finalize(minimized, build(minimized, true) ?? throwError("Failed to derive unique labels"));
 }
 function extractEntryParts(entry) {
 	if (!("spec" in entry && typeof entry.spec === "object")) return {
 		spec: entry,
 		extraTrace: void 0,
 		linkerPath: void 0,
-		qualifications: void 0
+		qualifications: void 0,
+		marker: void 0
 	};
 	return {
 		spec: entry.spec,
 		extraTrace: entry.extraTrace,
 		linkerPath: entry.linkerPath,
-		qualifications: entry.qualifications
+		qualifications: entry.qualifications,
+		marker: entry.marker
 	};
 }
 function formatQualification(q) {
@@ -7830,62 +7932,202 @@ function minimizeTypeSet(typeSet, records, stats, forceTraceElements, forcedSet,
 	}
 	return result;
 }
-const ABSENT_VALUE = "\0absent";
-/** Whether `fullType`'s rendered value differs across the group (absence counts as a value). */
-function typeDistinguishes(records, group, fullType) {
-	const values = /* @__PURE__ */ new Set();
-	for (const i of group) {
-		const ft = records[i].fullTrace.find((e) => e.fullType === fullType);
-		values.add(ft?.label ?? ABSENT_VALUE);
-		if (values.size > 1) return true;
-	}
-	return false;
-}
-/** The highest-importance trace type this row HAS (outside `typeSet`) that sets it apart from its
-*  group peers. `undefined` when the row carries nothing distinguishing of its own. */
-function bestDistinguishingType(records, group, row, typeSet, forcedSet, forceTraceElements, stats) {
-	return records[row].fullTrace.reduce((best, ft) => {
-		if (typeSet.has(ft.fullType) || forcedSet.has(ft.fullType) || forceTraceElements?.has(ft.type)) return best;
-		if (!typeDistinguishes(records, group, ft.fullType)) return best;
-		const imp = stats.importances.get(ft.fullType) ?? 0;
-		return best === void 0 || imp > best.imp ? {
-			type: ft.fullType,
-			imp
-		} : best;
-	}, void 0)?.type;
-}
-/**
-* Un-bare columns distinguished only "by absence". After minimization a column can end up with a
-* bare trace zone (only the forced native label) while a peer sharing that same base renders extra
-* tokens — the column reads as unique purely because it LACKS what the peer has. For each such bare
-* column this re-renders JUST that column's label with the highest-importance trace type it actually
-* carries that tells it apart from its peers, so every colliding column is distinguished by a token
-* it HAS rather than by omission.
-*
-* Patches individual labels rather than the shared type set on purpose: the set is global, so adding
-* a type there would also decorate unrelated columns in other groups that happen to carry it. Only
-* bare columns' labels grow (a superset of their previous value), so uniqueness is preserved. Groups
-* are keyed by the base = the label rendered from the forced types alone.
-*/
-function repairBareByPresence(labels, minimized, records, stats, forcedSet, forceTraceElements, separator) {
-	const base = records.map((r) => renderRecordLabel(r, forcedSet, forceTraceElements, separator));
-	const isBare = records.map((r, i) => renderRecordLabel(r, minimized, forceTraceElements, separator) === base[i]);
-	const groups = records.reduce((acc, _, i) => acc.set(base[i] ?? "", [...acc.get(base[i] ?? "") ?? [], i]), /* @__PURE__ */ new Map());
+/**
+* Repairs labels told apart only by what they lack: in a group with the same shown base, a
+* member is bare when its shown parts are a strict subset of a peer's. The group is re-labelled
+* from parts all members carry, or bare members add a hidden part (group-wide when labels stay
+* unique), whichever keeps the more important distinction; labels stay unique across the list.
+*/
+function repairBareLabels(labels, minimized, records, stats, forceTraceElements, separator) {
+	const traces = records.map((r) => new Map(r.fullTrace.map((ft) => [ft.fullType, ft.label])));
+	const isQualification = (t) => isSyntheticType(t.split("@")[0]);
+	const depths = records.map((r) => {
+		const steps = r.fullTrace.filter((ft) => ft.fullType !== LABEL_TYPE_FULL && !isQualification(ft.fullType));
+		return new Map(steps.map((ft, idx) => [ft.fullType, steps.length - idx]));
+	});
+	const isForced = (t) => forceTraceElements?.has(t.split("@")[0]) === true;
+	const isDistinctionType = (t) => t !== LABEL_TYPE_FULL && !isQualification(t);
+	const importance = (t) => stats.importances.get(t) ?? 0;
+	const byImportance = (a, b) => importance(b) - importance(a);
+	const render = (i, types) => renderRecordLabel(records[i], types, forceTraceElements, separator);
+	const partKey = (t, l) => `${t}\u0000${l}`;
+	const labelShown = minimized.has(LABEL_TYPE_FULL);
+	const baseTypes = new Set(labelShown ? [LABEL_TYPE_FULL] : []);
+	const qualTypes = [...minimized].filter(isQualification);
+	const groups = /* @__PURE__ */ new Map();
+	records.forEach((_, i) => {
+		const key = render(i, baseTypes) ?? "";
+		const group = groups.get(key);
+		if (group) group.push(i);
+		else groups.set(key, [i]);
+	});
 	const patched = [...labels];
-	for (const group of groups.values()) {
-		if (!group.some((i) => !isBare[i])) continue;
-		for (const i of group) {
-			if (!isBare[i]) continue;
-			const chosen = bestDistinguishingType(records, group, i, minimized, forcedSet, forceTraceElements, stats);
-			if (chosen === void 0) continue;
-			const withToken = /* @__PURE__ */ new Set([...minimized, chosen]);
-			patched[i] = renderRecordLabel(records[i], withToken, forceTraceElements, separator) ?? patched[i];
-		}
+	const counts = /* @__PURE__ */ new Map();
+	const addCount = (l, d) => counts.set(l, (counts.get(l) ?? 0) + d);
+	for (const l of patched) addCount(l, 1);
+	const tryApply = (members, next) => {
+		if (new Set(next).size !== members.length) return false;
+		for (const i of members) addCount(patched[i], -1);
+		const clashes = next.some((l) => (counts.get(l) ?? 0) > 0);
+		members.forEach((i, k) => {
+			if (!clashes) patched[i] = next[k];
+			addCount(patched[i], 1);
+		});
+		return !clashes;
+	};
+	for (const [key, group] of groups) {
+		if (group.length < 2) continue;
+		const shown = group.map((i) => [...traces[i]].filter(([t]) => t !== LABEL_TYPE_FULL && (minimized.has(t) || isForced(t))));
+		const partKeys = shown.map((parts) => parts.map(([t, l]) => partKey(t, l)));
+		const sigIndex = /* @__PURE__ */ new Map();
+		const setKeys = [];
+		const setMembers = [];
+		const sigOf = partKeys.map((keys, k) => {
+			const sig = [...keys].sort().join("
");
+			let s = sigIndex.get(sig);
+			if (s === void 0) {
+				s = setKeys.length;
+				sigIndex.set(sig, s);
+				setKeys.push(keys);
+				setMembers.push([]);
+			}
+			setMembers[s].push(k);
+			return s;
+		});
+		const setSets = setKeys.map((keys) => new Set(keys));
+		const postings = /* @__PURE__ */ new Map();
+		setKeys.forEach((keys, s) => keys.forEach((p) => {
+			const list = postings.get(p);
+			if (list) list.push(s);
+			else postings.set(p, [s]);
+		}));
+		const withParts = setKeys.map((_, s) => s).filter((s) => setKeys[s].length > 0);
+		const supersetSets = setKeys.map((keys, s) => {
+			if (keys.length === 0) return withParts;
+			const rarest = keys.reduce((a, b) => postings.get(a).length <= postings.get(b).length ? a : b);
+			return postings.get(rarest).filter((t) => t !== s && setSets[t].size > keys.length && keys.every((x) => setSets[t].has(x)));
+		});
+		const bare = group.map((_, k) => supersetSets[sigOf[k]].length > 0);
+		if (!bare.some(Boolean)) continue;
+		const typeCount = /* @__PURE__ */ new Map();
+		for (const i of group) for (const t of traces[i].keys()) typeCount.set(t, (typeCount.get(t) ?? 0) + 1);
+		const isUneven = (t) => (typeCount.get(t) ?? 0) > 0 && typeCount.get(t) < group.length;
+		const unevenMax = Math.max(...[...minimized].filter((t) => isDistinctionType(t) && !isForced(t) && isUneven(t)).map(importance));
+		let sharedLabels;
+		let sharedMax = Number.NEGATIVE_INFINITY;
+		if (labelShown && key !== "") {
+			const shared = [...typeCount].filter(([t, n]) => n === group.length && isDistinctionType(t)).map(([t]) => t).sort(byImportance);
+			const chosen = new Set(baseTypes);
+			const distinctCount = (types) => new Set(group.map((i) => render(i, types) ?? "")).size;
+			let count = distinctCount(chosen);
+			for (const t of shared) {
+				if (count === group.length) break;
+				const next = distinctCount(/* @__PURE__ */ new Set([...chosen, t]));
+				if (next > count) {
+					if (chosen.size === baseTypes.size) sharedMax = importance(t);
+					chosen.add(t);
+					count = next;
+				}
+			}
+			const withTags = /* @__PURE__ */ new Set([...chosen, ...qualTypes]);
+			const complete = group.map((i) => render(i, withTags)).filter((l) => l !== void 0);
+			if (count === group.length && complete.length === group.length && new Set(complete).size === group.length) sharedLabels = complete;
+		}
+		const applyBareFix = () => {
+			const bareMembers = group.filter((_, k) => bare[k]);
+			const oldBare = /* @__PURE__ */ new Map();
+			for (const i of bareMembers) oldBare.set(patched[i], (oldBare.get(patched[i]) ?? 0) + 1);
+			const isFree = (l) => (counts.get(l) ?? 0) - (oldBare.get(l) ?? 0) === 0;
+			const shownTypes = (k) => [
+				...baseTypes,
+				...shown[k].map(([t]) => t),
+				...qualTypes
+			];
+			const setLabels = /* @__PURE__ */ new Map();
+			const labelsIn = (s) => {
+				let byType = setLabels.get(s);
+				if (byType) return byType;
+				byType = /* @__PURE__ */ new Map();
+				for (const m of setMembers[s]) for (const [t, l] of traces[group[m]]) {
+					const entry = byType.get(t) ?? {
+						labels: /* @__PURE__ */ new Set(),
+						n: 0
+					};
+					entry.labels.add(l);
+					entry.n++;
+					byType.set(t, entry);
+				}
+				setLabels.set(s, byType);
+				return byType;
+			};
+			const someDiffers = (s, u, mine) => {
+				const entry = labelsIn(s).get(u);
+				if (entry === void 0) return mine !== void 0;
+				if (entry.n < setMembers[s].length) return true;
+				return entry.labels.size > 1 || !entry.labels.has(mine ?? "");
+			};
+			const extraDepthsOf = /* @__PURE__ */ new Map();
+			const extraDepths = (s) => {
+				let depthsSet = extraDepthsOf.get(s);
+				if (depthsSet) return depthsSet;
+				depthsSet = new Set(supersetSets[s].flatMap((t) => {
+					const rep = setMembers[t][0];
+					return shown[rep].filter(([u, l]) => !isQualification(u) && !setSets[s].has(partKey(u, l))).map(([u]) => depths[group[rep]].get(u));
+				}));
+				extraDepthsOf.set(s, depthsSet);
+				return depthsSet;
+			};
+			const picks = /* @__PURE__ */ new Map();
+			group.forEach((i, k) => {
+				if (!bare[k]) return;
+				const peers = supersetSets[sigOf[k]];
+				const kindDepths = extraDepths(sigOf[k]);
+				const sameKind = (u) => kindDepths.has(depths[i].get(u)) ? 1 : 0;
+				const candidates = [...traces[i].keys()].filter((u) => !minimized.has(u) && !isForced(u)).filter((u) => peers.some((t) => someDiffers(t, u, traces[i].get(u)))).sort((a, b) => sameKind(b) - sameKind(a) || byImportance(a, b));
+				for (const u of candidates) {
+					const label = render(i, /* @__PURE__ */ new Set([...shownTypes(k), u]));
+					if (label !== void 0 && isFree(label)) {
+						picks.set(i, {
+							type: u,
+							label
+						});
+						break;
+					}
+				}
+			});
+			if (picks.size === 0) return false;
+			if (labelShown && key !== "") {
+				const picked = [...new Set([...picks.values()].map((p) => p.type))];
+				const full = group.map((i, k) => render(i, /* @__PURE__ */ new Set([...shownTypes(k), ...picked]))).filter((l) => l !== void 0);
+				if (full.length === group.length && tryApply(group, full)) return true;
+			}
+			const proposed = new Map([...picks].map(([i, p]) => [i, p.label]));
+			for (let changed = true; changed;) {
+				changed = false;
+				const firstOld = /* @__PURE__ */ new Map();
+				for (const [i, l] of proposed) {
+					const old = firstOld.get(l);
+					if (old === void 0) firstOld.set(l, patched[i]);
+					else if (old !== patched[i]) changed = proposed.delete(i);
+				}
+				const kept = new Set(bareMembers.filter((i) => !proposed.has(i)).map((i) => patched[i]));
+				for (const [i, l] of proposed) if (kept.has(l)) changed = proposed.delete(i);
+			}
+			for (const i of bareMembers) addCount(patched[i], -1);
+			for (const i of bareMembers) {
+				patched[i] = proposed.get(i) ?? patched[i];
+				addCount(patched[i], 1);
+			}
+			return proposed.size > 0;
+		};
+		if (sharedLabels && sharedMax >= unevenMax && tryApply(group, sharedLabels)) continue;
+		if (applyBareFix()) continue;
+		if (sharedLabels && sharedMax < unevenMax) tryApply(group, sharedLabels);
 	}
 	return patched;
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/render/util/label.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/render/util/label.js
 /** @deprecated Use deriveDistinctLabels */
 function deriveLabels(values, getSpec, options = {}) {
 	return deriveDistinctLabels(values.map(getSpec), options).map((label, i) => ({
@@ -7894,15 +8136,17 @@ function deriveLabels(values, getSpec, options = {}) {
 	}));
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/render/util/pcolumn_data.js
-const RT_RESOURCE_MAP = "PColumnData/ResourceMap";
-const RT_RESOURCE_MAP_PARTITIONED = "PColumnData/Partitioned/ResourceMap";
-const RT_JSON_PARTITIONED = "PColumnData/JsonPartitioned";
-const RT_BINARY_PARTITIONED = "PColumnData/BinaryPartitioned";
-const RT_PARQUET_PARTITIONED = "PColumnData/ParquetPartitioned";
-const RT_JSON_SUPER_PARTITIONED = "PColumnData/Partitioned/JsonPartitioned";
-const RT_BINARY_SUPER_PARTITIONED = "PColumnData/Partitioned/BinaryPartitioned";
-const RT_PARQUET_SUPER_PARTITIONED = "PColumnData/Partitioned/ParquetPartitioned";
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/render/util/pcolumn_data.js
+const PCD_PREFIX = "PColumnData/";
+const RT_RESOURCE_MAP = PCD_PREFIX + "ResourceMap";
+const RT_RESOURCE_MAP_PARTITIONED = PCD_PREFIX + "Partitioned/ResourceMap";
+const RT_JSON_PARTITIONED = PCD_PREFIX + "JsonPartitioned";
+const RT_BINARY_PARTITIONED = PCD_PREFIX + "BinaryPartitioned";
+const RT_PARQUET_PARTITIONED = PCD_PREFIX + "ParquetPartitioned";
+const PCD_SUP_PREFIX = PCD_PREFIX + "Partitioned/";
+const RT_JSON_SUPER_PARTITIONED = PCD_SUP_PREFIX + "JsonPartitioned";
+const RT_BINARY_SUPER_PARTITIONED = PCD_SUP_PREFIX + "BinaryPartitioned";
+const RT_PARQUET_SUPER_PARTITIONED = PCD_SUP_PREFIX + "ParquetPartitioned";
 const removeIndexSuffix = (keyStr) => {
 	if (keyStr.endsWith(".index")) return {
 		baseKey: keyStr.substring(0, keyStr.length - 6),
@@ -8188,7 +8432,7 @@ function allPColumnsReady(columns) {
 	return columns.every(isPColumnReady);
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/render/util/column_collection.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/render/util/column_collection.js
 function isPColumnValues(value) {
 	if (!Array.isArray(value)) return false;
 	if (value.length === 0) return true;
@@ -8222,9 +8466,10 @@ function splitFiltersToAxisFilter(splitFilters) {
 }
 function fallbackIdDeriver(originalId, axisFilters) {
 	if (!axisFilters || axisFilters.length === 0) return originalId;
+	const filtersToCanonicalize = [...axisFilters].sort((a, b) => a[0] - b[0]);
 	return (0, import_canonicalize.default)({
 		id: originalId,
-		axisFilters: [...axisFilters].sort((a, b) => a[0] - b[0])
+		axisFilters: filtersToCanonicalize
 	});
 }
 /** Checks if a selector object uses any anchor properties */
@@ -8466,7 +8711,7 @@ var PColumnCollection = class {
 	}
 };
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/services/service_bridge.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/services/service_bridge.js
 /**
 * Builds a ServiceProxy from a ServiceDispatch.
 * Each service method call is forwarded to dispatch.callServiceMethod.
@@ -8475,7 +8720,7 @@ function createServiceProxy(dispatch) {
 	return ((serviceId) => Object.freeze(Object.fromEntries(dispatch.getServiceMethods(serviceId).map((method) => [method, (...args) => dispatch.callServiceMethod(serviceId, method, ...args)]))));
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/services/get_services.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/services/get_services.js
 const cachedServices = /* @__PURE__ */ new WeakMap();
 function getService(name, deps) {
 	const ctx = deps?.ctx ?? getCfgRenderCtx();
@@ -8489,7 +8734,7 @@ function getService(name, deps) {
 	})();
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/render/util/pframe_upgraders.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/render/util/pframe_upgraders.js
 function patchInSetFilters(filters) {
 	const inSetToOrEqual = (predicate) => {
 		if (predicate.operator !== "InSet") return predicate;
@@ -8527,7 +8772,7 @@ function patchInSetFilters(filters) {
 	return filters.map((filter) => mapFilter(filter, inSetToOrEqual));
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/render/api.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/render/api.js
 /**
 * Helper function to match domain objects
 * @param query Optional domain to match against
@@ -8578,11 +8823,13 @@ var ResultPool = class {
 		let refsWithEnrichments = false;
 		if (typeof opts !== "undefined") {
 			if (typeof opts === "function") labelOps = opts;
-			else if (typeof opts === "object") if ("includeNativeLabel" in opts || "separator" in opts || "addLabelAsSuffix" in opts) labelOps = opts;
-			else {
-				opts = opts;
-				labelOps = opts.label ?? {};
-				refsWithEnrichments = opts.refsWithEnrichments ?? false;
+			else if (typeof opts === "object") {
+				if ("includeNativeLabel" in opts || "separator" in opts || "addLabelAsSuffix" in opts) labelOps = opts;
+				else {
+					opts = opts;
+					labelOps = opts.label ?? {};
+					refsWithEnrichments = opts.refsWithEnrichments ?? false;
+				}
 			}
 		}
 		if (typeof labelOps === "object") return deriveLabels(filtered, (o) => o.obj, labelOps ?? {}).map(({ value: { ref }, label }) => ({
@@ -8976,27 +9223,27 @@ var PluginRenderCtx = class extends RenderCtxBase {
 	}
 };
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/plugin_model.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/plugin_model.js
 /** Internal plugin↔block handshake. `Symbol.for` (not `Symbol`) so it stays
 * identical across multiple `@platforma-sdk/model` copies in one process. */
 const CREATE_PLUGIN_MODEL = Symbol.for("@platforma-sdk/model:createPluginModel");
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/version.js
-const PlatformaSDKVersion = "1.84.1";
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/version.js
+const PlatformaSDKVersion = "1.86.3";
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/bconfig/types.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/bconfig/types.js
 function isConfigLambda(cfgOrFh) {
 	return cfgOrFh.__renderLambda === true;
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/bconfig/normalization.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/bconfig/normalization.js
 function downgradeCfgOrLambda(data) {
 	if (data === void 0) return void 0;
 	if (isConfigLambda(data)) return data.handle;
 	return data;
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/block_storage_callbacks.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/block_storage_callbacks.js
 /**
 * BlockStorage Callback Implementations - wired to facade callbacks in BlockModelV3.done().
 *
@@ -9350,7 +9597,7 @@ function deriveTemplateParamsFromStorage(storageJson, deriveTemplateParams) {
 	}
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/block_model.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/block_model.js
 /**
 * Merges two feature flag objects with type-aware logic:
 * - `supports*` (boolean): OR — `true` if either side is `true`
@@ -9716,7 +9963,7 @@ var BlockModelV3 = class BlockModelV3 {
 	}
 };
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/pframe_utils/axes.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/pframe_utils/axes.js
 /** Create id for column copy with added keys in axes domains */
 const colId = (id, domains, contextDomains) => {
 	let wid = id.toString();
@@ -9822,7 +10069,7 @@ function getAdditionalColumnsForColumn(blockAxes, column) {
 	})];
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/columns/column_recipes/leaf_rebrand.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/columns/column_recipes/leaf_rebrand.js
 /**
 * Replace every column leaf whose id equals `fromId` with `toId`, leaving
 * other column refs (linkers, sub-anchors) intact. Wrapper recipes
@@ -9840,1214 +10087,657 @@ function rebrandLeafId(node, fromId, toId) {
 	return mapSpecQueryColumns(node, { column: (id) => id === fromId ? toId : id });
 }
 //#endregion
-//#region ../node_modules/.pnpm/lru-cache@11.2.4/node_modules/lru-cache/dist/esm/index.js
-/**
-* @module LRUCache
-*/
-const defaultPerf = typeof performance === "object" && performance && typeof performance.now === "function" ? performance : Date;
-const warned = /* @__PURE__ */ new Set();
-/* c8 ignore start */
-const PROCESS = typeof process === "object" && !!process ? process : {};
-/* c8 ignore start */
-const emitWarning = (msg, type, code, fn) => {
-	typeof PROCESS.emitWarning === "function" ? PROCESS.emitWarning(msg, type, code, fn) : console.error(`[${code}] ${type}: ${msg}`);
-};
-let AC = globalThis.AbortController;
-let AS = globalThis.AbortSignal;
-/* c8 ignore start */
-if (typeof AC === "undefined") {
-	AS = class AbortSignal {
-		onabort;
-		_onabort = [];
-		reason;
-		aborted = false;
-		addEventListener(_, fn) {
-			this._onabort.push(fn);
-		}
-	};
-	AC = class AbortController {
-		constructor() {
-			warnACPolyfill();
-		}
-		signal = new AS();
-		abort(reason) {
-			if (this.signal.aborted) return;
-			this.signal.reason = reason;
-			this.signal.aborted = true;
-			for (const fn of this.signal._onabort) fn(reason);
-			this.signal.onabort?.(reason);
-		}
-	};
-	let printACPolyfillWarning = PROCESS.env?.LRU_CACHE_IGNORE_AC_WARNING !== "1";
-	const warnACPolyfill = () => {
-		if (!printACPolyfillWarning) return;
-		printACPolyfillWarning = false;
-		emitWarning("AbortController is not defined. If using lru-cache in node 14, load an AbortController polyfill from the `node-abort-controller` package. A minimal polyfill is provided for use by LRUCache.fetch(), but it should not be relied upon in other contexts (eg, passing it to other APIs that use AbortController/AbortSignal might have undesirable effects). You may disable this with LRU_CACHE_IGNORE_AC_WARNING=1 in the env.", "NO_ABORT_CONTROLLER", "ENOTSUP", warnACPolyfill);
-	};
-}
-/* c8 ignore stop */
-const shouldWarn = (code) => !warned.has(code);
-const isPosInt = (n) => n && n === Math.floor(n) && n > 0 && isFinite(n);
-/* c8 ignore start */
-const getUintArray = (max) => !isPosInt(max) ? null : max <= Math.pow(2, 8) ? Uint8Array : max <= Math.pow(2, 16) ? Uint16Array : max <= Math.pow(2, 32) ? Uint32Array : max <= Number.MAX_SAFE_INTEGER ? ZeroArray : null;
-/* c8 ignore stop */
-var ZeroArray = class extends Array {
-	constructor(size) {
-		super(size);
-		this.fill(0);
-	}
-};
-var Stack = class Stack {
+//#region ../node_modules/.pnpm/lru-cache@11.5.3/node_modules/lru-cache/dist/esm/browser/index.min.js
+var L = { hasSubscribers: !1 };
+var S = L;
+var W = L;
+var M = typeof performance == "object" && performance && typeof performance.now == "function" ? performance : Date;
+var R = () => S.hasSubscribers || W.hasSubscribers;
+var j = /* @__PURE__ */ new Set();
+var I = typeof process == "object" && process ? process : {};
+var P = (d, e, t, i) => {
+	typeof I.emitWarning == "function" ? I.emitWarning(d, e, t, i) : console.error(`[${t}] ${e}: ${d}`);
+};
+var k = (d) => !j.has(d);
+var T = (d) => !!d && d === Math.floor(d) && d > 0 && isFinite(d);
+var G = (d) => T(d) ? d <= Math.pow(2, 8) ? Uint8Array : d <= Math.pow(2, 16) ? Uint16Array : d <= Math.pow(2, 32) ? Uint32Array : d <= Number.MAX_SAFE_INTEGER ? O : null : null;
+var O = class extends Array {
+	constructor(e) {
+		super(e), this.fill(0);
+	}
+};
+var x = class d {
 	heap;
 	length;
-	static #constructing = false;
-	static create(max) {
-		const HeapCls = getUintArray(max);
-		if (!HeapCls) return [];
-		Stack.#constructing = true;
-		const s = new Stack(max, HeapCls);
-		Stack.#constructing = false;
-		return s;
-	}
-	constructor(max, HeapCls) {
-		/* c8 ignore start */
-		if (!Stack.#constructing) throw new TypeError("instantiate Stack using Stack.create(n)");
-		/* c8 ignore stop */
-		this.heap = new HeapCls(max);
-		this.length = 0;
-	}
-	push(n) {
-		this.heap[this.length++] = n;
+	static #o = !1;
+	static create(e) {
+		let t = G(e);
+		if (!t) return [];
+		d.#o = !0;
+		let i = new d(e, t);
+		return d.#o = !1, i;
+	}
+	constructor(e, t) {
+		if (!d.#o) throw new TypeError("instantiate Stack using Stack.create(n)");
+		this.heap = new t(e), this.length = 0;
+	}
+	push(e) {
+		this.heap[this.length++] = e;
 	}
 	pop() {
 		return this.heap[--this.length];
 	}
 };
-/**
-* Default export, the thing you're using this module to get.
-*
-* The `K` and `V` types define the key and value types, respectively. The
-* optional `FC` type defines the type of the `context` object passed to
-* `cache.fetch()` and `cache.memo()`.
-*
-* Keys and values **must not** be `null` or `undefined`.
-*
-* All properties from the options object (with the exception of `max`,
-* `maxSize`, `fetchMethod`, `memoMethod`, `dispose` and `disposeAfter`) are
-* added as normal public members. (The listed options are read-only getters.)
-*
-* Changing any of these will alter the defaults for subsequent method calls.
-*/
-var LRUCache = class LRUCache {
-	#max;
-	#maxSize;
-	#dispose;
-	#onInsert;
-	#disposeAfter;
-	#fetchMethod;
-	#memoMethod;
-	#perf;
-	/**
-	* {@link LRUCache.OptionsBase.perf}
-	*/
+var U = class d {
+	#o;
+	#c;
+	#S;
+	#O;
+	#w;
+	#M;
+	#I;
+	#m;
 	get perf() {
-		return this.#perf;
+		return this.#m;
 	}
-	/**
-	* {@link LRUCache.OptionsBase.ttl}
-	*/
 	ttl;
-	/**
-	* {@link LRUCache.OptionsBase.ttlResolution}
-	*/
 	ttlResolution;
-	/**
-	* {@link LRUCache.OptionsBase.ttlAutopurge}
-	*/
 	ttlAutopurge;
-	/**
-	* {@link LRUCache.OptionsBase.updateAgeOnGet}
-	*/
 	updateAgeOnGet;
-	/**
-	* {@link LRUCache.OptionsBase.updateAgeOnHas}
-	*/
 	updateAgeOnHas;
-	/**
-	* {@link LRUCache.OptionsBase.allowStale}
-	*/
 	allowStale;
-	/**
-	* {@link LRUCache.OptionsBase.noDisposeOnSet}
-	*/
 	noDisposeOnSet;
-	/**
-	* {@link LRUCache.OptionsBase.noUpdateTTL}
-	*/
 	noUpdateTTL;
-	/**
-	* {@link LRUCache.OptionsBase.maxEntrySize}
-	*/
 	maxEntrySize;
-	/**
-	* {@link LRUCache.OptionsBase.sizeCalculation}
-	*/
 	sizeCalculation;
-	/**
-	* {@link LRUCache.OptionsBase.noDeleteOnFetchRejection}
-	*/
 	noDeleteOnFetchRejection;
-	/**
-	* {@link LRUCache.OptionsBase.noDeleteOnStaleGet}
-	*/
 	noDeleteOnStaleGet;
-	/**
-	* {@link LRUCache.OptionsBase.allowStaleOnFetchAbort}
-	*/
 	allowStaleOnFetchAbort;
-	/**
-	* {@link LRUCache.OptionsBase.allowStaleOnFetchRejection}
-	*/
 	allowStaleOnFetchRejection;
-	/**
-	* {@link LRUCache.OptionsBase.ignoreFetchAbort}
-	*/
 	ignoreFetchAbort;
-	#size;
-	#calculatedSize;
-	#keyMap;
-	#keyList;
-	#valList;
-	#next;
-	#prev;
-	#head;
-	#tail;
-	#free;
-	#disposed;
-	#sizes;
-	#starts;
-	#ttls;
-	#autopurgeTimers;
-	#hasDispose;
-	#hasFetchMethod;
-	#hasDisposeAfter;
-	#hasOnInsert;
-	/**
-	* Do not call this method unless you need to inspect the
-	* inner workings of the cache.  If anything returned by this
-	* object is modified in any way, strange breakage may occur.
-	*
-	* These fields are private for a reason!
-	*
-	* @internal
-	*/
-	static unsafeExposeInternals(c) {
+	backgroundFetchSize;
+	#n;
+	#b;
+	#s;
+	#i;
+	#t;
+	#l;
+	#u;
+	#a;
+	#h;
+	#y;
+	#r;
+	#_;
+	#F;
+	#d;
+	#g;
+	#T;
+	#U;
+	#f;
+	#D;
+	static unsafeExposeInternals(e) {
 		return {
-			starts: c.#starts,
-			ttls: c.#ttls,
-			autopurgeTimers: c.#autopurgeTimers,
-			sizes: c.#sizes,
-			keyMap: c.#keyMap,
-			keyList: c.#keyList,
-			valList: c.#valList,
-			next: c.#next,
-			prev: c.#prev,
+			starts: e.#F,
+			ttls: e.#d,
+			autopurgeTimers: e.#g,
+			sizes: e.#_,
+			keyMap: e.#s,
+			keyList: e.#i,
+			valList: e.#t,
+			next: e.#l,
+			prev: e.#u,
 			get head() {
-				return c.#head;
+				return e.#a;
 			},
 			get tail() {
-				return c.#tail;
+				return e.#h;
 			},
-			free: c.#free,
-			isBackgroundFetch: (p) => c.#isBackgroundFetch(p),
-			backgroundFetch: (k, index, options, context) => c.#backgroundFetch(k, index, options, context),
-			moveToTail: (index) => c.#moveToTail(index),
-			indexes: (options) => c.#indexes(options),
-			rindexes: (options) => c.#rindexes(options),
-			isStale: (index) => c.#isStale(index)
+			free: e.#y,
+			isBackgroundFetch: (t) => e.#e(t),
+			backgroundFetch: (t, i, s, n) => e.#P(t, i, s, n),
+			moveToTail: (t) => e.#L(t),
+			indexes: (t) => e.#A(t),
+			rindexes: (t) => e.#z(t),
+			isStale: (t) => e.#p(t)
 		};
 	}
-	/**
-	* {@link LRUCache.OptionsBase.max} (read-only)
-	*/
 	get max() {
-		return this.#max;
+		return this.#o;
 	}
-	/**
-	* {@link LRUCache.OptionsBase.maxSize} (read-only)
-	*/
 	get maxSize() {
-		return this.#maxSize;
+		return this.#c;
 	}
-	/**
-	* The total computed size of items in the cache (read-only)
-	*/
 	get calculatedSize() {
-		return this.#calculatedSize;
+		return this.#b;
 	}
-	/**
-	* The number of items stored in the cache (read-only)
-	*/
 	get size() {
-		return this.#size;
+		return this.#n;
 	}
-	/**
-	* {@link LRUCache.OptionsBase.fetchMethod} (read-only)
-	*/
 	get fetchMethod() {
-		return this.#fetchMethod;
+		return this.#M;
 	}
 	get memoMethod() {
-		return this.#memoMethod;
+		return this.#I;
 	}
-	/**
-	* {@link LRUCache.OptionsBase.dispose} (read-only)
-	*/
 	get dispose() {
-		return this.#dispose;
+		return this.#S;
 	}
-	/**
-	* {@link LRUCache.OptionsBase.onInsert} (read-only)
-	*/
 	get onInsert() {
-		return this.#onInsert;
+		return this.#O;
 	}
-	/**
-	* {@link LRUCache.OptionsBase.disposeAfter} (read-only)
-	*/
 	get disposeAfter() {
-		return this.#disposeAfter;
-	}
-	constructor(options) {
-		const { max = 0, ttl, ttlResolution = 1, ttlAutopurge, updateAgeOnGet, updateAgeOnHas, allowStale, dispose, onInsert, disposeAfter, noDisposeOnSet, noUpdateTTL, maxSize = 0, maxEntrySize = 0, sizeCalculation, fetchMethod, memoMethod, noDeleteOnFetchRejection, noDeleteOnStaleGet, allowStaleOnFetchRejection, allowStaleOnFetchAbort, ignoreFetchAbort, perf } = options;
-		if (perf !== void 0) {
-			if (typeof perf?.now !== "function") throw new TypeError("perf option must have a now() method if specified");
-		}
-		this.#perf = perf ?? defaultPerf;
-		if (max !== 0 && !isPosInt(max)) throw new TypeError("max option must be a nonnegative integer");
-		const UintArray = max ? getUintArray(max) : Array;
-		if (!UintArray) throw new Error("invalid max value: " + max);
-		this.#max = max;
-		this.#maxSize = maxSize;
-		this.maxEntrySize = maxEntrySize || this.#maxSize;
-		this.sizeCalculation = sizeCalculation;
-		if (this.sizeCalculation) {
-			if (!this.#maxSize && !this.maxEntrySize) throw new TypeError("cannot set sizeCalculation without setting maxSize or maxEntrySize");
-			if (typeof this.sizeCalculation !== "function") throw new TypeError("sizeCalculation set to non-function");
-		}
-		if (memoMethod !== void 0 && typeof memoMethod !== "function") throw new TypeError("memoMethod must be a function if defined");
-		this.#memoMethod = memoMethod;
-		if (fetchMethod !== void 0 && typeof fetchMethod !== "function") throw new TypeError("fetchMethod must be a function if specified");
-		this.#fetchMethod = fetchMethod;
-		this.#hasFetchMethod = !!fetchMethod;
-		this.#keyMap = /* @__PURE__ */ new Map();
-		this.#keyList = new Array(max).fill(void 0);
-		this.#valList = new Array(max).fill(void 0);
-		this.#next = new UintArray(max);
-		this.#prev = new UintArray(max);
-		this.#head = 0;
-		this.#tail = 0;
-		this.#free = Stack.create(max);
-		this.#size = 0;
-		this.#calculatedSize = 0;
-		if (typeof dispose === "function") this.#dispose = dispose;
-		if (typeof onInsert === "function") this.#onInsert = onInsert;
-		if (typeof disposeAfter === "function") {
-			this.#disposeAfter = disposeAfter;
-			this.#disposed = [];
-		} else {
-			this.#disposeAfter = void 0;
-			this.#disposed = void 0;
-		}
-		this.#hasDispose = !!this.#dispose;
-		this.#hasOnInsert = !!this.#onInsert;
-		this.#hasDisposeAfter = !!this.#disposeAfter;
-		this.noDisposeOnSet = !!noDisposeOnSet;
-		this.noUpdateTTL = !!noUpdateTTL;
-		this.noDeleteOnFetchRejection = !!noDeleteOnFetchRejection;
-		this.allowStaleOnFetchRejection = !!allowStaleOnFetchRejection;
-		this.allowStaleOnFetchAbort = !!allowStaleOnFetchAbort;
-		this.ignoreFetchAbort = !!ignoreFetchAbort;
-		if (this.maxEntrySize !== 0) {
-			if (this.#maxSize !== 0) {
-				if (!isPosInt(this.#maxSize)) throw new TypeError("maxSize must be a positive integer if specified");
-			}
-			if (!isPosInt(this.maxEntrySize)) throw new TypeError("maxEntrySize must be a positive integer if specified");
-			this.#initializeSizeTracking();
-		}
-		this.allowStale = !!allowStale;
-		this.noDeleteOnStaleGet = !!noDeleteOnStaleGet;
-		this.updateAgeOnGet = !!updateAgeOnGet;
-		this.updateAgeOnHas = !!updateAgeOnHas;
-		this.ttlResolution = isPosInt(ttlResolution) || ttlResolution === 0 ? ttlResolution : 1;
-		this.ttlAutopurge = !!ttlAutopurge;
-		this.ttl = ttl || 0;
-		if (this.ttl) {
-			if (!isPosInt(this.ttl)) throw new TypeError("ttl must be a positive integer if specified");
-			this.#initializeTTLTracking();
-		}
-		if (this.#max === 0 && this.ttl === 0 && this.#maxSize === 0) throw new TypeError("At least one of max, maxSize, or ttl is required");
-		if (!this.ttlAutopurge && !this.#max && !this.#maxSize) {
-			const code = "LRU_CACHE_UNBOUNDED";
-			if (shouldWarn(code)) {
-				warned.add(code);
-				emitWarning("TTL caching without ttlAutopurge, max, or maxSize can result in unbounded memory consumption.", "UnboundedCacheWarning", code, LRUCache);
-			}
-		}
-	}
-	/**
-	* Return the number of ms left in the item's TTL. If item is not in cache,
-	* returns `0`. Returns `Infinity` if item is in cache without a defined TTL.
-	*/
-	getRemainingTTL(key) {
-		return this.#keyMap.has(key) ? Infinity : 0;
-	}
-	#initializeTTLTracking() {
-		const ttls = new ZeroArray(this.#max);
-		const starts = new ZeroArray(this.#max);
-		this.#ttls = ttls;
-		this.#starts = starts;
-		const purgeTimers = this.ttlAutopurge ? new Array(this.#max) : void 0;
-		this.#autopurgeTimers = purgeTimers;
-		this.#setItemTTL = (index, ttl, start = this.#perf.now()) => {
-			starts[index] = ttl !== 0 ? start : 0;
-			ttls[index] = ttl;
-			if (purgeTimers?.[index]) {
-				clearTimeout(purgeTimers[index]);
-				purgeTimers[index] = void 0;
-			}
-			if (ttl !== 0 && purgeTimers) {
-				const t = setTimeout(() => {
-					if (this.#isStale(index)) this.#delete(this.#keyList[index], "expire");
-				}, ttl + 1);
-				/* c8 ignore start */
-				if (t.unref) t.unref();
-				/* c8 ignore stop */
-				purgeTimers[index] = t;
-			}
-		};
-		this.#updateItemAge = (index) => {
-			starts[index] = ttls[index] !== 0 ? this.#perf.now() : 0;
-		};
-		this.#statusTTL = (status, index) => {
-			if (ttls[index]) {
-				const ttl = ttls[index];
-				const start = starts[index];
-				/* c8 ignore next */
-				if (!ttl || !start) return;
-				status.ttl = ttl;
-				status.start = start;
-				status.now = cachedNow || getNow();
-				status.remainingTTL = ttl - (status.now - start);
-			}
-		};
-		let cachedNow = 0;
-		const getNow = () => {
-			const n = this.#perf.now();
+		return this.#w;
+	}
+	constructor(e) {
+		let { max: t = 0, ttl: i, ttlResolution: s = 1, ttlAutopurge: n, updateAgeOnGet: o, updateAgeOnHas: l, allowStale: h, dispose: r, onInsert: c, disposeAfter: m, noDisposeOnSet: _, noUpdateTTL: u, maxSize: g = 0, maxEntrySize: f = 0, sizeCalculation: y, fetchMethod: a, memoMethod: w, noDeleteOnFetchRejection: F, noDeleteOnStaleGet: b, allowStaleOnFetchRejection: p, allowStaleOnFetchAbort: A, ignoreFetchAbort: z, backgroundFetchSize: C = 1, perf: E } = e;
+		if (this.backgroundFetchSize = C, E !== void 0 && typeof E?.now != "function") throw new TypeError("perf option must have a now() method if specified");
+		if (this.#m = E ?? M, t !== 0 && !T(t)) throw new TypeError("max option must be a nonnegative integer");
+		let v = t ? G(t) : Array;
+		if (!v) throw new Error("invalid max value: " + t);
+		if (this.#o = t, this.#c = g, this.maxEntrySize = f || this.#c, this.sizeCalculation = y, this.sizeCalculation) {
+			if (!this.#c && !this.maxEntrySize) throw new TypeError("cannot set sizeCalculation without setting maxSize or maxEntrySize");
+			if (typeof this.sizeCalculation != "function") throw new TypeError("sizeCalculation set to non-function");
+		}
+		if (w !== void 0 && typeof w != "function") throw new TypeError("memoMethod must be a function if defined");
+		if (this.#I = w, a !== void 0 && typeof a != "function") throw new TypeError("fetchMethod must be a function if specified");
+		if (this.#M = a, this.#U = !!a, this.#s = /* @__PURE__ */ new Map(), this.#i = Array.from({ length: t }).fill(void 0), this.#t = Array.from({ length: t }).fill(void 0), this.#l = new v(t), this.#u = new v(t), this.#a = 0, this.#h = 0, this.#y = x.create(t), this.#n = 0, this.#b = 0, typeof r == "function" && (this.#S = r), typeof c == "function" && (this.#O = c), typeof m == "function" ? (this.#w = m, this.#r = []) : (this.#w = void 0, this.#r = void 0), this.#T = !!this.#S, this.#D = !!this.#O, this.#f = !!this.#w, this.noDisposeOnSet = !!_, this.noUpdateTTL = !!u, this.noDeleteOnFetchRejection = !!F, this.allowStaleOnFetchRejection = !!p, this.allowStaleOnFetchAbort = !!A, this.ignoreFetchAbort = !!z, this.maxEntrySize !== 0) {
+			if (this.#c !== 0 && !T(this.#c)) throw new TypeError("maxSize must be a positive integer if specified");
+			if (!T(this.maxEntrySize)) throw new TypeError("maxEntrySize must be a positive integer if specified");
+			this.#X();
+		}
+		if (this.allowStale = !!h, this.noDeleteOnStaleGet = !!b, this.updateAgeOnGet = !!o, this.updateAgeOnHas = !!l, this.ttlResolution = T(s) || s === 0 ? s : 1, this.ttlAutopurge = !!n, this.ttl = i || 0, this.ttl) {
+			if (!T(this.ttl)) throw new TypeError("ttl must be a positive integer if specified");
+			this.#k();
+		}
+		if (this.#o === 0 && this.ttl === 0 && this.#c === 0) throw new TypeError("At least one of max, maxSize, or ttl is required");
+		if (!this.ttlAutopurge && !this.#o && !this.#c) {
+			let D = "LRU_CACHE_UNBOUNDED";
+			k(D) && (j.add(D), P("TTL caching without ttlAutopurge, max, or maxSize can result in unbounded memory consumption.", "UnboundedCacheWarning", D, d));
+		}
+	}
+	getRemainingTTL(e) {
+		return this.#s.has(e) ? 1 / 0 : 0;
+	}
+	#k() {
+		let e = new O(this.#o), t = new O(this.#o);
+		this.#d = e, this.#F = t;
+		let i = this.ttlAutopurge ? Array.from({ length: this.#o }) : void 0;
+		this.#g = i, this.#H = (h, r, c = this.#m.now()) => {
+			t[h] = r !== 0 ? c : 0, e[h] = r, s(h, r);
+		}, this.#R = (h) => {
+			t[h] = e[h] !== 0 ? this.#m.now() : 0, s(h, e[h]);
+		};
+		let s = this.ttlAutopurge ? (h, r) => {
+			if (i?.[h] && (clearTimeout(i[h]), i[h] = void 0), r && r !== 0 && i) {
+				let c = setTimeout(() => {
+					this.#p(h) ? (this.#E(this.#i[h], "expire"), i[h] = void 0) : s(h, l(h));
+				}, r + 1);
+				c.unref && c.unref(), i[h] = c;
+			}
+		} : () => {};
+		this.#v = (h, r) => {
+			if (e[r]) {
+				let c = e[r], m = t[r];
+				if (!c || !m) return;
+				h.ttl = c, h.start = m, h.now = n || o();
+				h.remainingTTL = c - (h.now - m);
+			}
+		};
+		let n = 0, o = () => {
+			let h = this.#m.now();
 			if (this.ttlResolution > 0) {
-				cachedNow = n;
-				const t = setTimeout(() => cachedNow = 0, this.ttlResolution);
-				/* c8 ignore start */
-				if (t.unref) t.unref();
-			}
-			return n;
-		};
-		this.getRemainingTTL = (key) => {
-			const index = this.#keyMap.get(key);
-			if (index === void 0) return 0;
-			const ttl = ttls[index];
-			const start = starts[index];
-			if (!ttl || !start) return Infinity;
-			return ttl - ((cachedNow || getNow()) - start);
-		};
-		this.#isStale = (index) => {
-			const s = starts[index];
-			const t = ttls[index];
-			return !!t && !!s && (cachedNow || getNow()) - s > t;
-		};
-	}
-	#updateItemAge = () => {};
-	#statusTTL = () => {};
-	#setItemTTL = () => {};
-	/* c8 ignore stop */
-	#isStale = () => false;
-	#initializeSizeTracking() {
-		const sizes = new ZeroArray(this.#max);
-		this.#calculatedSize = 0;
-		this.#sizes = sizes;
-		this.#removeItemSize = (index) => {
-			this.#calculatedSize -= sizes[index];
-			sizes[index] = 0;
-		};
-		this.#requireSize = (k, v, size, sizeCalculation) => {
-			if (this.#isBackgroundFetch(v)) return 0;
-			if (!isPosInt(size)) {
-				if (sizeCalculation) {
-					if (typeof sizeCalculation !== "function") throw new TypeError("sizeCalculation must be a function");
-					size = sizeCalculation(v, k);
-					if (!isPosInt(size)) throw new TypeError("sizeCalculation return invalid (expect positive integer)");
+				n = h;
+				let r = setTimeout(() => n = 0, this.ttlResolution);
+				r.unref && r.unref();
+			}
+			return h;
+		};
+		this.getRemainingTTL = (h) => {
+			let r = this.#s.get(h);
+			return r === void 0 ? 0 : l(r);
+		};
+		let l = (h) => {
+			let r = e[h], c = t[h];
+			if (!r || !c) return 1 / 0;
+			return r - ((n || o()) - c);
+		};
+		this.#p = (h) => {
+			let r = t[h], c = e[h];
+			return !!c && !!r && (n || o()) - r > c;
+		};
+	}
+	#R = () => {};
+	#v = () => {};
+	#H = () => {};
+	#p = () => !1;
+	#X() {
+		let e = new O(this.#o);
+		this.#b = 0, this.#_ = e, this.#x = (t) => {
+			this.#b -= e[t], e[t] = 0;
+		}, this.#N = (t, i, s, n) => {
+			if (!T(s)) {
+				if (this.#e(i)) return this.backgroundFetchSize;
+				if (n) {
+					if (typeof n != "function") throw new TypeError("sizeCalculation must be a function");
+					if (s = n(i, t), !T(s)) throw new TypeError("sizeCalculation return invalid (expect positive integer)");
 				} else throw new TypeError("invalid size value (must be positive integer). When maxSize or maxEntrySize is used, sizeCalculation or size must be set.");
 			}
-			return size;
-		};
-		this.#addItemSize = (index, size, status) => {
-			sizes[index] = size;
-			if (this.#maxSize) {
-				const maxSize = this.#maxSize - sizes[index];
-				while (this.#calculatedSize > maxSize) this.#evict(true);
-			}
-			this.#calculatedSize += sizes[index];
-			if (status) {
-				status.entrySize = size;
-				status.totalCalculatedSize = this.#calculatedSize;
+			return s;
+		}, this.#j = (t, i, s) => {
+			if (e[t] = i, this.#c) {
+				let n = this.#c - e[t];
+				for (; this.#b > n;) this.#G(!0);
 			}
+			this.#b += e[t], s && (s.entrySize = i, s.totalCalculatedSize = this.#b);
 		};
 	}
-	#removeItemSize = (_i) => {};
-	#addItemSize = (_i, _s, _st) => {};
-	#requireSize = (_k, _v, size, sizeCalculation) => {
-		if (size || sizeCalculation) throw new TypeError("cannot set size without setting maxSize or maxEntrySize on cache");
+	#x = (e) => {};
+	#j = (e, t, i) => {};
+	#N = (e, t, i, s) => {
+		if (i || s) throw new TypeError("cannot set size without setting maxSize or maxEntrySize on cache");
 		return 0;
 	};
-	*#indexes({ allowStale = this.allowStale } = {}) {
-		if (this.#size) for (let i = this.#tail;;) {
-			if (!this.#isValidIndex(i)) break;
-			if (allowStale || !this.#isStale(i)) yield i;
-			if (i === this.#head) break;
-			else i = this.#prev[i];
-		}
+	*#A({ allowStale: e = this.allowStale } = {}) {
+		if (this.#n) for (let t = this.#h; this.#V(t) && ((e || !this.#p(t)) && (yield t), t !== this.#a);) t = this.#u[t];
 	}
-	*#rindexes({ allowStale = this.allowStale } = {}) {
-		if (this.#size) for (let i = this.#head;;) {
-			if (!this.#isValidIndex(i)) break;
-			if (allowStale || !this.#isStale(i)) yield i;
-			if (i === this.#tail) break;
-			else i = this.#next[i];
-		}
+	*#z({ allowStale: e = this.allowStale } = {}) {
+		if (this.#n) for (let t = this.#a; this.#V(t) && ((e || !this.#p(t)) && (yield t), t !== this.#h);) t = this.#l[t];
 	}
-	#isValidIndex(index) {
-		return index !== void 0 && this.#keyMap.get(this.#keyList[index]) === index;
+	#V(e) {
+		return e !== void 0 && this.#s.get(this.#i[e]) === e;
 	}
-	/**
-	* Return a generator yielding `[key, value]` pairs,
-	* in order from most recently used to least recently used.
-	*/
 	*entries() {
-		for (const i of this.#indexes()) if (this.#valList[i] !== void 0 && this.#keyList[i] !== void 0 && !this.#isBackgroundFetch(this.#valList[i])) yield [this.#keyList[i], this.#valList[i]];
+		for (let e of this.#A()) this.#t[e] !== void 0 && this.#i[e] !== void 0 && !this.#e(this.#t[e]) && (yield [this.#i[e], this.#t[e]]);
 	}
-	/**
-	* Inverse order version of {@link LRUCache.entries}
-	*
-	* Return a generator yielding `[key, value]` pairs,
-	* in order from least recently used to most recently used.
-	*/
 	*rentries() {
-		for (const i of this.#rindexes()) if (this.#valList[i] !== void 0 && this.#keyList[i] !== void 0 && !this.#isBackgroundFetch(this.#valList[i])) yield [this.#keyList[i], this.#valList[i]];
+		for (let e of this.#z()) this.#t[e] !== void 0 && this.#i[e] !== void 0 && !this.#e(this.#t[e]) && (yield [this.#i[e], this.#t[e]]);
 	}
-	/**
-	* Return a generator yielding the keys in the cache,
-	* in order from most recently used to least recently used.
-	*/
 	*keys() {
-		for (const i of this.#indexes()) {
-			const k = this.#keyList[i];
-			if (k !== void 0 && !this.#isBackgroundFetch(this.#valList[i])) yield k;
+		for (let e of this.#A()) {
+			let t = this.#i[e];
+			t !== void 0 && !this.#e(this.#t[e]) && (yield t);
 		}
 	}
-	/**
-	* Inverse order version of {@link LRUCache.keys}
-	*
-	* Return a generator yielding the keys in the cache,
-	* in order from least recently used to most recently used.
-	*/
 	*rkeys() {
-		for (const i of this.#rindexes()) {
-			const k = this.#keyList[i];
-			if (k !== void 0 && !this.#isBackgroundFetch(this.#valList[i])) yield k;
+		for (let e of this.#z()) {
+			let t = this.#i[e];
+			t !== void 0 && !this.#e(this.#t[e]) && (yield t);
 		}
 	}
-	/**
-	* Return a generator yielding the values in the cache,
-	* in order from most recently used to least recently used.
-	*/
 	*values() {
-		for (const i of this.#indexes()) if (this.#valList[i] !== void 0 && !this.#isBackgroundFetch(this.#valList[i])) yield this.#valList[i];
+		for (let e of this.#A()) this.#t[e] !== void 0 && !this.#e(this.#t[e]) && (yield this.#t[e]);
 	}
-	/**
-	* Inverse order version of {@link LRUCache.values}
-	*
-	* Return a generator yielding the values in the cache,
-	* in order from least recently used to most recently used.
-	*/
 	*rvalues() {
-		for (const i of this.#rindexes()) if (this.#valList[i] !== void 0 && !this.#isBackgroundFetch(this.#valList[i])) yield this.#valList[i];
+		for (let e of this.#z()) this.#t[e] !== void 0 && !this.#e(this.#t[e]) && (yield this.#t[e]);
 	}
-	/**
-	* Iterating over the cache itself yields the same results as
-	* {@link LRUCache.entries}
-	*/
 	[Symbol.iterator]() {
 		return this.entries();
 	}
-	/**
-	* A String value that is used in the creation of the default string
-	* description of an object. Called by the built-in method
-	* `Object.prototype.toString`.
-	*/
 	[Symbol.toStringTag] = "LRUCache";
-	/**
-	* Find a value for which the supplied fn method returns a truthy value,
-	* similar to `Array.find()`. fn is called as `fn(value, key, cache)`.
-	*/
-	find(fn, getOptions = {}) {
-		for (const i of this.#indexes()) {
-			const v = this.#valList[i];
-			const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v;
-			if (value === void 0) continue;
-			if (fn(value, this.#keyList[i], this)) return this.get(this.#keyList[i], getOptions);
+	find(e, t = {}) {
+		for (let i of this.#A()) {
+			let s = this.#t[i], n = this.#e(s) ? s.__staleWhileFetching : s;
+			if (n !== void 0 && e(n, this.#i[i], this)) return this.#C(this.#i[i], t);
 		}
 	}
-	/**
-	* Call the supplied function on each item in the cache, in order from most
-	* recently used to least recently used.
-	*
-	* `fn` is called as `fn(value, key, cache)`.
-	*
-	* If `thisp` is provided, function will be called in the `this`-context of
-	* the provided object, or the cache if no `thisp` object is provided.
-	*
-	* Does not update age or recenty of use, or iterate over stale values.
-	*/
-	forEach(fn, thisp = this) {
-		for (const i of this.#indexes()) {
-			const v = this.#valList[i];
-			const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v;
-			if (value === void 0) continue;
-			fn.call(thisp, value, this.#keyList[i], this);
+	forEach(e, t = this) {
+		for (let i of this.#A()) {
+			let s = this.#t[i], n = this.#e(s) ? s.__staleWhileFetching : s;
+			n !== void 0 && e.call(t, n, this.#i[i], this);
 		}
 	}
-	/**
-	* The same as {@link LRUCache.forEach} but items are iterated over in
-	* reverse order.  (ie, less recently used items are iterated over first.)
-	*/
-	rforEach(fn, thisp = this) {
-		for (const i of this.#rindexes()) {
-			const v = this.#valList[i];
-			const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v;
-			if (value === void 0) continue;
-			fn.call(thisp, value, this.#keyList[i], this);
+	rforEach(e, t = this) {
+		for (let i of this.#z()) {
+			let s = this.#t[i], n = this.#e(s) ? s.__staleWhileFetching : s;
+			n !== void 0 && e.call(t, n, this.#i[i], this);
 		}
 	}
-	/**
-	* Delete any stale entries. Returns true if anything was removed,
-	* false otherwise.
-	*/
 	purgeStale() {
-		let deleted = false;
-		for (const i of this.#rindexes({ allowStale: true })) if (this.#isStale(i)) {
-			this.#delete(this.#keyList[i], "expire");
-			deleted = true;
-		}
-		return deleted;
-	}
-	/**
-	* Get the extended info about a given entry, to get its value, size, and
-	* TTL info simultaneously. Returns `undefined` if the key is not present.
-	*
-	* Unlike {@link LRUCache#dump}, which is designed to be portable and survive
-	* serialization, the `start` value is always the current timestamp, and the
-	* `ttl` is a calculated remaining time to live (negative if expired).
-	*
-	* Always returns stale values, if their info is found in the cache, so be
-	* sure to check for expirations (ie, a negative {@link LRUCache.Entry#ttl})
-	* if relevant.
-	*/
-	info(key) {
-		const i = this.#keyMap.get(key);
-		if (i === void 0) return void 0;
-		const v = this.#valList[i];
-		/* c8 ignore start - this isn't tested for the info function,
-		* but it's the same logic as found in other places. */
-		const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v;
-		if (value === void 0) return void 0;
-		/* c8 ignore end */
-		const entry = { value };
-		if (this.#ttls && this.#starts) {
-			const ttl = this.#ttls[i];
-			const start = this.#starts[i];
-			if (ttl && start) {
-				entry.ttl = ttl - (this.#perf.now() - start);
-				entry.start = Date.now();
-			}
-		}
-		if (this.#sizes) entry.size = this.#sizes[i];
-		return entry;
+		let e = !1;
+		for (let t of this.#z({ allowStale: !0 })) this.#p(t) && (this.#E(this.#i[t], "expire"), e = !0);
+		return e;
+	}
+	info(e) {
+		let t = this.#s.get(e);
+		if (t === void 0) return;
+		let i = this.#t[t], s = this.#e(i) ? i.__staleWhileFetching : i;
+		if (s === void 0) return;
+		let n = { value: s };
+		if (this.#d && this.#F) {
+			let o = this.#d[t], l = this.#F[t];
+			if (o && l) n.ttl = o - (this.#m.now() - l), n.start = Date.now();
+		}
+		return this.#_ && (n.size = this.#_[t]), n;
 	}
-	/**
-	* Return an array of [key, {@link LRUCache.Entry}] tuples which can be
-	* passed to {@link LRUCache#load}.
-	*
-	* The `start` fields are calculated relative to a portable `Date.now()`
-	* timestamp, even if `performance.now()` is available.
-	*
-	* Stale entries are always included in the `dump`, even if
-	* {@link LRUCache.OptionsBase.allowStale} is false.
-	*
-	* Note: this returns an actual array, not a generator, so it can be more
-	* easily passed around.
-	*/
 	dump() {
-		const arr = [];
-		for (const i of this.#indexes({ allowStale: true })) {
-			const key = this.#keyList[i];
-			const v = this.#valList[i];
-			const value = this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v;
-			if (value === void 0 || key === void 0) continue;
-			const entry = { value };
-			if (this.#ttls && this.#starts) {
-				entry.ttl = this.#ttls[i];
-				const age = this.#perf.now() - this.#starts[i];
-				entry.start = Math.floor(Date.now() - age);
-			}
-			if (this.#sizes) entry.size = this.#sizes[i];
-			arr.unshift([key, entry]);
-		}
-		return arr;
-	}
-	/**
-	* Reset the cache and load in the items in entries in the order listed.
-	*
-	* The shape of the resulting cache may be different if the same options are
-	* not used in both caches.
-	*
-	* The `start` fields are assumed to be calculated relative to a portable
-	* `Date.now()` timestamp, even if `performance.now()` is available.
-	*/
-	load(arr) {
-		this.clear();
-		for (const [key, entry] of arr) {
-			if (entry.start) {
-				const age = Date.now() - entry.start;
-				entry.start = this.#perf.now() - age;
+		let e = [];
+		for (let t of this.#A({ allowStale: !0 })) {
+			let i = this.#i[t], s = this.#t[t], n = this.#e(s) ? s.__staleWhileFetching : s;
+			if (n === void 0 || i === void 0) continue;
+			let o = { value: n };
+			if (this.#d && this.#F) {
+				o.ttl = this.#d[t];
+				let l = this.#m.now() - this.#F[t];
+				o.start = Math.floor(Date.now() - l);
 			}
-			this.set(key, entry.value, entry);
+			this.#_ && (o.size = this.#_[t]), e.unshift([i, o]);
 		}
+		return e;
 	}
-	/**
-	* Add a value to the cache.
-	*
-	* Note: if `undefined` is specified as a value, this is an alias for
-	* {@link LRUCache#delete}
-	*
-	* Fields on the {@link LRUCache.SetOptions} options param will override
-	* their corresponding values in the constructor options for the scope
-	* of this single `set()` operation.
-	*
-	* If `start` is provided, then that will set the effective start
-	* time for the TTL calculation. Note that this must be a previous
-	* value of `performance.now()` if supported, or a previous value of
-	* `Date.now()` if not.
-	*
-	* Options object may also include `size`, which will prevent
-	* calling the `sizeCalculation` function and just use the specified
-	* number if it is a positive integer, and `noDisposeOnSet` which
-	* will prevent calling a `dispose` function in the case of
-	* overwrites.
-	*
-	* If the `size` (or return value of `sizeCalculation`) for a given
-	* entry is greater than `maxEntrySize`, then the item will not be
-	* added to the cache.
-	*
-	* Will update the recency of the entry.
-	*
-	* If the value is `undefined`, then this is an alias for
-	* `cache.delete(key)`. `undefined` is never stored in the cache.
-	*/
-	set(k, v, setOptions = {}) {
-		if (v === void 0) {
-			this.delete(k);
-			return this;
-		}
-		const { ttl = this.ttl, start, noDisposeOnSet = this.noDisposeOnSet, sizeCalculation = this.sizeCalculation, status } = setOptions;
-		let { noUpdateTTL = this.noUpdateTTL } = setOptions;
-		const size = this.#requireSize(k, v, setOptions.size || 0, sizeCalculation);
-		if (this.maxEntrySize && size > this.maxEntrySize) {
-			if (status) {
-				status.set = "miss";
-				status.maxEntrySizeExceeded = true;
-			}
-			this.#delete(k, "set");
-			return this;
-		}
-		let index = this.#size === 0 ? void 0 : this.#keyMap.get(k);
-		if (index === void 0) {
-			index = this.#size === 0 ? this.#tail : this.#free.length !== 0 ? this.#free.pop() : this.#size === this.#max ? this.#evict(false) : this.#size;
-			this.#keyList[index] = k;
-			this.#valList[index] = v;
-			this.#keyMap.set(k, index);
-			this.#next[this.#tail] = index;
-			this.#prev[index] = this.#tail;
-			this.#tail = index;
-			this.#size++;
-			this.#addItemSize(index, size, status);
-			if (status) status.set = "add";
-			noUpdateTTL = false;
-			if (this.#hasOnInsert) this.#onInsert?.(v, k, "add");
-		} else {
-			this.#moveToTail(index);
-			const oldVal = this.#valList[index];
-			if (v !== oldVal) {
-				if (this.#hasFetchMethod && this.#isBackgroundFetch(oldVal)) {
-					oldVal.__abortController.abort(/* @__PURE__ */ new Error("replaced"));
-					const { __staleWhileFetching: s } = oldVal;
-					if (s !== void 0 && !noDisposeOnSet) {
-						if (this.#hasDispose) this.#dispose?.(s, k, "set");
-						if (this.#hasDisposeAfter) this.#disposed?.push([
-							s,
-							k,
-							"set"
-						]);
-					}
-				} else if (!noDisposeOnSet) {
-					if (this.#hasDispose) this.#dispose?.(oldVal, k, "set");
-					if (this.#hasDisposeAfter) this.#disposed?.push([
-						oldVal,
-						k,
+	load(e) {
+		this.clear();
+		for (let [t, i] of e) {
+			if (i.start) {
+				let s = Date.now() - i.start;
+				i.start = this.#m.now() - s;
+			}
+			this.#W(t, i.value, i);
+		}
+	}
+	set(e, t, i = {}) {
+		let { status: s = S.hasSubscribers ? {} : void 0 } = i;
+		i.status = s, s && (s.op = "set", s.key = e, t !== void 0 && (s.value = t), s.cache = this);
+		let n = this.#W(e, t, i);
+		return s && S.hasSubscribers && S.publish(s), n;
+	}
+	#W(e, t, i, s) {
+		let { ttl: n = this.ttl, start: o, noDisposeOnSet: l = this.noDisposeOnSet, sizeCalculation: h = this.sizeCalculation, status: r } = i, c = this.#e(t);
+		if (t === void 0) return r && (r.set = "deleted"), this.delete(e), this;
+		let { noUpdateTTL: m = this.noUpdateTTL } = i;
+		r && !c && (r.value = t);
+		let _ = this.#N(e, t, i.size || 0, h, r);
+		if (this.maxEntrySize && _ > this.maxEntrySize) return this.#E(e, "set"), r && (r.set = "miss", r.maxEntrySizeExceeded = !0), this;
+		let u = this.#n === 0 ? void 0 : this.#s.get(e);
+		if (u === void 0) u = this.#n === 0 ? this.#h : this.#y.length !== 0 ? this.#y.pop() : this.#n === this.#o ? this.#G(!1) : this.#n, this.#i[u] = e, this.#t[u] = t, this.#s.set(e, u), this.#l[this.#h] = u, this.#u[u] = this.#h, this.#h = u, this.#n++, this.#j(u, _, r), r && (r.set = "add"), m = !1, this.#D && !c && this.#O?.(t, e, "add");
+		else {
+			this.#L(u);
+			let g = this.#t[u];
+			if (t !== g) {
+				if (!l) if (this.#e(g)) {
+					g !== s && g.__abortController.abort(/* @__PURE__ */ new Error("replaced"));
+					let { __staleWhileFetching: f } = g;
+					f !== void 0 && f !== t && (this.#T && this.#S?.(f, e, "set"), this.#f && this.#r?.push([
+						f,
+						e,
 						"set"
-					]);
-				}
-				this.#removeItemSize(index);
-				this.#addItemSize(index, size, status);
-				this.#valList[index] = v;
-				if (status) {
-					status.set = "replace";
-					const oldValue = oldVal && this.#isBackgroundFetch(oldVal) ? oldVal.__staleWhileFetching : oldVal;
-					if (oldValue !== void 0) status.oldValue = oldValue;
+					]));
+				} else this.#T && this.#S?.(g, e, "set"), this.#f && this.#r?.push([
+					g,
+					e,
+					"set"
+				]);
+				if (this.#x(u), this.#j(u, _, r), this.#t[u] = t, !c) {
+					let f = g && this.#e(g) ? g.__staleWhileFetching : g, y = f === void 0 ? "add" : t !== f ? "replace" : "update";
+					r && (r.set = y, f !== void 0 && (r.oldValue = f)), this.#D && this.onInsert?.(t, e, y);
 				}
-			} else if (status) status.set = "update";
-			if (this.#hasOnInsert) this.onInsert?.(v, k, v === oldVal ? "update" : "replace");
+			} else c || (r && (r.set = "update"), this.#D && this.onInsert?.(t, e, "update"));
 		}
-		if (ttl !== 0 && !this.#ttls) this.#initializeTTLTracking();
-		if (this.#ttls) {
-			if (!noUpdateTTL) this.#setItemTTL(index, ttl, start);
-			if (status) this.#statusTTL(status, index);
-		}
-		if (!noDisposeOnSet && this.#hasDisposeAfter && this.#disposed) {
-			const dt = this.#disposed;
-			let task;
-			while (task = dt?.shift()) this.#disposeAfter?.(...task);
+		if (n !== 0 && !this.#d && this.#k(), this.#d && (m || this.#H(u, n, o), r && this.#v(r, u)), !l && this.#f && this.#r) {
+			let g = this.#r, f;
+			for (; f = g?.shift();) this.#w?.(...f);
 		}
 		return this;
 	}
-	/**
-	* Evict the least recently used item, returning its value or
-	* `undefined` if cache is empty.
-	*/
 	pop() {
 		try {
-			while (this.#size) {
-				const val = this.#valList[this.#head];
-				this.#evict(true);
-				if (this.#isBackgroundFetch(val)) {
-					if (val.__staleWhileFetching) return val.__staleWhileFetching;
-				} else if (val !== void 0) return val;
+			for (; this.#n;) {
+				let e = this.#t[this.#a];
+				if (this.#G(!0), this.#e(e)) {
+					if (e.__staleWhileFetching) return e.__staleWhileFetching;
+				} else if (e !== void 0) return e;
 			}
 		} finally {
-			if (this.#hasDisposeAfter && this.#disposed) {
-				const dt = this.#disposed;
-				let task;
-				while (task = dt?.shift()) this.#disposeAfter?.(...task);
-			}
-		}
-	}
-	#evict(free) {
-		const head = this.#head;
-		const k = this.#keyList[head];
-		const v = this.#valList[head];
-		if (this.#hasFetchMethod && this.#isBackgroundFetch(v)) v.__abortController.abort(/* @__PURE__ */ new Error("evicted"));
-		else if (this.#hasDispose || this.#hasDisposeAfter) {
-			if (this.#hasDispose) this.#dispose?.(v, k, "evict");
-			if (this.#hasDisposeAfter) this.#disposed?.push([
-				v,
-				k,
-				"evict"
-			]);
-		}
-		this.#removeItemSize(head);
-		if (this.#autopurgeTimers?.[head]) {
-			clearTimeout(this.#autopurgeTimers[head]);
-			this.#autopurgeTimers[head] = void 0;
-		}
-		if (free) {
-			this.#keyList[head] = void 0;
-			this.#valList[head] = void 0;
-			this.#free.push(head);
-		}
-		if (this.#size === 1) {
-			this.#head = this.#tail = 0;
-			this.#free.length = 0;
-		} else this.#head = this.#next[head];
-		this.#keyMap.delete(k);
-		this.#size--;
-		return head;
-	}
-	/**
-	* Check if a key is in the cache, without updating the recency of use.
-	* Will return false if the item is stale, even though it is technically
-	* in the cache.
-	*
-	* Check if a key is in the cache, without updating the recency of
-	* use. Age is updated if {@link LRUCache.OptionsBase.updateAgeOnHas} is set
-	* to `true` in either the options or the constructor.
-	*
-	* Will return `false` if the item is stale, even though it is technically in
-	* the cache. The difference can be determined (if it matters) by using a
-	* `status` argument, and inspecting the `has` field.
-	*
-	* Will not update item age unless
-	* {@link LRUCache.OptionsBase.updateAgeOnHas} is set.
-	*/
-	has(k, hasOptions = {}) {
-		const { updateAgeOnHas = this.updateAgeOnHas, status } = hasOptions;
-		const index = this.#keyMap.get(k);
-		if (index !== void 0) {
-			const v = this.#valList[index];
-			if (this.#isBackgroundFetch(v) && v.__staleWhileFetching === void 0) return false;
-			if (!this.#isStale(index)) {
-				if (updateAgeOnHas) this.#updateItemAge(index);
-				if (status) {
-					status.has = "hit";
-					this.#statusTTL(status, index);
-				}
-				return true;
-			} else if (status) {
-				status.has = "stale";
-				this.#statusTTL(status, index);
-			}
-		} else if (status) status.has = "miss";
-		return false;
-	}
-	/**
-	* Like {@link LRUCache#get} but doesn't update recency or delete stale
-	* items.
-	*
-	* Returns `undefined` if the item is stale, unless
-	* {@link LRUCache.OptionsBase.allowStale} is set.
-	*/
-	peek(k, peekOptions = {}) {
-		const { allowStale = this.allowStale } = peekOptions;
-		const index = this.#keyMap.get(k);
-		if (index === void 0 || !allowStale && this.#isStale(index)) return;
-		const v = this.#valList[index];
-		return this.#isBackgroundFetch(v) ? v.__staleWhileFetching : v;
-	}
-	#backgroundFetch(k, index, options, context) {
-		const v = index === void 0 ? void 0 : this.#valList[index];
-		if (this.#isBackgroundFetch(v)) return v;
-		const ac = new AC();
-		const { signal } = options;
-		signal?.addEventListener("abort", () => ac.abort(signal.reason), { signal: ac.signal });
-		const fetchOpts = {
-			signal: ac.signal,
-			options,
-			context
-		};
-		const cb = (v, updateCache = false) => {
-			const { aborted } = ac.signal;
-			const ignoreAbort = options.ignoreFetchAbort && v !== void 0;
-			if (options.status) {
-				if (aborted && !updateCache) {
-					options.status.fetchAborted = true;
-					options.status.fetchError = ac.signal.reason;
-					if (ignoreAbort) options.status.fetchAbortIgnored = true;
-				} else options.status.fetchResolved = true;
-			}
-			if (aborted && !ignoreAbort && !updateCache) return fetchFail(ac.signal.reason);
-			const bf = p;
-			const vl = this.#valList[index];
-			if (vl === p || ignoreAbort && updateCache && vl === void 0) {
-				if (v === void 0) {
-					if (bf.__staleWhileFetching !== void 0) this.#valList[index] = bf.__staleWhileFetching;
-					else this.#delete(k, "fetch");
-				} else {
-					if (options.status) options.status.fetchUpdated = true;
-					this.set(k, v, fetchOpts.options);
-				}
-			}
-			return v;
-		};
-		const eb = (er) => {
-			if (options.status) {
-				options.status.fetchRejected = true;
-				options.status.fetchError = er;
-			}
-			return fetchFail(er);
-		};
-		const fetchFail = (er) => {
-			const { aborted } = ac.signal;
-			const allowStaleAborted = aborted && options.allowStaleOnFetchAbort;
-			const allowStale = allowStaleAborted || options.allowStaleOnFetchRejection;
-			const noDelete = allowStale || options.noDeleteOnFetchRejection;
-			const bf = p;
-			if (this.#valList[index] === p) {
-				if (!noDelete || bf.__staleWhileFetching === void 0) this.#delete(k, "fetch");
-				else if (!allowStaleAborted) this.#valList[index] = bf.__staleWhileFetching;
-			}
-			if (allowStale) {
-				if (options.status && bf.__staleWhileFetching !== void 0) options.status.returnedStale = true;
-				return bf.__staleWhileFetching;
-			} else if (bf.__returned === bf) throw er;
-		};
-		const pcall = (res, rej) => {
-			const fmp = this.#fetchMethod?.(k, v, fetchOpts);
-			if (fmp && fmp instanceof Promise) fmp.then((v) => res(v === void 0 ? void 0 : v), rej);
-			ac.signal.addEventListener("abort", () => {
-				if (!options.ignoreFetchAbort || options.allowStaleOnFetchAbort) {
-					res(void 0);
-					if (options.allowStaleOnFetchAbort) res = (v) => cb(v, true);
-				}
-			});
-		};
-		if (options.status) options.status.fetchDispatched = true;
-		const p = new Promise(pcall).then(cb, eb);
-		const bf = Object.assign(p, {
-			__abortController: ac,
-			__staleWhileFetching: v,
+			if (this.#f && this.#r) {
+				let e = this.#r, t;
+				for (; t = e?.shift();) this.#w?.(...t);
+			}
+		}
+	}
+	#G(e) {
+		let t = this.#a, i = this.#i[t], s = this.#t[t], n = this.#e(s);
+		n && s.__abortController.abort(/* @__PURE__ */ new Error("evicted"));
+		let o = n ? s.__staleWhileFetching : s;
+		return (this.#T || this.#f) && o !== void 0 && (this.#T && this.#S?.(o, i, "evict"), this.#f && this.#r?.push([
+			o,
+			i,
+			"evict"
+		])), this.#x(t), this.#g?.[t] && (clearTimeout(this.#g[t]), this.#g[t] = void 0), e && (this.#i[t] = void 0, this.#t[t] = void 0, this.#y.push(t)), this.#n === 1 ? (this.#a = this.#h = 0, this.#y.length = 0) : this.#a = this.#l[t], this.#s.delete(i), this.#n--, t;
+	}
+	has(e, t = {}) {
+		let { status: i = S.hasSubscribers ? {} : void 0 } = t;
+		t.status = i, i && (i.op = "has", i.key = e, i.cache = this);
+		let s = this.#Y(e, t);
+		return S.hasSubscribers && S.publish(i), s;
+	}
+	#Y(e, t = {}) {
+		let { updateAgeOnHas: i = this.updateAgeOnHas, status: s } = t, n = this.#s.get(e);
+		if (n !== void 0) {
+			let o = this.#t[n];
+			if (this.#e(o) && o.__staleWhileFetching === void 0) return !1;
+			if (this.#p(n)) s && (s.has = "stale", this.#v(s, n));
+			else return i && this.#R(n), s && (s.has = "hit", this.#v(s, n)), !0;
+		} else s && (s.has = "miss");
+		return !1;
+	}
+	peek(e, t = {}) {
+		let { status: i = R() ? {} : void 0 } = t;
+		i && (i.op = "peek", i.key = e, i.cache = this), t.status = i;
+		let s = this.#J(e, t);
+		return S.hasSubscribers && S.publish(i), s;
+	}
+	#J(e, t) {
+		let { status: i, allowStale: s = this.allowStale } = t, n = this.#s.get(e);
+		if (n === void 0 || !s && this.#p(n)) {
+			i && (i.peek = n === void 0 ? "miss" : "stale");
+			return;
+		}
+		let o = this.#t[n], l = this.#e(o) ? o.__staleWhileFetching : o;
+		return i && (l !== void 0 ? (i.peek = "hit", i.value = l) : i.peek = "miss"), l;
+	}
+	#P(e, t, i, s) {
+		let n = t === void 0 ? void 0 : this.#t[t];
+		if (this.#e(n)) return n;
+		let o = new AbortController(), { signal: l } = i;
+		l?.addEventListener("abort", () => o.abort(l.reason), { signal: o.signal });
+		let h = {
+			signal: o.signal,
+			options: i,
+			context: s
+		}, r = (f, y = !1) => {
+			let { aborted: a } = o.signal, w = i.ignoreFetchAbort && f !== void 0, F = i.ignoreFetchAbort || !!(i.allowStaleOnFetchAbort && f !== void 0);
+			if (i.status && (a && !y ? (i.status.fetchAborted = !0, i.status.fetchError = o.signal.reason, w && (i.status.fetchAbortIgnored = !0)) : i.status.fetchResolved = !0), a && !w && !y) return m(o.signal.reason, F);
+			let b = u, p = this.#t[t];
+			return (p === u || p === void 0 && w && y) && (f === void 0 ? b.__staleWhileFetching !== void 0 ? this.#t[t] = b.__staleWhileFetching : this.#E(e, "fetch") : (i.status && (i.status.fetchUpdated = !0), this.#W(e, f, h.options, b))), f;
+		}, c = (f) => (i.status && (i.status.fetchRejected = !0, i.status.fetchError = f), m(f, !1)), m = (f, y) => {
+			let { aborted: a } = o.signal, w = a && i.allowStaleOnFetchAbort, F = w || i.allowStaleOnFetchRejection, b = F || i.noDeleteOnFetchRejection, p = u;
+			if (this.#t[t] === u && (!b || !y && p.__staleWhileFetching === void 0 ? this.#E(e, "fetch") : w || (this.#t[t] = p.__staleWhileFetching)), F) return i.status && p.__staleWhileFetching !== void 0 && (i.status.returnedStale = !0), p.__staleWhileFetching;
+			if (p.__returned === p) throw f;
+		}, _ = (f, y) => {
+			let a = this.#M?.(e, n, h);
+			o.signal.addEventListener("abort", () => {
+				(!i.ignoreFetchAbort || i.allowStaleOnFetchAbort) && (f(void 0), i.allowStaleOnFetchAbort && (f = (w) => r(w, !0)));
+			}), a && a instanceof Promise ? a.then((w) => f(w === void 0 ? void 0 : w), y) : a !== void 0 && f(a);
+		};
+		i.status && (i.status.fetchDispatched = !0);
+		let u = new Promise(_).then(r, c), g = Object.assign(u, {
+			__abortController: o,
+			__staleWhileFetching: n,
 			__returned: void 0
 		});
-		if (index === void 0) {
-			this.set(k, bf, {
-				...fetchOpts.options,
-				status: void 0
-			});
-			index = this.#keyMap.get(k);
-		} else this.#valList[index] = bf;
-		return bf;
-	}
-	#isBackgroundFetch(p) {
-		if (!this.#hasFetchMethod) return false;
-		const b = p;
-		return !!b && b instanceof Promise && b.hasOwnProperty("__staleWhileFetching") && b.__abortController instanceof AC;
-	}
-	async fetch(k, fetchOptions = {}) {
-		const { allowStale = this.allowStale, updateAgeOnGet = this.updateAgeOnGet, noDeleteOnStaleGet = this.noDeleteOnStaleGet, ttl = this.ttl, noDisposeOnSet = this.noDisposeOnSet, size = 0, sizeCalculation = this.sizeCalculation, noUpdateTTL = this.noUpdateTTL, noDeleteOnFetchRejection = this.noDeleteOnFetchRejection, allowStaleOnFetchRejection = this.allowStaleOnFetchRejection, ignoreFetchAbort = this.ignoreFetchAbort, allowStaleOnFetchAbort = this.allowStaleOnFetchAbort, context, forceRefresh = false, status, signal } = fetchOptions;
-		if (!this.#hasFetchMethod) {
-			if (status) status.fetch = "get";
-			return this.get(k, {
-				allowStale,
-				updateAgeOnGet,
-				noDeleteOnStaleGet,
-				status
-			});
-		}
-		const options = {
-			allowStale,
-			updateAgeOnGet,
-			noDeleteOnStaleGet,
-			ttl,
-			noDisposeOnSet,
-			size,
-			sizeCalculation,
-			noUpdateTTL,
-			noDeleteOnFetchRejection,
-			allowStaleOnFetchRejection,
-			allowStaleOnFetchAbort,
-			ignoreFetchAbort,
-			status,
-			signal
-		};
-		let index = this.#keyMap.get(k);
-		if (index === void 0) {
-			if (status) status.fetch = "miss";
-			const p = this.#backgroundFetch(k, index, options, context);
+		return t === void 0 ? (this.#W(e, g, {
+			...h.options,
+			status: void 0
+		}), t = this.#s.get(e)) : this.#t[t] = g, g;
+	}
+	#e(e) {
+		if (!this.#U) return !1;
+		let t = e;
+		return !!t && t instanceof Promise && t.hasOwnProperty("__staleWhileFetching") && t.__abortController instanceof AbortController;
+	}
+	fetch(e, t = {}) {
+		let i = W.hasSubscribers, { status: s = R() ? {} : void 0 } = t;
+		t.status = s, s && t.context && (s.context = t.context);
+		let n = this.#B(e, t);
+		return s && i && (s.trace = !0, W.tracePromise(() => n, s).catch(() => {})), n;
+	}
+	async #B(e, t = {}) {
+		let { allowStale: i = this.allowStale, updateAgeOnGet: s = this.updateAgeOnGet, noDeleteOnStaleGet: n = this.noDeleteOnStaleGet, ttl: o = this.ttl, noDisposeOnSet: l = this.noDisposeOnSet, size: h = 0, sizeCalculation: r = this.sizeCalculation, noUpdateTTL: c = this.noUpdateTTL, noDeleteOnFetchRejection: m = this.noDeleteOnFetchRejection, allowStaleOnFetchRejection: _ = this.allowStaleOnFetchRejection, ignoreFetchAbort: u = this.ignoreFetchAbort, allowStaleOnFetchAbort: g = this.allowStaleOnFetchAbort, context: f, forceRefresh: y = !1, status: a, signal: w } = t;
+		if (a && (a.op = "fetch", a.key = e, y && (a.forceRefresh = !0), a.cache = this), !this.#U) return a && (a.fetch = "get"), this.#C(e, {
+			allowStale: i,
+			updateAgeOnGet: s,
+			noDeleteOnStaleGet: n,
+			status: a
+		});
+		let F = {
+			allowStale: i,
+			updateAgeOnGet: s,
+			noDeleteOnStaleGet: n,
+			ttl: o,
+			noDisposeOnSet: l,
+			size: h,
+			sizeCalculation: r,
+			noUpdateTTL: c,
+			noDeleteOnFetchRejection: m,
+			allowStaleOnFetchRejection: _,
+			allowStaleOnFetchAbort: g,
+			ignoreFetchAbort: u,
+			status: a,
+			signal: w
+		}, b = this.#s.get(e);
+		if (b === void 0) {
+			a && (a.fetch = "miss");
+			let p = this.#P(e, b, F, f);
 			return p.__returned = p;
 		} else {
-			const v = this.#valList[index];
-			if (this.#isBackgroundFetch(v)) {
-				const stale = allowStale && v.__staleWhileFetching !== void 0;
-				if (status) {
-					status.fetch = "inflight";
-					if (stale) status.returnedStale = true;
-				}
-				return stale ? v.__staleWhileFetching : v.__returned = v;
-			}
-			const isStale = this.#isStale(index);
-			if (!forceRefresh && !isStale) {
-				if (status) status.fetch = "hit";
-				this.#moveToTail(index);
-				if (updateAgeOnGet) this.#updateItemAge(index);
-				if (status) this.#statusTTL(status, index);
-				return v;
-			}
-			const p = this.#backgroundFetch(k, index, options, context);
-			const staleVal = p.__staleWhileFetching !== void 0 && allowStale;
-			if (status) {
-				status.fetch = isStale ? "stale" : "refresh";
-				if (staleVal && isStale) status.returnedStale = true;
-			}
-			return staleVal ? p.__staleWhileFetching : p.__returned = p;
-		}
-	}
-	async forceFetch(k, fetchOptions = {}) {
-		const v = await this.fetch(k, fetchOptions);
-		if (v === void 0) throw new Error("fetch() returned undefined");
-		return v;
-	}
-	memo(k, memoOptions = {}) {
-		const memoMethod = this.#memoMethod;
-		if (!memoMethod) throw new Error("no memoMethod provided to constructor");
-		const { context, forceRefresh, ...options } = memoOptions;
-		const v = this.get(k, options);
-		if (!forceRefresh && v !== void 0) return v;
-		const vv = memoMethod(k, v, {
-			options,
-			context
-		});
-		this.set(k, vv, options);
-		return vv;
+			let p = this.#t[b];
+			if (this.#e(p)) {
+				let v = i && p.__staleWhileFetching !== void 0;
+				return a && (a.fetch = "inflight", v && (a.returnedStale = !0)), v ? p.__staleWhileFetching : p.__returned = p;
+			}
+			let A = this.#p(b);
+			if (!y && !A) return a && (a.fetch = "hit"), this.#L(b), s && this.#R(b), a && this.#v(a, b), p;
+			let z = this.#P(e, b, F, f), E = z.__staleWhileFetching !== void 0 && i;
+			return a && (a.fetch = A ? "stale" : "refresh", E && A && (a.returnedStale = !0)), E ? z.__staleWhileFetching : z.__returned = z;
+		}
+	}
+	forceFetch(e, t = {}) {
+		let i = W.hasSubscribers, { status: s = R() ? {} : void 0 } = t;
+		t.status = s, s && t.context && (s.context = t.context);
+		let n = this.#K(e, t);
+		return s && i && (s.trace = !0, W.tracePromise(() => n, s).catch(() => {})), n;
+	}
+	async #K(e, t = {}) {
+		let i = await this.#B(e, t);
+		if (i === void 0) throw new Error("fetch() returned undefined");
+		return i;
+	}
+	memo(e, t = {}) {
+		let { status: i = S.hasSubscribers ? {} : void 0 } = t;
+		t.status = i, i && (i.op = "memo", i.key = e, t.context && (i.context = t.context), i.cache = this);
+		let s = this.#Q(e, t);
+		return i && (i.value = s), S.hasSubscribers && S.publish(i), s;
+	}
+	#Q(e, t = {}) {
+		let i = this.#I;
+		if (!i) throw new Error("no memoMethod provided to constructor");
+		let { context: s, status: n, forceRefresh: o, ...l } = t;
+		n && o && (n.forceRefresh = !0);
+		let h = this.#C(e, l), r = o || h === void 0;
+		if (n && (n.memo = r ? "miss" : "hit", r || (n.value = h)), !r) return h;
+		let c = i(e, h, {
+			options: l,
+			context: s
+		});
+		return n && (n.value = c), this.#W(e, c, l), c;
+	}
+	get(e, t = {}) {
+		let { status: i = S.hasSubscribers ? {} : void 0 } = t;
+		t.status = i, i && (i.op = "get", i.key = e, i.cache = this);
+		let s = this.#C(e, t);
+		return i && (s !== void 0 && (i.value = s), S.hasSubscribers && S.publish(i)), s;
+	}
+	#C(e, t = {}) {
+		let { allowStale: i = this.allowStale, updateAgeOnGet: s = this.updateAgeOnGet, noDeleteOnStaleGet: n = this.noDeleteOnStaleGet, status: o } = t, l = this.#s.get(e);
+		if (l === void 0) {
+			o && (o.get = "miss");
+			return;
+		}
+		let h = this.#t[l], r = this.#e(h);
+		return o && this.#v(o, l), this.#p(l) ? r ? (o && (o.get = "stale-fetching"), i && h.__staleWhileFetching !== void 0 ? (o && (o.returnedStale = !0), h.__staleWhileFetching) : void 0) : (n || this.#E(e, "expire"), o && (o.get = "stale"), i ? (o && (o.returnedStale = !0), h) : void 0) : (o && (o.get = r ? "fetching" : "hit"), this.#L(l), s && this.#R(l), r ? h.__staleWhileFetching : h);
 	}
-	/**
-	* Return a value from the cache. Will update the recency of the cache
-	* entry found.
-	*
-	* If the key is not found, get() will return `undefined`.
-	*/
-	get(k, getOptions = {}) {
-		const { allowStale = this.allowStale, updateAgeOnGet = this.updateAgeOnGet, noDeleteOnStaleGet = this.noDeleteOnStaleGet, status } = getOptions;
-		const index = this.#keyMap.get(k);
-		if (index !== void 0) {
-			const value = this.#valList[index];
-			const fetching = this.#isBackgroundFetch(value);
-			if (status) this.#statusTTL(status, index);
-			if (this.#isStale(index)) {
-				if (status) status.get = "stale";
-				if (!fetching) {
-					if (!noDeleteOnStaleGet) this.#delete(k, "expire");
-					if (status && allowStale) status.returnedStale = true;
-					return allowStale ? value : void 0;
-				} else {
-					if (status && allowStale && value.__staleWhileFetching !== void 0) status.returnedStale = true;
-					return allowStale ? value.__staleWhileFetching : void 0;
-				}
-			} else {
-				if (status) status.get = "hit";
-				if (fetching) return value.__staleWhileFetching;
-				this.#moveToTail(index);
-				if (updateAgeOnGet) this.#updateItemAge(index);
-				return value;
-			}
-		} else if (status) status.get = "miss";
+	#$(e, t) {
+		this.#u[t] = e, this.#l[e] = t;
 	}
-	#connect(p, n) {
-		this.#prev[n] = p;
-		this.#next[p] = n;
+	#L(e) {
+		e !== this.#h && (e === this.#a ? this.#a = this.#l[e] : this.#$(this.#u[e], this.#l[e]), this.#$(this.#h, e), this.#h = e);
 	}
-	#moveToTail(index) {
-		if (index !== this.#tail) {
-			if (index === this.#head) this.#head = this.#next[index];
-			else this.#connect(this.#prev[index], this.#next[index]);
-			this.#connect(this.#tail, index);
-			this.#tail = index;
-		}
+	delete(e) {
+		return this.#E(e, "delete");
 	}
-	/**
-	* Deletes a key out of the cache.
-	*
-	* Returns true if the key was deleted, false otherwise.
-	*/
-	delete(k) {
-		return this.#delete(k, "delete");
-	}
-	#delete(k, reason) {
-		let deleted = false;
-		if (this.#size !== 0) {
-			const index = this.#keyMap.get(k);
-			if (index !== void 0) {
-				if (this.#autopurgeTimers?.[index]) {
-					clearTimeout(this.#autopurgeTimers?.[index]);
-					this.#autopurgeTimers[index] = void 0;
-				}
-				deleted = true;
-				if (this.#size === 1) this.#clear(reason);
+	#E(e, t) {
+		S.hasSubscribers && S.publish({
+			op: "delete",
+			delete: t,
+			key: e,
+			cache: this
+		});
+		let i = !1;
+		if (this.#n !== 0) {
+			let s = this.#s.get(e);
+			if (s !== void 0) if (this.#g?.[s] && (clearTimeout(this.#g[s]), this.#g[s] = void 0), i = !0, this.#n === 1) this.#q(t);
+			else {
+				this.#x(s);
+				let n = this.#t[s];
+				if (this.#e(n) ? n.__abortController.abort(/* @__PURE__ */ new Error("deleted")) : (this.#T || this.#f) && (this.#T && this.#S?.(n, e, t), this.#f && this.#r?.push([
+					n,
+					e,
+					t
+				])), this.#s.delete(e), this.#i[s] = void 0, this.#t[s] = void 0, s === this.#h) this.#h = this.#u[s];
+				else if (s === this.#a) this.#a = this.#l[s];
 				else {
-					this.#removeItemSize(index);
-					const v = this.#valList[index];
-					if (this.#isBackgroundFetch(v)) v.__abortController.abort(/* @__PURE__ */ new Error("deleted"));
-					else if (this.#hasDispose || this.#hasDisposeAfter) {
-						if (this.#hasDispose) this.#dispose?.(v, k, reason);
-						if (this.#hasDisposeAfter) this.#disposed?.push([
-							v,
-							k,
-							reason
-						]);
-					}
-					this.#keyMap.delete(k);
-					this.#keyList[index] = void 0;
-					this.#valList[index] = void 0;
-					if (index === this.#tail) this.#tail = this.#prev[index];
-					else if (index === this.#head) this.#head = this.#next[index];
-					else {
-						const pi = this.#prev[index];
-						this.#next[pi] = this.#next[index];
-						const ni = this.#next[index];
-						this.#prev[ni] = this.#prev[index];
-					}
-					this.#size--;
-					this.#free.push(index);
+					let o = this.#u[s];
+					this.#l[o] = this.#l[s];
+					let l = this.#l[s];
+					this.#u[l] = this.#u[s];
 				}
+				this.#n--, this.#y.push(s);
 			}
 		}
-		if (this.#hasDisposeAfter && this.#disposed?.length) {
-			const dt = this.#disposed;
-			let task;
-			while (task = dt?.shift()) this.#disposeAfter?.(...task);
+		if (this.#f && this.#r?.length) {
+			let s = this.#r, n;
+			for (; n = s?.shift();) this.#w?.(...n);
 		}
-		return deleted;
+		return i;
 	}
-	/**
-	* Clear the cache entirely, throwing away all values.
-	*/
 	clear() {
-		return this.#clear("delete");
+		return this.#q("delete");
 	}
-	#clear(reason) {
-		for (const index of this.#rindexes({ allowStale: true })) {
-			const v = this.#valList[index];
-			if (this.#isBackgroundFetch(v)) v.__abortController.abort(/* @__PURE__ */ new Error("deleted"));
+	#q(e) {
+		for (let t of this.#z({ allowStale: !0 })) {
+			let i = this.#t[t];
+			if (this.#e(i)) i.__abortController.abort(/* @__PURE__ */ new Error("deleted"));
 			else {
-				const k = this.#keyList[index];
-				if (this.#hasDispose) this.#dispose?.(v, k, reason);
-				if (this.#hasDisposeAfter) this.#disposed?.push([
-					v,
-					k,
-					reason
+				let s = this.#i[t];
+				this.#T && this.#S?.(i, s, e), this.#f && this.#r?.push([
+					i,
+					s,
+					e
 				]);
 			}
 		}
-		this.#keyMap.clear();
-		this.#valList.fill(void 0);
-		this.#keyList.fill(void 0);
-		if (this.#ttls && this.#starts) {
-			this.#ttls.fill(0);
-			this.#starts.fill(0);
-			for (const t of this.#autopurgeTimers ?? []) if (t !== void 0) clearTimeout(t);
-			this.#autopurgeTimers?.fill(void 0);
+		if (this.#s.clear(), this.#t.fill(void 0), this.#i.fill(void 0), this.#d && this.#F) {
+			this.#d.fill(0), this.#F.fill(0);
+			for (let t of this.#g ?? []) t !== void 0 && clearTimeout(t);
+			this.#g?.fill(void 0);
 		}
-		if (this.#sizes) this.#sizes.fill(0);
-		this.#head = 0;
-		this.#tail = 0;
-		this.#free.length = 0;
-		this.#calculatedSize = 0;
-		this.#size = 0;
-		if (this.#hasDisposeAfter && this.#disposed) {
-			const dt = this.#disposed;
-			let task;
-			while (task = dt?.shift()) this.#disposeAfter?.(...task);
+		if (this.#_ && this.#_.fill(0), this.#a = 0, this.#h = 0, this.#y.length = 0, this.#b = 0, this.#n = 0, this.#f && this.#r) {
+			let t = this.#r, i;
+			for (; i = t?.shift();) this.#w?.(...i);
 		}
 	}
 };
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/columns/column_providers/providers.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/columns/column_providers/providers.js
 /**
 * Unified memoised factory dispatching to the right provider flavour by the
 * source shape:
@@ -11070,7 +10760,7 @@ function ColumnsProvider(source) {
 * {@link AccessorColumnsProviderImpl}, so `indexAccessorRoot` runs once per
 * accessor root (within the LRU window).
 */
-const _accessorProviderCache = new LRUCache({ max: 64 });
+const _accessorProviderCache = new U({ max: 64 });
 function AccessorColumnsProvider(root) {
 	let provider = _accessorProviderCache.get(root.handle);
 	if (provider === void 0) {
@@ -11084,7 +10774,7 @@ function AccessorColumnsProvider(root) {
 * {@link ResultPoolColumnsProviderImpl}, so `indexPoolBlock` runs once per
 * pool snapshot (within the LRU window).
 */
-const _resultPoolProviderCache = new LRUCache({ max: 4 });
+const _resultPoolProviderCache = new U({ max: 4 });
 function ResultPoolColumnsProvider(rawPool = getCfgRenderCtx().getUpstreamBlockCtx()) {
 	const key = hashRawPool(rawPool);
 	let provider = _resultPoolProviderCache.get(key);
@@ -11136,7 +10826,7 @@ function hashRawPool(rawPool) {
 	return rawPool.map((b) => `${b.blockId}\x1f${b.prodCtx ?? ""}\x1f${b.stagingCtx ?? ""}\x1f${b.prodIncomplete ? 1 : 0}\x1f${b.stagingIncomplete ? 1 : 0}`).join("");
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/columns/column_providers/index.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/columns/column_providers/index.js
 /**
 * Build the default set of ColumnsProviders for the ambient render ctx:
 *  - `AccessorColumnsProvider` over `outputs` (if present)
@@ -11171,7 +10861,7 @@ function isColumnProvider(source) {
 	return typeof p.getColumns === "function" && typeof p.isFinal === "function";
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/columns/data_column.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/columns/data_column.js
 /**
 * Thrown by leaf-recipe factories when the requested column is provably
 * absent in the active render ctx — i.e. every relevant accessor reports
@@ -11402,7 +11092,7 @@ const readDataStatus = memoizeByEntry(({ accessor, name }) => {
 	return accessor.getInputsLocked() ? "absent" : "resolving";
 });
 function memoizeByEntry(fn) {
-	const cache = new LRUCache({ max: 1e3 });
+	const cache = new U({ max: 1e3 });
 	return (entry) => {
 		const key = `${entry.accessor.handle}:${entry.name}`;
 		let hit = cache.get(key);
@@ -11411,7 +11101,7 @@ function memoizeByEntry(fn) {
 	};
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/columns/column_recipes/column_overrided_recipe.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/columns/column_recipes/column_overrided_recipe.js
 /**
 * Recipe wrapper that overlays {@link SpecOverrides} on top of any other
 * recipe. The id is `ColumnOverriddenKey { source: inner.id, specOverrides }`.
@@ -11549,7 +11239,7 @@ var DataColumnOverriddenRecipe = class extends ColumnOverriddenRecipe {
 	}
 };
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/columns/column_recipes/column_filtered_recipe.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/columns/column_recipes/column_filtered_recipe.js
 /**
 * Recipe wrapper that fixes the values of selected axes of an inner recipe
 * (axis slicing). The id is `FilteredPColumnId { source: inner.id,
@@ -11675,7 +11365,7 @@ function toAxisSelector(axis) {
 	return selector;
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/columns/column_recipes/index.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/columns/column_recipes/index.js
 /**
 * Build a `ColumnRecipe` from a stringified id. Dispatches to the matching
 * concrete recipe variant based on the id's encoding and recurses on
@@ -11726,7 +11416,7 @@ function ColumnRecipeGetStatus(id, opts = {}) {
 }
 const ColumnRecipe = Object.assign(ColumnRecipeBuild, { getStatus: ColumnRecipeGetStatus });
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/columns/column_recipes/column_discovered_recipe.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/columns/column_recipes/column_discovered_recipe.js
 /**
 * Recipe for columns identified by a {@link ColumnDiscoveredKey}: a base
 * column + a `path` of linkers + qualifications.
@@ -11897,7 +11587,7 @@ function referencedUniIdsOf(key) {
 	return /* @__PURE__ */ new Set([key.column, ...(key.path ?? []).map((item) => item.column)]);
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/columns/column.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/columns/column.js
 /**
 * Unified entry point — routes between the two top-level dispatchers:
 *   - string id (`PObjectId` / `ColumnUniversalId`) → {@link ColumnRecipe}
@@ -11911,7 +11601,7 @@ function Column(source, opts) {
 	return DataColumn(source, opts);
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/columns/columns_collection.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/columns/columns_collection.js
 /**
 * Build a {@link ColumnsCollection} from sandbox-side source descriptors.
 * Resolves the `columnsCollection` driver (either from `deps.driver` or via
@@ -12020,7 +11710,35 @@ function defaultCtxSources(ctx) {
 	return [...currentBlockSources(ctx), { kind: "result_pool" }];
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/columns/utils.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/columns/peer_links.js
+/** Main axes of the datasets: the second axis of every column marked `pl7.app/isAnchor`. */
+function collectDatasetAxes(specs) {
+	return new Set(specs.flatMap((spec) => {
+		const main = spec.axesSpec[1];
+		return readAnnotation(spec, Annotation.IsAnchor) === "true" && main !== void 0 ? [canonicalizeAxisId(main)] : [];
+	}));
+}
+/** {@link collectDatasetAxes} over the result pool. */
+function getResultPoolDatasetAxes() {
+	return collectDatasetAxes(ResultPoolColumnsProvider().getColumns().map((c) => c.getSpec()));
+}
+/**
+* Labels of the peer links on a linker path. A peer link joins two datasets' main axes, e.g. one
+* clonotype to another, so the columns behind it describe a different clonotype than the row.
+*/
+function findPeerLinks(linkers, datasetAxes) {
+	return uniq(linkers.flatMap((l) => {
+		const peer = l.axesSpec.every((a) => datasetAxes.has(canonicalizeAxisId(a)));
+		const label = readAnnotation(l, Annotation.LinkLabel) ?? readAnnotation(l, Annotation.Label);
+		return peer && label ? [label] : [];
+	}));
+}
+/** Hover text for the link icon. */
+function describePeerLinks(links) {
+	return `Reached via ${links.join(", then ")}`;
+}
+//#endregion
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/columns/utils.js
 /**
 * PObjectIds of every non-hit column referenced by `recipe.getQuery()`,
 * deduped in traversal order. The hit column is
@@ -12151,7 +11869,7 @@ function hasSingleDataColumn(recipe) {
 	return recipe.getReferencedIds().length === 1;
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/pframe_utils/columns.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/pframe_utils/columns.js
 function getAllRelatedColumns(ctx, predicate) {
 	const columns = new PColumnCollection();
 	columns.addColumnProvider(ctx.resultPool);
@@ -12227,7 +11945,7 @@ function discoverIntegrableColumnIds(ctx, rootColumns) {
 	}
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/components/PFrameForGraphs.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/components/PFrameForGraphs.js
 function isHiddenFromGraphColumn(column) {
 	return !!readAnnotationJson(column, Annotation.HideDataFromGraphs);
 }
@@ -12256,7 +11974,169 @@ function createPFrameForGraphs(ctx, blockColumns) {
 	}));
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/filters/traverse.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/components/PlDatasetSelector/filter_discovery.js
+/**
+* Matches columns annotated `pl7.app/isSubset: "true"` whose axes ⊆ anchor axes.
+*
+* Filter-intent: only the dataset's own direct subset columns, no linker
+* traversal — so this uses `.filter()` (pins `maxHops: 0`), not `.discover()`
+* (which would default to 4 hops and surface subset columns from other,
+* linker-reachable datasets). `.filter()` still applies the default
+* `enrichment` matching mode (`allowFloatingHitAxes: false`), which enforces
+* the axes-subset constraint. See `matchingModeToConstraints()`.
+*/
+function findFilterColumns(options) {
+	return ColumnsCollection([...options.sources], { driver: options.driver }).filter({
+		anchors: { main: options.anchorSpec },
+		include: { annotations: { [Annotation.IsSubset]: "true" } }
+	}).getColumns();
+}
+/**
+* Derive labeled options from filter column variants, for use in DatasetOption.filters.
+*
+* Entries whose column id has no PlRef in `refsByObjectId` are silently
+* skipped — they cannot be exposed as user-selectable options.
+*/
+function filterMatchesToOptions(variants, options) {
+	if (variants.length === 0) return [];
+	const { refsByObjectId, datasetSpec, labelOptions } = options;
+	const entries = variants.flatMap((variant) => {
+		const ref = refsByObjectId.get(extractPObjectId(variant.id));
+		if (ref === void 0) return [];
+		return [{
+			ref,
+			spec: variant.getSpec(),
+			linkerPath: collectLinkerColumns(variant).map((linker) => ({ spec: linker.getSpec() }))
+		}];
+	});
+	const labels = deriveDistinctLabels([...entries, { spec: datasetSpec }], {
+		...labelOptions,
+		formatters: {
+			...labelOptions?.formatters,
+			native: () => void 0
+		}
+	});
+	return entries.map(({ ref }, i) => ({
+		ref,
+		label: labels[i]
+	}));
+}
+/** Build the `refsByObjectId` map from `ctx.resultPool.getSpecs().entries`. */
+function buildRefMap(entries) {
+	return new Map(entries.map((e) => [(0, import_canonicalize.default)(e.ref), e.ref]));
+}
+//#endregion
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/components/PlDatasetSelector/enrichment_discovery.js
+/**
+* Linker-reached hits attached to the anchor primary. Drops zero-hop variants
+* (filters / the primary itself) and structural hits (subset, linker, label
+* columns). Narrow further with `include` selectors or a `predicate`.
+*/
+function findEnrichmentColumns(options) {
+	const include = options.include === void 0 ? void 0 : Array.isArray(options.include) ? options.include : [options.include];
+	const columns = ColumnsCollection([...options.sources], { driver: options.driver }).discover({
+		anchors: { main: options.anchorSpec },
+		mode: "enrichment",
+		maxHops: options.maxHops ?? 4,
+		include,
+		exclude: [
+			{ annotations: { [Annotation.IsSubset]: "true" } },
+			{ annotations: { [Annotation.IsLinkerColumn]: "true" } },
+			{ name: Annotation.Label }
+		]
+	}).getColumns();
+	const predicate = options.predicate;
+	return columns.filter((v) => {
+		if (hasSingleDataColumn(v)) return false;
+		if (predicate !== void 0 && !predicate(v.getSpec())) return false;
+		if (!isGlobalPObjectId(extractPObjectId(v.id))) return false;
+		if (collectLinkerIds(v).some((id) => !isGlobalPObjectId(id))) return false;
+		return true;
+	});
+}
+/**
+* Pair each variant with a path-disambiguated label (so export headers stay
+* unique) and carry hit/linker `PObjectId`s through verbatim. Propagates
+* `qualifications.forHit`; `forQueries` is re-derived by the table builder.
+*/
+function enrichmentVariantsToRefs(variants, labelOptions) {
+	if (variants.length === 0) return [];
+	const linkerIdsByVariant = variants.map((v) => collectLinkerIds(v));
+	const hitQualsByVariant = variants.map((v) => [...hitQualifications(v)]);
+	const labels = deriveDistinctLabels(variants.map((variant, i) => ({
+		spec: variant.getSpec(),
+		linkerPath: collectLinkerColumns(variant).map((linker) => ({ spec: linker.getSpec() })),
+		qualifications: {
+			forHit: hitQualsByVariant[i],
+			forQueries: queriesQualifications(variant)
+		}
+	})), labelOptions);
+	return variants.map((variant, i) => {
+		const path = linkerIdsByVariant[i].length === 0 ? void 0 : linkerIdsByVariant[i].map((id) => ({
+			type: "linker",
+			linker: id
+		}));
+		return {
+			ref: createEnrichmentRef(extractPObjectId(variant.id), {
+				path,
+				qualifications: hitQualsByVariant[i]
+			}),
+			label: labels[i]
+		};
+	});
+}
+//#endregion
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/components/PlDatasetSelector/build_dataset_options.js
+function toPredicate(opt) {
+	if (opt === void 0) return () => true;
+	return typeof opt === "function" ? opt : multiColumnSelectorsToPredicate(opt);
+}
+/**
+* Usage:
+* ```ts
+* .output("datasetOptions", (ctx) => buildDatasetOptions(ctx))
+* ```
+*/
+function buildDatasetOptions(ctx, opts) {
+	const primaryPredicate = toPredicate(opts?.primary);
+	const filterPredicate = toPredicate(opts?.filter);
+	const options = ctx.resultPool.getOptions(primaryPredicate, { refsWithEnrichments: opts?.requireEnrichments ?? true });
+	if (options.length === 0) return [];
+	const refMap = buildRefMap(ctx.resultPool.getSpecs().entries);
+	const withEnrichments = opts?.withEnrichments ?? false;
+	const filterSource = ColumnsProvider(ctx.ctx.getUpstreamBlockCtx());
+	const enrichmentSources = withEnrichments ? getCtxProviders(ctx) : void 0;
+	return options.map((primary) => {
+		const datasetSpec = ctx.resultPool.getPColumnSpecByRef(primary.ref);
+		if (!datasetSpec) return { primary };
+		const filterMatches = findFilterColumns({
+			sources: [filterSource],
+			anchorSpec: datasetSpec
+		}).filter((m) => filterPredicate(m.getSpec()));
+		const filters = filterMatches.length === 0 ? void 0 : filterMatchesToOptions(filterMatches, {
+			refsByObjectId: refMap,
+			datasetSpec,
+			labelOptions: opts?.labelOptions
+		});
+		let enrichments;
+		if (enrichmentSources && withEnrichments) {
+			const enrichmentVariants = findEnrichmentColumns({
+				sources: enrichmentSources,
+				anchorSpec: datasetSpec,
+				maxHops: opts?.enrichmentMaxHops,
+				...typeof withEnrichments === "function" ? { predicate: withEnrichments } : { include: withEnrichments }
+			});
+			if (enrichmentVariants.length > 0) enrichments = enrichmentVariantsToRefs(enrichmentVariants, opts?.labelOptions);
+		}
+		return {
+			primary,
+			...filters !== void 0 && filters.length > 0 ? { filters } : {},
+			...enrichments !== void 0 && enrichments.length > 0 ? { enrichments } : {}
+		};
+	});
+}
+//#endregion
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/filters/traverse.js
 /**
 * Recursively traverses a FilterSpec tree bottom-up, applying visitor callbacks.
 *
@@ -12295,7 +12175,7 @@ function collectFilterSpecColumns(filter) {
 	});
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/filters/converters/filterToQuery.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/filters/converters/filterToQuery.js
 /** Converts a QueryColumnId object into a SpecQueryExpression reference. */
 function resolveColumnRef(col) {
 	return col.type === "axis" ? {
@@ -12607,7 +12487,7 @@ function isEmpty(value) {
 	return true;
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/filters/distill.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/filters/distill.js
 /**
 * Strips non-FilterSpec metadata (whitelist approach) and removes
 * unfilled leaves (type is undefined or any required field is undefined).
@@ -12712,7 +12592,7 @@ const REQUIRED_KEYS_BY_TYPE = {
 	greaterThanColumnOrEqual: ["column", "rhs"]
 };
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/components/PlDataTable/state-migration.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/components/PlDataTable/state-migration.js
 /** Upgrade PlDataTableStateV2 to the latest version */
 function upgradePlDataTableStateV2(state) {
 	if (!state) return createPlDataTableStateV2();
@@ -13070,7 +12950,7 @@ function parseLegacyLeafColumn(s) {
 	return parsed;
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/components/PlDataTable/createPlDataTable/utils.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/components/PlDataTable/createPlDataTable/utils.js
 /** Adapt a {@link ColumnRecipe} to the plain {@link RuleColumn} shape. */
 function toRuleColumn(col) {
 	return {
@@ -13164,11 +13044,12 @@ function deriveAllLabels(options) {
 	return deriveDistinctLabels(columns.map((c) => ({
 		spec: c.spec,
 		linkerPath: c.linkerPath?.map((step) => ({ spec: step.linker.spec })),
-		qualifications: c.qualifications
+		qualifications: c.qualifications,
+		marker: c.marker
 	})), deriveLabelsOptions).reduce((acc, label, index) => (acc[columns[index].id] = label, acc), {});
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/components/PlDataTable/createPlDataTable/createPTableDefV3.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/components/PlDataTable/createPlDataTable/createPTableDefV3.js
 /**
 * Assemble a ptable def directly from recipes. Each secondary recipe is its own
 * outer-joined subtree: `getQuery()` encodes its linker chain, and its
@@ -13232,7 +13113,7 @@ function columnToJoinEntry(col, qualifications) {
 	};
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/components/PlDataTable/columnResolver.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/components/PlDataTable/columnResolver.js
 function createColumnResolver(columns) {
 	const axisIds = [];
 	for (const c of columns) for (const ax of c.getSpec().axesSpec) axisIds.push(getAxisId(ax));
@@ -13254,7 +13135,7 @@ function createColumnResolver(columns) {
 	};
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/components/PlDataTable/createPlDataTable/discoverColumns.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/components/PlDataTable/createPlDataTable/discoverColumns.js
 /**
 * Discover columns from sources/anchors and split them into primary
 * (direct anchor hits — zero-hop, query is a bare column) and secondary
@@ -13300,7 +13181,7 @@ function discoverLabelColumns(ctx, primary) {
 	}).getColumns();
 }
 //#endregion
-//#region ../node_modules/.pnpm/@platforma-sdk+model@1.84.1/node_modules/@platforma-sdk/model/dist/components/PlDataTable/createPlDataTable/createPlDataTableV3.js
+//#region ../node_modules/.pnpm/@platforma-sdk+model@1.86.3/node_modules/@platforma-sdk/model/dist/components/PlDataTable/createPlDataTable/createPlDataTableV3.js
 function createPlDataTableV3(ctx, options) {
 	const state = upgradePlDataTableStateV2(options.tableState);
 	const primaryJoinType = options.primaryJoinType ?? "full";
@@ -13309,8 +13190,13 @@ function createPlDataTableV3(ctx, options) {
 	const { primary, secondary } = resolved;
 	if (primary.length === 0) return void 0;
 	const { direct, linked } = splitByTopology(secondary);
+	const labelable = [...primary, ...secondary].map(toLabelableColumn);
+	const linkHints = collectLinkHints(labelable);
 	const derivedLabels = deriveAllLabels({
-		columns: [...primary, ...secondary].filter((c) => !isColumnHidden(c.getSpec())).map(toLabelableColumn),
+		columns: labelable.filter((c) => !isColumnHidden(c.spec)).map((c) => ({
+			...c,
+			marker: linkHints.get(c.id)
+		})),
 		deriveLabelsOptions: {
 			includeNativeLabel: true,
 			...options.labelsOptions
@@ -13383,6 +13269,7 @@ function createPlDataTableV3(ctx, options) {
 		],
 		primaryColumns: primary,
 		derivedLabels,
+		linkHints,
 		visibilityByColId,
 		orderByColId
 	});
@@ -13424,6 +13311,15 @@ function splitByTopology(columns) {
 function collectLinkerSnapshots(linked) {
 	return uniqueBy(linked.flatMap((c) => collectLinkerColumns(c)), (c) => c.id);
 }
+/** Link icon hover text per column, for columns reached through at least one peer link. */
+function collectLinkHints(columns) {
+	if (!columns.some((c) => c.linkerPath?.length)) return /* @__PURE__ */ new Map();
+	const datasetAxes = getResultPoolDatasetAxes();
+	return new Map(columns.flatMap((c) => {
+		const links = findPeerLinks(c.linkerPath?.map((step) => step.linker.spec) ?? [], datasetAxes);
+		return links.length > 0 ? [[c.id, describePeerLinks(links)]] : [];
+	}));
+}
 function toLabelableColumn(col) {
 	return {
 		id: col.id,
@@ -13444,7 +13340,7 @@ function toLabelableColumn(col) {
 * The UI overlays this onto the engine-emitted specs at render time.
 */
 function buildColumnsMeta(params) {
-	const { fullColumns, visibleColumns, primaryColumns, derivedLabels } = params;
+	const { fullColumns, visibleColumns, primaryColumns, derivedLabels, linkHints } = params;
 	const { visibilityByColId, orderByColId } = params;
 	const visibleStatus = buildDataStatusMap(visibleColumns);
 	const columns = fullColumns.reduce((acc, c) => {
@@ -13453,7 +13349,8 @@ function buildColumnsMeta(params) {
 			label: derivedLabels[c.id],
 			visibility: getEffectiveVisibility(rc, visibilityByColId),
 			order: getOrderPriority(rc, orderByColId),
-			status: visibleStatus[c.id]
+			status: visibleStatus[c.id],
+			linkHint: linkHints.get(c.id)
 		};
 		return acc;
 	}, {});
@@ -13663,6 +13560,11 @@ const ErrorShape = objectType({
 	errors: lazyType(() => ErrorShape.array()).optional()
 });
 //#endregion
+//#region ../node_modules/.pnpm/es-toolkit@1.41.0/node_modules/es-toolkit/dist/predicate/isBoolean.mjs
+function isBoolean(x) {
+	return typeof x === "boolean";
+}
+//#endregion
 //#region ../node_modules/.pnpm/es-toolkit@1.41.0/node_modules/es-toolkit/dist/predicate/isString.mjs
 function isString(value) {
 	return typeof value === "string";
@@ -13675,6 +13577,30 @@ function isNumber(value) {
 //#endregion
 //#region ../kind/dist/index.js
 /**
+* The equations the block fits.
+*
+* `log_fluorescence` is a Hill fit on the log gate fluorescence with the exponent fixed at 1,
+* weighted least squares. `hill_gate_index` is the fit the block shipped through 2.4.0: a Hill
+* fit on the read-weighted mean gate index with a free exponent, graded on R² and the exponent.
+*/
+const EQUATIONS = ["log_fluorescence", "hill_gate_index"];
+/**
+* How the error of a value combined over sample replicates is computed.
+*
+* `sd_over_sqrt_n` is the sample SD over the square root of the replicate count, falling back to
+* the single fit's own standard error for one replicate. `phillips` is the population SD over the
+* square root of the count plus one, which is 0 for one replicate; it reproduces the SEM published
+* with Phillips 2021.
+*/
+const REPLICATE_ERROR_MODELS = ["sd_over_sqrt_n", "phillips"];
+const DEFAULT_REPLICATE_ERROR_MODEL = "sd_over_sqrt_n";
+/**
+* Share of the entered replicates one censoring side must hold, and exceed the other side by, for
+* the combined value to be reported as that side's bound. The block's own rule: no published
+* method defines one, and opposite bounds cannot be averaged into anything meaningful.
+*/
+const DEFAULT_CENSORED_MAJORITY = .5;
+/**
 * The contract at runtime, for params arriving from a template file rather than typed code. An
 * absent field is always allowed — every param is optional and the block's own default takes
 * over — so each guard runs only on what is present. Keys the contract does not name are dropped
@@ -13716,6 +13642,14 @@ function isNumberFrom(min) {
 	return (v) => isFiniteNumber(v) && v >= min;
 }
 const isFraction = (v) => isFiniteNumber(v) && v >= 0 && v <= 1;
+/** A fraction with zero excluded: a plateau floor of 0 asks for no rise at all. */
+const isPositiveFraction = (v) => isFiniteNumber(v) && v > 0 && v <= 1;
+const isEquation = (v) => isString(v) && EQUATIONS.includes(v);
+const isReplicateErrorModel = (v) => isString(v) && REPLICATE_ERROR_MODELS.includes(v);
+/** A positive number: a cutoff of 0 decades rejects every fit. */
+const isPositiveNumber = (v) => isFiniteNumber(v) && v > 0;
+/** A share from one half to the whole: below one half no side can be the majority. */
+const isMajority = (v) => isFiniteNumber(v) && v >= .5 && v <= 1;
 /**
 * The runtime half of the contract. The `satisfies` clause is what stops it drifting: every
 * field `BlockParams` declares must appear here, and each guard must narrow to that field's own
@@ -13728,11 +13662,18 @@ const isFraction = (v) => isFiniteNumber(v) && v >= 0 && v <= 1;
 */
 const CONTRACT = {
 	abundanceRef: check(isPlRef, "a reference to an abundance column"),
+	filterRef: check(isPlRef, "a reference to a subset column"),
 	concentrationColumnRef: check(isPlRef, "a reference to a concentration column"),
 	binColumnRef: check(isPlRef, "a reference to a FACS bin column"),
 	antigenColumnRef: check(isPlRef, "a reference to an antigen column"),
 	sortFractionColumnRef: check(isPlRef, "a reference to a FACS sort fraction column"),
+	binFluorescenceColumnRef: check(isPlRef, "a reference to a gate fluorescence column"),
 	targetAntigen: check(isString, "a string"),
+	equation: check(isEquation, `one of ${EQUATIONS.map((e) => `"${e}"`).join(" or ")}`),
+	plateauFloor: check(isPositiveFraction, "a number above 0 and at most 1"),
+	r2GateMin: check(isFraction, "a number between 0 and 1"),
+	requireAllConcentrations: check(isBoolean, "true or false"),
+	kdSeGateMax: check((v) => isFiniteNumber(v) && v > 0, "a number above 0"),
 	minReadsPerConcentration: check(isNumberFrom(1), "a number of 1 or more"),
 	minConcentrationPoints: check(isNumberFrom(3), "a number of 3 or more"),
 	r2ThresholdGood: check(isFraction, "a number between 0 and 1"),
@@ -13742,10 +13683,27 @@ const CONTRACT = {
 	hookEffectThresholdBin: check(isFiniteNumber, "a number"),
 	hookEffectThresholdNoBin: check(isFiniteNumber, "a number"),
 	hookEffectMinReads: check(isFiniteNumber, "a number"),
+	replicateColumnRef: check(isPlRef, "a reference to a replicate column"),
+	replicateErrorModel: check(isReplicateErrorModel, `one of ${REPLICATE_ERROR_MODELS.map((m) => `"${m}"`).join(" or ")}`),
+	replicateFitErrorCutoff: check(isPositiveNumber, "a number above 0"),
+	replicateR2Floor: check(isFraction, "a number between 0 and 1"),
+	replicateCensoredMajority: check(isMajority, "a number between 0.5 and 1"),
 	customBlockLabel: check(isString, "a string")
 };
+Object.keys(CONTRACT);
 //#endregion
 //#region ../model/dist/index.js
+/**
+* The per-replicate chart: one dot per replicate on a log Kd,app axis. The page binds the sources
+* from the columns the run produced.
+*/
+const REPLICATES_DEFAULT_STATE = {
+	title: "",
+	template: "dots",
+	currentTab: null,
+	layersSettings: { dots: {} },
+	axesSettings: { axisY: { scale: "log" } }
+};
 const summaryCol = (name, type) => `{"kind":"column","name":"{\\"name\\":\\"${name}\\",\\"resolvePath\\":[\\"main\\",\\"summaryPf\\"]}","type":"${type}"}`;
 const KD_PLOT_COL = summaryCol("kdPlotPosition", "Double");
 const HILL_PLOT_COL = summaryCol("hillPlotPosition", "Double");
@@ -13760,7 +13718,10 @@ const AFFINITY_VS_FIT_DEFAULT_STATE = {
 		type: "grouping",
 		value: FIT_FAILURE_REASON_COL
 	} } },
-	axesSettings: { axisX: { scale: "log" } },
+	axesSettings: {
+		axisX: { scale: "log" },
+		axisY: { scale: "log" }
+	},
 	optionsState: {
 		type: "scatterplot",
 		components: {
@@ -13828,20 +13789,34 @@ const AFFINITY_VS_FIT_DEFAULT_STATE = {
 */
 const initBlockData = (params) => ({
 	abundanceRef: params?.abundanceRef,
+	filterRef: params?.filterRef,
 	concentrationColumnRef: params?.concentrationColumnRef,
 	binColumnRef: params?.binColumnRef,
+	binFluorescenceColumnRef: params?.binFluorescenceColumnRef,
 	antigenColumnRef: params?.antigenColumnRef,
 	sortFractionColumnRef: params?.sortFractionColumnRef,
 	targetAntigen: params?.targetAntigen,
-	minReadsPerConcentration: params?.minReadsPerConcentration ?? 3,
-	minConcentrationPoints: params?.minConcentrationPoints ?? 5,
-	r2ThresholdGood: params?.r2ThresholdGood ?? .8,
-	r2ThresholdFailed: params?.r2ThresholdFailed ?? .5,
-	nMin: params?.nMin ?? .5,
-	nMax: params?.nMax ?? 2,
-	hookEffectThresholdBin: params?.hookEffectThresholdBin ?? .2,
-	hookEffectThresholdNoBin: params?.hookEffectThresholdNoBin ?? .02,
-	hookEffectMinReads: params?.hookEffectMinReads ?? 20,
+	equation: params?.equation ?? (params?.minReadsPerConcentration !== void 0 ? "hill_gate_index" : "log_fluorescence"),
+	plateauFloor: params?.plateauFloor ?? .667,
+	r2GateMin: params?.r2GateMin ?? .8,
+	kdSeGateMax: params?.kdSeGateMax ?? 1,
+	requireAllConcentrations: params?.requireAllConcentrations,
+	replicateColumnRef: params?.replicateColumnRef,
+	replicateErrorModel: params?.replicateErrorModel ?? "sd_over_sqrt_n",
+	replicateFitErrorCutoff: params?.replicateFitErrorCutoff,
+	replicateR2Floor: params?.replicateR2Floor,
+	replicateCensoredMajority: params?.replicateCensoredMajority ?? .5,
+	replicateTableState: createPlDataTableStateV2(),
+	graphStateReplicates: REPLICATES_DEFAULT_STATE,
+	minReadsPerConcentration: params?.minReadsPerConcentration ?? READ_COVERAGE_DEFAULTS.minReadsPerConcentration,
+	minConcentrationPoints: params?.minConcentrationPoints ?? READ_COVERAGE_DEFAULTS.minConcentrationPoints,
+	r2ThresholdGood: params?.r2ThresholdGood ?? HILL_GATE_INDEX_DEFAULTS.r2ThresholdGood,
+	r2ThresholdFailed: params?.r2ThresholdFailed ?? HILL_GATE_INDEX_DEFAULTS.r2ThresholdFailed,
+	nMin: params?.nMin ?? HILL_GATE_INDEX_DEFAULTS.nMin,
+	nMax: params?.nMax ?? HILL_GATE_INDEX_DEFAULTS.nMax,
+	hookEffectThresholdBin: params?.hookEffectThresholdBin ?? HILL_GATE_INDEX_DEFAULTS.hookEffectThresholdBin,
+	hookEffectThresholdNoBin: params?.hookEffectThresholdNoBin ?? HILL_GATE_INDEX_DEFAULTS.hookEffectThresholdNoBin,
+	hookEffectMinReads: params?.hookEffectMinReads ?? HILL_GATE_INDEX_DEFAULTS.hookEffectMinReads,
 	defaultBlockLabel: "Tite-Seq Analysis",
 	customBlockLabel: params?.customBlockLabel ?? "",
 	tableState: createPlDataTableStateV2(),
@@ -13866,7 +13841,91 @@ const initBlockData = (params) => ({
 	graphStateAffinityVsFit: AFFINITY_VS_FIT_DEFAULT_STATE,
 	settingsOpen: false
 });
-const dataModel = new DataModelBuilder({ kind }).from("v1").init(({ params }) => initBlockData(params));
+/**
+* v1 -> v2. A v1 project (v2.4.0 or earlier) ran the gate-index fit, so name it.
+*
+* Writing the field is the point. An absent `equation` reads as a new block's default,
+* `log_fluorescence`, and every released project would change the equation it fits.
+*
+* The plateau floor arrives at a new block's value and stays unread. `hill_gate_index` does
+* not read one. Nothing else moves: every setting, reference, label and piece of view state
+* crosses untouched, so a re-run reproduces the numbers the project already holds.
+*/
+const migrateV1ToV2 = (v1) => ({
+	...v1,
+	equation: "hill_gate_index",
+	plateauFloor: DEFAULT_PLATEAU_FLOOR
+});
+/**
+* v2 -> v3. The R² gate arrives off, so a log-fluorescence project rates its fits as it did. v2
+* shipped only in development builds; the step repairs their stored projects.
+*/
+const migrateV2ToV3 = (v2) => ({
+	...v2,
+	r2GateEnabled: false,
+	r2GateMin: .8
+});
+/**
+* v3 -> v4. Sample replicates arrive unset: no replicate column, both filters off, the default
+* error model and censoring majority, and empty per-replicate view state. The args a v3 project
+* sends do not move, so it does not re-run.
+*/
+const migrateV3ToV4 = (v3) => ({
+	...v3,
+	replicateErrorModel: DEFAULT_REPLICATE_ERROR_MODEL,
+	replicateCensoredMajority: DEFAULT_CENSORED_MAJORITY,
+	replicateTableState: createPlDataTableStateV2(),
+	graphStateReplicates: REPLICATES_DEFAULT_STATE
+});
+/**
+* v4 -> v5. A stored point count below the minimum is raised to it. A cleared field stays cleared.
+* Raising it changes that project's args, so the block goes stale.
+*/
+const migrateV4ToV5 = (v4) => ({
+	...v4,
+	minConcentrationPoints: v4.minConcentrationPoints === void 0 ? void 0 : Math.max(v4.minConcentrationPoints, 5)
+});
+/**
+* v5 -> v6. The checkbox is gone: a limit applies when it is set. A project with the checkbox off
+* clears both limits, and one with it on keeps them, so the args do not move and it does not
+* re-run.
+*/
+const migrateV5ToV6 = ({ r2GateEnabled, ...v5 }) => ({
+	...v5,
+	r2GateMin: r2GateEnabled ? v5.r2GateMin : void 0,
+	kdSeGateMax: r2GateEnabled ? v5.kdSeGateMax : void 0
+});
+const dataModel = new DataModelBuilder({ kind }).from("v1").migrate("v2", migrateV1ToV2).migrate("v3", migrateV2ToV3).migrate("v4", migrateV3ToV4).migrate("v5", migrateV4ToV5).migrate("v6", migrateV5ToV6).init(({ params }) => initBlockData(params));
+/** The per-replicate frame of the last run. Undefined when the run combined no replicates. */
+function replicateCols(ctx) {
+	return ctx.outputs?.resolve({
+		field: "replicatePf",
+		allowPermanentAbsence: true
+	})?.getPColumns();
+}
+const REPLICATE_AXIS = "pl7.app/vdj/replicate";
+/**
+* The filter that narrows the per-replicate frame to one variant. The variant axis is whichever
+* axis is not the replicate one, taken from the frame's own spec so the domain matches exactly.
+* Undefined when nothing is selected or the frame has no such axis.
+*/
+function replicateDrilldownFilter(specs, key) {
+	const value = key?.[0];
+	if (value === void 0 || value === null) return void 0;
+	const axis = specs.find((s) => s.name === "pl7.app/vdj/kd")?.axesSpec.find((a) => a.name !== REPLICATE_AXIS);
+	if (axis === void 0) return void 0;
+	return {
+		type: "and",
+		filters: [{
+			type: "patternEquals",
+			column: {
+				type: "axis",
+				id: getAxisId(axis)
+			},
+			value: String(value)
+		}]
+	};
+}
 function isIntegerValueType(vt) {
 	return vt === "Int" || vt === "Long";
 }
@@ -13891,16 +13950,86 @@ function filterPopulatedOptions(ctx, specPred, opts = {}) {
 		return opts.valuePredicate ? opts.valuePredicate(finite) : true;
 	});
 }
-const platforma$1 = BlockModelV3.create({
-	dataModel,
-	kind
-}).templateParams(deriveTemplateParams).args((data) => {
+const DATASET_KEY_AXES = /* @__PURE__ */ new Set([
+	"pl7.app/vdj/clonotypeKey",
+	"pl7.app/vdj/scClonotypeKey",
+	"pl7.app/variantKey"
+]);
+/**
+* The block's workflow input, and the gate on whether it may run at all: a throw here marks the
+* args invalid and disables Run. Named rather than written inline so the staleness contract —
+* which bytes a given state projects — can be asserted in a test.
+*/
+const deriveArgs = (data) => {
 	if (data.abundanceRef === void 0) throw new Error("Abundance column is required");
 	if (data.concentrationColumnRef === void 0) throw new Error("Concentration column is required");
 	if (data.antigenColumnRef !== void 0 && !data.targetAntigen) throw new Error("Target antigen is required when an antigen column is selected");
 	if (data.sortFractionColumnRef !== void 0 && data.binColumnRef === void 0) throw new Error("FACS sort fraction requires a FACS bin column — the correction only applies in bin mode");
+	const inputs = {
+		abundanceRef: data.abundanceRef,
+		concentrationColumnRef: data.concentrationColumnRef,
+		binColumnRef: data.binColumnRef,
+		antigenColumnRef: data.antigenColumnRef,
+		sortFractionColumnRef: data.sortFractionColumnRef,
+		targetAntigen: data.targetAntigen
+	};
+	if (data.replicateColumnRef !== void 0) {
+		if (data.replicateFitErrorCutoff !== void 0 && data.replicateFitErrorCutoff <= 0) throw new Error("Replicate fit-error cutoff must be above 0, or empty to turn it off");
+		if (data.replicateR2Floor !== void 0 && (data.replicateR2Floor < 0 || data.replicateR2Floor > 1)) throw new Error("Replicate R² floor must be between 0 and 1, or empty to turn it off");
+		if (data.replicateCensoredMajority === void 0) throw new Error("Replicate censoring majority is required");
+		if (data.replicateCensoredMajority < .5 || data.replicateCensoredMajority > 1) throw new Error("Replicate censoring majority must be between 0.5 and 1");
+	}
+	const labels = {
+		defaultBlockLabel: data.defaultBlockLabel ?? "Tite-Seq Analysis",
+		customBlockLabel: data.customBlockLabel ?? "",
+		...data.filterRef !== void 0 && { inputFilter: createGlobalPObjectId(data.filterRef.blockId, data.filterRef.name) },
+		...data.replicateColumnRef !== void 0 && {
+			replicateColumnRef: data.replicateColumnRef,
+			replicateErrorModel: "sd_over_sqrt_n",
+			...data.equation === "log_fluorescence" && data.replicateFitErrorCutoff !== void 0 && { replicateFitErrorCutoff: data.replicateFitErrorCutoff },
+			...data.replicateR2Floor !== void 0 && { replicateR2Floor: data.replicateR2Floor },
+			replicateCensoredMajority: data.replicateCensoredMajority
+		}
+	};
+	switch (data.equation) {
+		case "log_fluorescence": return logFluorescenceArgs(data, inputs, labels);
+		case "hill_gate_index": return hillGateIndexArgs(data, inputs, labels);
+		default: throw new Error(`Unknown equation: ${data.equation}`);
+	}
+};
+/**
+* Read coverage, which both equations read: a point below the read floor is dropped, and a
+* clonotype left with fewer than the point count is refused before any fit. Narrowed here because
+* a check in the caller does not narrow `data` inside each equation's builder.
+*/
+function readCoverage(data) {
 	if (data.minReadsPerConcentration === void 0) throw new Error("Min reads per concentration is required");
 	if (data.minConcentrationPoints === void 0) throw new Error("Min concentration points is required");
+	if (data.minReadsPerConcentration < 1) throw new Error("Min reads per concentration must be ≥ 1");
+	if (data.minConcentrationPoints < 5) throw new Error(`Min concentration points must be ≥ 5`);
+	return {
+		minReadsPerConcentration: data.minReadsPerConcentration,
+		minConcentrationPoints: data.minConcentrationPoints
+	};
+}
+function logFluorescenceArgs(data, inputs, labels) {
+	if (data.plateauFloor === void 0) throw new Error("Plateau floor is required");
+	if (data.plateauFloor <= 0 || data.plateauFloor > 1) throw new Error("Plateau floor must be above 0 and at most 1");
+	if (data.binColumnRef === void 0) throw new Error("The log fluorescence fit requires a FACS bin column. For frequency-only data, choose the Mean bin fit in Fit method equation.");
+	if (data.r2GateMin !== void 0 && !(data.r2GateMin >= 0 && data.r2GateMin <= 1)) throw new Error("Minimum R² must be between 0 and 1, or empty for no limit");
+	if (data.kdSeGateMax !== void 0 && !(data.kdSeGateMax > 0)) throw new Error("Maximum Kd,app SE must be above 0, or empty for no limit");
+	return {
+		...inputs,
+		binFluorescenceColumnRef: data.binFluorescenceColumnRef,
+		equation: "log_fluorescence",
+		plateauFloor: data.plateauFloor,
+		...readCoverage(data),
+		...data.r2GateMin !== void 0 && { r2GateMin: data.r2GateMin },
+		...data.kdSeGateMax !== void 0 && { kdSeGateMax: data.kdSeGateMax },
+		...labels
+	};
+}
+function hillGateIndexArgs(data, inputs, labels) {
 	if (data.r2ThresholdGood === void 0) throw new Error("R² threshold (Good) is required");
 	if (data.r2ThresholdFailed === void 0) throw new Error("R² threshold (Failed) is required");
 	if (data.nMin === void 0) throw new Error("Hill coefficient nMin is required");
@@ -13913,44 +14042,62 @@ const platforma$1 = BlockModelV3.create({
 	if (data.nMin >= data.nMax) throw new Error("Hill coefficient nMin must be < nMax");
 	if (data.r2ThresholdGood < 0 || data.r2ThresholdGood > 1) throw new Error("R² threshold (Good) out of range");
 	if (data.r2ThresholdFailed < 0 || data.r2ThresholdFailed > 1) throw new Error("R² threshold (Failed) out of range");
-	if (data.minReadsPerConcentration < 1) throw new Error("Min reads per concentration must be ≥ 1");
-	if (data.minConcentrationPoints < 3) throw new Error("Min concentration points must be ≥ 3");
 	return {
-		abundanceRef: data.abundanceRef,
-		concentrationColumnRef: data.concentrationColumnRef,
-		binColumnRef: data.binColumnRef,
-		antigenColumnRef: data.antigenColumnRef,
-		sortFractionColumnRef: data.sortFractionColumnRef,
-		targetAntigen: data.targetAntigen,
-		minReadsPerConcentration: data.minReadsPerConcentration,
-		minConcentrationPoints: data.minConcentrationPoints,
+		...inputs,
+		...readCoverage(data),
 		r2ThresholdGood: data.r2ThresholdGood,
 		r2ThresholdFailed: data.r2ThresholdFailed,
 		nMin: data.nMin,
 		nMax: data.nMax,
-		hookEffectThresholdBin: data.hookEffectThresholdBin ?? .2,
-		hookEffectThresholdNoBin: data.hookEffectThresholdNoBin ?? .02,
+		hookEffectThresholdBin: data.hookEffectThresholdBin ?? HILL_GATE_INDEX_DEFAULTS.hookEffectThresholdBin,
+		hookEffectThresholdNoBin: data.hookEffectThresholdNoBin ?? HILL_GATE_INDEX_DEFAULTS.hookEffectThresholdNoBin,
 		hookEffectMinReads: data.hookEffectMinReads,
-		defaultBlockLabel: data.defaultBlockLabel ?? "Tite-Seq Analysis",
-		customBlockLabel: data.customBlockLabel ?? ""
+		...labels
 	};
-}).output("abundanceOptions", (ctx) => ctx.resultPool.getOptions([
+}
+/** The block's pages. Per-replicate values are read by clicking a variant in the main table. */
+const sectionsFor = () => [
 	{
-		axes: [{ name: "pl7.app/sampleId" }, { name: "pl7.app/vdj/clonotypeKey" }],
-		annotations: { "pl7.app/isAnchor": "true" }
+		type: "link",
+		href: "/",
+		label: "Table"
+	},
+	{
+		type: "link",
+		href: "/titration-curves",
+		label: "Titration Curves"
 	},
 	{
-		axes: [{ name: "pl7.app/sampleId" }, { name: "pl7.app/vdj/scClonotypeKey" }],
-		annotations: { "pl7.app/isAnchor": "true" }
+		type: "link",
+		href: "/kd-distribution",
+		label: "Kd Distribution"
 	},
 	{
-		axes: [{ name: "pl7.app/sampleId" }, { name: "pl7.app/variantKey" }],
-		annotations: { "pl7.app/isAnchor": "true" }
+		type: "link",
+		href: "/affinity-vs-fit",
+		label: "Affinity vs Fit Quality"
 	}
-], { label: { includeNativeLabel: false } })).output("concentrationOptions", (ctx) => filterPopulatedOptions(ctx, (spec) => isPColumnSpec(spec) && isFloatValueType(spec.valueType) && spec.axesSpec.length === 1 && spec.axesSpec[0].name === "pl7.app/sampleId", { excludeRef: ctx.data.sortFractionColumnRef })).output("binOptions", (ctx) => filterPopulatedOptions(ctx, (spec) => isPColumnSpec(spec) && isIntegerValueType(spec.valueType) && spec.axesSpec.length === 1 && spec.axesSpec[0].name === "pl7.app/sampleId")).output("sortFractionOptions", (ctx) => filterPopulatedOptions(ctx, (spec) => isPColumnSpec(spec) && isFloatValueType(spec.valueType) && spec.axesSpec.length === 1 && spec.axesSpec[0].name === "pl7.app/sampleId", {
+];
+const platforma$1 = BlockModelV3.create({
+	dataModel,
+	kind
+}).templateParams(deriveTemplateParams).args(deriveArgs).output("abundanceOptions", (ctx) => buildDatasetOptions(ctx, {
+	primary: (spec) => isPColumnSpec(spec) && spec.annotations?.["pl7.app/isAnchor"] === "true" && spec.axesSpec.length === 2 && spec.axesSpec[0].name === "pl7.app/sampleId" && DATASET_KEY_AXES.has(spec.axesSpec[1].name),
+	filter: (spec) => isPColumnSpec(spec) && spec.axesSpec.length === 1 && DATASET_KEY_AXES.has(spec.axesSpec[0].name),
+	requireEnrichments: false
+}) ?? []).output("concentrationOptions", (ctx) => filterPopulatedOptions(ctx, (spec) => isPColumnSpec(spec) && isFloatValueType(spec.valueType) && spec.axesSpec.length === 1 && spec.axesSpec[0].name === "pl7.app/sampleId", { excludeRef: ctx.data.sortFractionColumnRef })).output("binOptions", (ctx) => filterPopulatedOptions(ctx, (spec) => isPColumnSpec(spec) && isIntegerValueType(spec.valueType) && spec.axesSpec.length === 1 && spec.axesSpec[0].name === "pl7.app/sampleId")).output("binFluorescenceOptions", (ctx) => filterPopulatedOptions(ctx, (spec) => isPColumnSpec(spec) && isFloatValueType(spec.valueType) && spec.axesSpec.length === 1 && spec.axesSpec[0].name === "pl7.app/sampleId", { excludeRef: ctx.data.concentrationColumnRef })).output("sortFractionOptions", (ctx) => filterPopulatedOptions(ctx, (spec) => isPColumnSpec(spec) && isFloatValueType(spec.valueType) && spec.axesSpec.length === 1 && spec.axesSpec[0].name === "pl7.app/sampleId", {
 	excludeRef: ctx.data.concentrationColumnRef,
 	valuePredicate: (finite) => finite.every((v) => v >= 0 && v <= 1)
-})).output("antigenOptions", (ctx) => ctx.resultPool.getOptions((spec) => isPColumnSpec(spec) && spec.valueType === "String" && spec.axesSpec.length === 1 && spec.axesSpec[0].name === "pl7.app/sampleId")).output("targetAntigenValues", (ctx) => {
+})).output("antigenOptions", (ctx) => ctx.resultPool.getOptions((spec) => isPColumnSpec(spec) && spec.valueType === "String" && spec.axesSpec.length === 1 && spec.axesSpec[0].name === "pl7.app/sampleId")).output("replicateOptions", (ctx) => {
+	const picked = [
+		ctx.data.concentrationColumnRef,
+		ctx.data.binColumnRef,
+		ctx.data.sortFractionColumnRef,
+		ctx.data.binFluorescenceColumnRef,
+		ctx.data.antigenColumnRef
+	].filter((ref) => ref !== void 0);
+	return filterPopulatedOptions(ctx, (spec) => isPColumnSpec(spec) && (spec.valueType === "String" || isIntegerValueType(spec.valueType)) && spec.axesSpec.length === 1 && spec.axesSpec[0].name === "pl7.app/sampleId").filter((opt) => !picked.some((ref) => plRefsEqual(opt.ref, ref)));
+}).output("targetAntigenValues", (ctx) => {
 	if (!ctx.data.antigenColumnRef) return void 0;
 	const values = (ctx.resultPool.getDataByRef(ctx.data.antigenColumnRef)?.data)?.getDataAsJson()?.["data"];
 	if (!values) return void 0;
@@ -13964,9 +14111,13 @@ const platforma$1 = BlockModelV3.create({
 	for (const key of [
 		"summaryPf",
 		"signalPf",
-		"logHandle"
+		"logHandle",
+		"replicatePf"
 	]) {
-		const errorAcc = ctx.outputs?.resolve(key)?.getError();
+		const errorAcc = (key === "replicatePf" ? ctx.outputs?.resolve({
+			field: key,
+			allowPermanentAbsence: true
+		}) : ctx.outputs?.resolve(key))?.getError();
 		if (!errorAcc) continue;
 		const typeName = errorAcc.resourceType.name;
 		const detail = errorAcc.getDataAsJson()?.message ?? typeName;
@@ -13976,13 +14127,6 @@ const platforma$1 = BlockModelV3.create({
 			message: isCidConflict ? `Transient result-hash conflict on "${key}": ${detail}. The platform retries automatically; usually self-recovers. If this persists across retries, the workflow likely has a non-deterministic step — report it.` : `Workflow output "${key}" failed: ${detail}`
 		});
 	}
-	if (data.concentrationColumnRef !== void 0) {
-		const unitLabel = ctx.resultPool.getPColumnSpecByRef(data.concentrationColumnRef)?.annotations?.["pl7.app/label"];
-		if (unitLabel && /\s/.test(unitLabel)) issues.push({
-			severity: "warning",
-			message: `Concentration column label "${unitLabel}" contains spaces. The full label becomes the Kd,app unit, so values render as "Kd,app (${unitLabel})". Use a bare unit like "nM" or "µM".`
-		});
-	}
 	if (data.antigenColumnRef === void 0 && data.targetAntigen) issues.push({
 		severity: "warning",
 		message: "targetAntigen is set but no antigen column is selected — the value is ignored. Select an antigen column or clear the targetAntigen field."
@@ -13995,7 +14139,6 @@ const platforma$1 = BlockModelV3.create({
 }).output("logHandle", (ctx) => ctx.outputs?.resolve("logHandle")?.getLogHandle()).output("isRunning", (ctx) => ctx.outputs?.getIsReadyOrError() === false).outputWithStatus("summaryTable", (ctx) => {
 	const summaryCols = ctx.outputs?.resolve("summaryPf")?.getPColumns();
 	if (summaryCols === void 0) return void 0;
-	const signalCols = ctx.outputs?.resolve("signalPf")?.getPColumns() ?? [];
 	const kdCol = summaryCols.find((c) => c.spec.name === "pl7.app/vdj/kd");
 	if (!kdCol) return void 0;
 	const resultPoolCols = ColumnsCollection(["result_pool"], { ctx: ctx.ctx }).filter({
@@ -14012,13 +14155,9 @@ const platforma$1 = BlockModelV3.create({
 		return spec.valueType !== "File" && !spec.annotations?.["pl7.app/trace"]?.includes("milaboratories.titeseq-analysis");
 	}).map((c) => c.withSpecs({ annotations: { "pl7.app/table/visibility": "optional" } }));
 	return createPlDataTableV3(ctx, {
-		primaryColumns: [...summaryCols, ...signalCols].map((c) => DataColumn.fromColumn(c)),
+		primaryColumns: summaryCols.map((c) => DataColumn.fromColumn(c)),
 		columns: resultPoolCols,
-		tableState: ctx.data.tableState,
-		displayOptions: { visibility: [{
-			match: { name: [exactly("pl7.app/vdj/fitFailureReason"), ...signalCols.map((c) => exactly(c.spec.name))] },
-			visibility: "default"
-		}] }
+		tableState: ctx.data.tableState
 	});
 }).outputWithStatus("titrationCurvesPf", (ctx) => {
 	const signalCols = ctx.outputs?.resolve("signalPf")?.getPColumns();
@@ -14048,28 +14187,52 @@ const platforma$1 = BlockModelV3.create({
 	const pCols = ctx.outputs?.resolve("summaryPf")?.getPColumns();
 	if (pCols === void 0) return void 0;
 	return pCols.length === 0;
-}).output("binMode", (ctx) => ctx.data.binColumnRef !== void 0).title(() => "Tite-Seq Analysis").subtitle((ctx) => ctx.data.customBlockLabel || ctx.data.defaultBlockLabel || "").sections((_ctx) => [
-	{
-		type: "link",
-		href: "/",
-		label: "Table"
-	},
-	{
-		type: "link",
-		href: "/titration-curves",
-		label: "Titration Curves"
-	},
-	{
-		type: "link",
-		href: "/kd-distribution",
-		label: "Kd Distribution"
-	},
-	{
-		type: "link",
-		href: "/affinity-vs-fit",
-		label: "Affinity vs Fit Quality"
-	}
-]).done();
+}).output("binMode", (ctx) => ctx.data.binColumnRef !== void 0).output("replicates", (ctx) => replicateCols(ctx) !== void 0).outputWithStatus("replicateTable", (ctx) => {
+	const cols = replicateCols(ctx);
+	if (cols === void 0) return void 0;
+	return createPlDataTableV3(ctx, {
+		primaryColumns: cols.map((c) => DataColumn.fromColumn(c)),
+		columns: void 0,
+		tableState: ctx.data.replicateTableState,
+		displayOptions: { visibility: [{
+			match: { name: cols.map((c) => exactly(c.spec.name)) },
+			visibility: "default"
+		}] }
+	});
+}).output("summaryKeyAxisId", (ctx) => {
+	const cols = ctx.outputs?.resolve("summaryPf")?.getPColumns();
+	const axis = (cols?.find((c) => c.spec.name === "pl7.app/vdj/affinityClass") ?? cols?.find((c) => c.spec.name === "pl7.app/vdj/kd"))?.spec.axesSpec[0];
+	return axis === void 0 ? void 0 : getAxisId(axis);
+}).outputWithStatus("replicateDrilldownTable", (ctx) => {
+	const cols = replicateCols(ctx);
+	if (cols === void 0) return void 0;
+	const filters = replicateDrilldownFilter(cols.map((c) => c.spec), ctx.data.replicateDrilldownKey);
+	if (filters === void 0) return void 0;
+	return createPlDataTableV3(ctx, {
+		primaryColumns: cols.map((c) => DataColumn.fromColumn(c)),
+		columns: void 0,
+		tableState: ctx.data.replicateDrilldownTableState,
+		displayOptions: { visibility: [{
+			match: { name: [exactly("pl7.app/label")] },
+			visibility: "hidden"
+		}, {
+			match: { name: cols.map((c) => exactly(c.spec.name)) },
+			visibility: "default"
+		}] },
+		filters
+	});
+}).outputWithStatus("replicatePfHandle", (ctx) => {
+	const cols = replicateCols(ctx);
+	if (cols === void 0) return void 0;
+	return createPFrameForGraphs(ctx, cols);
+}).output("replicatePfCols", (ctx) => {
+	const cols = replicateCols(ctx);
+	if (cols === void 0) return void 0;
+	return cols.map((c) => ({
+		columnId: c.id,
+		spec: c.spec
+	}));
+}).title(() => "Tite-Seq Analysis").subtitle((ctx) => ctx.data.customBlockLabel || ctx.data.defaultBlockLabel || "").sections(() => sectionsFor()).done();
 //#endregion
 //#region src/index.ts
 const selfUrl = import.meta.url;