@farm.js/react 0.1.0-beta.2 → 0.1.0-beta.21

package/README.md

@@ -23,7 +23,31 @@ export default defineConfig({
 ```
 
 `compiler: true` uses inference: every application TSX/JSX component is considered, eligible
-components are compiled, and everything else keeps the normal React path.
+components are compiled with hybrid reactivity, and everything else keeps the normal React path.
+
+Hybrid reactivity starts from the compiler's proven state-to-binding dependency lists, then marks
+only multi-state short-circuit bindings for runtime read tracking. For
+`enabled ? activeValue : inactiveValue`, an update to the inactive value does not schedule the
+binding. The runtime uses direct subscription indexes rather than proxies or a component-wide
+scan. Use `compiler: { reactivity: "static" }` to retain only the complete build-time dependency
+lists for comparison or diagnosis.
+
+Compiler output also selects its runtime capabilities at build time. A direct counter imports only
+the cell scheduler and direct-binding core; conditionals, keyed rows and LIS, nested host ranges,
+and component islands are retained only when a compiled component in that module needs them. Plain
+keyed rows omit the larger recursive-host and row-conditional extensions. This selection is
+automatic and does not add a configuration option or asynchronous runtime loading. The legacy
+`createCompiledComponent` export remains a complete compatibility entry for hand-authored
+definitions, while generated code uses the tree-shakable feature entry.
+
+Plain keyed lists with filter hints and only identity-based selection also use the single-kind
+target runtime. Filtering keeps its existing native-method checks and fallback; mixed Set/Map
+targets, conditional rows, and nested host blocks keep their existing runtime capabilities.
+
+The persisted production-size fixtures and regression gate live in
+[`RUNTIME_SIZE_RESULTS.md`](./RUNTIME_SIZE_RESULTS.md). The recorded compiler-selected core runtime
+premium is 85.4% smaller than the complete compatibility runtime premium; the feature-heavy keyed
+benchmark application removes 6,185 gzip bytes from its previous compiler-on build.
 
 For selective adoption, use annotation mode:
 
@@ -34,6 +58,7 @@ renderer: react({
       mode: "annotation",
       directive: "use compiler",
       onUnsupported: "warn",
+      reactivity: "hybrid",
     },
   },
 }),
@@ -56,29 +81,37 @@ The current compiler handles components that it can prove have:
 - one host-element root and a statically known host-element tree around supported conditional,
   keyed-list, and React component-island boundaries;
 - an identifier props parameter or flat object destructuring with aliases and defaults;
+- build-time dependency cells for referenced flat primitive props, with runtime identity guards;
 - top-level `useState` declarations;
 - optional compiler-safe derived `const` values declared after state and in source order;
 - whitelisted `Boolean`, `Number`, `String`, and deterministic `Math` calculations;
 - optional synchronous `const` or function-declaration handlers used by JSX events;
 - state-driven text, attributes, per-property inline styles, and controlled form properties;
 - host-rooted `condition && <element>` and `condition ? <element> : <element>` child blocks at
-  statically known locations, including supported nested boundaries;
+  statically known locations, including direct ranges among static siblings and at the component
+  root;
 - item-keyed `collection.map(...)` children and explicit `List` boundaries at statically known
   container locations, including supported non-mutating collection pipelines;
 - inline synchronous events inside otherwise eligible host-only keyed rows;
-- row-local logical and ternary host branches inside stable keyed-row containers;
+- multiple and recursively nested logical or ternary host branches inside non-interactive keyed
+  rows, including branches beside static host siblings;
 - stable module-level child components with compiler-safe props;
 - React-managed event handlers; and
 - no refs, effects, or unsupported dynamic child structures.
 
-The generated component preserves React ownership of initial placement, props, events, SSR, and
-hydration. Local state cells batch updates into a microtask and patch only compiler-known DOM
-targets. Proven, dedicated host containers can transfer child ownership after mount for host-only
-conditional branches and non-interactive host-only keyed rows. An interactive row or a row with
-local conditional slots uses a hybrid boundary instead: React retains its events, conditional
-Fibers, and structural reconciliation, while Farm patches same-key bindings and refreshes only
-changed row-local branches. React still creates or hydrates all initial DOM. Anything outside those
-narrow contracts uses a small React-owned boundary or the complete original component.
+The generated component preserves React ownership of initial placement, parent update commits,
+identity-bearing props, events, SSR, and hydration. Local state cells batch updates into a
+microtask; eligible flat destructured primitive props join the same dependency index after React
+commits their parent update. The runtime skips unchanged binding output and patches only
+compiler-known DOM targets. Objects, arrays, functions, symbols, React elements, `children`, and
+identifier props retain the normal React prop-render path. Proven host containers
+can transfer child ownership after mount for host-only conditional
+branches and ranges, plus non-interactive host-only keyed rows and their recursively nested host
+conditions. An interactive row uses a hybrid boundary instead: React retains its events,
+conditional Fibers, and structural reconciliation, while Farm patches same-key bindings and
+refreshes only changed React-owned row-local branches. React still creates or hydrates all initial
+DOM. Anything outside those narrow contracts uses a small React-owned boundary or the complete
+original component.
 
 For a common dedicated conditional, no new component or annotation is required:
 
@@ -96,6 +129,26 @@ or hydration, a same-branch update patches those bindings without replacing the
 change creates, removes, or replaces only the selected branch. No marker node is added to SSR output.
 More complex conditional shapes keep the existing React-owned conditional boundary.
 
+Eligible direct conditionals can also share a host container with static host siblings:
+
+```tsx
+<article data-update={updates}>
+  <header>Status</header>
+  {loading && <p>Loading {updates}</p>}
+  <section>Stable content</section>
+  {enabled ? <strong>Enabled</strong> : <span>Disabled</span>}
+  <footer>Actions</footer>
+</article>
+```
+
+That `article` may be the component's exact returned root. Farm adopts the original container and
+counts its direct static elements as anchors for the conditional ranges. Same-branch bindings patch
+in place; branch changes insert, remove, or replace only their range. Multiple changed ranges use
+one state snapshot and reconcile from right to left, including when adjacent ranges are empty. The
+root and every unchanged static sibling keep their DOM identity, and no wrapper or marker is added.
+Branch events, components, fragments, refs, SVG, spreads, nested dynamic blocks, or another
+unsupported direct child keep the container on the React-owned path.
+
 For a common keyed map, no new API is required:
 
 ```tsx
@@ -113,6 +166,677 @@ Later list updates patch surviving rows by key, create or remove only the change
 longest increasing subsequence (LIS) to minimize DOM moves during a reorder. The outer user
 component and the list callback do not rerun for those compiler-cell updates.
 
+When a separate state cell or primitive prop is compared with the exact row-key expression using
+`===` or `!==`, the compiler emits a key-directed binding proof. A selection change such as
+`item.id === selectedId` then looks up only the previously selected and newly selected row
+instances. Class, attribute, style, and leaf-text bindings on those rows update without evaluating
+the other keyed instances. The proof requires one reactive target used only in strict comparisons;
+mixed structural dependencies, ambiguous expressions, non-primitive runtime targets, React-owned
+rows, and unsupported shapes keep the complete scan or React fallback. No option is required, and
+the compiler report exposes the emitted binding count as `keyedIdentityTargets`.
+
+For multi-selection, an exact local-state expression such as `markedIds.has(item.id)` receives a
+separate Set-membership proof. The runtime compares the previous and next native `Set` snapshots and
+patches only row keys in their symmetric difference. It accepts ordinary native sets containing
+primitive keys. Different fields, extra reactive dependencies, Set subclasses or proxies, object
+members, customized `has` behavior, React-owned rows, nested blocks, and structural dependencies
+stay on the existing complete or React-owned paths. The compiler report exposes this count as
+`keyedMembershipTargets`.
+
+For per-row data, an exact local-state expression such as `statusById.get(item.id)` receives a
+separate Map-lookup proof. The runtime compares the previous and next native `Map` snapshots and
+patches only row keys whose mapped primitive value changed. It accepts ordinary native maps with
+primitive keys and primitive or nullish values. Different fields, extra dependencies, Map
+subclasses or proxies, object values, customized `get` behavior, React-owned rows, nested blocks,
+and structural dependencies keep the existing complete or React-owned paths. The compiler report
+exposes this count as `keyedMapLookupTargets`.
+
+When a targeted Set or Map is compiler-owned, Farm can also carry the exact mutated keys from a
+proven immutable functional update:
+
+```tsx
+setMarkedIds((current) => {
+  const next = new Set(current);
+  if (next.has(id)) next.delete(id);
+  else next.add(id);
+  return next;
+});
+
+setStatusById((current) => new Map(current).set(id, "ready"));
+```
+
+The application still creates its normal immutable collection. The generated update records only
+the native `add`, `delete`, or `set` calls that execute, and the runtime validates those keys
+against the previous committed collection. It can then update the relevant keyed rows without
+iterating every old and new Set member or Map entry first. Queued functional updates compose, and
+the runtime periodically compacts its persistent snapshot so a long update chain stays bounded.
+
+This proof is deliberately conservative. The state must start from a compiler-owned native
+`Set`/`Map`; every setter use must be a fresh same-kind replacement or a recognized immutable
+updater; and the collection, updater parameter, and cloned draft must not escape or be mutated
+through unknown code. Shadowed constructors, custom collections, object keys, object Map values,
+direct state mutation, aliased drafts, or a failed runtime check use the existing snapshot or
+React-owned path before compiled bindings run. No option or syntax is added. The compiler report
+counts emitted native mutation sites as `keyedCollectionUpdateHints`.
+
+For a direct keyed `useState` collection, the compiler also recognizes conservative same-order
+updates such as:
+
+```tsx
+setItems((current) =>
+  current
+    .map((item) => (item.id === targetId ? { ...item, label: nextLabel } : item))
+    .map((item) => (item.id === targetId ? { ...item, selected: !item.selected } : item)),
+);
+```
+
+Farm executes every generated native `map()` and then compares the committed and final item
+identities once. It validates final length, keys, and positions and patches each final changed row
+once; intermediate arrays never receive DOM work. Every user `map()` remains O(n); this removes the
+keyed runtime's second full key-and-binding scan. Queued hints compose. The source method lookup,
+native result, callback order, and thrown errors are preserved.
+
+The setter may be concise or use a block containing exactly one value-returning `return`. Extra
+updater statements, conditional returns, and missing returns keep complete keyed reconciliation.
+Each stage requires an inline synchronous conditional mapper that returns the original item on at
+least one path and an object-spread replacement on another. The callback may be a concise expression
+or a structured block containing fully returning `if` or `switch` branches and proven local `const`
+aliases. Each alias needs a simple identifier and compiler-safe initializer. A `switch` needs one
+`default`, a complete return from every case, safe discriminant and case expressions, and no trailing
+statements. Consecutive empty labels may share the next fully returning body; partially executed
+fallthrough and dangling labels are rejected. An unsupported mapper anywhere in the chain disables
+the complete setter hint. Custom methods still execute but record no metadata. Key changes, structural
+edits, sparse or subclassed arrays, relevant mixed dependencies, and failed runtime checks use the
+existing complete reconciliation and LIS path. Non-functional setters, derived collections,
+referenced callbacks, mutable or destructured declarations, effectful initializers, other
+intermediate statements, partial or dangling fallthrough, mutating mappers, and other unproven forms
+are simply not hinted. No new option is required. A compiler report counts prepared map calls as
+`keyedMapUpdateHints`. The separate hint runtime capability is imported only when that count is
+nonzero, so direct-only and ordinary keyed builds do not retain it.
+
+The same optional runtime recognizes conservative immutable appends on a direct keyed array:
+
+```tsx
+setItems((current) => [...current, nextItem]);
+setItems((current) => [...current, ...nextItems]);
+setItems((current) => {
+  return [...current, ...nextItems];
+});
+```
+
+Because every existing item keeps its key and index, Farm validates the committed source and the
+queued append chain, reads keys and descriptors only for the appended suffix, and mounts that
+suffix in one fragment. Existing row DOM is left untouched. The setter may be concise or use a
+block containing exactly one direct value-returning `return`. Extra statements, conditional
+returns, and missing returns keep complete keyed reconciliation. Native arrays are required;
+middle insertion, removal, direct replacement, duplicate keys, rows that read the collection
+itself, and failed runtime checks use complete keyed reconciliation. A key that reads the
+collection prevents hint emission entirely. The compiler report exposes the emitted-site count as
+`keyedArrayAppendHints`.
+
+Adjacent removal and append setters can share the same committed-row proof:
+
+```tsx
+setItems((current) => current.filter((item) => item.id !== expiredId));
+setItems((current) => [...current, incoming]);
+
+setItems((current) => current.slice(start, end));
+setItems((current) => [...current, ...incoming]);
+
+setItems((current) => current.slice(start, end));
+setItems((current) => [...current, incoming]);
+setItems((current) =>
+  current.map((item) => (item.id === targetId ? { ...item, label: nextLabel } : item)),
+);
+
+setItems((current) => current.filter((item) => item.id !== expiredId));
+setItems((current) =>
+  current.map((item) => (item.id === targetId ? { ...item, label: nextLabel } : item)),
+);
+setItems((current) => [...current, incoming]);
+```
+
+The setters still execute in order and still create their normal native arrays. Before changing the
+DOM, Farm validates the original committed token, every filter or slice survivor, the complete final
+length, and every incoming key. It prepares all incoming keys, descriptors, bindings, and detached
+host rows first; only then does it remove rejected rows, update survivor indexes, and append the new
+suffix in one fragment. Existing survivors are neither rebound nor recreated, and additional
+adjacent append setters are collapsed into the same final suffix. This keeps the unavoidable native
+filter or slice work while removing the keyed runtime's second full scan.
+
+One or more immediately adjacent safe same-key `map()` setters may run between the filter or slice
+and the append, after the append, or in both positions. A safe map may also precede the structural
+removal. Farm carries the original survivor indices or retained interval through those native maps
+and records each replacement against its committed row. Before touching the DOM it validates the
+complete dense result, every survivor identity, every changed key and binding, and every incoming
+row. It then removes only rejected rows, patches only changed survivors, and creates the suffix from
+its final values. The owner stays mounted, survivor DOM identity is preserved, and the suffix is
+appended once.
+
+Only concise updater results and blocks with one direct value-returning `return` that form one
+direct chain for the same state array are linked. The row and key must be compiler-owned and
+index-independent. A reorder in the structural-append chain, an
+unsupported or non-adjacent map, an unhinted update to that state, another dirty row dependency,
+collection-reading binding, custom, sparse, or subclassed array, nested or React-owned row,
+duplicate final key, or reuse of any committed key in the appended suffix keeps complete React
+reconciliation before a DOM write. A mapped survivor whose key changes also falls back before
+mutation. No API or configuration is added. Compiler reports use the existing
+`keyedArrayFilterHints`, `keyedArraySliceHints`, and `keyedArrayAppendHints` counts, and modules
+without both accepted operations omit the composed runtime.
+
+The mirror-image prepend form is supported when the keyed row and key do not read the row index:
+
+```tsx
+setItems((current) => [nextItem, ...current]);
+setItems((current) => [...nextItems, ...current]);
+setItems((current) => {
+  return [...nextItems, ...current];
+});
+
+setItems((current) => current.filter((item) => item.id !== expiredId));
+setItems((current) => [nextItem, ...current]);
+
+setItems((current) => current.slice(start, end));
+setItems((current) => [...nextItems, ...current]);
+
+setItems((current) => current.filter((item) => item.id !== expiredId));
+setItems((current) => [nextItem, ...current]);
+setItems((current) =>
+  current.map((item) => (item.id === targetId ? { ...item, label: nextLabel } : item)),
+);
+
+setItems((current) => current.slice(start, end));
+setItems((current) =>
+  current.map((item) => (item.id === targetId ? { ...item, label: nextLabel } : item)),
+);
+setItems((current) => [nextItem, ...current]);
+```
+
+Farm validates the committed source and queued prepend chain, creates only the new prefix, inserts
+it before the first existing row, and shifts the stored indexes used by delegated row events.
+When an adjacent filter or bounded slice runs first, the compiler also carries the exact survivor
+positions into the prepend. The runtime removes only rejected rows, preserves every surviving DOM
+node, and creates only the final prefix instead of rescanning and rebinding the whole result.
+Multiple adjacent prepends share the same proof.
+
+The setter may be concise or use a block containing exactly one direct value-returning `return`.
+Extra statements, conditional returns, and missing returns keep complete keyed reconciliation.
+
+One or more immediately adjacent safe same-key `map()` setters may run after the prepend or between
+the removal and prepend. A safe map may also run immediately before the removal. Farm carries every
+survivor back to its committed row, validates the complete dense result and every final key, then
+patches only changed survivors and creates the prefix from its final mapped values. A surviving DOM
+node keeps its identity even when its item object changes.
+
+Index-aware rows, collection-reading bindings or keys, React-owned or nested row structures,
+middle insertion, direct replacement, a reordered structural chain, an unsupported or non-adjacent
+map, duplicate final keys, reuse of any committed key in the new prefix, custom or sparse arrays,
+and failed validation use complete keyed reconciliation before any DOM mutation. A mapped survivor
+whose key changes also falls back before mutation. The compiler report exposes the emitted-site
+count as `keyedArrayPrependHints`; no option or component API is added, and modules without the
+accepted removal, prepend, and map chain omit its mapped runtime.
+
+Native slices with compiler-safe bounds can carry their exact retained interval into the same
+removal runtime:
+
+```tsx
+setItems((current) => current.slice(1_000));
+setItems((current) => current.slice(0, -1_000));
+setItems((current) => current.slice(2, 8));
+setItems((current) => current.slice(trimCount));
+setItems((current) => current.slice(visible.start, visible.end));
+setItems((current) => {
+  return current.slice(visible.start, visible.end);
+});
+```
+
+For compiler-owned host rows whose render and key do not read the row index, Farm validates the
+committed source and queued slice chain, preserves every surviving DOM row, and removes only rows
+outside the retained interval. A slice-only chain does not reread surviving keys, descriptors, or
+bindings. One or two safe-integer literals or compiler-safe runtime expressions are required.
+Identifiers, property reads, side-effect-free arithmetic and conditionals, and safe `Math` calls
+are supported. The setter may be concise or use a block containing exactly one direct
+value-returning `return`. Farm preserves native method lookup, argument evaluation, coercion,
+results, and errors, then records metadata only when the evaluated bounds are already safe integers.
+Calls, assignments, updates, unsafe evaluated bounds, updater blocks with extra statements,
+directives, conditional returns, or no value-returning `return`, chained updates, custom slice
+methods, sparse or subclassed arrays, index-aware or collection-reading rows, React-owned structures,
+and failed validation keep complete keyed reconciliation. No option or component is added. The
+compiler report exposes the emitted-site count as `keyedArraySliceHints`.
+
+A fixed-size feed can combine that retained tail with a new keyed suffix:
+
+```tsx
+setItems((current) => [...current.slice(1), nextItem]);
+setItems((current) => [...current.slice(1_000), ...nextItems]);
+
+const trimCount = pageSize * pagesToExpire;
+setItems((current) => [...current.slice(trimCount), ...nextItems]);
+setItems((current) => {
+  return [...current.slice(trimCount), ...nextItems];
+});
+```
+
+Farm executes the ordinary native slice and array construction, then validates the complete hint
+chain back to the committed source, retained item identities, and final incoming keys. Multiple
+rolling setters queued before one compiler flush collapse into one cumulative prefix removal; rows
+introduced by an earlier setter are created only if they remain in the final suffix. Farm removes
+only the expired committed prefix, leaves the retained DOM rows in place, and creates only that
+final incoming suffix. The setter may be concise or use a block containing exactly one direct
+value-returning `return`. This form supports one safe-integer literal or compiler-safe runtime slice
+bound and compiler-owned, index-independent host rows. Identifiers, property reads,
+side-effect-free arithmetic and conditionals, and safe `Math` calls are supported while preserving
+native lookup, evaluation, results, and errors.
+
+Immediately adjacent safe same-key maps may run before, after, or between one or more rolling
+setters in the same synchronous setter segment:
+
+```tsx
+setItems((current) =>
+  current.map((item) => (item.id === editedId ? { ...item, label: nextLabel } : item)),
+);
+setItems((current) => [...current.slice(trimCount), ...nextItems]);
+setItems((current) =>
+  current.map((item) => (item.id === selectedId ? { ...item, selected: true } : item)),
+);
+setItems((current) => [...current.slice(secondTrimCount), ...laterItems]);
+setItems((current) =>
+  current.map((item) => (item.id === editedId ? { ...item, status: "ready" } : item)),
+);
+```
+
+Each map may use a compiler-safe nested conditional to update several retained rows.
+The compiler carries mapped survivor identity through the retained tail, creates incoming rows
+from their final mapped values, and patches only changed committed survivors. A single rolling
+setter uses the optional structural append/map runtime. Multiple rolling setters keep their
+cumulative retained-window metadata and mapped provenance through an optional runtime dedicated to
+mapped rolling chains. No new public helper, option, or always-loaded browser code is added.
+
+Effectful expressions, reused keys, updater blocks with extra statements, directives, conditional
+returns, or no value-returning `return`, custom slice behavior, collection-reading or index-aware
+rows, nested or React-owned rows, mixed or unhinted queued chains, a statement or unsupported setter
+inside the segment, changed mapped keys, unsafe or no-op evaluated bounds, and failed checks use
+complete keyed reconciliation. Unmapped rolling modules retain the smaller optional all-hint
+runtime. Reports expose each emitted rolling site as `keyedArrayRollingWindowHints`, each rolling
+step retained across a multi-window mapped chain as `keyedArrayMappedRollingWindowChainHints`, and
+each safe map as `keyedMapUpdateHints`.
+
+Native known-position updates can avoid a complete keyed scan too:
+
+```tsx
+setItems((current) => current.toSpliced(selectedIndex, 0, nextItem));
+setItems((current) => current.toSpliced(selectedIndex, 0, nextA, nextB));
+setItems((current) => current.toSpliced(selectedIndex, 0, ...incomingItems));
+setItems((current) => current.toSpliced(selectedIndex, 1));
+setItems((current) => current.toSpliced(selectedIndex, 25));
+setItems((current) => current.toSpliced(selectedIndex, 1, replacement));
+setItems((current) => current.toSpliced(selectedIndex, 25, ...replacements));
+setItems((current) => current.with(selectedIndex, replacement));
+setItems((current) => {
+  return current.toSpliced(selectedIndex, 0, nextItem);
+});
+setItems((current) => {
+  return current.with(selectedIndex, replacement);
+});
+
+// Two same-key windows may be queued before one compiler flush.
+setItems((current) => current.toSpliced(firstIndex, 25, ...firstRefresh));
+setItems((current) => current.toSpliced(secondIndex, 25, ...secondRefresh));
+```
+
+The compiler recognizes a concise functional setter or a setter block containing exactly one direct
+`return`. Its position must be either a safe-integer literal or a compiler-safe runtime expression,
+such as an identifier, property read, arithmetic, conditional, or safe `Math` call. The update must insert
+one or more compiler-safe items with zero removals, remove one item or a fixed positive safe-integer
+literal range, replace one item through either `toSpliced()` or `with()`, or replace a fixed positive
+safe-integer literal window with compiler-safe explicit items or a safe spread. Farm preserves method lookup,
+evaluates the position and remaining arguments once in their original order, executes the ordinary
+native call, and records metadata only after validating the committed native source, result, and
+actual safe-integer position and clamped removal count. A batch requires at least two evaluated
+items at runtime. Exact-window replacement supports a safe spread that evaluates to zero, one, or
+many items. A fresh-key window creates every incoming key, descriptor, binding snapshot, and
+detached row before changing the live DOM, rejects key collisions, and mounts the complete batch
+through one document fragment. It then removes only the replaced window. When the incoming window
+has the same length and the same keys in the same order, Farm prepares every binding read and
+changed DOM target across the complete window first, patches the existing rows in place, and
+updates the stored row objects used by later events. That path creates no descriptors or DOM rows,
+and preserves row identity, focus, and selection. Validated same-key row and window refreshes also
+keep the existing row map and element lookup, and skip redundant cache cleanup instead of
+rebuilding whole-list bookkeeping. Source and key validation still run, and each flush commits the
+new collection token for subsequent updates. Structural changes retain index rebuilding and cache
+cleanup. A window may instead grow or shrink while it
+reorders keys from inside its own removed interval and mixes them with globally fresh keys. Farm
+prepares all reused binding updates, new descriptors, binding snapshots, and detached rows before
+the first DOM write. It removes only retired rows, preserves each reused row, batches adjacent new
+rows in a fragment, updates shifted suffix indexes, and applies LIS only to the reused part of that
+interval so it moves the fewest connected rows needed by the local permutation. Rows outside the
+interval are not rerendered or rebound.
+Multiple length-preserving same-key windows
+queued before one compiler flush compose into one atomic refresh. Fixed-length queued windows may
+mix same-key refreshes with globally new final keys, and both disjoint and overlapping windows are
+supported. An overlapping position uses the last queued value; intermediate identities are never
+mounted. Farm validates the complete chain and final key set, then prepares every touched key,
+binding value, DOM target, new descriptor, binding snapshot, and disconnected DOM row before the
+first write. It patches same-key positions and swaps only final fresh-key positions. Untouched rows
+keep their identity and are not recreated. The runtime otherwise creates one inserted row,
+removes only the known row or range, or patches/replaces one row at that position without rereading
+every existing key, descriptor, and binding. Surviving rows keep their DOM identity. Index-aware or
+collection-reading rows, custom methods, position expressions with user calls or mutations,
+runtime positions that are not safe integers, dynamic, zero, negative, or fractional removal
+counts, other `toSpliced()` forms, updater blocks with extra statements, directives, conditional
+returns, or no value-returning `return`, unsafe incoming expressions, queued chains containing a
+structural window or unhinted intermediate update, existing keys moved from outside the removed
+interval, duplicate final keys, nested or React-owned rows, and failed checks use complete keyed
+reconciliation before the fast path mutates the DOM.
+Reports expose the site count as `keyedArrayPositionHints`. Batch insertion and exact-window
+replacement use progressively separate optional runtime capabilities, so existing single-position
+and batch-only bundles do not retain window validation or replacement code.
+
+A direct native reverse can carry its complete permutation to a separate optional runtime:
+
+```tsx
+setItems((current) => current.toReversed());
+setItems((current) => {
+  return current.toReversed();
+});
+```
+
+Farm recognizes the concise form and a block containing exactly one direct `return`. It preserves
+the method lookup, call result, and errors, then records metadata only for the native method on an
+ordinary array whose chain starts at the committed collection. One direct reverse
+verifies equal lengths and every reversed item identity before moving the existing keyed elements
+with the minimum `n - 1` connected DOM moves. It does not reread row keys, descriptors, or bindings
+and does not run the generic LIS calculation. Consecutive concise native `toReversed()` and
+`toSorted()` setters queued before one flush compose into one final validated permutation. The
+runtime skips intermediate DOM states. When the proven chain contains only reversals, Farm tracks
+their parity relative to the committed rows: an even count validates exact identity and performs
+no DOM moves, source-item map construction, or LIS; an odd count validates exact reverse and uses
+the same minimum `n - 1` moves as one reverse. A chain containing a sort keeps the general final
+permutation and uses LIS once. A concise updater or a block containing exactly one direct
+value-returning `return` may also chain two or more native reorder operations:
+
+```tsx
+setItems((current) => current.toSorted((left, right) => left.rank - right.rank).toReversed());
+setItems((current) => {
+  return current.toSorted((left, right) => left.rank - right.rank).toReversed();
+});
+```
+
+Farm evaluates every lookup and call in JavaScript order, carries the same committed token through
+the pipeline, and reconciles only its final result. Index-aware or collection-reading rows,
+arguments to `toReversed()`, referenced comparators, computed methods, updater blocks with extra
+statements, directives, conditional returns, or no returned value, custom methods, sparse or
+subclassed behavior, structural calls after reordering, an unhinted intermediate update, nested or
+React-owned rows, and failed checks keep complete keyed reconciliation.
+
+A compiler-safe `filter()` or bounded `slice()` prefix may precede the native reorder suffix in a
+concise updater or exact one-return block. A filter predicate may be concise or contain exactly one
+direct value-returning `return`:
+
+```tsx
+setItems((current) =>
+  current
+    .filter((item) => {
+      return item.visible;
+    })
+    .toSorted((left, right) => left.rank - right.rank)
+    .toReversed(),
+);
+```
+
+Farm validates the complete survivor set and final order before the first DOM write, removes only
+rejected rows, and applies LIS once to the survivors. Concise or exact one-return filter/slice and
+reorder setters also compose when queued in that order before one flush. Unsupported calls or a
+structural call after a reorder fall back. Reports count each compiled step in the existing filter,
+slice, sort, or reverse counter, and modules without those operations omit their optional runtimes.
+Farm does not polyfill `Array.prototype.toReversed`.
+
+A compiler-safe same-key map may also appear before or after native reorder steps:
+
+```tsx
+setItems((current) =>
+  current
+    .map((item) => (item.id === editedId ? { ...item, label: nextLabel } : item))
+    .map((item) => (item.id === editedId ? { ...item, rank: nextRank } : item))
+    .toSorted((left, right) => left.rank - right.rank),
+);
+```
+
+One callback may select several rows through nested expressions, structured early returns, or a
+fully returning `switch`:
+
+```tsx
+setItems((current) =>
+  current.map((item) => {
+    const matchesReviewed = item.id === reviewedId;
+    if (matchesReviewed) return { ...item, status: "reviewed" };
+    const matchesEscalated = item.id === escalatedId;
+    if (matchesEscalated) {
+      return { ...item, status: "escalated", priority: 1 };
+    }
+    return item;
+  }),
+);
+```
+
+Every condition must be compiler-safe, and every leaf must return the original item or a safe
+object spread of it, with at least one unchanged and one replacement path. Concise expressions and
+blocks made from fully returning `if` or `switch` branches plus local `const` aliases are accepted.
+Each alias must have a simple identifier and compiler-safe initializer. A switch requires one
+`default` and complete returning cases. Consecutive empty labels may share the next body, while
+partial or dangling fallthrough is rejected. Mutable or destructured declarations, effectful
+initializers, other intermediate statements, and ambiguous leaves use complete keyed
+reconciliation. A runtime key change also falls back before any DOM write.
+
+The functional setter may be concise or a block containing exactly one direct value-returning
+`return`. Farm executes every native map and reorder call normally. For consecutive accepted maps,
+it checks each native call but compares only the input and final result of that map segment, avoiding
+a full lineage scan for every intermediate array. It verifies the committed token, dense-array
+shape, a one-to-one source-item match, and every final replacement key before touching the DOM, then runs one
+LIS and patches each changed row once. Unchanged rows need no second key or binding read. Queued
+supported map-and-reorder setters compose against the same committed rows. Every accepted map
+requires an inline synchronous conditional mapper whose leaves return either the original item or
+an object-spread replacement, plus index-independent compiler-owned host rows. Concise expressions
+and structured blocks with proven local `const` aliases plus fully returning `if` or `switch`
+branches are supported.
+Changed keys, referenced callbacks, mutable, destructured, or effectful declarations, other
+intermediate statements or partial/dangling fallthrough, unconditional replacements, `thisArg`,
+structural calls in the same chain, computed or custom methods, sparse or subclassed arrays,
+collection-reading bindings, nested or React-owned rows, and failed checks use complete keyed
+reconciliation. Reports use the existing map, sort, and reorder hint counters, and unrelated modules
+do not retain this optional runtime.
+
+The maps may also finish the concise pipeline:
+
+```tsx
+setItems((current) =>
+  current
+    .toReversed()
+    .map((item) => (item.id === editedId ? { ...item, label: nextLabel } : item))
+    .map((item) => (item.id === editedId ? { ...item, rank: nextRank } : item)),
+);
+```
+
+Farm retains the preceding reorder instead of treating the mapped result as an unhinted snapshot.
+An exact reverse uses the minimum-move reverse path without a general source-item lookup or LIS. A
+sort remains an ambiguous permutation, so Farm performs one validated source lookup and LIS pass.
+Safe maps on both sides of a reorder flatten their replacements back to the same committed rows.
+
+Safe maps may also run before, between, or after index-independent `filter` or `slice` steps in one
+concise functional setter or one block with a single direct `return`. A final native reorder is optional:
+
+```tsx
+setItems((current) =>
+  current
+    .filter((item) => item.visible)
+    .map((item) => (item.id === editedId ? { ...item, label: nextLabel } : item))
+    .slice(0, limit)
+    .toSorted((left, right) => left.rank - right.rank),
+);
+
+setItems((current) =>
+  current
+    .map((item) => (item.id === editedId ? { ...item, label: nextLabel } : item))
+    .filter((item) => item.visible)
+    .slice(0, limit),
+);
+```
+
+The structural helpers retain both the committed survivor indices and mapped-item sources across
+each accepted step. The final commit removes rejected rows, performs LIS moves only when a reorder
+needs them, and patches bindings only for changed survivors. Every native callback and method still
+runs in JavaScript order.
+
+The structural and map steps may also be split across immediately adjacent setter calls in either
+order:
+
+```tsx
+// Map, then structural work.
+setItems((current) =>
+  current.map((item) => (item.id === editedId ? { ...item, label: nextLabel } : item)),
+);
+setItems((current) => current.filter((item) => item.visible));
+setItems((current) => current.slice(0, limit));
+
+// Structural work, then maps.
+setItems((current) => current.filter((item) => item.visible));
+setItems((current) => current.slice(0, limit));
+setItems((current) =>
+  current.map((item) => (item.id === editedId ? { ...item, label: nextLabel } : item)),
+);
+setItems((current) =>
+  current.map((item) => (item.id === editedId ? { ...item, rank: nextRank } : item)),
+);
+```
+
+Farm links only consecutive calls to the same setter. A leading map retains its first committed
+source through later structural work; a terminal map consumes the saved survivor lineage from the
+preceding filter or slice. Multiple safe steps in either segment may share the proof, and mixed
+map/structural/map sequences compose. Every result and key is validated before the queued commit
+touches the DOM. An intervening statement, another setter, an unsafe callback, a changed key, or
+failed runtime validation keeps complete keyed reconciliation.
+
+The survivor proof may continue through adjacent native reorder setters:
+
+```tsx
+setItems((current) => current.filter((item) => item.visible));
+setItems((current) =>
+  current.map((item) => (item.id === editedId ? { ...item, rank: nextRank } : item)),
+);
+setItems((current) => current.toSorted((left, right) => left.rank - right.rank));
+setItems((current) => current.toReversed());
+```
+
+Farm retains the committed survivor positions and same-key replacements until the final queued
+value. The commit removes rejected rows, patches changed survivors, and applies the final order in
+one validated DOM transaction. Exact reverses use the minimum-move reverse path; an arbitrary sort
+uses one source lookup and LIS. Non-adjacent calls, another setter, unsupported syntax, or a failed
+shape/key check keep complete reconciliation.
+
+The reorder and safe maps may also be adjacent setter calls in the same synchronous block:
+
+```tsx
+setItems((current) => current.toReversed());
+setItems((current) =>
+  current.map((item) => (item.id === editedId ? { ...item, label: nextLabel } : item)),
+);
+setItems((current) =>
+  current.map((item) => (item.id === editedId ? { ...item, rank: nextRank } : item)),
+);
+```
+
+The compiler links only consecutive calls to the same setter. It keeps the reorder token through
+each accepted native map, then validates row keys before applying the same exact-reverse or
+sort-permutation path at commit. Adjacent compiler-safe filter or slice work switches to the
+structural proof above. An intervening statement, another setter, an unsupported map, or a changed
+key keeps the ordinary complete fallback. Standalone map-only components do not retain the
+map-and-reorder runtime.
+
+The mirror order is supported as well: two or more adjacent concise same-key map setters may be
+followed by a concise native reverse or sort setter. Farm records their replacement lineage from
+the committed collection and carries it into the final reorder. Only adjacent calls to the same
+setter are linked; intervening work and unsupported updates retain complete reconciliation.
+
+Mapped lineage also continues through multiple adjacent native reorder setters. For example,
+`map -> reverse -> sort -> reverse` keeps the same committed-row proof until the final value, then
+performs one validated keyed reconciliation. A concise `map().toReversed()` pipeline may start the
+same chain. Adjacent compiler-safe filter or slice work changes it into a structural chain while
+retaining the committed source. Every updater and native method still executes in order; another
+setter, intervening work, or an unsupported method ends the chain and preserves the complete
+fallback.
+
+A reverse before the safe map pipeline may be queued in a separate setter:
+
+```tsx
+setItems((current) => current.toReversed());
+setItems((current) =>
+  current.map((item) => (item.id === editedId ? { ...item, label: nextLabel } : item)).toReversed(),
+);
+```
+
+A direct `toReversed()` suffix is more specific than an arbitrary permutation. When all preceding
+maps retain committed row order, Farm validates the mirrored source-to-result relation and every
+changed binding before touching the DOM, then performs the minimum-move reverse without building a
+second item lookup map or running LIS. Additional exact reversals toggle that proof between reverse
+and identity. Therefore two reversals after safe maps patch changed rows in committed order without
+moving DOM nodes or creating the generic source map; three use the exact reverse path. Exact reverse
+metadata also composes across queued setters: a queued reverse followed by safe maps and another
+reverse retains exact identity, so only changed row bindings are patched. A preceding sort or any
+ambiguous order keeps the general permutation path.
+
+A direct native immutable sort can use the same optional reorder runtime:
+
+```tsx
+setItems((current) => current.toSorted((left, right) => left.rank - right.rank));
+setLabels((current) => current.toSorted());
+setItems((current) => {
+  return current.toSorted((left, right) => left.rank - right.rank);
+});
+```
+
+Farm recognizes a concise functional setter or a block containing exactly one direct `return`,
+with no comparator or an inline synchronous comparator from the compiler-safe expression subset.
+It preserves the original method lookup, comparator, stable native result, and errors. After the
+native sort runs, the runtime validates an ordinary dense array whose reorder chain starts at the
+committed collection, equal lengths, and a unique one-to-one item-identity permutation. It then
+uses LIS to move only `n - LIS` keyed DOM nodes without rereading row keys, descriptors, or
+bindings. Multiple concise native sorts and reverses queued in one flush, or chained in one concise
+updater, share the original committed token and reconcile only their final permutation. The native
+sorting work itself is unchanged.
+
+Index-aware or collection-reading rows, referenced comparators, updater blocks with extra
+statements, directives, conditional returns, or no returned value, computed or unsupported chained
+calls, custom methods, sparse or subclassed arrays, duplicate item identities, unhinted intermediate
+updates, structural calls after reordering, nested or React-owned rows, and failed checks keep
+complete keyed reconciliation. A compiler-safe filter/slice prefix is supported. Reports count each
+compiled sort step as a `keyedArraySortHints` entry; sort shares the optional reorder runtime, and
+Farm does not polyfill `Array.prototype.toSorted`.
+
+Concise or single-return block-bodied immutable filters on a direct keyed array can carry removal
+positions into the same optional runtime:
+
+```tsx
+setItems((current) => current.filter((item) => item.id !== removedId));
+setItems((current) => {
+  return current.filter((item) => item.id !== removedId);
+});
+setItems((current) =>
+  current.filter((item) => {
+    return item.id !== removedId;
+  }),
+);
+```
+
+For compiler-owned host rows whose render and key do not observe the row index, Farm validates the
+native filter chain, every surviving item identity, and every surviving key before removing only
+the rejected DOM rows. It does not recreate descriptors or reread bindings for unchanged rows,
+and queued filters compose before one compiler flush. Index-aware rows or predicates, updater blocks
+with extra statements, directives, conditional returns, or no value-returning `return`, predicate
+blocks with those unsupported shapes, custom filter methods, sparse or subclassed arrays,
+collection-reading bindings or keys, React-owned row structures, mixed dirty dependencies, and
+failed validation use complete keyed reconciliation. No option or new component is required. The
+compiler report exposes the emitted-site count as `keyedArrayFilterHints`.
+
 An otherwise eligible host row may also contain an inline synchronous React event:
 
 ```tsx
@@ -134,7 +858,7 @@ insert, removal, or reorder asks React to reconcile the rows, adopts the committ
 reapplies current bindings, and then resumes direct same-key patches. This avoids creating eventful
 DOM outside React's Fiber tree.
 
-A keyed row may also contain dedicated conditional slots:
+A non-interactive keyed row may also transfer its safe host conditions to the same keyed instance:
 
 ```tsx
 <ul>
@@ -142,7 +866,16 @@ A keyed row may also contain dedicated conditional slots:
     <li key={item.id}>
       <span>{item.label}</span>
       <div className="status-slot">
-        {item.done ? <strong>{item.label} complete</strong> : <span>In progress</span>}
+        <i>State</i>
+        {item.done ? (
+          <article>
+            <strong>{item.label} complete</strong>
+            <div>{item.details && <small>{item.description}</small>}</div>
+          </article>
+        ) : (
+          <span>In progress</span>
+        )}
+        <b>Prepared</b>
       </div>
       <section className="details-slot">{item.expanded && <p>{item.description}</p>}</section>
     </li>
@@ -150,13 +883,59 @@ A keyed row may also contain dedicated conditional slots:
 </ul>
 ```
 
-Each conditional must be the only meaningful child of its persistent lowercase host container.
-The compiler records its test and branch bindings per row key. A same-key collection update compares
-those prepared snapshots and asks React to render only the conditional boundaries whose selected
-branch or branch values changed. Other conditional rows and the outer map stay untouched. Inserts,
-removals, and reorders remain React structural commits for these rows, after which Farm re-adopts
-the host skeleton and resumes row-local updates. This keeps empty branches, SSR, hydration,
-recoverable hydration errors, error boundaries, and Fast Refresh inside React's ownership.
+The compiler prepares the row descriptor, static sibling positions, branch factories, and
+text/attribute/style bindings at build time. React creates or hydrates the initial list. After
+mount, a same-key update patches the active branch in place or mounts, replaces, or removes only the
+changed branch. Multiple and deeper host-only conditions share that row scope. Insertions and
+removals create or clean one row scope, while reorders use the normal LIS pass. The component body
+and map callback do not rerun, and no wrapper or hydration marker is added.
+
+This compiler-owned tier requires a lowercase non-interactive host row. Hooks, custom components,
+branch events, refs, SVG, fragments, spreads, dangerous HTML, controlled inputs inside a condition,
+and unproven expressions stay on React. An otherwise eligible row with inline events continues to
+use the hybrid boundary: React owns its conditional Fibers and structural commits, while Farm
+compares per-key snapshots and refreshes only changed slots. Duplicate runtime keys or invalid
+adopted DOM switch the complete list to React.
+
+An eligible outer keyed row may also own nested keyed ranges:
+
+```tsx
+<div>
+  {projects.map((project) => (
+    <section key={project.id}>
+      <h2>{project.name}</h2>
+      <ul>
+        <li>Tasks</li>
+        {project.tasks.map((task) => (
+          <li key={task.id}>{task.title}</li>
+        ))}
+        <li>End</li>
+      </ul>
+    </section>
+  ))}
+</div>
+```
+
+Every outer key receives an isolated inner key table and LIS pass. Moving a project preserves its
+task scope; reordering one task list touches only that project. Surviving project, task, and static
+sibling elements keep their DOM identity, and removing an outer row cleans its inner scope. The
+initial contract accepts non-interactive lowercase inner rows from `.map(...)` or inline `List`,
+including multiple ranges separated by static host siblings. Inner events or forms, Hooks, custom
+components, fragments, refs, SVG, spreads, dangerous HTML, and index keys keep the complete outer
+row on React's fallback. Additional keyed levels that satisfy the same host-only contract are
+analyzed recursively instead of using a fixed nesting limit.
+
+When every inner key stays in the same order, the nested scope reuses its row table and skips
+position-map construction and LIS planning. It still validates all keys and updates every child
+scope and binding. Insertions, removals, and reorders keep the existing structural reconciliation;
+duplicate keys or an invalid child scope keep the existing React fallback. This also applies to
+keyed ranges next to host-only conditions inside a nested mixed range.
+
+For example, `boards → columns → cards → tags` becomes a tree of keyed scopes. Each stable parent
+key owns its child key table and LIS pass. Moving a board carries its column, card, and tag scopes;
+reordering cards reconciles only the selected column. Block IDs stay globally unique while runtime
+instances are isolated by their complete parent-key path. Removing any parent cleans every
+descendant subscription before its DOM leaves the document.
 
 A keyed collection may use derived locals or an inline chain of `filter`, `slice`, `toSorted`, and
 `toReversed`:
@@ -190,10 +969,9 @@ the TypeScript `lib` with ES2023 and target a runtime that supports them when us
 
 React remains the fallback and compatibility boundary. An interactive map beside static children,
 a non-host sibling between ranges, a row with a non-inline or async handler, a file input or dynamic
-form control shape, a fragment, a ref, a custom component, or a conditional mixed directly beside
-other children in the same host slot uses the existing React-owned keyed boundary. The outer
-compiled component can still be skipped, but React reconciles that list's rows and owns their
-events, lifecycle, and state.
+form control shape, a fragment, a ref, a custom component, or any unsupported nested dynamic
+structure uses the existing React-owned keyed boundary. The outer compiled component can still be
+skipped, but React reconciles that list's rows and owns their events, lifecycle, and state.
 
 Non-interactive host maps can share a nested or component-root container with static host siblings:
 
@@ -290,23 +1068,41 @@ Generated callback refs give directly patched host elements stable private targe
 React-owned component may therefore return `null`, a fragment, or multiple host nodes without
 shifting an unrelated compiler binding. These refs do not add attributes to SSR output.
 
-Conditional blocks have two safe ownership levels. A dedicated container with exactly one proven
-host-only conditional child can use compiler-owned branch instances. Events, keys, custom
-components, fragments, refs, SVG, attribute spreads, `dangerouslySetInnerHTML`, nested dynamic
-blocks, and static siblings in that container keep React ownership. The more general React-owned
-conditional path still accepts supported nested conditionals, keyed lists, and component islands.
-An empty ternary branch may be `null` or `false`. The inactive branch is described at build time but
-is never pre-mounted or cached. If a logical `&&` evaluates to a number such as `0`, the runtime also
-falls back to React so JavaScript and React rendering semantics remain exact.
+Conditional blocks have three safe ownership levels. One or more proven host-only direct branches
+may become compiler-owned ranges among static host siblings, including at the exact component root.
+A dedicated container with exactly one conditional child uses the smaller compiler-owned branch
+boundary. The more general React-owned conditional path accepts supported events, nested host
+conditionals, keyed lists, and component islands. A compiler-owned host branch may now recursively
+contain eligible host-only conditional ranges and non-interactive keyed ranges in nested host
+containers. Each nested range receives its own dependency entry and updates without rerunning or
+replacing the outer branch. When conditionals and keyed maps/`List` ranges are direct siblings in
+one safe host container, the compiler emits one ordered mixed-range controller. It mounts or removes
+conditional branches, applies independent LIS reconciliation to each keyed range, and preserves
+static siblings in place. Stateful leaf text, attributes, `className`, and individual inline style
+properties on those siblings are compiled into stable segment/sibling/path bindings. Their address
+does not shift when a nearby condition mounts or a keyed range inserts, removes, or reorders rows,
+so the same controller patches them from the current state snapshot without replacing the sibling
+or rerunning the owner. The same mixed layout may recurse inside safe branches and keyed rows.
+Keys on branches, custom components, fragments, refs, SVG, attribute spreads,
+`dangerouslySetInnerHTML`, branch events, interactive rows, and unsupported mixed children keep
+React ownership. An empty ternary branch may be `null` or `false`. The
+inactive branch is described at build time but is never pre-mounted or cached. If a logical `&&`
+evaluates to a number such as `0`,
+or adopted DOM no longer matches its descriptor, the affected container remounts through React so
+JavaScript, hydration, and React rendering semantics remain exact.
 
 All component-level boundary types share one block graph and one ID sequence. A nested
 binding records its nearest conditional parent. If one state flush affects both an outer
 conditional and its descendants, the runtime refreshes the mounted outer boundary once and skips
-the redundant descendant refreshes. React unmounts inner boundaries normally, their subscriptions
-are removed, and a later remount reads the latest compiler-cell values. Host-only keyed rows have
-separate runtime instances per key. Row-local conditional IDs are scoped to that instance and
-paired with its stable key, so two rows can use the same build-time slot ID without sharing data or
-subscriptions. Unsupported row subtrees stay complete React-owned keyed boundaries.
+the redundant descendant refreshes. React-owned inner boundaries unmount normally. Compiler-owned
+host scopes explicitly remove every nested subscription before their outer DOM is removed, and a
+later mount reads the latest compiler-cell values. Surviving keyed rows move with the existing LIS
+algorithm. Duplicate runtime keys, invalid adoption, or an unsafe logical value transfer the outer
+container back to React; descendant dependencies remain subscribed so that fallback stays live.
+Host-only keyed rows have separate runtime instances per key. Row-local conditional and keyed-range
+IDs are scoped to that instance and paired with its stable key, so two rows can use the same
+build-time slot ID without sharing data or subscriptions. Unsupported row subtrees stay complete
+React-owned keyed boundaries.
 
 Unsupported components fall back to React by default. Use `onUnsupported: "warn"` for diagnostics
 or `onUnsupported: "error"` while tightening an annotated migration.
@@ -323,7 +1119,29 @@ compiler: {
 
 The default path is `.farm/react-compiler.json`. The report covers the production browser graph and
 contains project-relative module paths, compiled component names, fallback details, and fallback
-reasons aggregated by count. A custom project-relative `reportFile` also enables reporting.
+reasons aggregated by count. Its summary and per-module `optimizations` also report
+`keyedIdentityTargets`, the number of scalar key-directed row bindings;
+`keyedMapLookupTargets`, the number of native-Map keyed lookup bindings;
+`keyedMembershipTargets`, the number of native-Set membership bindings;
+`keyedCollectionUpdateHints`, the number of compiler-proven native Set/Map mutation sites; and
+`keyedMapUpdateHints`, the number of compiler-proven keyed `map()` update calls; and
+`keyedArrayAppendHints`, the number of compiler-proven direct keyed-array append sites; and
+`keyedArrayFilterHints`, the number of compiler-proven keyed-array filter sites, including supported
+structural reorder pipelines; and
+`keyedArrayPrependHints`, the number of compiler-proven direct keyed-array prepend sites; and
+`keyedArrayPositionHints`, the number of compiler-proven native exact-position insertion, single or
+contiguous-range removal, single-row replacement, or exact-window replacement sites, including
+guarded compiler-safe runtime positions;
+and
+`keyedArrayReorderHints`, the number of compiler-proven native keyed-array reverse steps; and
+`keyedArraySortHints`, the number of compiler-proven native keyed-array sort steps; and
+`keyedArrayMappedRollingWindowChainHints`, the number of compiler-proven rolling steps retained
+across multi-window same-key map chains; and
+`keyedArrayRollingWindowHints`, the number of compiler-proven retained-tail plus incoming-suffix
+sites; and
+`keyedArraySliceHints`, the number of compiler-proven keyed-array slice sites with literal or guarded
+compiler-safe runtime bounds, including supported structural reorder pipelines. A custom
+project-relative `reportFile` also enables reporting.
 
 The runtime test compares the same counter interaction on both paths: ordinary React performs a
 second component render and commit, while the compiled component remains at one render and one
@@ -331,11 +1149,15 @@ commit and updates its two bindings directly. This is a deterministic structural
 assertion; it is not presented as a cross-machine timing benchmark.
 
 Application and prototype calls, dynamic style objects, handlers outside JSX events, nested,
-computed, and rest props patterns, async handlers, unkeyed or index-keyed lists, chained maps,
-unsupported conditional roots, effects, and more advanced hook support intentionally stay on React
-in this release. Compiler-owned keyed rows support either one dedicated host-only map/`List` or
-one or more non-interactive ranges in a nested or component-root host container. Inline synchronous
-events and dedicated row-local host conditional slots can use the single-list hybrid path, but
-branch events, interactive ranges beside siblings, nested dynamic blocks, conditionals mixed with
-siblings in one slot, non-inline or async row handlers, unsupported form shapes, custom components,
-fragments, refs, SVG, and duplicate runtime keys keep or switch to React ownership.
+computed, and rest props patterns, async handlers, unkeyed or index-keyed lists, unsupported map
+chains, unsupported conditional roots, effects, and more advanced hook support intentionally stay
+on React in this release. Compiler-owned keyed rows support either one dedicated host-only map/`List` or
+one or more non-interactive ranges in a nested or component-root host container. A dedicated
+non-interactive row may also contain multiple recursive logical or ternary host branches beside
+stateful static host siblings, plus recursively nested non-interactive keyed ranges scoped by every
+stable parent key. Static sibling bindings support safe leaf text, attributes, `className`, and
+individual style properties; lifecycle-sensitive shapes continue to fall back. Inline synchronous
+row events continue to use the hybrid React-owned row path. Branch
+or nested-row events, interactive ranges beside siblings, non-inline or async row handlers,
+unsupported form shapes, custom components, fragments, refs, SVG, and duplicate runtime keys keep
+or switch to React ownership.