diff --git a/crates/aura-core/src/lib.rs b/crates/aura-core/src/lib.rs
index b061f34..5edfce7 100644
--- a/crates/aura-core/src/lib.rs
+++ b/crates/aura-core/src/lib.rs
@@ -24,8 +24,7 @@
 //!   access into each input (closing the cycle-0001 read-side gap on
 //!   [`AnyColumn`]).
 //!
-//! Still to come (subsequent cycles): the `Source` trait + data-server ingestion
-//! and source-native time normalization (C3/C11), the broker-independent
+//! Still to come (subsequent cycles): the broker-independent
 //! position-event output and downstream broker nodes (C10), and the run registry
 //! (C18/C22).
 
diff --git a/crates/aura-ingest/src/lib.rs b/crates/aura-ingest/src/lib.rs
index 9135e5b..a411226 100644
--- a/crates/aura-ingest/src/lib.rs
+++ b/crates/aura-ingest/src/lib.rs
@@ -7,6 +7,14 @@
 //! as the engine source-stream shape (`Vec<(Timestamp, Scalar)>`) the SMA-cross
 //! sample strategy consumes.
 //!
+//! Two ingestion shapes coexist: the **eager** [`load_m1_window`] → [`M1Columns`]
+//! transpose (a bounded window materialized to owned SoA columns), and the **lazy
+//! streaming** [`M1FieldSource`] — a `Source` that pulls one data-server
+//! `Arc<[M1Parsed]>` chunk at a time and decodes each `Scalar` on demand
+//! (resident O(one chunk), not O(window length)) for backtests over long
+//! horizons. Both normalize ms→epoch-ns through the one [`unix_ms_to_epoch_ns`]
+//! seam (C3).
+//!
 //! This crate is the **data-source ingestion edge**: it links `data-server`
 //! (and its transitive `chrono`/`regex`/`zip`) and normalizes it into aura's
 //! columns here. Dependencies follow the amended C16 per-case policy (INDEX.md),
diff --git a/crates/aura-registry/src/lib.rs b/crates/aura-registry/src/lib.rs
index bbae347..fd9308d 100644
--- a/crates/aura-registry/src/lib.rs
+++ b/crates/aura-registry/src/lib.rs
@@ -101,7 +101,7 @@ fn metric_cmp(
 }
 
 /// Sort `reports` **best-first** by a named metric. "Best" is per-metric, fixed
-/// by each metric's meaning (see [`metric_cmp`]). A stable sort keeps file
+/// by each metric's meaning (see `metric_cmp`). A stable sort keeps file
 /// (insertion) order among ties. An unknown metric name is a
 /// `RegistryError::UnknownMetric`.
 pub fn rank_by(mut reports: Vec<RunReport>, metric: &str) -> Result<Vec<RunReport>, RegistryError> {
@@ -112,7 +112,7 @@ pub fn rank_by(mut reports: Vec<RunReport>, metric: &str) -> Result<Vec<RunRepor
 
 /// `rank_by`'s argmax: return the single best `SweepPoint` of a `SweepFamily`
 /// under a named metric, by the same fixed per-metric sense of best (see
-/// [`metric_cmp`]). The whole point is carried — its `params` coordinate AND its
+/// `metric_cmp`). The whole point is carried — its `params` coordinate AND its
 /// `RunReport` — because the caller needs the params that won. Ties on the metric
 /// resolve to the **earliest** enumeration-order point (the family is already in
 /// odometer order; only a strictly-better later point displaces the incumbent).
diff --git a/docs/design/INDEX.md b/docs/design/INDEX.md
index 795f392..43dda53 100644
--- a/docs/design/INDEX.md
+++ b/docs/design/INDEX.md
@@ -527,12 +527,18 @@ unit: (1) param-sweep (grid/random), (2) optimization (argmax metric),
 (3) walk-forward (rolling in-sample optimize + out-of-sample test),
 (4) Monte-Carlo (N seeded realizations perturbing input). **MC = sweep over
 seeds**; each realization is itself deterministic given its seed.
-*Status (cycle 0011).* The first ingestion (`aura-ingest`) **eagerly
-materializes** a data-server window into owned source streams rather than
-sharing `data-server`'s `Arc<[T]>` chunks zero-copy across sims — the cross-sim
-`Arc<[T]>` sharing has no consumer until the orchestration axes above are built.
-That sharing remains the target for the orchestration cycle that introduces
-them; the transpose logic is unchanged by it. A known, deliberate gap, not drift.
+**Realization (cycle 0041).** The eager ingestion of cycle 0011 is no longer the
+only path. `Harness::run` is re-typed to a **producer seam** — a `Source` trait
+(`peek`/`next`, object-safe) the k-way merge drives — and a streaming
+**`M1FieldSource`** (`aura-ingest`) pulls a data-server window lazily, borrowing
+**one** `Arc<[M1Parsed]>` chunk per pull (zero-copy *within* a source) and
+decoding each `Scalar` on demand: resident O(one chunk), not O(window length),
+so a 20-year window streams in the same memory as a one-day one. The eager
+`load_m1_window`/`close_stream` path is kept for bounded loads (the gap closes by
+a streaming path *existing*, not by deleting the eager one). **Still open:**
+cross-*sim* `Arc<[T]>` sharing — one window shared zero-copy across many disjoint
+sweep sims — has no consumer until the orchestration families (axes 2–4 above:
+#66/#68/#69) are built, and remains the target for those cycles.
 **Forbids.** Baking a specific search strategy (Bayesian/genetic) into the
 primitive — those are pluggable policies atop the atomic unit; recompiling on a
 param change.