diff --git a/src/V3Width.cpp b/src/V3Width.cpp
index 861714e34..849c28ef5 100644
--- a/src/V3Width.cpp
+++ b/src/V3Width.cpp
@@ -3431,9 +3431,17 @@ class WidthVisitor final : public VNVisitor {
         for (AstNode *nextip, *itemp = nodep->itemsp(); itemp; itemp = nextip) {
             nextip = itemp->nextp();
             itemp = VN_AS(itemp, DistItem)->rangep();
-            // InsideRange will get replaced with Lte&Gte and finalized later
-            if (!VN_IS(itemp, InsideRange))
+            if (AstInsideRange* const rangep = VN_CAST(itemp, InsideRange)) {
+                // Finalize both bounds now: the in-constraint path keeps the dist
+                // (and its ranges) for constraint lowering, which cannot re-width
+                // a mixed-width bound expression
+                iterateCheck(nodep, "Dist Range", rangep->lhsp(), CONTEXT_DET, FINAL, subDTypep,
+                             EXTEND_EXP);
+                iterateCheck(nodep, "Dist Range", rangep->rhsp(), CONTEXT_DET, FINAL, subDTypep,
+                             EXTEND_EXP);
+            } else {
                 iterateCheck(nodep, "Dist Item", itemp, CONTEXT_DET, FINAL, subDTypep, EXTEND_EXP);
+            }
         }
 
         // Inside a constraint, V3Randomize handles dist lowering with proper weights,
@@ -3471,6 +3479,8 @@ class WidthVisitor final : public VNVisitor {
         UINFOTREE(9, nodep, "", "dist-out");
         nodep->replaceWith(newp);
         VL_DO_DANGLING(pushDeletep(nodep), nodep);
+        // Width the replacement (same reason as in visit(AstInside) below)
+        userIterate(newp, m_vup);
     }
 
     void visit(AstInside* nodep) override {
@@ -3566,6 +3576,10 @@ class WidthVisitor final : public VNVisitor {
         UINFOTREE(9, newp, "", "inside-out");
         nodep->replaceWith(newp);
         VL_DO_DANGLING(pushDeletep(nodep), nodep);
+        // Width the replacement: InsideRange bounds are skipped above (finalized
+        // "later"), and a single-BOTH context (e.g. the RHS of '->' via
+        // iterateCheckBool) never revisits it, leaving mixed-width bounds unextended.
+        userIterate(newp, m_vup);
     }
     AstNodeExpr* insideItem(AstNode* nodep, AstNodeExpr* exprp, AstNodeExpr* itemp) {
         const AstNodeDType* const itemDtp = itemp->dtypep()->skipRefp();
diff --git a/test_regress/t/t_constraint_inside_impl_mixwidth.py b/test_regress/t/t_constraint_inside_impl_mixwidth.py
new file mode 100755
index 000000000..a161cb414
--- /dev/null
+++ b/test_regress/t/t_constraint_inside_impl_mixwidth.py
@@ -0,0 +1,22 @@
+#!/usr/bin/env python3
+# DESCRIPTION: Verilator: Verilog Test driver/expect definition
+#
+# This program is free software; you can redistribute it and/or modify it
+# under the terms of either the GNU Lesser General Public License Version 3
+# or the Perl Artistic License Version 2.0.
+# SPDX-FileCopyrightText: 2026 Wilson Snyder
+# SPDX-License-Identifier: LGPL-3.0-only OR Artistic-2.0
+
+import vltest_bootstrap
+
+test.scenarios('simulator')
+
+if not test.have_solver:
+    test.skip("No constraint solver installed")
+
+# The mixed-width range bound (64-bit minus 32-bit) is intentional.
+test.compile(verilator_flags2=["-Wno-WIDTHEXPAND"])
+
+test.execute()
+
+test.passes()
diff --git a/test_regress/t/t_constraint_inside_impl_mixwidth.v b/test_regress/t/t_constraint_inside_impl_mixwidth.v
new file mode 100644
index 000000000..c4afbec7e
--- /dev/null
+++ b/test_regress/t/t_constraint_inside_impl_mixwidth.v
@@ -0,0 +1,136 @@
+// DESCRIPTION: Verilator: Verilog Test module
+//
+// This file ONLY is placed under the Creative Commons Public Domain.
+// SPDX-FileCopyrightText: 2026 PlanV GmbH
+// SPDX-License-Identifier: CC0-1.0
+
+// verilog_format: off
+`define stop $stop
+`define checkd(gotv,expv) do if ((gotv) !== (expv)) begin $write("%%Error: %s:%0d:  got=%0d exp=%0d\n", `__FILE__,`__LINE__, (gotv), (expv)); `stop; end while(0);
+// verilog_format: on
+
+// Mixed-width inside-range bound under an implication (and other single-BOTH
+// contexts) must be zero-extended in the emitted SMT.
+class Impl;
+  rand bit [63:0] x, y;
+  rand bit [31:0] g;
+  constraint c {
+    g inside {[1:10]};
+    y == 64'h100;
+    y != 0 -> x inside {[y - g : y]};
+  }
+endclass
+
+class Neg;  // inside under logical-not under implication
+  rand bit [63:0] x, y;
+  rand bit [31:0] g;
+  constraint c {
+    g inside {[1:10]};
+    y == 64'h100;
+    y != 0 -> !(x inside {[y - g : y - 1]});
+  }
+endclass
+
+class LAnd;  // inside as a logical-and operand (no implication)
+  rand bit [63:0] x, y;
+  rand bit [31:0] g;
+  constraint c {
+    g inside {[1:10]};
+    y == 64'h100;
+    (x inside {[y - g : y]}) && (x[0] == 1'b0);
+  }
+endclass
+
+class Nest;  // nested implication a -> (b -> inside)
+  rand bit [63:0] x, y;
+  rand bit [31:0] g;
+  rand bit a, b;
+  constraint c {
+    g inside {[1:10]};
+    y == 64'h100;
+    a == 1;
+    b == 1;
+    a -> (b -> x inside {[y - g : y]});
+  }
+endclass
+
+class CondCtx;  // inside as a ?: condition
+  rand bit [63:0] x, y;
+  rand bit [31:0] g;
+  rand bit s;
+  constraint c {
+    g inside {[1:10]};
+    y == 64'h100;
+    (x inside {[y - g : y]}) ? (s == 1'b1) : (s == 1'b0);
+  }
+endclass
+
+class Ctl;  // all-32-bit control: no extension needed anywhere
+  rand bit [31:0] x, y, g;
+  constraint c {
+    g inside {[1:10]};
+    y == 32'h100;
+    y != 0 -> x inside {[y - g : y]};
+  }
+endclass
+
+class DistRange;  // mixed-width dist range bound (kept for constraint lowering)
+  rand bit [63:0] x, y;
+  rand bit [31:0] g;
+  constraint c {
+    g inside {[1:10]};
+    y == 64'h100;
+    x dist {[y - g : y] := 1, 5 := 1};
+  }
+endclass
+
+module t;
+  Impl im;
+  Neg ng;
+  LAnd la;
+  Nest ne;
+  CondCtx cx;
+  Ctl ct;
+  DistRange dr;
+  int ok;
+  initial begin
+    im = new;
+    ng = new;
+    la = new;
+    ne = new;
+    cx = new;
+    ct = new;
+    dr = new;
+    for (int i = 0; i < 20; ++i) begin
+      ok = im.randomize();
+      `checkd(ok, 1);
+      if (im.x < (64'h100 - im.g) || im.x > 64'h100) `checkd(0, 1);
+
+      ok = ng.randomize();
+      `checkd(ok, 1);
+      if (ng.x >= (64'h100 - ng.g) && ng.x <= 64'hFF) `checkd(0, 1);
+
+      ok = la.randomize();
+      `checkd(ok, 1);
+      if (la.x < (64'h100 - la.g) || la.x > 64'h100 || la.x[0] !== 1'b0) `checkd(0, 1);
+
+      ok = ne.randomize();
+      `checkd(ok, 1);
+      if (ne.x < (64'h100 - ne.g) || ne.x > 64'h100) `checkd(0, 1);
+
+      ok = cx.randomize();
+      `checkd(ok, 1);
+      if (cx.s !== ((cx.x >= (64'h100 - cx.g)) && (cx.x <= 64'h100))) `checkd(0, 1);
+
+      ok = ct.randomize();
+      `checkd(ok, 1);
+      if (ct.x < (32'h100 - ct.g) || ct.x > 32'h100) `checkd(0, 1);
+
+      ok = dr.randomize();
+      `checkd(ok, 1);
+      if (dr.x != 5 && (dr.x < (64'h100 - dr.g) || dr.x > 64'h100)) `checkd(0, 1);
+    end
+    $write("*-* All Finished *-*\n");
+    $finish;
+  end
+endmodule