diff --git a/changelog.d/10080-string-for-of-code-points.md b/changelog.d/10080-string-for-of-code-points.md
new file mode 100644
index 0000000000..35d51b9b86
--- /dev/null
+++ b/changelog.d/10080-string-for-of-code-points.md
@@ -0,0 +1,10 @@
+Fix typed string `for...of` loops splitting astral characters into separate
+surrogate iterations. Both function-body and module-initialization lowering
+now convert strings to code-point arrays using the runtime string iterator's
+existing WTF-8 conversion, preserving lone surrogates and the code-unit
+semantics of bracket indexing and `charCodeAt`.
+
+Regression coverage checks every yielded code unit for typed and dynamic
+strings, local and module-level loops, adjacent astral characters, lone
+surrogates, empty/ASCII strings, assignment heads, `break`, `continue`,
+`return`, and `for await...of`.
diff --git a/crates/perry-hir/src/lower/stmt_loops.rs b/crates/perry-hir/src/lower/stmt_loops.rs
index 8d498c4056..c0c43c4635 100644
--- a/crates/perry-hir/src/lower/stmt_loops.rs
+++ b/crates/perry-hir/src/lower/stmt_loops.rs
@@ -1387,8 +1387,8 @@ pub(super) fn lower_stmt_for_of_inner(
     // routes through the runtime default-iterator (`js_for_of_to_array`).
     //
     // We deliberately DON'T wrap the statically-resolved kinds handled
-    // above (Map/Set/typed-array via their own materializers, strings via
-    // the string index-loop, Headers/URLSearchParams via their entries
+    // above (Map/Set/typed-array via their own paths, strings via
+    // code-point materialization, Headers/URLSearchParams via their entries
     // rewrite) nor proven arrays — those keep their existing fast paths.
     let proven_array = match &iterable_type {
         Some(Type::Array(_)) => true,
@@ -1472,6 +1472,11 @@ pub(super) fn lower_stmt_for_of_inner(
     } else if use_lazy_iter {
         // GetIterator(obj): obj[Symbol.iterator](). Drives the lazy loop below.
         Expr::GetIterator(Box::new(arr_expr))
+    } else if is_string_iter {
+        // #10062: string indexing yields UTF-16 code units, while for-of
+        // yields code points. Materialize with the same WTF-8 conversion as
+        // the runtime string iterator, then index the resulting array.
+        Expr::ForOfToArray(Box::new(arr_expr))
     } else {
         arr_expr
     };
@@ -1503,11 +1508,11 @@ pub(super) fn lower_stmt_for_of_inner(
             _ => Type::Any,
         }
     };
-    // The __arr holder's type: String for string iteration, Map for
+    // The __arr holder's type: Array<String> for materialized strings, Map for
     // the Map-fast-path so `__m.size` resolves through `is_map_expr`,
     // Array otherwise.
-    let arr_type = if is_string_iter {
-        Type::String
+    let arr_type = if is_string_iter && !use_lazy_iter {
+        Type::Array(Box::new(Type::String))
     } else if map_kv_fastpath {
         Type::Generic {
             base: "Map".to_string(),
diff --git a/crates/perry-hir/src/lower_decl/body_stmt.rs b/crates/perry-hir/src/lower_decl/body_stmt.rs
index 2441bd7651..5c675a03a3 100644
--- a/crates/perry-hir/src/lower_decl/body_stmt.rs
+++ b/crates/perry-hir/src/lower_decl/body_stmt.rs
@@ -1646,12 +1646,17 @@ fn lower_body_stmt_impl(ctx: &mut LoweringContext, stmt: &ast::Stmt) -> Result<V
                 arr_expr
             } else if use_lazy_iter {
                 Expr::GetIterator(Box::new(arr_expr))
+            } else if is_string_iter {
+                // #10062: index an array of code points, not the string's
+                // UTF-16 code units. Shares the runtime string iterator's
+                // WTF-8 conversion, including lone-surrogate preservation.
+                Expr::ForOfToArray(Box::new(arr_expr))
             } else {
                 arr_expr
             };
 
-            // For string iteration the __arr holder is typed as String (so codegen
-            // uses string.length + js_string_char_at via the existing str[i] path).
+            // Materialized strings use an Array<String> holder so codegen
+            // indexes whole code points rather than UTF-16 code units.
             // For an identifier iterable like `for (const word of words)` where
             // `words: string[]`, extract the element type from the local's
             // declared Array<T> so the loop variable gets the right type.
@@ -1678,8 +1683,8 @@ fn lower_body_stmt_impl(ctx: &mut LoweringContext, stmt: &ast::Stmt) -> Result<V
                 });
             // For the Map fast path the holder must be typed Map so
             // `__m.size` resolves through `is_map_expr` to `js_map_size`.
-            let holder_type = if is_string_iter {
-                Type::String
+            let holder_type = if is_string_iter && !use_lazy_iter {
+                Type::Array(Box::new(Type::String))
             } else if map_kv_fastpath {
                 Type::Generic {
                     base: "Map".to_string(),
diff --git a/test-files/test_gap_string_for_of_code_points.ts b/test-files/test_gap_string_for_of_code_points.ts
new file mode 100644
index 0000000000..3338f9ee76
--- /dev/null
+++ b/test-files/test_gap_string_for_of_code_points.ts
@@ -0,0 +1,134 @@
+// #10062: for-of yields code points; indexing and charCodeAt yield code units.
+function equal(actual: string, expected: string): void {
+  if (actual !== expected) throw new Error(actual + " !== " + expected);
+}
+
+// Include EVERY code unit, so an astral element with a missing/wrong low
+// surrogate cannot satisfy the check merely by reporting length two.
+function describe(ch: string): string {
+  let out = "" + ch.length;
+  for (let i = 0; i < ch.length; i++) out += ":" + ch.charCodeAt(i);
+  return out + ",";
+}
+
+function typed(s: string): string {
+  let out = "";
+  for (const ch of s) out += describe(ch);
+  return out;
+}
+
+function dynamic(s: any): string {
+  let out = "";
+  for (const ch of s) out += describe(ch);
+  return out;
+}
+
+const mixed = "\u00e4\u4e2d\u{1f600}\u00d6";
+const mixedExpected = "1:228,1:20013,2:55357:56832,1:214,";
+equal(typed(mixed), mixedExpected);
+equal(dynamic(mixed), mixedExpected);
+equal(typed(""), "");
+equal(dynamic(""), "");
+equal(typed("aBcD"), "1:97,1:66,1:99,1:68,");
+equal(dynamic("aBcD"), "1:97,1:66,1:99,1:68,");
+
+const adjacent = "\u{1f600}\u{1f680}\u{10000}\u{10ffff}";
+const adjacentExpected = "2:55357:56832,2:55357:56960,2:55296:56320,2:56319:57343,";
+equal(typed(adjacent), adjacentExpected);
+equal(dynamic(adjacent), adjacentExpected);
+
+// Lone surrogates stay individual values, including a low/high sequence.
+const lone = "\ud800A\udc00\udfff\udbffZ";
+const loneExpected = "1:55296,1:65,1:56320,1:57343,1:56319,1:90,";
+equal(typed(lone), loneExpected);
+equal(dynamic(lone), loneExpected);
+equal(typed(String.fromCharCode(0xd83d, 0xde00)), "2:55357:56832,");
+
+function local(): string {
+  let source: string = "\u00e4\u4e2d\u{1f600}\u00d6";
+  let out = "";
+  for (const ch of source) out += describe(ch);
+  return out;
+}
+equal(local(), mixedExpected);
+
+// Module initialization has a separate for-of lowering implementation.
+let top = "";
+for (const ch of mixed) top += describe(ch);
+equal(top, mixedExpected);
+let literal = "";
+for (const ch of "\u{1f600}\u{1f680}") literal += describe(ch);
+equal(literal, "2:55357:56832,2:55357:56960,");
+const topDynamic: any = mixed;
+let genericTop = "";
+for (const ch of topDynamic) genericTop += describe(ch);
+equal(genericTop, mixedExpected);
+
+// Continue must advance exactly once; break must not process the suffix.
+function control(s: string): string {
+  let out = "";
+  for (const ch of s) {
+    if (ch === "\u{1f600}") continue;
+    if (ch === "!") break;
+    out += describe(ch);
+  }
+  return out;
+}
+equal(control("\u{1f600}A\u{1f600}\u{1f680}!Z"), "1:65,2:55357:56960,");
+let topControl = "";
+for (const ch of "\u{1f600}A\u{1f600}\u{1f680}!Z") {
+  if (ch === "\u{1f600}") continue;
+  if (ch === "!") break;
+  topControl += describe(ch);
+}
+equal(topControl, "1:65,2:55357:56960,");
+
+function first(s: string): string {
+  for (const ch of s) return ch;
+  return "";
+}
+equal(describe(first(adjacent)), "2:55357:56832,");
+equal(first(""), "");
+
+let assigned = "";
+let assignmentItems = "";
+for (assigned of adjacent) assignmentItems += describe(assigned);
+equal(assignmentItems, adjacentExpected);
+
+// Indexed access still exposes BOTH halves separately.
+function indexed(s: string): string {
+  return describe(s[0]) + describe(s[1]) + s.charCodeAt(0) + ":" + s.charCodeAt(1);
+}
+equal(indexed("\u{1f600}"), "1:55357,1:56832,55357:56832");
+
+// A guarded array loop also lowers its nested string loop in forced lazy
+// mode. Its holder must remain an iterator object in that alternative arm.
+function nested(inputs: string[]): string {
+  let out = "";
+  for (const input of inputs) {
+    for (const ch of input) out += describe(ch);
+  }
+  return out;
+}
+equal(nested([mixed]), mixedExpected);
+const originalArrayIterator = Array.prototype[Symbol.iterator];
+Array.prototype[Symbol.iterator] = function () {
+  return originalArrayIterator.call(this);
+};
+equal(nested([adjacent]), adjacentExpected);
+Array.prototype[Symbol.iterator] = originalArrayIterator;
+
+console.log("string for-of code points: ok");
+
+async function asyncTyped(s: string): Promise<string> {
+  let out = "";
+  for await (const ch of s) {
+    if (ch === "\u00e4") continue;
+    out += describe(ch);
+  }
+  return out;
+}
+asyncTyped(mixed).then((out: string) => {
+  equal(out, "1:20013,2:55357:56832,1:214,");
+  console.log("async string for-of code points: ok");
+});