@classytic/labs 0.6.0 → 0.7.0

package/README.md

@@ -3,7 +3,7 @@
 > **Standard v1 is in progress.** The architecture is `docs/ARCHITECTURE.md`; every lab gets a pure
 > model (`docs/LAB-MODEL.md`) and hosts compose labs through one registry (`docs/REGISTRY.md`). The
 > API sections below describe the pre-v1 surface (domain barrels, `blocks/*`), which is
-> replaced in migration phase 3 (`docs/MIGRATION.md`); this README is rewritten then.
+> replaced by the registry; this README is rewritten then.
 
 **Authorable, domain-organized interactive learning labs — built on the
 [`@classytic/stage`](../stage) engine.** Labs are React components composed from the
@@ -25,12 +25,25 @@ How a lab is built: [Architecture](docs/ARCHITECTURE.md). The frame every lab sh
 tokens, type roles, motion, focus, targets, and which region of the shell carries which
 learning principle. Its tokens are exported to `design-tokens.json` (W3C DTCG 2025.10).
 
+Hosts also provide the existing Base UI shadcn source components through `@/components/ui/*`.
+See the [host UI source contract](docs/DESIGN-SYSTEM.md#host-ui-source-contract) for the supported
+component API, bundler aliases, Tailwind scan and validation lanes.
+
 ```bash
 npm i @classytic/labs @classytic/stage react react-dom katex lucide-react clsx tailwind-merge zod
 # optional feature peers: @classytic/cms-ui (/blocks authoring),
-#                         three + @react-three/fiber (/three renderers)
+#                         three + @react-three/fiber (graphs containing 3D renderers)
 ```
 
+Optional peers are scoped by the imported feature graph. The complete built-in catalog, including
+`/blocks/resolve` and registries composed from `classyticPacks`, retains native loaders that reference
+Three renderers. Bundling those complete graphs requires `three` and `@react-three/fiber`, even when
+the page selects a different lab. A scene's runtime fallback does not make an unresolved build-time
+import optional. Hosts that need selected domains can compose complete public `/packs/<domain>`
+entries through `createLabRegistry`; the reachable loaders in those packs determine their peer
+requirements. The complete circuits pack has been verified without the 3D peers; this is not a
+blanket guarantee for every domain. See [the registry guide](docs/REGISTRY.md#2-a-host).
+
 ```css
 /* in your global CSS, after `@import "tailwindcss";` */
 @import '@classytic/stage/styles.css'; /* engine tokens + asset kit */
@@ -42,7 +55,8 @@ labs on only some routes should use them separately, so pages without labs never
 download the lab styles:
 
 ```css
-/* global CSS (your Tailwind entry): the scan for the authoring UI's utilities, no rules */
+/* global CSS (your Tailwind entry): the Tailwind scan, no rules. Lab markup and the authoring UI
+   use utilities your Tailwind build generates, so this is required wherever a lab renders */
 @import '@classytic/labs/tailwind.css';
 ```
 
@@ -55,7 +69,7 @@ import '@classytic/labs/styles/runtime.css';
 a course page. Hosts that know which subjects a page shows can go finer:
 
 ```css
-@import '@classytic/labs/tailwind.css'; /* in the Tailwind entry, if you use /blocks */
+@import '@classytic/labs/tailwind.css'; /* in the Tailwind entry: required wherever a lab renders */
 @import '@classytic/labs/styles/core.css'; /* tokens, shell, components: always */
 @import '@classytic/labs/styles/figure.css'; /* figure art direction:        always */
 @import '@classytic/labs/styles/domains/math.css'; /* ONE subject */
@@ -199,7 +213,8 @@ completion/score events flow to the host's learner seam (xAPI) via `useLearner()
 ## Subpaths
 
 Domain packs (lab components): `@classytic/labs/{math, physics, chem, circuits, geometry,
-language, ict, commerce, biology, geography, discrete, statistics, ml}`. Shared:
+language, ict, commerce, biology, geography, discrete, ml}`. Scientific statistics and probability
+functions are imported from `@classytic/stage/math` and retain their `Result` refusals. Shared:
 `@classytic/labs/{core, schemas}`. KaTeX-backed typesetting is available
 from `@classytic/labs/tex` so that dependency is explicit. Editor blocks use
 `@classytic/labs/blocks`; discovery-only hosts should prefer `/blocks/catalog`,
@@ -216,24 +231,25 @@ domain-scoped. Authors configure the teaching problem; the package owns playback
 layout, transcript, and keyboard controls.
 
 ```tsx
-import {
-  GraphAlgorithmLab,
-  GridPathLab,
-  HeapQuestLab,
-  TreeQuestLab,
-} from '@classytic/labs/algorithms/react';
-
-<GraphAlgorithmLab algorithm="dijkstra" graph={graph} source="home" target="server" />
-<TreeQuestLab operation="avl-insert" values={[30, 10]} target={20} predict />
-<HeapQuestLab operation="insert" kind="min" values={[3, 7, 5, 12]} value={1} />
-<GridPathLab rows={4} cols={5} />
+import { createLabRegistry } from '@classytic/labs';
+import { ictPack } from '@classytic/labs/packs/ict';
+
+const { Lab } = createLabRegistry([ictPack]);
+
+<Lab id="graph-algorithm" algorithm="dijkstra" graph={graph} source="home" target="server" />
+<Lab id="tree-quest" operation="avl-insert" values={[30, 10]} target={20} predict />
+<Lab id="heap-quest" operation="insert" kind="min" values={[3, 7, 5, 12]} value={1} />
+<Lab id="grid-path-dp" rows={4} cols={5} />
+<Lab id="array-vs-list" operation="append-many" values={[4, 8, 15]} capacity={1} />
 ```
 
-Use `@classytic/labs/algorithms/core` for contracts and trace-independent utilities,
-`/graph`, `/tree`, `/heap`, or `/dp` for one pure algorithm family, and `/react` only in a
-React learner surface. Graph, tree, heap, and DP manifests all provide lazy authoring panels;
-editors do not enter learner bundles. Keep trees at 31 nodes, heaps at 15 items, and DP grids
-at 8×8 or below so labels and touch controls remain instructional rather than decorative.
+Use one host registry composed from the scoped packs needed by the lesson. Reach labs by their
+registry ids or tags; standalone algorithm lab components and the legacy TraceTransport are no
+longer exported. The existing pure algorithm helpers remain available through
+`@classytic/labs/algorithms/core`, `/graph`, `/tree`, `/heap`, and `/dp`.
+Authoring panels remain lazy and do not enter learner bundles. Keep trees at 31 nodes, heaps at
+15 items, and DP grids at 8×8 or below so labels and touch controls remain instructional rather
+than decorative.
 
 ## Authorable pathways
 

package/dist/algorithms/index.d.mts

@@ -18,10 +18,8 @@ import { teachingGraph } from "../domains/ict/graph-algorithm/presets.mjs";
 import { Box, boxesOverlap, graphTextWidth, segmentHitsBox } from "../kit/algorithms/graph-geometry.mjs";
 import { AlgorithmGraphLegend, AlgorithmGraphTone } from "../kit/algorithms/graph-legend.mjs";
 import { AlgorithmGraphView, AlgorithmGraphViewProps, EdgeLayout, GRAPH_VIEWBOX, GraphLayout, GraphLayoutOptions, GraphPick, NodeLayout, circleHitsBox, graphLayoutFrame, layoutGraph } from "../kit/algorithms/graph.mjs";
-import { TraceTransport, TraceTransportProps } from "./TraceTransport.mjs";
 import { TreeScene, TreeSceneProps } from "../domains/ict/tree-quest/TreeScene.mjs";
-import { LIST_ACTIVITY_ID, ListLab, ListLabOperation, ListLabProps, Prediction, numericOptions, usePredictions } from "./ListLab.mjs";
 import { HeapDualView, HeapTreeLayout, heapTag, heapTreeLayout } from "../domains/ict/heap-quest/HeapDualView.mjs";
 import CostDerivation from "../domains/ict/cost-derivation/runtime.mjs";
 import { CostMode, halvingChain, halvingSteps, readout as costReadout, recursionLevels, triangleRows, triangleTotal } from "@classytic/stage/math";
-export { AbstractStructure, AlgorithmEdge, AlgorithmEvent, AlgorithmGraph, AlgorithmGraphLegend, type AlgorithmGraphTone, AlgorithmGraphView, AlgorithmGraphViewProps, AlgorithmNode, AlgorithmTrace, BALANCED_BST, BinaryTree, BinaryTreeNode, type Box, CLASSIC_BST, CLASSIC_GROWTH_CLASSES, CostDerivation, type CostMode, Crossover, DEFAULT_A, DEFAULT_B, DEFAULT_CAPACITY, DEFAULT_COSTS, DEFAULT_ITEMS, DPCellEvent, DPTrace, DP_LIMITS, DP_RECURRENCE, DeleteCase, DfsOrder, DpCell, DpCellRef, DpDistractor, DpEvent, DpOrder, DpProblem, DpSetEvent, DpSolution, DpSpec, DpStallEvent, EdgeLayout, EditOp, FACTORIAL_VAR, GRAPH_VIEWBOX, GROWTH_ALIASES, GROWTH_CLASSES, GROWTH_EXAMPLE, GROWTH_NOTATION, GraphAlgorithmId, GraphDecision, GraphDecisionOption, GraphLayout, GraphLayoutOptions, GraphPick, GraphTraceState, GrowthChart, GrowthClass, GrowthPolicy, GrowthRow, GrowthStep, GrowthTrace, HASH_FUNCTION_LABEL, HashFunction, HashOptions, HashStep, HashStrategy, HashTrace, HeapDualView, HeapEvent, HeapKind, HeapOperation, HeapSource, HeapStats, HeapTrace, HeapTreeLayout, INTRACTABLE_CLASSES, KnapsackItem, LIST_ACTIVITY_ID, LIST_OPERATIONS, ListComparison, ListKind, ListLab, ListLabOperation, ListLabProps, ListOperation, ListRun, ListStep, LookupTrace, NodeLayout, OPERATION_LABEL, PRACTICAL_CLASSES, Prediction, QUICK_PIVOTS, QuickPivot, ResolvedSortInput, RouteAnswer, SEARCH_VARIANTS, SORT_ALGORITHMS, SORT_COMPLEXITY, SORT_LABEL, SORT_SHAPES, SORT_STABLE, STRATEGY_LABEL, STRUCTURE_OPERATIONS, SearchDecision, SearchStep, SearchTrace, SearchVariant, SequenceDecision, SequenceEvent, SequenceItem, SortAlgorithm, SortEntry, SortEvent, SortInput, SortOptions, SortShape, SortStability, SortTallyEvent, SortTrace, TREE_GAP_X, TREE_GAP_Y, TraceTransport, TraceTransportProps, TraversalOrder, TreeBuildStrategy, TreeEvent, TreeKeySource, TreePosition, TreeScene, TreeSceneProps, TreeTrace, adjacencyList, adjacencyMatrix, appendMany, bellmanFord, bfs, binarySearchTrace, boxesOverlap, buildHeap, buildTeachingTree, cheapestAt, circleHitsBox, compareShortest, compareStructures, costReadout, countingApplies, crossoverOf, decreaseKeyHeap, deleteBST, describeEdit, describeHash, detectCycle, dfs, dijkstra, edgesAlong, extractHeap, fillOrder, findEdge, findHeapItem, formatOperations, formatWeight, gradeDpCell, graphLayoutFrame, graphStateAt, graphTextWidth, gridPaths, grow, growthAt, growthChart, halvingChain, halvingSteps, hasNegativeEdge, hashKey, hashTrace, hashWith, heapItemName, heapItems, heapItemsFrom, heapTag, heapTreeLayout, heapsortHeap, insertAVL, insertBST, insertHeap, intractableAt, isHeap, isWeighted, kruskal, layoutBinaryTree, layoutGraph, linearSearchComparisons, lookupCost, lookupTrace, normalizeCostExpr, normalizeGraph, numericOptions, operations, pathWeight, predictionCells, prepareGraph, prim, probeSequence, probeSlot, reconstructPath, recursionLevels, resizePushes, resolveGrowthClass, resolveSortInput, runGraphAlgorithm, runHeapOperation, runOperation, searchBST, secondHash, segmentHitsBox, shapeInput, snapshotItems, solveDp, sortCosts, sortStability, sortTrace, sortedCopy, splitStuck, structureOf, teachingGraph, tieRanks, timesSlower, toSortItems, topKHeap, topologicalSort, traverseTree, treeHeight, treeNodeName, triangleRows, triangleTotal, usePredictions, withFactorialVar };
+export { AbstractStructure, AlgorithmEdge, AlgorithmEvent, AlgorithmGraph, AlgorithmGraphLegend, type AlgorithmGraphTone, AlgorithmGraphView, AlgorithmGraphViewProps, AlgorithmNode, AlgorithmTrace, BALANCED_BST, BinaryTree, BinaryTreeNode, type Box, CLASSIC_BST, CLASSIC_GROWTH_CLASSES, CostDerivation, type CostMode, Crossover, DEFAULT_A, DEFAULT_B, DEFAULT_CAPACITY, DEFAULT_COSTS, DEFAULT_ITEMS, DPCellEvent, DPTrace, DP_LIMITS, DP_RECURRENCE, DeleteCase, DfsOrder, DpCell, DpCellRef, DpDistractor, DpEvent, DpOrder, DpProblem, DpSetEvent, DpSolution, DpSpec, DpStallEvent, EdgeLayout, EditOp, FACTORIAL_VAR, GRAPH_VIEWBOX, GROWTH_ALIASES, GROWTH_CLASSES, GROWTH_EXAMPLE, GROWTH_NOTATION, GraphAlgorithmId, GraphDecision, GraphDecisionOption, GraphLayout, GraphLayoutOptions, GraphPick, GraphTraceState, GrowthChart, GrowthClass, GrowthPolicy, GrowthRow, GrowthStep, GrowthTrace, HASH_FUNCTION_LABEL, HashFunction, HashOptions, HashStep, HashStrategy, HashTrace, HeapDualView, HeapEvent, HeapKind, HeapOperation, HeapSource, HeapStats, HeapTrace, HeapTreeLayout, INTRACTABLE_CLASSES, KnapsackItem, LIST_OPERATIONS, ListComparison, ListKind, ListOperation, ListRun, ListStep, LookupTrace, NodeLayout, OPERATION_LABEL, PRACTICAL_CLASSES, QUICK_PIVOTS, QuickPivot, ResolvedSortInput, RouteAnswer, SEARCH_VARIANTS, SORT_ALGORITHMS, SORT_COMPLEXITY, SORT_LABEL, SORT_SHAPES, SORT_STABLE, STRATEGY_LABEL, STRUCTURE_OPERATIONS, SearchDecision, SearchStep, SearchTrace, SearchVariant, SequenceDecision, SequenceEvent, SequenceItem, SortAlgorithm, SortEntry, SortEvent, SortInput, SortOptions, SortShape, SortStability, SortTallyEvent, SortTrace, TREE_GAP_X, TREE_GAP_Y, TraversalOrder, TreeBuildStrategy, TreeEvent, TreeKeySource, TreePosition, TreeScene, TreeSceneProps, TreeTrace, adjacencyList, adjacencyMatrix, appendMany, bellmanFord, bfs, binarySearchTrace, boxesOverlap, buildHeap, buildTeachingTree, cheapestAt, circleHitsBox, compareShortest, compareStructures, costReadout, countingApplies, crossoverOf, decreaseKeyHeap, deleteBST, describeEdit, describeHash, detectCycle, dfs, dijkstra, edgesAlong, extractHeap, fillOrder, findEdge, findHeapItem, formatOperations, formatWeight, gradeDpCell, graphLayoutFrame, graphStateAt, graphTextWidth, gridPaths, grow, growthAt, growthChart, halvingChain, halvingSteps, hasNegativeEdge, hashKey, hashTrace, hashWith, heapItemName, heapItems, heapItemsFrom, heapTag, heapTreeLayout, heapsortHeap, insertAVL, insertBST, insertHeap, intractableAt, isHeap, isWeighted, kruskal, layoutBinaryTree, layoutGraph, linearSearchComparisons, lookupCost, lookupTrace, normalizeCostExpr, normalizeGraph, operations, pathWeight, predictionCells, prepareGraph, prim, probeSequence, probeSlot, reconstructPath, recursionLevels, resizePushes, resolveGrowthClass, resolveSortInput, runGraphAlgorithm, runHeapOperation, runOperation, searchBST, secondHash, segmentHitsBox, shapeInput, snapshotItems, solveDp, sortCosts, sortStability, sortTrace, sortedCopy, splitStuck, structureOf, teachingGraph, tieRanks, timesSlower, toSortItems, topKHeap, topologicalSort, traverseTree, treeHeight, treeNodeName, triangleRows, triangleTotal, withFactorialVar };

package/dist/algorithms/index.mjs

@@ -6,7 +6,6 @@ import { DEFAULT_A, DEFAULT_B, DEFAULT_CAPACITY, DEFAULT_COSTS, DEFAULT_ITEMS, D
 import { boxesOverlap, graphTextWidth, segmentHitsBox } from "../kit/algorithms/graph-geometry.mjs";
 import { AlgorithmGraphLegend } from "../kit/algorithms/graph-legend.mjs";
 import { AlgorithmGraphView, GRAPH_VIEWBOX, circleHitsBox, graphLayoutFrame, layoutGraph } from "../kit/algorithms/graph.mjs";
-import { TraceTransport } from "./TraceTransport.mjs";
 import "../domains/ict/tree-quest/tree-contract.mjs";
 import { TREE_GAP_X, TREE_GAP_Y, layoutBinaryTree } from "../domains/ict/tree-quest/tree-layout.mjs";
 import { deleteBST, insertAVL, insertBST, searchBST, traverseTree, treeHeight, treeNodeName } from "../domains/ict/tree-quest/tree.mjs";
@@ -20,9 +19,8 @@ import { SEARCH_VARIANTS, binarySearchTrace, linearSearchComparisons, sortedCopy
 import { CLASSIC_GROWTH_CLASSES, FACTORIAL_VAR, GROWTH_ALIASES, GROWTH_CLASSES, GROWTH_EXAMPLE, GROWTH_NOTATION, INTRACTABLE_CLASSES, PRACTICAL_CLASSES, cheapestAt, crossoverOf, formatOperations, growthAt, growthChart, intractableAt, normalizeCostExpr, operations, resolveGrowthClass, timesSlower, withFactorialVar } from "./growth.mjs";
 import { HASH_FUNCTION_LABEL, STRATEGY_LABEL, describeHash, hashKey, hashTrace, hashWith, lookupCost, lookupTrace, probeSequence, probeSlot, secondHash } from "./hashing.mjs";
 import { LIST_OPERATIONS, OPERATION_LABEL, STRUCTURE_OPERATIONS, appendMany, compareStructures, grow, resizePushes, runOperation, structureOf } from "./lists.mjs";
-import { LIST_ACTIVITY_ID, ListLab, numericOptions, usePredictions } from "./ListLab.mjs";
 import { HeapDualView, heapTag, heapTreeLayout } from "../domains/ict/heap-quest/HeapDualView.mjs";
 import CostDerivation from "../domains/ict/cost-derivation/runtime.mjs";
 import { halvingChain, halvingSteps, readout as costReadout, recursionLevels, triangleRows, triangleTotal } from "@classytic/stage/math";
 
-export { AlgorithmGraphLegend, AlgorithmGraphView, BALANCED_BST, CLASSIC_BST, CLASSIC_GROWTH_CLASSES, CostDerivation, DEFAULT_A, DEFAULT_B, DEFAULT_CAPACITY, DEFAULT_COSTS, DEFAULT_ITEMS, DP_LIMITS, DP_RECURRENCE, FACTORIAL_VAR, GRAPH_VIEWBOX, GROWTH_ALIASES, GROWTH_CLASSES, GROWTH_EXAMPLE, GROWTH_NOTATION, HASH_FUNCTION_LABEL, HeapDualView, INTRACTABLE_CLASSES, LIST_ACTIVITY_ID, LIST_OPERATIONS, ListLab, OPERATION_LABEL, PRACTICAL_CLASSES, QUICK_PIVOTS, SEARCH_VARIANTS, SORT_ALGORITHMS, SORT_COMPLEXITY, SORT_LABEL, SORT_SHAPES, SORT_STABLE, STRATEGY_LABEL, STRUCTURE_OPERATIONS, TREE_GAP_X, TREE_GAP_Y, TraceTransport, TreeScene, adjacencyList, adjacencyMatrix, appendMany, bellmanFord, bfs, binarySearchTrace, boxesOverlap, buildHeap, buildTeachingTree, cheapestAt, circleHitsBox, compareShortest, compareStructures, costReadout, countingApplies, crossoverOf, decreaseKeyHeap, deleteBST, describeEdit, describeHash, detectCycle, dfs, dijkstra, edgesAlong, extractHeap, fillOrder, findEdge, findHeapItem, formatOperations, formatWeight, gradeDpCell, graphLayoutFrame, graphStateAt, graphTextWidth, gridPaths, grow, growthAt, growthChart, halvingChain, halvingSteps, hasNegativeEdge, hashKey, hashTrace, hashWith, heapItemName, heapItems, heapItemsFrom, heapTag, heapTreeLayout, heapsortHeap, insertAVL, insertBST, insertHeap, intractableAt, isHeap, isWeighted, kruskal, layoutBinaryTree, layoutGraph, linearSearchComparisons, lookupCost, lookupTrace, normalizeCostExpr, normalizeGraph, numericOptions, operations, pathWeight, predictionCells, prepareGraph, prim, probeSequence, probeSlot, reconstructPath, recursionLevels, resizePushes, resolveGrowthClass, resolveSortInput, runGraphAlgorithm, runHeapOperation, runOperation, searchBST, secondHash, segmentHitsBox, shapeInput, snapshotItems, solveDp, sortCosts, sortStability, sortTrace, sortedCopy, splitStuck, structureOf, teachingGraph, tieRanks, timesSlower, toSortItems, topKHeap, topologicalSort, traverseTree, treeHeight, treeNodeName, triangleRows, triangleTotal, usePredictions, withFactorialVar };
+export { AlgorithmGraphLegend, AlgorithmGraphView, BALANCED_BST, CLASSIC_BST, CLASSIC_GROWTH_CLASSES, CostDerivation, DEFAULT_A, DEFAULT_B, DEFAULT_CAPACITY, DEFAULT_COSTS, DEFAULT_ITEMS, DP_LIMITS, DP_RECURRENCE, FACTORIAL_VAR, GRAPH_VIEWBOX, GROWTH_ALIASES, GROWTH_CLASSES, GROWTH_EXAMPLE, GROWTH_NOTATION, HASH_FUNCTION_LABEL, HeapDualView, INTRACTABLE_CLASSES, LIST_OPERATIONS, OPERATION_LABEL, PRACTICAL_CLASSES, QUICK_PIVOTS, SEARCH_VARIANTS, SORT_ALGORITHMS, SORT_COMPLEXITY, SORT_LABEL, SORT_SHAPES, SORT_STABLE, STRATEGY_LABEL, STRUCTURE_OPERATIONS, TREE_GAP_X, TREE_GAP_Y, TreeScene, adjacencyList, adjacencyMatrix, appendMany, bellmanFord, bfs, binarySearchTrace, boxesOverlap, buildHeap, buildTeachingTree, cheapestAt, circleHitsBox, compareShortest, compareStructures, costReadout, countingApplies, crossoverOf, decreaseKeyHeap, deleteBST, describeEdit, describeHash, detectCycle, dfs, dijkstra, edgesAlong, extractHeap, fillOrder, findEdge, findHeapItem, formatOperations, formatWeight, gradeDpCell, graphLayoutFrame, graphStateAt, graphTextWidth, gridPaths, grow, growthAt, growthChart, halvingChain, halvingSteps, hasNegativeEdge, hashKey, hashTrace, hashWith, heapItemName, heapItems, heapItemsFrom, heapTag, heapTreeLayout, heapsortHeap, insertAVL, insertBST, insertHeap, intractableAt, isHeap, isWeighted, kruskal, layoutBinaryTree, layoutGraph, linearSearchComparisons, lookupCost, lookupTrace, normalizeCostExpr, normalizeGraph, operations, pathWeight, predictionCells, prepareGraph, prim, probeSequence, probeSlot, reconstructPath, recursionLevels, resizePushes, resolveGrowthClass, resolveSortInput, runGraphAlgorithm, runHeapOperation, runOperation, searchBST, secondHash, segmentHitsBox, shapeInput, snapshotItems, solveDp, sortCosts, sortStability, sortTrace, sortedCopy, splitStuck, structureOf, teachingGraph, tieRanks, timesSlower, toSortItems, topKHeap, topologicalSort, traverseTree, treeHeight, treeNodeName, triangleRows, triangleTotal, withFactorialVar };

package/dist/algorithms/react/index.d.mts

@@ -1,7 +1,6 @@
 import { Box, boxesOverlap, graphTextWidth, segmentHitsBox } from "../../kit/algorithms/graph-geometry.mjs";
 import { AlgorithmGraphLegend, AlgorithmGraphTone } from "../../kit/algorithms/graph-legend.mjs";
 import { AlgorithmGraphView, AlgorithmGraphViewProps, EdgeLayout, GRAPH_VIEWBOX, GraphLayout, GraphLayoutOptions, GraphPick, NodeLayout, circleHitsBox, graphLayoutFrame, layoutGraph } from "../../kit/algorithms/graph.mjs";
-import { TraceTransport, TraceTransportProps } from "../TraceTransport.mjs";
 import { TreeScene, TreeSceneProps } from "../../domains/ict/tree-quest/TreeScene.mjs";
 import { HeapDualView, HeapTreeLayout, heapTag, heapTreeLayout } from "../../domains/ict/heap-quest/HeapDualView.mjs";
-export { AlgorithmGraphLegend, type AlgorithmGraphTone, AlgorithmGraphView, AlgorithmGraphViewProps, type Box, EdgeLayout, GRAPH_VIEWBOX, GraphLayout, GraphLayoutOptions, GraphPick, HeapDualView, HeapTreeLayout, NodeLayout, TraceTransport, TraceTransportProps, TreeScene, TreeSceneProps, boxesOverlap, circleHitsBox, graphLayoutFrame, graphTextWidth, heapTag, heapTreeLayout, layoutGraph, segmentHitsBox };
+export { AlgorithmGraphLegend, type AlgorithmGraphTone, AlgorithmGraphView, AlgorithmGraphViewProps, type Box, EdgeLayout, GRAPH_VIEWBOX, GraphLayout, GraphLayoutOptions, GraphPick, HeapDualView, HeapTreeLayout, NodeLayout, TreeScene, TreeSceneProps, boxesOverlap, circleHitsBox, graphLayoutFrame, graphTextWidth, heapTag, heapTreeLayout, layoutGraph, segmentHitsBox };

package/dist/algorithms/react/index.mjs

@@ -3,8 +3,7 @@
 import { boxesOverlap, graphTextWidth, segmentHitsBox } from "../../kit/algorithms/graph-geometry.mjs";
 import { AlgorithmGraphLegend } from "../../kit/algorithms/graph-legend.mjs";
 import { AlgorithmGraphView, GRAPH_VIEWBOX, circleHitsBox, graphLayoutFrame, layoutGraph } from "../../kit/algorithms/graph.mjs";
-import { TraceTransport } from "../TraceTransport.mjs";
 import { TreeScene } from "../../domains/ict/tree-quest/TreeScene.mjs";
 import { HeapDualView, heapTag, heapTreeLayout } from "../../domains/ict/heap-quest/HeapDualView.mjs";
 
-export { AlgorithmGraphLegend, AlgorithmGraphView, GRAPH_VIEWBOX, HeapDualView, TraceTransport, TreeScene, boxesOverlap, circleHitsBox, graphLayoutFrame, graphTextWidth, heapTag, heapTreeLayout, layoutGraph, segmentHitsBox };
+export { AlgorithmGraphLegend, AlgorithmGraphView, GRAPH_VIEWBOX, HeapDualView, TreeScene, boxesOverlap, circleHitsBox, graphLayoutFrame, graphTextWidth, heapTag, heapTreeLayout, layoutGraph, segmentHitsBox };

package/dist/algorithms/sorting.mjs

@@ -1,6 +1,6 @@
-import { mulberry32, randInt } from "../core/rng.mjs";
 import { snapshotItems } from "./sequence-contract.mjs";
 import { resolveDataset } from "./worlds/index.mjs";
+import { mulberry32, randInt } from "@classytic/stage/rng";
 
 //#region src/algorithms/sorting.ts
 /**

package/dist/authoring/evidence.d.mts

@@ -0,0 +1,29 @@
+import { LabTaxonomy } from "../lab-def/define-lab.mjs";
+//#region src/authoring/evidence.d.ts
+export declare const LAB_EVIDENCE_DIMENSIONS: readonly ["model-review", "interaction-test", "keyboard", "non-drag-pointer", "text-alternative", "reduced-motion", "responsive-zoom", "visual-themes", "authoring-variation", "bundle-budget"];
+export type LabEvidenceDimension = (typeof LAB_EVIDENCE_DIMENSIONS)[number];
+export type LabEvidenceStatus = 'verified' | 'planned' | 'not-applicable';
+export interface LabEvidenceRecord {
+  status: LabEvidenceStatus;
+  /** Test path, review document, gallery scene, or other inspectable proof. */
+  reference?: string;
+  /** Required when a dimension genuinely does not apply. */
+  note?: string;
+}
+export type LabQualityEvidence = Partial<Record<LabEvidenceDimension, LabEvidenceRecord>>;
+export interface EvidenceBearingManifest {
+  taxonomy?: Pick<LabTaxonomy, 'qualityTier' | 'starter'>;
+  qualityEvidence?: LabQualityEvidence;
+}
+export interface LabEvidenceAssessment {
+  ready: boolean;
+  scoped: boolean;
+  verified: number;
+  required: number;
+  dimensions: Partial<Record<LabEvidenceDimension, LabEvidenceStatus | 'missing'>>;
+  issues: string[];
+}
+export declare function requiredEvidenceDimensions(tier: LabTaxonomy['qualityTier']): readonly LabEvidenceDimension[];
+/** Assess inspectable proof separately from the manifest's declared capability contract. */
+export declare function assessLabEvidence(manifest: EvidenceBearingManifest): LabEvidenceAssessment;
+//#endregion

package/dist/authoring/index.d.mts

@@ -1,3 +1,4 @@
+import { EvidenceBearingManifest, LAB_EVIDENCE_DIMENSIONS, LabEvidenceAssessment, LabEvidenceDimension, LabEvidenceRecord, LabEvidenceStatus, LabQualityEvidence, assessLabEvidence, requiredEvidenceDimensions } from "./evidence.mjs";
 import { LabAuthoringComponent, LabLearningExperience, LabManifest, LabRepresentation, LabRuntimeComponent, LabTaxonomy, defineLab, labTag } from "../lab-def/define-lab.mjs";
 import { ActivityPattern, AuthoredActivity, AuthoredActivityStep, AuthoredChoice, AuthoredChoiceQuestion, AuthoredDataset, AuthoredInvestigation, AuthoredNumericQuestion, AuthoredOrderingQuestion, AuthoredQuestion, AuthoredReflectionQuestion, AuthoredSuccessCondition, AuthoredTextQuestion, AuthoredTransferCase, CompiledAuthoredActivity, SuccessOperator, compileAuthoredActivity, defineAuthoredActivity, defineInvestigation, isCompiledAuthoredActivity, withAuthoredObjectives } from "../kit/activity-authoring.mjs";
 import { activityPatternSchema, authoredActivitySchema, authoredActivityStepSchema, authoredChoiceSchema, authoredDatasetSchema, authoredQuestionSchema, authoredSuccessSchema, authoredTransferCaseSchema } from "../schemas/activity-authoring.mjs";
@@ -7,4 +8,4 @@ import { LabQualityEntry, LabQualityReport, LabQualityStatus, createLabQualityRe
 /** Validate unknown CMS data and compile it into the learner runtime plan. */
 export declare function parseAuthoredActivity(input: unknown): CompiledAuthoredActivity;
 //#endregion
-export { type ActivityPattern, type AuthoredActivity, type AuthoredActivityStep, type AuthoredChoice, type AuthoredChoiceQuestion, type AuthoredDataset, type AuthoredInvestigation, type AuthoredNumericQuestion, type AuthoredOrderingQuestion, type AuthoredQuestion, type AuthoredReflectionQuestion, type AuthoredSuccessCondition, type AuthoredTextQuestion, type AuthoredTransferCase, type CompiledAuthoredActivity, type LabAccessibilityEvidence, type LabAuthoringComponent, type LabExperienceAssessment, type LabLearningExperience, type LabManifest, type LabQualityEntry, type LabQualityReport, type LabQualityStatus, type LabRepresentation, type LabRuntimeComponent, type LabTaxonomy, type SuccessOperator, activityPatternSchema, assessLabExperience, authoredActivitySchema, authoredActivityStepSchema, authoredChoiceSchema, authoredDatasetSchema, authoredQuestionSchema, authoredSuccessSchema, authoredTransferCaseSchema, compileAuthoredActivity, createLabQualityReport, defineAuthoredActivity, defineInvestigation, defineLab, deriveActivityExperience, isCompiledAuthoredActivity, labTag, withAuthoredObjectives };
+export { type ActivityPattern, type AuthoredActivity, type AuthoredActivityStep, type AuthoredChoice, type AuthoredChoiceQuestion, type AuthoredDataset, type AuthoredInvestigation, type AuthoredNumericQuestion, type AuthoredOrderingQuestion, type AuthoredQuestion, type AuthoredReflectionQuestion, type AuthoredSuccessCondition, type AuthoredTextQuestion, type AuthoredTransferCase, type CompiledAuthoredActivity, type EvidenceBearingManifest, LAB_EVIDENCE_DIMENSIONS, type LabAccessibilityEvidence, type LabAuthoringComponent, type LabEvidenceAssessment, type LabEvidenceDimension, type LabEvidenceRecord, type LabEvidenceStatus, type LabExperienceAssessment, type LabLearningExperience, type LabManifest, type LabQualityEntry, type LabQualityEvidence, type LabQualityReport, type LabQualityStatus, type LabRepresentation, type LabRuntimeComponent, type LabTaxonomy, type SuccessOperator, activityPatternSchema, assessLabEvidence, assessLabExperience, authoredActivitySchema, authoredActivityStepSchema, authoredChoiceSchema, authoredDatasetSchema, authoredQuestionSchema, authoredSuccessSchema, authoredTransferCaseSchema, compileAuthoredActivity, createLabQualityReport, defineAuthoredActivity, defineInvestigation, defineLab, deriveActivityExperience, isCompiledAuthoredActivity, labTag, requiredEvidenceDimensions, withAuthoredObjectives };

package/dist/authoring/index.mjs

@@ -2,6 +2,7 @@ import { compileAuthoredActivity, defineAuthoredActivity, defineInvestigation, i
 import { activityPatternSchema, authoredActivitySchema, authoredActivityStepSchema, authoredChoiceSchema, authoredDatasetSchema, authoredQuestionSchema, authoredSuccessSchema, authoredTransferCaseSchema } from "../schemas/activity-authoring.mjs";
 import { defineLab, labTag } from "../lab-def/define-lab.mjs";
 import { assessLabExperience, deriveActivityExperience } from "./quality.mjs";
+import { LAB_EVIDENCE_DIMENSIONS, assessLabEvidence, requiredEvidenceDimensions } from "./evidence.mjs";
 import { createLabQualityReport } from "./report.mjs";
 
 //#region src/authoring/index.ts
@@ -17,4 +18,4 @@ function parseAuthoredActivity(input) {
 }
 
 //#endregion
-export { activityPatternSchema, assessLabExperience, authoredActivitySchema, authoredActivityStepSchema, authoredChoiceSchema, authoredDatasetSchema, authoredQuestionSchema, authoredSuccessSchema, authoredTransferCaseSchema, compileAuthoredActivity, createLabQualityReport, defineAuthoredActivity, defineInvestigation, defineLab, deriveActivityExperience, isCompiledAuthoredActivity, labTag, parseAuthoredActivity, withAuthoredObjectives };
+export { LAB_EVIDENCE_DIMENSIONS, activityPatternSchema, assessLabEvidence, assessLabExperience, authoredActivitySchema, authoredActivityStepSchema, authoredChoiceSchema, authoredDatasetSchema, authoredQuestionSchema, authoredSuccessSchema, authoredTransferCaseSchema, compileAuthoredActivity, createLabQualityReport, defineAuthoredActivity, defineInvestigation, defineLab, deriveActivityExperience, isCompiledAuthoredActivity, labTag, parseAuthoredActivity, requiredEvidenceDimensions, withAuthoredObjectives };

package/dist/blocks/authoring.d.mts

@@ -7,19 +7,33 @@ import { ReactNode } from "react";
  * attrs through this: array → as-is, JSON-string-of-array → parsed, else fallback.
  */
 export declare function coerceArray<T>(raw: unknown, fallback?: T[]): T[];
+/** Native naming and validation links shared by the editor's input primitives. */
+interface AuthoringFieldProps {
+  id?: string;
+  name?: string;
+  ariaLabel?: string;
+  invalid?: boolean;
+  describedBy?: string;
+}
 /** A subtle settings panel shown above a block while editing. */
 declare function ConfigPanel({ children }: {
   children: ReactNode;
 }): ReactNode;
-declare function ConfigRow({ label, hint, error, errorId, children }: {
+declare function ConfigRow({ label, hint, error, errorId, labelId, hintId, controlId, children }: {
   label: string;
   hint?: string;
   error?: string;
   errorId?: string;
+  labelId?: string;
+  hintId?: string;
+  controlId?: string;
   children: ReactNode;
 }): ReactNode;
-declare function ChipToggle({ active, onClick, children }: {
+declare function ChipToggle({ active, ariaLabel, describedBy, invalid, onClick, children }: {
   active: boolean;
+  ariaLabel?: string;
+  describedBy?: string;
+  invalid?: boolean;
   onClick: () => void;
   children: ReactNode;
 }): ReactNode;
@@ -28,15 +42,12 @@ declare function ChipToggle({ active, onClick, children }: {
  * `updateAttributes` round-trips through Slate and re-renders; we only re-sync
  * from upstream when the field is not focused (external/programmatic edits).
  */
-declare function TextField({ value, onChange, placeholder, mono, className, invalid, describedBy, ariaLabel }: {
+declare function TextField({ value, name, id, onChange, placeholder, mono, className, invalid, describedBy, ariaLabel }: AuthoringFieldProps & {
   value: string;
   onChange: (v: string) => void;
   placeholder?: string;
   mono?: boolean;
   className?: string;
-  invalid?: boolean;
-  describedBy?: string;
-  ariaLabel?: string;
 }): ReactNode;
 /** Multi-line plain-text field (draft-buffered like TextField). For prose blocks
  *  such as a reading passage; use JsonArea instead for structured JSON. */
@@ -46,15 +57,13 @@ declare function TextArea({ value, onChange, placeholder, rows }: {
   placeholder?: string;
   rows?: number;
 }): ReactNode;
-declare function NumField({ value, onChange, className, min, max, step, invalid, describedBy }: {
+declare function NumField({ value, name, id, ariaLabel, onChange, className, min, max, step, invalid, describedBy }: AuthoringFieldProps & {
   value: number;
   onChange: (v: number) => void;
   className?: string;
   min?: number;
   max?: number;
   step?: number;
-  invalid?: boolean;
-  describedBy?: string;
 }): ReactNode;
 declare function SmallButton({ onClick, children, tone, ariaLabel }: {
   onClick: () => void;
@@ -66,11 +75,13 @@ export interface SelectOption {
   value: string;
   label: string;
 }
-declare function SelectField({ value, onChange, options, ariaLabel, className }: {
+declare function SelectField({ value, onChange, options, ariaLabel, describedBy, invalid, className }: {
   value: string;
   onChange: (v: string) => void;
   options: readonly (string | SelectOption)[];
   ariaLabel?: string;
+  describedBy?: string;
+  invalid?: boolean;
   className?: string;
 }): ReactNode;
 declare function BooleanField({ checked, onChange, label, hint }: {
@@ -86,7 +97,7 @@ declare function SegmentedField({ value, onChange, options, ariaLabel }: {
   ariaLabel: string;
 }): ReactNode;
 /** Comma-separated text ↔ string[] (caret-stable). */
-declare function TagsField({ value, onChange, placeholder }: {
+declare function TagsField({ value, describedBy, invalid, name, id, ariaLabel, onChange, placeholder }: AuthoringFieldProps & {
   value: string[];
   onChange: (v: string[]) => void;
   placeholder?: string;
@@ -111,7 +122,7 @@ declare function PedagogyRows({ objectives, hints, onObjectives, onHints }: {
 }): ReactNode;
 /** A JSON escape hatch for deeply-nested data (advanced authoring); keeps a
  *  draft and commits on every valid parse, keeping the last good value. */
-declare function JsonArea<T>({ value, onChange, rows }: {
+declare function JsonArea<T>({ value, describedBy, invalid, name, id, ariaLabel, onChange, rows }: AuthoringFieldProps & {
   value: T;
   onChange: (v: T) => void;
   rows?: number;
@@ -144,8 +155,11 @@ export interface RowCol {
 }
 /** Edit an array of records as add/remove/reorder rows of typed fields, the
  *  creator-facing alternative to hand-writing JSON. */
-declare function RowsEditor<T extends object>({ rows, onChange, columns, newRow, addLabel }: {
+declare function RowsEditor<T extends object>({ rows, fieldName, describedBy, invalid, onChange, columns, newRow, addLabel }: {
   rows: T[];
+  fieldName?: string;
+  describedBy?: string;
+  invalid?: boolean;
   onChange: (rows: T[]) => void;
   columns: RowCol[];
   newRow: () => T;

package/dist/blocks/authoring.mjs

@@ -1,12 +1,13 @@
 'use client';
 
-import { useEffect, useRef, useState } from "react";
+import { useEffect, useId, useRef, useState } from "react";
 import { Fragment as Fragment$1, jsx, jsxs } from "react/jsx-runtime";
 import { Button } from "@/components/ui/button";
 import { Input } from "@/components/ui/input";
 import { Select, SelectContent, SelectItem, SelectTrigger, SelectValue } from "@/components/ui/select";
 import { Textarea } from "@/components/ui/textarea";
 import { Checkbox } from "@/components/ui/checkbox";
+import { Field, FieldGroup, FieldLabel, FieldTitle } from "@/components/ui/field";
 import { Popover, PopoverContent, PopoverTrigger } from "@/components/ui/popover";
 
 //#region src/blocks/authoring.tsx
@@ -40,41 +41,56 @@ function coerceArray(raw, fallback = []) {
 }
 /** A subtle settings panel shown above a block while editing. */
 function ConfigPanel({ children }) {
-	return /* @__PURE__ */ jsx("div", {
-		className: "mb-2 space-y-2 rounded-md border border-border/60 bg-muted/40 p-2.5 text-xs",
+	return /* @__PURE__ */ jsx(FieldGroup, {
+		className: "mb-2 gap-2 rounded-md border border-border/60 bg-muted/40 p-2.5 text-xs",
 		children
 	});
 }
-function ConfigRow({ label, hint, error, errorId, children }) {
-	return /* @__PURE__ */ jsxs("div", {
-		className: "flex flex-col gap-0.5",
+function ConfigRow({ label, hint, error, errorId, labelId, hintId, controlId, children }) {
+	const uid = useId();
+	const namedBy = labelId ?? `${uid}-label`;
+	return /* @__PURE__ */ jsxs(Field, {
+		className: "gap-0.5",
+		"aria-labelledby": namedBy,
+		"aria-describedby": [hint && hintId, error && errorId].filter(Boolean).join(" ") || undefined,
+		"data-invalid": error ? true : undefined,
 		children: [
 			/* @__PURE__ */ jsxs("div", {
 				className: "flex flex-wrap items-center gap-2",
-				children: [/* @__PURE__ */ jsx("span", {
+				children: [controlId ? /* @__PURE__ */ jsx(FieldLabel, {
+					id: namedBy,
+					htmlFor: controlId,
 					className: "w-24 shrink-0 self-start pt-1.5 font-medium text-muted-foreground",
 					children: label
+				}) : /* @__PURE__ */ jsx(FieldTitle, {
+					id: namedBy,
+					className: "w-24 shrink-0 self-start pt-1.5",
+					children: label
 				}), children]
 			}),
 			hint ? /* @__PURE__ */ jsx("span", {
-				className: "pl-[calc(6rem+0.5rem)] text-[10.5px] leading-snug text-muted-foreground/80",
+				id: hintId,
+				className: "pl-[calc(6rem+0.5rem)] text-[10.5px] leading-snug text-muted-foreground/80 [overflow-wrap:anywhere]",
 				children: hint
 			}) : null,
 			error ? /* @__PURE__ */ jsx("span", {
 				id: errorId,
-				className: "pl-[calc(6rem+0.5rem)] text-[10.5px] leading-snug text-destructive",
+				className: "pl-[calc(6rem+0.5rem)] text-[10.5px] leading-snug text-destructive [overflow-wrap:anywhere]",
 				children: error
 			}) : null
 		]
 	});
 }
-function ChipToggle({ active, onClick, children }) {
+function ChipToggle({ active, ariaLabel, describedBy, invalid, onClick, children }) {
 	return /* @__PURE__ */ jsx(Button, {
 		type: "button",
 		size: "xs",
 		variant: active ? "secondary" : "outline",
 		onClick,
 		"aria-pressed": active,
+		"aria-label": ariaLabel,
+		"aria-describedby": describedBy,
+		"aria-invalid": invalid || undefined,
 		className: ["rounded-full border px-2.5 py-0.5 font-medium transition-colors", active ? "border-transparent bg-primary text-primary-foreground" : "border-border text-muted-foreground hover:bg-background"].join(" "),
 		children
 	});
@@ -84,13 +100,15 @@ function ChipToggle({ active, onClick, children }) {
 * `updateAttributes` round-trips through Slate and re-renders; we only re-sync
 * from upstream when the field is not focused (external/programmatic edits).
 */
-function TextField({ value, onChange, placeholder, mono, className, invalid, describedBy, ariaLabel }) {
+function TextField({ value, name, id, onChange, placeholder, mono, className, invalid, describedBy, ariaLabel }) {
 	const [draft, setDraft] = useState(value);
 	const focused = useRef(false);
 	useEffect(() => {
 		if (!focused.current) setDraft(value);
 	}, [value]);
 	return /* @__PURE__ */ jsx(Input, {
+		id,
+		name,
 		type: "text",
 		value: draft,
 		placeholder,
@@ -142,13 +160,16 @@ function TextArea({ value, onChange, placeholder, rows = 5 }) {
 		className: "w-full min-w-0 rounded border border-border bg-background px-2 py-1 leading-relaxed"
 	});
 }
-function NumField({ value, onChange, className, min, max, step, invalid, describedBy }) {
+function NumField({ value, name, id, ariaLabel, onChange, className, min, max, step, invalid, describedBy }) {
 	const [draft, setDraft] = useState(String(value));
 	const focused = useRef(false);
 	useEffect(() => {
 		if (!focused.current) setDraft(Number.isFinite(value) ? String(value) : "");
 	}, [value]);
 	return /* @__PURE__ */ jsx(Input, {
+		id,
+		name,
+		"aria-label": ariaLabel,
 		type: "number",
 		value: draft,
 		min,
@@ -186,7 +207,7 @@ function SmallButton({ onClick, children, tone, ariaLabel }) {
 		children
 	});
 }
-function SelectField({ value, onChange, options, ariaLabel, className }) {
+function SelectField({ value, onChange, options, ariaLabel, describedBy, invalid, className }) {
 	const items = options.map((option) => typeof option === "string" ? {
 		value: option,
 		label: option
@@ -200,6 +221,8 @@ function SelectField({ value, onChange, options, ariaLabel, className }) {
 		children: [/* @__PURE__ */ jsx(SelectTrigger, {
 			size: "sm",
 			"aria-label": ariaLabel,
+			"aria-describedby": describedBy,
+			"aria-invalid": invalid || undefined,
 			className: ["min-w-0 text-[11px]", className ?? ""].join(" "),
 			children: /* @__PURE__ */ jsx(SelectValue, {})
 		}), /* @__PURE__ */ jsx(SelectContent, { children: items.map((item) => /* @__PURE__ */ jsx(SelectItem, {
@@ -244,13 +267,18 @@ function SegmentedField({ value, onChange, options, ariaLabel }) {
 	});
 }
 /** Comma-separated text ↔ string[] (caret-stable). */
-function TagsField({ value, onChange, placeholder }) {
+function TagsField({ value, describedBy, invalid, name, id, ariaLabel, onChange, placeholder }) {
 	const [draft, setDraft] = useState((value ?? []).join(", "));
 	const focused = useRef(false);
 	useEffect(() => {
 		if (!focused.current) setDraft((value ?? []).join(", "));
 	}, [value]);
 	return /* @__PURE__ */ jsx(Input, {
+		id,
+		name,
+		"aria-label": ariaLabel,
+		"aria-invalid": invalid || undefined,
+		"aria-describedby": describedBy,
 		type: "text",
 		value: draft,
 		placeholder,
@@ -325,9 +353,10 @@ function PedagogyRows({ objectives, hints, onObjectives, onHints }) {
 }
 /** A JSON escape hatch for deeply-nested data (advanced authoring); keeps a
 *  draft and commits on every valid parse, keeping the last good value. */
-function JsonArea({ value, onChange, rows = 6 }) {
+function JsonArea({ value, describedBy, invalid, name, id, ariaLabel, onChange, rows = 6 }) {
 	const [draft, setDraft] = useState(() => JSON.stringify(value, null, 2));
 	const [bad, setBad] = useState(false);
+	const syntaxId = useId();
 	const focused = useRef(false);
 	useEffect(() => {
 		if (!focused.current) setDraft(JSON.stringify(value, null, 2));
@@ -335,6 +364,11 @@ function JsonArea({ value, onChange, rows = 6 }) {
 	return /* @__PURE__ */ jsxs("div", {
 		className: "w-full",
 		children: [/* @__PURE__ */ jsx(Textarea, {
+			id,
+			name,
+			"aria-label": ariaLabel,
+			"aria-invalid": bad || invalid || undefined,
+			"aria-describedby": [describedBy, bad && syntaxId].filter(Boolean).join(" ") || undefined,
 			value: draft,
 			rows,
 			spellCheck: false,
@@ -357,6 +391,8 @@ function JsonArea({ value, onChange, rows = 6 }) {
 			},
 			className: "w-full rounded border border-border bg-background px-2 py-1 font-mono text-[11px] leading-snug"
 		}), bad ? /* @__PURE__ */ jsx("span", {
+			id: syntaxId,
+			role: "alert",
 			className: "text-[11px] text-destructive",
 			children: "invalid JSON, last valid kept"
 		}) : null]
@@ -717,7 +753,7 @@ function IconPicker({ value, onChange, placeholder = "pick" }) {
 }
 /** Edit an array of records as add/remove/reorder rows of typed fields, the
 *  creator-facing alternative to hand-writing JSON. */
-function RowsEditor({ rows, onChange, columns, newRow, addLabel = "row" }) {
+function RowsEditor({ rows, fieldName, describedBy, invalid, onChange, columns, newRow, addLabel = "row" }) {
 	const list = Array.isArray(rows) ? rows : [];
 	const set = (i, key, v) => onChange(list.map((r, j) => j === i ? {
 		...r,
@@ -744,9 +780,13 @@ function RowsEditor({ rows, onChange, columns, newRow, addLabel = "row" }) {
 			return /* @__PURE__ */ jsxs("div", {
 				className: "block-row-editor",
 				children: [columns.map((col) => {
+					const ariaLabel = fieldName ? `${fieldName}[${i}].${col.key}` : col.label;
 					if (col.type === "number") return /* @__PURE__ */ jsxs("span", {
 						className: "block-row-number",
 						children: [col.label, /* @__PURE__ */ jsx(NumField, {
+							ariaLabel,
+							describedBy,
+							invalid,
 							value: Number(rec[col.key]) || 0,
 							onChange: (v) => set(i, col.key, v)
 						})]
@@ -754,9 +794,12 @@ function RowsEditor({ rows, onChange, columns, newRow, addLabel = "row" }) {
 					if (col.type === "pos") return /* @__PURE__ */ jsxs("span", {
 						className: "block-row-field",
 						children: [head(col), /* @__PURE__ */ jsx(SelectField, {
+							describedBy,
+							invalid,
 							value: rec[col.key] ?? "other",
 							onChange: (v) => set(i, col.key, v),
-							options: POS_OPTS
+							options: POS_OPTS,
+							ariaLabel
 						})]
 					}, col.key);
 					if (col.type === "select") {
@@ -764,10 +807,12 @@ function RowsEditor({ rows, onChange, columns, newRow, addLabel = "row" }) {
 						return /* @__PURE__ */ jsxs("span", {
 							className: "block-row-field",
 							children: [head(col), /* @__PURE__ */ jsx(SelectField, {
+								describedBy,
+								invalid,
 								value: rec[col.key] ?? (typeof first === "string" ? first : first?.value) ?? "",
 								onChange: (v) => set(i, col.key, v),
 								options: col.options ?? [],
-								ariaLabel: col.label
+								ariaLabel
 							})]
 						}, col.key);
 					}
@@ -775,6 +820,9 @@ function RowsEditor({ rows, onChange, columns, newRow, addLabel = "row" }) {
 						className: "block-row-field",
 						"data-grow": col.grow || undefined,
 						children: [head(col), /* @__PURE__ */ jsx(TagsField, {
+							ariaLabel,
+							describedBy,
+							invalid,
 							value: rec[col.key] ?? [],
 							onChange: (v) => set(i, col.key, v),
 							placeholder: col.label
@@ -783,6 +831,9 @@ function RowsEditor({ rows, onChange, columns, newRow, addLabel = "row" }) {
 					if (col.type === "bool") return /* @__PURE__ */ jsxs("label", {
 						className: "block-row-bool",
 						children: [/* @__PURE__ */ jsx(Checkbox, {
+							"aria-label": ariaLabel,
+							"aria-describedby": describedBy,
+							"aria-invalid": invalid || undefined,
 							checked: !!rec[col.key],
 							onCheckedChange: (value) => set(i, col.key, value === true)
 						}), col.label]
@@ -817,10 +868,12 @@ function RowsEditor({ rows, onChange, columns, newRow, addLabel = "row" }) {
 						"data-grow": col.grow || undefined,
 						"data-wide": col.wide || undefined,
 						children: [head(col), /* @__PURE__ */ jsx(TextField, {
+							describedBy,
+							invalid,
 							value: rec[col.key] ?? "",
 							onChange: (v) => set(i, col.key, v),
 							placeholder: col.label,
-							ariaLabel: col.label,
+							ariaLabel,
 							className: "block-row-input"
 						})]
 					}, col.key);