@jax-js/jax 0.0.4 → 0.0.5

package/dist/index.js

@@ -1,5 +1,5 @@
 import { __export } from "./chunk-Cl8Af3a2.js";
-import { AluExp, AluGroup, AluOp, AluVar, DEBUG, DType, FpHash, Kernel, PPrint, Reduction, ShapeTracker, accessorAluExp, accessorGlobal, byteWidth, checkAxis, deepEqual, defaultDevice, devices, dtypedArray, dtypedJsArray, getBackend, init, invertPermutation, isFloatDtype, isNumberPair, isPermutation, normalizeAxis, partitionList, prod, promoteTypes, range, recursiveFlatten, rep, runWithCache, setDebug, toposort, unravelAlu, unzip2, zip, zipn } from "./backend-EBRGmEYw.js";
+import { AluExp, AluGroup, AluOp, AluVar, DEBUG, DType, FpHash, Kernel, PPrint, Reduction, ShapeTracker, accessorAluExp, accessorGlobal, byteWidth, checkAxis, deepEqual, defaultDevice, devices, dtypedArray, dtypedJsArray, generalBroadcast, getBackend, init, invertPermutation, isFloatDtype, isNumberPair, isPermutation, normalizeAxis, partitionList, prod, promoteTypes, range, recursiveFlatten, rep, runWithCache, setDebug, toposort, unravelAlu, unzip2, zip, zipn } from "./backend-CdcTZEOF.js";
 
 //#region src/tree.ts
 var tree_exports = {};
@@ -565,6 +565,21 @@ var Trace = class {
 		this.main = main;
 	}
 };
+/**
+* Broadcast shapes and promote types with casting for two avals.
+*
+* This implements the weak type behavior described in `promoteTypes()`, but not
+* implemented in that function as `weakType` is not passed.
+*/
+function promoteAvals(a, b) {
+	const shape$1 = generalBroadcast(a.shape, b.shape);
+	const weakType = a.weakType && b.weakType;
+	let dtype;
+	if (a.weakType === b.weakType) dtype = promoteTypes(a.dtype, b.dtype);
+	else if (a.weakType) dtype = promoteTypes(b.dtype, DType.Uint32);
+	else dtype = promoteTypes(a.dtype, DType.Uint32);
+	return new ShapedArray(shape$1, dtype, weakType);
+}
 var Tracer = class Tracer {
 	/** @ignore */
 	_trace;
@@ -579,10 +594,19 @@ var Tracer = class Tracer {
 	get size() {
 		return prod(this.shape);
 	}
-	/** The dtype of the array. */
+	/** The dtype of elements stored in the array. */
 	get dtype() {
 		return this.aval.dtype;
 	}
+	/**
+	* Whether the array is weakly typed.
+	*
+	* Weakly typed arrays will cast to the dtype of the other operand. See
+	* `promoteTypes()` for details.
+	*/
+	get weakType() {
+		return this.aval.weakType;
+	}
 	/** The number of dimensions of the array. */
 	get ndim() {
 		return this.shape.length;
@@ -819,12 +843,13 @@ function getShape(x) {
 	return x instanceof Tracer ? x.shape : [];
 }
 var ShapedArray = class ShapedArray {
-	constructor(shape$1, dtype) {
+	constructor(shape$1, dtype, weakType) {
 		this.shape = shape$1;
 		this.dtype = dtype;
+		this.weakType = weakType;
 	}
 	static fromAval(aval) {
-		return new ShapedArray(aval.shape, aval.dtype);
+		return new ShapedArray(aval.shape, aval.dtype, aval.weakType);
 	}
 	get ndim() {
 		return this.shape.length;
@@ -838,7 +863,7 @@ var ShapedArray = class ShapedArray {
 };
 function getAval(x) {
 	if (x instanceof Tracer) return x.aval;
-	else if (typeof x === "boolean" || typeof x === "number") return new ShapedArray([], typeof x === "boolean" ? DType.Bool : DType.Float32);
+	else if (typeof x === "boolean" || typeof x === "number") return new ShapedArray([], typeof x === "boolean" ? DType.Bool : DType.Float32, typeof x === "boolean" ? false : true);
 	else throw new TypeError(`Unknown value: ${x}`);
 }
 function bind(prim, args, params = {}) {
@@ -1160,7 +1185,7 @@ const jitRules = {
 		const k1 = reshapeViews(keys[1], mapping);
 		const c0 = AluExp.u32(0);
 		const c1 = AluExp.cast(DType.Uint32, AluVar.gidx);
-		const exp$2 = AluExp.threefry2x32(c0, c1, k0, k1, mode);
+		const exp$2 = AluExp.threefry2x32(k0, k1, c0, c1, mode);
 		return new Kernel(nargs, prod(shape$1), exp$2);
 	},
 	[Primitive.Sin]: unopJit(AluExp.sin),
@@ -1201,7 +1226,7 @@ const jitRules = {
 	[Primitive.Dot](nargs, [a, b], [as, bs]) {
 		const k1 = jitRules[Primitive.Mul](nargs, [a, b], [as, bs], {});
 		const c = k1.exp;
-		const cs = new ShapedArray(generalBroadcast(as.shape, bs.shape), c.dtype);
+		const cs = promoteAvals(as, bs);
 		return jitRules[Primitive.Reduce](nargs, [c], [cs], {
 			op: AluOp.Add,
 			axis: [cs.ndim - 1]
@@ -1211,8 +1236,8 @@ const jitRules = {
 		const [stX, stY] = prepareConv(ShapeTracker.fromShape(as.shape), ShapeTracker.fromShape(bs.shape), params);
 		a = reshapeViews(a, (st) => st.compose(stX));
 		b = reshapeViews(b, (st) => st.compose(stY));
-		as = new ShapedArray(stX.shape, as.dtype);
-		bs = new ShapedArray(stY.shape, bs.dtype);
+		as = new ShapedArray(stX.shape, as.dtype, as.weakType);
+		bs = new ShapedArray(stY.shape, bs.dtype, bs.weakType);
 		return jitRules[Primitive.Dot](nargs, [a, b], [as, bs], {});
 	},
 	[Primitive.Compare]: broadcastedJit(([a, b], { op }) => aluCompare(a, b, op)),
@@ -1265,9 +1290,10 @@ function splitGraphDataflow(backend, jaxpr) {
 		Primitive.Conv,
 		Primitive.PoolTranspose
 	];
+	const heterogeneousViewPrimitives = [Primitive.Gather, Primitive.RandomBits];
 	for (let i = jaxpr.eqns.length - 1; i >= 0; i--) {
 		const eqn = jaxpr.eqns[i];
-		if (reducePrimitives.includes(eqn.primitive) || eqn.primitive === Primitive.Gather || eqn.outBinders.some((v) => blackNodes.has(v))) {
+		if (reducePrimitives.includes(eqn.primitive) || heterogeneousViewPrimitives.includes(eqn.primitive) || eqn.outBinders.some((v) => blackNodes.has(v))) {
 			for (const v of eqn.outBinders) {
 				blackNodes.add(v);
 				p1NextBlack.set(v, v);
@@ -1397,6 +1423,7 @@ var Array$1 = class Array$1 extends Tracer {
 	static #nextId = 1001;
 	id;
 	#dtype;
+	#weakType;
 	#source;
 	#st;
 	#backend;
@@ -1408,21 +1435,22 @@ var Array$1 = class Array$1 extends Tracer {
 	* is a backend `Slot`, this constructor _takes ownership_ of the slot. It
 	* will be freed when the array is disposed.
 	*/
-	constructor(source, st, dtype, backend, { pending = null } = {}) {
+	constructor(args) {
 		super(baseArrayTrace);
 		this.id = Array$1.#nextId++;
-		this.#dtype = dtype;
-		this.#source = source;
-		this.#st = st;
-		this.#backend = backend;
+		this.#dtype = args.dtype;
+		this.#weakType = args.weakType;
+		this.#source = args.source;
+		this.#st = args.st;
+		this.#backend = args.backend;
 		this.#rc = 1;
-		this.#pendingSet = new Set(pending);
+		this.#pendingSet = new Set(args.pending);
 		if (this.#pendingSet.size === 0) this.#pendingSet = null;
-		else if (source instanceof AluExp) throw new Error("internal: AluExp source cannot have pending executes");
+		else if (this.#source instanceof AluExp) throw new Error("internal: AluExp source cannot have pending executes");
 	}
 	/** @ignore */
 	get aval() {
-		return new ShapedArray(this.#st.shape, this.#dtype);
+		return new ShapedArray(this.#st.shape, this.#dtype, this.#weakType);
 	}
 	/** Return a simple string representation of the array's dimensions. */
 	toString() {
@@ -1434,6 +1462,17 @@ var Array$1 = class Array$1 extends Tracer {
 	#check() {
 		if (this.#rc <= 0) throw new UseAfterFreeError(this);
 	}
+	/** Construct an array, copying fields from `this`. */
+	#newArrayFrom(args) {
+		return new Array$1({
+			source: args.source ?? this.#source,
+			st: args.st ?? this.#st,
+			dtype: args.dtype ?? this.#dtype,
+			weakType: this.#weakType,
+			backend: args.backend ?? this.#backend,
+			pending: args.pending ?? this.#pending ?? void 0
+		});
+	}
 	get ref() {
 		this.#check();
 		this.#rc++;
@@ -1473,7 +1512,10 @@ var Array$1 = class Array$1 extends Tracer {
 		const pending = this.#pending;
 		for (const exe of pending) exe.updateRc(1);
 		if (typeof this.#source === "number") this.#backend.incRef(this.#source);
-		const ar = new Array$1(this.#source, st, this.#dtype, this.#backend, { pending });
+		const ar = this.#newArrayFrom({
+			st,
+			pending
+		});
 		this.dispose();
 		return ar;
 	}
@@ -1522,7 +1564,11 @@ var Array$1 = class Array$1 extends Tracer {
 		pending.push(new PendingExecute(this.#backend, kernel, inputs, [output]));
 		this.dispose();
 		for (const ar of indices) ar.dispose();
-		return new Array$1(output, ShapeTracker.fromShape(finalShape), this.#dtype, this.#backend, { pending });
+		return this.#newArrayFrom({
+			source: output,
+			st: ShapeTracker.fromShape(finalShape),
+			pending
+		});
 	}
 	/** Move axes to the rightmost dimension of the shape. */
 	#moveAxesDown(axis) {
@@ -1545,11 +1591,16 @@ var Array$1 = class Array$1 extends Tracer {
 		return this.#reshape(this.#st.permute(perm));
 	}
 	#unary(op, dtypeOutput) {
+		const weakType = !dtypeOutput && this.#weakType;
 		dtypeOutput ??= this.#dtype;
 		this.#check();
 		if (this.#source instanceof AluExp) {
 			const exp$3 = new AluExp(op, dtypeOutput, [this.#source]);
-			return new Array$1(exp$3.simplify(), this.#st, dtypeOutput, this.#backend);
+			return this.#newArrayFrom({
+				source: exp$3.simplify(),
+				dtype: dtypeOutput,
+				weakType
+			});
 		}
 		const indices = unravelAlu(this.#st.shape, AluVar.gidx);
 		const exp$2 = new AluExp(op, dtypeOutput, [AluExp.globalView(this.#dtype, 0, this.#st, indices)]);
@@ -1559,41 +1610,65 @@ var Array$1 = class Array$1 extends Tracer {
 		for (const exe of pending) exe.updateRc(1);
 		pending.push(new PendingExecute(this.#backend, kernel, [this.#source], [output]));
 		this.dispose();
-		return new Array$1(output, ShapeTracker.fromShape(this.shape), dtypeOutput, this.#backend, { pending });
+		return this.#newArrayFrom({
+			source: output,
+			st: ShapeTracker.fromShape(this.shape),
+			dtype: dtypeOutput,
+			weakType,
+			pending
+		});
 	}
 	#binary(op, other) {
-		const custom = (src) => new AluExp(op, this.#dtype, src);
+		const custom = (src) => new AluExp(op, src[0].dtype, src);
 		return Array$1.#naryCustom(op, custom, [this, other]);
 	}
-	static #naryCustom(name, custom, arrays, { dtypeOverride, dtypeOutput, reduceAxis } = {}) {
+	static #naryCustom(name, custom, arrays, { dtypeOverride, strongTypeOutput, reduceAxis } = {}) {
 		const n = arrays.length;
 		const backend = arrays[0].#backend;
 		if (n === 0) throw new TypeError(`No inputs for ${name}`);
 		for (const ar of arrays) ar.#check();
-		let dtype;
+		let castDtype;
+		let castWeakType = true;
 		for (let i = 0; i < n; i++) {
 			if (dtypeOverride?.[i]) {
 				if (arrays[i].#dtype !== dtypeOverride[i]) throw new TypeError(`Wrong dtype in ${name}: expected ${dtypeOverride[i]}, got ${arrays[i].#dtype}`);
-			} else if (!dtype) dtype = arrays[i].#dtype;
-			else if (arrays[i].#dtype !== dtype) throw new TypeError(`Dtype mismatch in ${name}: ${dtype} vs ${arrays[i].#dtype}`);
+			} else if (castDtype === void 0) {
+				castDtype = arrays[i].#dtype;
+				castWeakType = arrays[i].#weakType;
+			} else ({dtype: castDtype, weakType: castWeakType} = promoteAvals(new ShapedArray([], castDtype, castWeakType), new ShapedArray([], arrays[i].#dtype, arrays[i].#weakType)));
 			if (arrays[i].#backend !== backend) throw new TypeError(`Backend mismatch in ${name}: ${backend.type} vs ${arrays[i].#backend.type}`);
 		}
-		dtypeOutput ??= dtype;
-		if (!dtypeOutput) throw new TypeError("nary operation with no dtype");
+		const weakType = castWeakType && !strongTypeOutput;
 		arrays = Array$1.#broadcastArrays(arrays);
 		const newShape = [...arrays[0].shape];
 		if (arrays.every((ar) => ar.#source instanceof AluExp) && !reduceAxis) {
+			const sources = arrays.map((ar, i) => {
+				if (!dtypeOverride?.[i]) return AluExp.cast(castDtype, ar.#source);
+				else return ar.#source;
+			});
 			if (arrays.every((ar) => deepEqual(ar.#st, arrays[0].#st))) {
-				const exp$4 = custom(arrays.map((ar) => ar.#source));
-				return new Array$1(exp$4.simplify(), arrays[0].#st, exp$4.dtype, backend);
+				const exp$4 = custom(sources);
+				return new Array$1({
+					source: exp$4.simplify(),
+					st: arrays[0].#st,
+					dtype: exp$4.dtype,
+					weakType,
+					backend
+				});
 			}
-			const exp$3 = custom(arrays.map((ar) => {
-				const src$1 = ar.#source;
+			const exp$3 = custom(arrays.map((ar, i) => {
+				const src$1 = sources[i];
 				if (ar.#st.contiguous) return src$1;
 				return accessorAluExp(src$1, ar.#st, unravelAlu(newShape, AluVar.idx));
 			}));
 			const st = ShapeTracker.fromShape(newShape);
-			return new Array$1(exp$3.simplify(), st, exp$3.dtype, backend);
+			return new Array$1({
+				source: exp$3.simplify(),
+				st,
+				dtype: exp$3.dtype,
+				weakType,
+				backend
+			});
 		}
 		let indices;
 		if (!reduceAxis) indices = unravelAlu(newShape, AluVar.gidx);
@@ -1603,14 +1678,19 @@ var Array$1 = class Array$1 extends Tracer {
 		}
 		const inputs = [];
 		const src = [];
-		for (const ar of arrays) if (ar.#source instanceof AluExp) src.push(accessorAluExp(ar.#source, ar.#st, indices));
-		else {
-			let gid = inputs.indexOf(ar.#source);
-			if (gid === -1) {
-				gid = inputs.length;
-				inputs.push(ar.#source);
+		for (const [i, ar] of arrays.entries()) {
+			let nextSrc;
+			if (ar.#source instanceof AluExp) nextSrc = accessorAluExp(ar.#source, ar.#st, indices);
+			else {
+				let gid = inputs.indexOf(ar.#source);
+				if (gid === -1) {
+					gid = inputs.length;
+					inputs.push(ar.#source);
+				}
+				nextSrc = AluExp.globalView(ar.#dtype, gid, ar.#st, indices);
 			}
-			src.push(AluExp.globalView(ar.#dtype, gid, ar.#st, indices));
+			if (!dtypeOverride?.[i]) nextSrc = AluExp.cast(castDtype, nextSrc);
+			src.push(nextSrc);
 		}
 		const exp$2 = custom(src);
 		let re = void 0;
@@ -1624,12 +1704,17 @@ var Array$1 = class Array$1 extends Tracer {
 		for (const exe of pending) exe.updateRc(1);
 		pending.add(new PendingExecute(backend, kernel, inputs, [output]));
 		for (const ar of arrays) ar.dispose();
-		return new Array$1(output, ShapeTracker.fromShape(newShape), dtypeOutput, backend, { pending });
+		return new Array$1({
+			source: output,
+			st: ShapeTracker.fromShape(newShape),
+			dtype: kernel.dtype,
+			weakType,
+			backend,
+			pending
+		});
 	}
 	/** Reduce the last dimension of the array by an operation. */
 	#reduce(op) {
-		this.#check();
-		if (this.ndim === 0) throw new Error("Cannot reduce a scalar");
 		const shape$1 = this.shape;
 		const reduction = new Reduction(this.#dtype, op, shape$1[shape$1.length - 1]);
 		const newShape = shape$1.slice(0, -1);
@@ -1648,7 +1733,11 @@ var Array$1 = class Array$1 extends Tracer {
 		for (const exe of pending) exe.updateRc(1);
 		pending.push(new PendingExecute(this.#backend, kernel, inputs, [output]));
 		this.dispose();
-		return new Array$1(output, ShapeTracker.fromShape(newShape), this.#dtype, this.#backend, { pending });
+		return this.#newArrayFrom({
+			source: output,
+			st: ShapeTracker.fromShape(newShape),
+			pending
+		});
 	}
 	/**
 	* Normalizes this array into one backed by a `Slot`.
@@ -1684,8 +1773,8 @@ var Array$1 = class Array$1 extends Tracer {
 	}
 	#dataInline() {
 		this.#check();
-		const exp$2 = this.#source;
-		const ar = new Array$1(exp$2, this.#st, this.dtype, getBackend("cpu"));
+		if (!(this.#source instanceof AluExp)) throw new Error("internal: #dataInline called on non-AluExp source");
+		const ar = this.#newArrayFrom({ backend: getBackend("cpu") });
 		this.dispose();
 		return ar.dataSync();
 	}
@@ -1811,7 +1900,11 @@ var Array$1 = class Array$1 extends Tracer {
 					x.#backend.incRef(x.#source);
 					const pending = x.#pending;
 					for (const exe of pending) exe.updateRc(1);
-					const y = new Array$1(x.#source, x.#st, dtype, x.#backend, { pending });
+					const y = x.#newArrayFrom({
+						dtype,
+						weakType: false,
+						pending
+					});
 					x.dispose();
 					return [y];
 				}
@@ -1886,7 +1979,7 @@ var Array$1 = class Array$1 extends Tracer {
 			},
 			[Primitive.Compare]([x, y], { op }) {
 				const custom = ([x$1, y$1]) => aluCompare(x$1, y$1, op);
-				return [Array$1.#naryCustom("compare", custom, [x, y], { dtypeOutput: DType.Bool })];
+				return [Array$1.#naryCustom("compare", custom, [x, y], { strongTypeOutput: true })];
 			},
 			[Primitive.Where]([cond, x, y]) {
 				const custom = ([cond$1, x$1, y$1]) => AluExp.where(cond$1, x$1, y$1);
@@ -1932,7 +2025,14 @@ var Array$1 = class Array$1 extends Tracer {
 				pending.splice(0, 0, ...prevPending);
 				args.forEach((x) => x.dispose());
 				return outputs.map((source, i) => {
-					return new Array$1(source, ShapeTracker.fromShape(jaxpr.outs[i].aval.shape), jaxpr.outs[i].aval.dtype, backend, { pending });
+					return new Array$1({
+						source,
+						st: ShapeTracker.fromShape(jaxpr.outs[i].aval.shape),
+						dtype: jaxpr.outs[i].aval.dtype,
+						weakType: jaxpr.outs[i].aval.weakType,
+						backend,
+						pending
+					});
 				});
 			}
 		};
@@ -1942,33 +2042,11 @@ var Array$1 = class Array$1 extends Tracer {
 		return this.#source;
 	}
 };
-/** Construct an array from a single scalar constant. */
-function scalar(value, { dtype, device } = {}) {
-	if (typeof value === "number") {
-		dtype ??= DType.Float32;
-		if (![
-			DType.Float32,
-			DType.Float16,
-			DType.Int32,
-			DType.Uint32
-		].includes(dtype)) throw new TypeError(`Mismatched dtype for scalar ${value}`);
-	} else if (typeof value === "boolean") {
-		dtype ??= DType.Bool;
-		if (![
-			DType.Float32,
-			DType.Float16,
-			DType.Int32,
-			DType.Uint32,
-			DType.Bool
-		].includes(dtype)) throw new TypeError(`Mismatched dtype for scalar ${value}`);
-	} else throw new TypeError(`Invalid type for scalar ${value}`);
-	return new Array$1(AluExp.const(dtype, value), ShapeTracker.fromShape([]), dtype, getBackend(device));
-}
 /** Constructor for creating a new array from data. */
 function array(values, { shape: shape$1, dtype, device } = {}) {
 	if (values instanceof Tracer) {
 		if (shape$1 && !deepEqual(values.shape, shape$1)) values = values.reshape(shape$1);
-		if (dtype && values.dtype !== dtype) throw new Error("array astype not implemented yet");
+		if (dtype && values.dtype !== dtype) values = values.astype(dtype);
 		return values;
 	} else if (ArrayBuffer.isView(values)) return arrayFromData(values, shape$1 ?? [values.length], {
 		dtype,
@@ -1990,6 +2068,10 @@ function array(values, { shape: shape$1, dtype, device } = {}) {
 			dtype,
 			device
 		});
+		if (size$1 === 1) return full(shape$1, flat[0], {
+			dtype,
+			device
+		});
 		if (typeof flat[0] === "boolean") {
 			dtype = dtype ?? DType.Bool;
 			const data = new Int32Array(flat.map((x) => x ? 1 : 0));
@@ -1998,46 +2080,51 @@ function array(values, { shape: shape$1, dtype, device } = {}) {
 				device
 			});
 		} else {
+			const weakType = dtype == void 0;
 			dtype = dtype ?? DType.Float32;
 			const data = dtypedJsArray(dtype, flat);
 			return arrayFromData(data, shape$1, {
 				dtype,
 				device
-			});
+			}, weakType);
 		}
 	}
 }
-function arrayFromData(data, shape$1, { dtype, device } = {}) {
+function arrayFromData(data, shape$1, { dtype, device }, weakType = false) {
+	if (data instanceof Float32Array) {
+		if (dtype && dtype !== DType.Float32) throw new Error("Float32Array must have float32 type");
+		dtype ??= DType.Float32;
+	} else if (data instanceof Int32Array) {
+		if (dtype && dtype !== DType.Int32 && dtype !== DType.Bool) throw new Error("Int32Array must have int32 or bool type");
+		dtype ??= DType.Int32;
+	} else if (data instanceof Uint32Array) {
+		if (dtype && dtype !== DType.Uint32) throw new Error("Uint32Array must have uint32 type");
+		dtype ??= DType.Uint32;
+	} else if (data instanceof Float16Array) {
+		if (dtype && dtype !== DType.Float16) throw new Error("Float16Array must have float16 type");
+		dtype ??= DType.Float16;
+	} else throw new Error("Unsupported data array type: " + data.constructor.name);
 	if (data.length < inlineArrayLimit) {
 		let allEqual = true;
 		for (let i = 1; i < data.length; i++) if (data[i] !== data[0]) {
 			allEqual = false;
 			break;
 		}
-		if (allEqual) return full(shape$1, data[0], {
-			dtype,
-			device
-		});
+		if (allEqual) {
+			const sa = new ShapedArray(shape$1, dtype, weakType);
+			return fullInternal(sa, data[0], device);
+		}
 	}
 	const backend = getBackend(device);
-	if (ArrayBuffer.isView(data)) {
-		const buf = new Uint8Array(data.buffer, data.byteOffset, data.byteLength);
-		if (data instanceof Float32Array) {
-			if (dtype && dtype !== DType.Float32) throw new Error("Float32Array must have float32 type");
-			dtype ??= DType.Float32;
-		} else if (data instanceof Int32Array) {
-			if (dtype && dtype !== DType.Int32 && dtype !== DType.Bool) throw new Error("Int32Array must have int32 or bool type");
-			dtype ??= DType.Int32;
-		} else if (data instanceof Uint32Array) {
-			if (dtype && dtype !== DType.Uint32) throw new Error("Uint32Array must have uint32 type");
-			dtype ??= DType.Uint32;
-		} else if (data instanceof Float16Array) {
-			if (dtype && dtype !== DType.Float16) throw new Error("Float16Array must have float16 type");
-			dtype ??= DType.Float16;
-		} else throw new Error("Unsupported data array type: " + data.constructor.name);
-		const slot = backend.malloc(data.byteLength, buf);
-		return new Array$1(slot, ShapeTracker.fromShape(shape$1), dtype, backend);
-	} else throw new Error("Unsupported data type: " + data.constructor.name);
+	const buf = new Uint8Array(data.buffer, data.byteOffset, data.byteLength);
+	const slot = backend.malloc(data.byteLength, buf);
+	return new Array$1({
+		source: slot,
+		st: ShapeTracker.fromShape(shape$1),
+		dtype,
+		weakType,
+		backend
+	});
 }
 function dataToJs(dtype, data, shape$1) {
 	if (shape$1.length === 0) return dtype === DType.Bool ? Boolean(data[0]) : data[0];
@@ -2053,7 +2140,7 @@ function dataToJs(dtype, data, shape$1) {
 /** If x is a value, lift it into an array, otherwise leave it be. */
 function pureArray(x) {
 	if (x instanceof Tracer) return x;
-	else return scalar(x);
+	else return array(x);
 }
 var EvalTrace = class extends Trace {
 	pure = (x) => pureArray(x);
@@ -2064,20 +2151,27 @@ var EvalTrace = class extends Trace {
 };
 const baseArrayTrace = new EvalTrace(newMain(EvalTrace, null));
 const implRules = Array$1._implRules();
+function fullInternal(aval, fillValue, device) {
+	return new Array$1({
+		source: AluExp.const(aval.dtype, fillValue),
+		st: ShapeTracker.fromShape(aval.shape),
+		dtype: aval.dtype,
+		weakType: aval.weakType,
+		backend: getBackend(device)
+	});
+}
 function zerosLike$1(val, dtype) {
-	const aval = getAval(val);
-	if (val instanceof Tracer) val.dispose();
-	return zeros(aval.shape, { dtype: dtype ?? aval.dtype });
+	return fullLike(val, 0, dtype);
 }
 function onesLike$1(val, dtype) {
-	const aval = getAval(val);
-	if (val instanceof Tracer) val.dispose();
-	return ones(aval.shape, { dtype: dtype ?? aval.dtype });
+	return fullLike(val, 1, dtype);
 }
 function fullLike(val, fillValue, dtype) {
 	const aval = getAval(val);
 	if (val instanceof Tracer) val.dispose();
-	return full(aval.shape, fillValue, { dtype: dtype ?? aval.dtype });
+	if (fillValue instanceof Tracer) throw new Error("numpy.fullLike() with array argument not implemented yet");
+	const sa = new ShapedArray(aval.shape, dtype ?? aval.dtype, aval.weakType);
+	return fullInternal(sa, fillValue);
 }
 /** Return a new array of given shape and type, filled with zeros. */
 function zeros(shape$1, { dtype, device } = {}) {
@@ -2095,19 +2189,14 @@ function ones(shape$1, { dtype, device } = {}) {
 }
 /** Return a new array of given shape and type, filled with `fill_value`. */
 function full(shape$1, fillValue, { dtype, device } = {}) {
-	let source;
-	if (typeof fillValue === "number") {
-		dtype = dtype ?? DType.Float32;
-		source = AluExp.const(dtype, fillValue);
-	} else if (typeof fillValue === "bigint") {
-		dtype = dtype ?? DType.Int32;
-		source = AluExp.const(dtype, Number(fillValue));
-	} else if (typeof fillValue === "boolean") {
+	let weakType = dtype == void 0;
+	if (typeof fillValue === "number") dtype = dtype ?? DType.Float32;
+	else if (typeof fillValue === "boolean") {
 		dtype = dtype ?? DType.Bool;
-		source = AluExp.const(dtype, fillValue ? 1 : 0);
+		weakType = false;
 	} else if (fillValue instanceof Tracer) throw new Error("numpy.full() with array argument not implemented yet");
 	else throw new TypeError(`Invalid type for full: ${fillValue}`);
-	return new Array$1(source, ShapeTracker.fromShape(shape$1), dtype ?? DType.Float32, getBackend(device));
+	return fullInternal(new ShapedArray(shape$1, dtype, weakType), fillValue, device);
 }
 /**
 * Create an identity matrix.
@@ -2117,6 +2206,7 @@ function full(shape$1, fillValue, { dtype, device } = {}) {
 */
 function eye(numRows, numCols, { dtype, device } = {}) {
 	numCols = numCols ?? numRows;
+	const weakType = dtype == void 0;
 	dtype = dtype ?? DType.Float32;
 	if (numCols < numRows) {
 		const arr = eye(numCols, numRows, {
@@ -2130,7 +2220,13 @@ function eye(numRows, numCols, { dtype, device } = {}) {
 		device
 	});
 	const exp$2 = AluExp.cmplt(AluExp.mod(AluVar.idx, AluExp.i32(numCols + 1)), AluExp.i32(1));
-	return new Array$1(AluExp.cast(dtype, exp$2), ShapeTracker.fromShape([numRows, numCols]), dtype, getBackend(device));
+	return new Array$1({
+		source: AluExp.cast(dtype, exp$2),
+		st: ShapeTracker.fromShape([numRows, numCols]),
+		dtype,
+		weakType,
+		backend: getBackend(device)
+	});
 }
 /** Return the identity matrix, with ones on the main diagonal. */
 function identity$1(n, { dtype, device } = {}) {
@@ -2167,7 +2263,13 @@ function arange(start, stop, step = 1, { dtype, device } = {}) {
 	});
 	const exp$2 = AluExp.add(AluExp.const(dtype, start), AluExp.mul(AluExp.cast(dtype, AluVar.idx), AluExp.const(dtype, step)));
 	const st = ShapeTracker.fromShape([size$1]);
-	return new Array$1(exp$2, st, dtype, getBackend(device));
+	return new Array$1({
+		source: exp$2,
+		st,
+		dtype,
+		weakType: false,
+		backend: getBackend(device)
+	});
 }
 /**
 * Return evenly spaced numbers over a specified interval.
@@ -2185,10 +2287,10 @@ function linspace(start, stop, num = 50, endpoint = true, { dtype, device } = {}
 		dtype,
 		device
 	});
-	else if (num === 1) return scalar(start, {
+	else if (num === 1) return full([1], start, {
 		dtype,
 		device
-	}).reshape([1]);
+	});
 	else if (start === stop) return full([num], start, {
 		dtype,
 		device
@@ -2197,7 +2299,13 @@ function linspace(start, stop, num = 50, endpoint = true, { dtype, device } = {}
 	const denom = endpoint ? num - 1 : num;
 	const exp$2 = AluExp.cast(dtype, AluExp.add(AluExp.f32(start), AluExp.mul(AluExp.f32(delta / denom), AluExp.cast(DType.Float32, AluVar.idx))));
 	const st = ShapeTracker.fromShape([num]);
-	return new Array$1(exp$2, st, dtype, getBackend(device));
+	return new Array$1({
+		source: exp$2,
+		st,
+		dtype,
+		weakType: false,
+		backend: getBackend(device)
+	});
 }
 function aluCompare(a, b, op) {
 	switch (op) {
@@ -2209,35 +2317,6 @@ function aluCompare(a, b, op) {
 		case CompareOp.LessEqual: return AluExp.add(AluExp.cmplt(a, b), AluExp.cmpne(a, b).not());
 	}
 }
-/**
-* Implements a NumPy-style generalized broadcast rule on two array shapes.
-*
-* "When operating on two arrays, NumPy compares their shapes element-wise. It
-* starts with the trailing (i.e. rightmost) dimension and works its way left.
-* Two dimensions are compatible when:
-*   1. they are equal, or
-*   2. one of them is 1."
-*
-* Throws a TypeError if the broadcast is not possible.
-*
-* <https://numpy.org/doc/stable/user/basics.broadcasting.html#general-broadcasting-rules>
-*/
-function generalBroadcast(a, b) {
-	const out = [];
-	let i = a.length - 1;
-	let j = b.length - 1;
-	for (; i >= 0 && j >= 0; i--, j--) {
-		const x = a[i];
-		const y = b[j];
-		if (x === y) out.push(x);
-		else if (x === 1) out.push(y);
-		else if (y === 1) out.push(x);
-		else throw new TypeError(`Incompatible array broadcast shapes: ${a} vs ${b}`);
-	}
-	for (; i >= 0; i--) out.push(a[i]);
-	for (; j >= 0; j--) out.push(b[j]);
-	return out.reverse();
-}
 
 //#endregion
 //#region node_modules/.pnpm/@oxc-project+runtime@0.78.0/node_modules/@oxc-project/runtime/src/helpers/esm/usingCtx.js
@@ -2313,13 +2392,15 @@ var Var = class Var {
 };
 /** Literal in a Jaxpr expression. Currently, only scalars are supported. */
 var Lit = class {
-	dtype;
 	value;
 	aval;
-	constructor(dtype, value) {
-		this.dtype = dtype;
+	get dtype() {
+		return this.aval.dtype;
+	}
+	constructor(aval, value) {
+		if (aval.shape.length !== 0) throw new Error(`internal: Lit must be a scalar`);
 		this.value = value;
-		this.aval = new ShapedArray([], dtype);
+		this.aval = ShapedArray.fromAval(aval);
 	}
 };
 function atomIsLit(atom, literal) {
@@ -2443,14 +2524,19 @@ var Jaxpr = class Jaxpr {
 				const c = eqn.outBinders[0];
 				if (atomIsLit(a, 0)) context.set(c, b);
 				else if (atomIsLit(b, 0)) context.set(c, a);
-				else if (atomIsLit(a) && atomIsLit(b)) context.set(c, new Lit(a.dtype, a.dtype === DType.Bool ? Math.min(a.value + b.value, 1) : a.value + b.value));
+				else if (atomIsLit(a) && atomIsLit(b)) context.set(c, new Lit(promoteAvals(a.aval, b.aval), a.dtype === DType.Bool ? Math.min(a.value + b.value, 1) : a.value + b.value));
+				else newEqns.push(eqn);
+			} else if (eqn.primitive === Primitive.Neg) {
+				const [a] = inputs;
+				const c = eqn.outBinders[0];
+				if (atomIsLit(a)) context.set(c, new Lit(a.aval, -a.value));
 				else newEqns.push(eqn);
 			} else if (eqn.primitive === Primitive.Mul) {
 				const [a, b] = inputs;
 				const c = eqn.outBinders[0];
 				if (atomIsLit(a, 1)) context.set(c, b);
 				else if (atomIsLit(b, 1)) context.set(c, a);
-				else if (atomIsLit(a) && atomIsLit(b)) context.set(c, new Lit(a.dtype, a.value * b.value));
+				else if (atomIsLit(a) && atomIsLit(b)) context.set(c, new Lit(promoteAvals(a.aval, b.aval), a.value * b.value));
 				else newEqns.push(eqn);
 			} else if (eqn.primitive === Primitive.Idiv) {
 				const [a, b] = inputs;
@@ -2548,7 +2634,7 @@ function evalJaxpr(jaxpr, args) {
 		if (x instanceof Var) {
 			remainingRefs.set(x, (remainingRefs.get(x) ?? 0) - 1);
 			return env.get(x);
-		} else return scalar(x.value, { dtype: x.dtype });
+		} else return array(x.value, { dtype: x.dtype });
 	};
 	const write = (v, val) => {
 		if (env.has(v)) throw new Error(`Variable already bound: ${v}`);
@@ -2607,7 +2693,7 @@ var JaxprTrace = class extends Trace {
 		let tracer = this.builder.constTracers.get(val);
 		if (tracer === void 0) {
 			tracer = this.builder.newTracer(this, ShapedArray.fromAval(getAval(val)));
-			this.builder.addConst(tracer, val instanceof Tracer ? val.ref : scalar(val));
+			this.builder.addConst(tracer, val instanceof Tracer ? val.ref : array(val));
 		}
 		return tracer;
 	}
@@ -2676,7 +2762,7 @@ function _inlineLiterals(jaxpr, consts) {
 	const newConsts = [];
 	for (let i = 0; i < consts.length; i++) if (ndim$1(consts[i]) === 0 && consts[i] instanceof Array$1) {
 		const ar = consts[i];
-		literals.set(jaxpr.inBinders[i], new Lit(ar.dtype, ar.dataSync()[0]));
+		literals.set(jaxpr.inBinders[i], new Lit(ar.aval, ar.dataSync()[0]));
 	} else {
 		constBinders.push(jaxpr.inBinders[i]);
 		newConsts.push(consts[i]);
@@ -2689,13 +2775,12 @@ function _inlineLiterals(jaxpr, consts) {
 }
 function binopAbstractEval([x, y]) {
 	if (!(x instanceof ShapedArray) || !(y instanceof ShapedArray)) throw new TypeError("binopAbstractEval expects ShapedArray inputs");
-	if (x.dtype !== y.dtype) throw new TypeError(`Mismatched dtypes: ${x.dtype} vs ${y.dtype}`);
-	return [new ShapedArray(generalBroadcast(x.shape, y.shape), x.dtype)];
+	return [promoteAvals(x, y)];
 }
 function compareAbstractEval([x, y]) {
 	if (!(x instanceof ShapedArray) || !(y instanceof ShapedArray)) throw new TypeError("compareAbstractEval expects ShapedArray inputs");
-	if (x.dtype !== y.dtype) throw new TypeError(`Mismatched dtypes: ${x.dtype} vs ${y.dtype}`);
-	return [new ShapedArray(generalBroadcast(x.shape, y.shape), DType.Bool)];
+	const aval = promoteAvals(x, y);
+	return [new ShapedArray(aval.shape, DType.Bool, false)];
 }
 function vectorizedUnopAbstractEval([x]) {
 	return [ShapedArray.fromAval(x)];
@@ -2708,18 +2793,18 @@ const abstractEvalRules = {
 	[Primitive.Reciprocal]: vectorizedUnopAbstractEval,
 	[Primitive.StopGradient]: vectorizedUnopAbstractEval,
 	[Primitive.Cast]([x], { dtype }) {
-		return [new ShapedArray(x.shape, dtype)];
+		return [new ShapedArray(x.shape, dtype, false)];
 	},
 	[Primitive.Bitcast]([x], { dtype }) {
 		if (x.dtype === DType.Bool || dtype === DType.Bool) throw new TypeError("Bitcast to/from bool is not allowed");
 		if (byteWidth(x.dtype) !== byteWidth(dtype)) throw new TypeError(`Bitcast from ${x.dtype} to ${dtype} with different byte width`);
-		return [new ShapedArray(x.shape, dtype)];
+		return [new ShapedArray(x.shape, dtype, false)];
 	},
 	[Primitive.RandomBits]([k0, k1], { shape: shape$1 }) {
 		if (k0.dtype !== DType.Uint32 || k1.dtype !== DType.Uint32) throw new TypeError(`RandomBits requires uint32 keys, got ${k0.dtype} and ${k1.dtype}`);
 		const keyShape = generalBroadcast(k0.shape, k1.shape);
 		if (!deepEqual(generalBroadcast(keyShape, shape$1), shape$1)) throw new TypeError(`Keys of shapes ${k0.shape} and ${k1.shape} cannot be broadcast to shape ${shape$1}`);
-		return [new ShapedArray(shape$1, DType.Uint32)];
+		return [new ShapedArray(shape$1, DType.Uint32, false)];
 	},
 	[Primitive.Sin]: vectorizedUnopAbstractEval,
 	[Primitive.Cos]: vectorizedUnopAbstractEval,
@@ -2733,55 +2818,54 @@ const abstractEvalRules = {
 	[Primitive.Reduce]([x], { axis }) {
 		const axisSet = new Set(axis);
 		const newShape = x.shape.filter((_, i) => !axisSet.has(i));
-		return [new ShapedArray(newShape, x.dtype)];
+		return [new ShapedArray(newShape, x.dtype, x.weakType)];
 	},
 	[Primitive.Pool]([x], { window, strides }) {
 		const shape$1 = checkPoolShape(x.shape, window, strides);
-		return [new ShapedArray(shape$1, x.dtype)];
+		return [new ShapedArray(shape$1, x.dtype, x.weakType)];
 	},
 	[Primitive.PoolTranspose]([x], { inShape, window, strides }) {
 		const shape$1 = checkPoolShape(inShape, window, strides);
 		if (!deepEqual(shape$1, x.shape)) throw new TypeError(`PoolTranspose shape mismatch: expected ${JSON.stringify(shape$1)}, got ${JSON.stringify(x.shape)}`);
-		return [new ShapedArray(inShape, x.dtype)];
+		return [new ShapedArray(inShape, x.dtype, x.weakType)];
 	},
 	[Primitive.Dot]([x, y]) {
-		if (x.dtype !== y.dtype) throw new TypeError(`Dot dtype mismatch, got ${x.dtype} vs ${y.dtype}`);
 		if (x.ndim === 0 && y.ndim === 0) throw new TypeError("Dot requires at least 1D inputs");
-		const shape$1 = generalBroadcast(x.shape, y.shape);
+		const { shape: shape$1, dtype, weakType } = promoteAvals(x, y);
 		shape$1.splice(-1, 1);
-		return [new ShapedArray(shape$1, x.dtype)];
+		return [new ShapedArray(shape$1, dtype, weakType)];
 	},
 	[Primitive.Conv]([lhs, rhs], params) {
-		if (lhs.dtype !== rhs.dtype) throw new TypeError(`Conv dtype mismatch, got ${lhs.dtype} vs ${rhs.dtype}`);
+		const { dtype, weakType } = promoteAvals(new ShapedArray([], lhs.dtype, lhs.weakType), new ShapedArray([], rhs.dtype, rhs.weakType));
 		const shape$1 = checkConvShape(lhs.shape, rhs.shape, params);
-		return [new ShapedArray(shape$1, lhs.dtype)];
+		return [new ShapedArray(shape$1, dtype, weakType)];
 	},
 	[Primitive.Compare]: compareAbstractEval,
 	[Primitive.Where]([cond, x, y]) {
 		if (cond.dtype !== DType.Bool) throw new TypeError(`Condition must be boolean, got ${cond.dtype}`);
-		if (x.dtype !== y.dtype) throw new TypeError(`Mismatched dtypes: ${x.dtype} vs ${y.dtype}`);
-		const shape$1 = generalBroadcast(cond.shape, generalBroadcast(x.shape, y.shape));
-		return [new ShapedArray(shape$1, x.dtype)];
+		const xy = promoteAvals(x, y);
+		const shape$1 = generalBroadcast(cond.shape, xy.shape);
+		return [new ShapedArray(shape$1, xy.dtype, xy.weakType)];
 	},
 	[Primitive.Transpose]([x], { perm }) {
-		return [new ShapedArray(perm.map((i) => x.shape[i]), x.dtype)];
+		return [new ShapedArray(perm.map((i) => x.shape[i]), x.dtype, x.weakType)];
 	},
 	[Primitive.Broadcast]([x], { shape: shape$1 }) {
-		return [new ShapedArray(shape$1, x.dtype)];
+		return [new ShapedArray(shape$1, x.dtype, x.weakType)];
 	},
 	[Primitive.Reshape]([x], { shape: shape$1 }) {
-		return [new ShapedArray(shape$1, x.dtype)];
+		return [new ShapedArray(shape$1, x.dtype, x.weakType)];
 	},
 	[Primitive.Flip]([x], _) {
-		return [new ShapedArray(x.shape, x.dtype)];
+		return [ShapedArray.fromAval(x)];
 	},
 	[Primitive.Shrink]([x], { slice }) {
 		const newShape = slice.map((s) => s[1] - s[0]);
-		return [new ShapedArray(newShape, x.dtype)];
+		return [new ShapedArray(newShape, x.dtype, x.weakType)];
 	},
 	[Primitive.Pad]([x], { width }) {
 		const newShape = x.shape.map((dim, i) => dim + width[i][0] + width[i][1]);
-		return [new ShapedArray(newShape, x.dtype)];
+		return [new ShapedArray(newShape, x.dtype, x.weakType)];
 	},
 	[Primitive.Gather]([x, ...indices], { axis, outDim }) {
 		for (const a of indices) if (a.dtype !== DType.Int32 && a.dtype !== DType.Uint32) throw new TypeError(`Gather indices must be Int32 or Uint32, got ${a.dtype}`);
@@ -2794,7 +2878,7 @@ const abstractEvalRules = {
 		const gatherShape = indices.reduce((shape$1, a) => generalBroadcast(shape$1, a.shape), []);
 		const newShape = x.shape.filter((_, i) => !axisSet.has(i));
 		newShape.splice(outDim, 0, ...gatherShape);
-		return [new ShapedArray(newShape, x.dtype)];
+		return [new ShapedArray(newShape, x.dtype, x.weakType)];
 	},
 	[Primitive.JitCall](args, { jaxpr }) {
 		const { inTypes, outTypes } = typecheckJaxpr(jaxpr);
@@ -2861,6 +2945,7 @@ function jit$1(f, opts) {
 		const cacheKey = JSON.stringify(jaxprArgs);
 		const { jaxpr, consts, treedef: outTree } = runWithCache(cache, cacheKey, () => makeJaxpr$1(f, opts)(...jaxprArgs));
 		const outs = bind(Primitive.JitCall, [...consts.map((c) => c.ref), ...argsFlat], {
+			name: f.name || "closure",
 			jaxpr,
 			numConsts: consts.length
 		});
@@ -3022,13 +3107,14 @@ const jvpRules = {
 		const indicesRef = indices.map((t) => t.ref);
 		return [[gather(x, indices, axis, outDim)], [gather(dx, indicesRef, axis, outDim)]];
 	},
-	[Primitive.JitCall](primals, tangents, { jaxpr }) {
+	[Primitive.JitCall](primals, tangents, { name, jaxpr }) {
 		const { newJaxpr, newConsts } = jvpJaxpr(jaxpr);
 		const outs = bind(Primitive.JitCall, [
 			...newConsts.map((c) => c.ref),
 			...primals,
 			...tangents
 		], {
+			name: `${name}_jvp`,
 			jaxpr: newJaxpr,
 			numConsts: newConsts.length
 		});
@@ -3082,7 +3168,7 @@ function jvp$1(f, primals, tangents) {
 function mappedAval(batchDim, aval) {
 	const shape$1 = [...aval.shape];
 	shape$1.splice(batchDim, 1);
-	return new ShapedArray(shape$1, aval.dtype);
+	return new ShapedArray(shape$1, aval.dtype, aval.weakType);
 }
 /** Move one axis to a different index. */
 function moveaxis$1(x, src, dst) {
@@ -3226,9 +3312,10 @@ const vmapRules = {
 		const newWidth = width.toSpliced(xBdim, 0, [0, 0]);
 		return [[pad$1(x, newWidth)], [xBdim]];
 	},
-	[Primitive.JitCall](axisSize, args, dims, { jaxpr }) {
+	[Primitive.JitCall](axisSize, args, dims, { name, jaxpr }) {
 		const { newJaxpr, newConsts } = vmapJaxpr(jaxpr, axisSize, dims);
 		const outs = bind(Primitive.JitCall, [...newConsts.map((c) => c.ref), ...args], {
+			name: `${name}_vmap`,
 			jaxpr: newJaxpr,
 			numConsts: newConsts.length
 		});
@@ -3244,7 +3331,7 @@ function vmapJaxpr(jaxpr, axisSize, dims) {
 		if (dims[i] === null) return v.aval;
 		const shape$1 = [...v.aval.shape];
 		shape$1.splice(dims[i], 0, axisSize);
-		return new ShapedArray(shape$1, v.aval.dtype);
+		return new ShapedArray(shape$1, v.aval.dtype, v.aval.weakType);
 	});
 	const { jaxpr: newJaxpr, consts: newConsts } = makeJaxpr$1((args) => vmapFlat(jaxprAsFun(jaxpr), dims, args))(inAvals);
 	const result = {
@@ -3457,8 +3544,8 @@ var PartialEvalTrace = class extends Trace {
 	processPrimitive(primitive, tracers, params) {
 		if (tracers.every((t) => t.pval.isKnown)) return bind(primitive, tracers.map((t) => t.fullLower()), params);
 		if (primitive === Primitive.JitCall) {
-			const { jaxpr, numConsts } = params;
-			return this.#partialEvalJaxpr(jaxpr, numConsts, tracers);
+			const { name, jaxpr, numConsts } = params;
+			return this.#partialEvalJaxpr(name, jaxpr, numConsts, tracers);
 		}
 		const tracersIn = tracers.map((t) => this.instantiateConst(t));
 		const avalsIn = tracersIn.map((t) => t.pval.aval);
@@ -3484,12 +3571,13 @@ var PartialEvalTrace = class extends Trace {
 	*
 	* Used when encountering a JitCall rule during the trace.
 	*/
-	#partialEvalJaxpr(jaxpr, numConsts, tracers) {
+	#partialEvalJaxpr(name, jaxpr, numConsts, tracers) {
 		jaxpr = jaxpr.flatten();
 		const inUnknowns = tracers.map((t) => !t.pval.isKnown);
 		const { jaxpr1, jaxpr2, outUnknowns, numRes } = partialEvalJaxpr(jaxpr, inUnknowns);
 		const [knownTracers, unknownTracers] = partitionList(inUnknowns, tracers);
 		const outs1Res = bind(Primitive.JitCall, knownTracers.map((t) => t.ref.fullLower()), {
+			name: `${name}_peval`,
 			jaxpr: jaxpr1,
 			numConsts: 0
 		});
@@ -3501,6 +3589,7 @@ var PartialEvalTrace = class extends Trace {
 			prim: Primitive.JitCall,
 			tracersIn: resTracers.concat(unknownTracers),
 			params: {
+				name: `${name}_resid`,
 				jaxpr: jaxpr2,
 				numConsts: 0
 			},
@@ -3643,7 +3732,7 @@ function evalJaxprTransposed(jaxpr, args, cotangents) {
 	}
 	for (let i = jaxpr.eqns.length - 1; i >= 0; i--) {
 		const eqn = jaxpr.eqns[i];
-		const primalsIn = eqn.inputs.map((v) => v instanceof Lit ? scalar(v.value, { dtype: v.dtype }) : knownPrimals.has(v) ? knownPrimals.get(v).ref : new UndefPrimal(v.aval));
+		const primalsIn = eqn.inputs.map((v) => v instanceof Lit ? array(v.value, { dtype: v.dtype }) : knownPrimals.has(v) ? knownPrimals.get(v).ref : new UndefPrimal(v.aval));
 		const cotangentsOut = eqn.outBinders.map(readCotangent);
 		const rule = transposeRules[eqn.primitive];
 		if (!rule) throw new TypeError(`Backward pass not implemented for ${eqn.primitive}`);
@@ -3823,7 +3912,7 @@ const transposeRules = {
 		if (indices.some((i) => i instanceof UndefPrimal)) throw new NonlinearError(Primitive.Gather);
 		throw new Error("Gather transpose rule is not yet implemented, requires complex Scatter sum operation");
 	},
-	[Primitive.JitCall](cts, args, { jaxpr }) {
+	[Primitive.JitCall](cts, args, { name, jaxpr }) {
 		const undefPrimals = args.map((x) => x instanceof UndefPrimal);
 		const { newJaxpr, newConsts } = transposeJaxpr(jaxpr, undefPrimals);
 		const residuals = args.filter((x, i$1) => !undefPrimals[i$1]);
@@ -3832,6 +3921,7 @@ const transposeRules = {
 			...residuals,
 			...cts
 		], {
+			name: `${name}_t`,
 			jaxpr: newJaxpr,
 			numConsts: newConsts.length
 		});
@@ -3906,7 +3996,7 @@ function valueAndGrad$1(f) {
 		const [y, fVjp] = vjp$1(f, x[0], ...x.slice(1).map(stopGradient));
 		if (!(y instanceof Tracer) || ndim$1(y) !== 0) throw new TypeError("grad requires a scalar output");
 		if (!isFloatDtype(y.dtype)) throw new TypeError("grad only supports floating-point dtypes");
-		const [ct, ...rest] = fVjp(scalar(1, { dtype: y.dtype }));
+		const [ct, ...rest] = fVjp(array(1, { dtype: y.dtype }));
 		for (const r of rest) dispose(r);
 		fVjp.dispose();
 		return [y, ct];
@@ -4276,7 +4366,7 @@ function argmin(a, axis, opts) {
 	} else axis = checkAxis(axis, a.ndim);
 	const shape$1 = a.shape;
 	const isMax = equal(a, min(a.ref, axis, { keepdims: true }));
-	const length = scalar(shape$1[axis], {
+	const length = array(shape$1[axis], {
 		dtype: int32,
 		device: a.device
 	});
@@ -4300,7 +4390,7 @@ function argmax(a, axis, opts) {
 	} else axis = checkAxis(axis, a.ndim);
 	const shape$1 = a.shape;
 	const isMax = equal(a, max(a.ref, axis, { keepdims: true }));
-	const length = scalar(shape$1[axis], {
+	const length = array(shape$1[axis], {
 		dtype: int32,
 		device: a.device
 	});
@@ -4716,7 +4806,7 @@ function acos(x) {
 * stable than sqrt(x1**2 + x2**2). We don't currently implement those stability
 * improvements.
 */
-const hypot = jit$1((x1, x2) => {
+const hypot = jit$1(function hypot$1(x1, x2) {
 	return sqrt(square(x1).add(square(x2)));
 });
 /**
@@ -4732,7 +4822,7 @@ const hypot = jit$1((x1, x2) => {
 *
 * The output is ill-defined when both x and y are zero.
 */
-const atan2 = jit$1((y, x) => {
+const atan2 = jit$1(function atan2$1(y, x) {
 	const r = sqrt(square(x.ref).add(square(y.ref)));
 	const xNeg = less(x.ref, 0);
 	const numer = where(xNeg.ref, r.ref.sub(x.ref), y.ref);
@@ -4800,13 +4890,13 @@ const degrees = rad2deg;
 * @function
 * Computes first array raised to power of second array, element-wise.
 */
-const power = jit$1((x1, x2) => {
+const power = jit$1(function power$1(x1, x2) {
 	return exp(log(x1).mul(x2));
 });
 /** @function Alias of `jax.numpy.power()`. */
 const pow = power;
 /** @function Calculate the element-wise cube root of the input array. */
-const cbrt = jit$1((x) => {
+const cbrt = jit$1(function cbrt$1(x) {
 	const sgn = where(less(x.ref, 0), -1, 1);
 	return sgn.ref.mul(exp(log(x.mul(sgn)).mul(1 / 3)));
 });
@@ -4816,7 +4906,7 @@ const cbrt = jit$1((x) => {
 *
 * `sinh(x) = (exp(x) - exp(-x)) / 2`
 */
-const sinh = jit$1((x) => {
+const sinh = jit$1(function sinh$1(x) {
 	const ex = exp(x);
 	const emx = reciprocal(ex.ref);
 	return ex.sub(emx).mul(.5);
@@ -4827,7 +4917,7 @@ const sinh = jit$1((x) => {
 *
 * `cosh(x) = (exp(x) + exp(-x)) / 2`
 */
-const cosh = jit$1((x) => {
+const cosh = jit$1(function cosh$1(x) {
 	const ex = exp(x);
 	const emx = reciprocal(ex.ref);
 	return ex.add(emx).mul(.5);
@@ -4838,7 +4928,7 @@ const cosh = jit$1((x) => {
 *
 * `tanh(x) = sinh(x)/cosh(x) = (exp(x) - exp(-x)) / (exp(x) + exp(-x))`
 */
-const tanh = jit$1((x) => {
+const tanh = jit$1(function tanh$1(x) {
 	const negsgn = where(less(x.ref, 0), 1, -1);
 	const en2x = exp(x.mul(negsgn.ref).mul(2));
 	return en2x.ref.sub(1).div(en2x.add(1)).mul(negsgn);
@@ -4849,7 +4939,7 @@ const tanh = jit$1((x) => {
 *
 * `arcsinh(x) = ln(x + sqrt(x^2 + 1))`
 */
-const arcsinh = jit$1((x) => {
+const arcsinh = jit$1(function arcsinh$1(x) {
 	return log(x.ref.add(sqrt(square(x).add(1))));
 });
 /**
@@ -4858,7 +4948,7 @@ const arcsinh = jit$1((x) => {
 *
 * `arccosh(x) = ln(x + sqrt(x^2 - 1))`
 */
-const arccosh = jit$1((x) => {
+const arccosh = jit$1(function arccosh$1(x) {
 	return log(x.ref.add(sqrt(square(x).sub(1))));
 });
 /**
@@ -4867,7 +4957,7 @@ const arccosh = jit$1((x) => {
 *
 * `arctanh(x) = 0.5 * ln((1 + x) / (1 - x))`
 */
-const arctanh = jit$1((x) => {
+const arctanh = jit$1(function arctanh$1(x) {
 	return log(add(1, x.ref).div(subtract(1, x))).mul(.5);
 });
 /** @function Alias of `jax.numpy.arcsinh()`. */
@@ -4983,7 +5073,9 @@ function softSign(x) {
 *
 * Reference: https://en.wikipedia.org/wiki/Swish_function
 */
-const silu = jit$1((x) => x.ref.mul(sigmoid(x)));
+const silu = jit$1(function silu$1(x) {
+	return x.ref.mul(sigmoid(x));
+});
 /**
 * @function
 * Sigmoid-weighted Linear Unit (SiLU) activation function, also known as
@@ -5044,7 +5136,7 @@ function celu(x, alpha = 1) {
 *
 * This will be improved in the future.
 */
-const gelu = jit$1((x) => {
+const gelu = jit$1(function gelu$1(x) {
 	const SQRT_2_OVER_PI = Math.sqrt(2 / Math.PI);
 	return x.ref.mul(.5).mul(tanh(x.ref.mul(x.ref.mul(x).mul(.044715).add(1)).mul(SQRT_2_OVER_PI)).add(1));
 });
@@ -5215,8 +5307,11 @@ function bits(key$1, shape$1 = []) {
 	const keyShape = validateKeyShape(key$1);
 	return randomBits(key$1.ref.slice(...keyShape.map(() => null), 0), key$1.slice(...keyShape.map(() => null), 1), shape$1);
 }
-/** Sample uniform random values in [minval, maxval) with given shape. */
-function uniform(key$1, shape$1 = [], { minval = 0, maxval = 1 } = {}) {
+/**
+* @function
+* Sample uniform random values in [minval, maxval) with given shape.
+*/
+const uniform = jit$1(function uniform$1(key$1, shape$1 = [], { minval = 0, maxval = 1 } = {}) {
 	if (minval >= maxval) throw new Error(`Invalid range: [${minval}, ${maxval}).`);
 	const mantissa = bits(key$1, shape$1).div(array(512, {
 		dtype: DType.Uint32,
@@ -5229,7 +5324,7 @@ function uniform(key$1, shape$1 = [], { minval = 0, maxval = 1 } = {}) {
 	const rand = bitcast(float12, DType.Float32).sub(1);
 	if (minval === 0 && maxval === 1) return rand;
 	else return rand.mul(maxval - minval).add(minval);
-}
+}, { staticArgnums: [1, 2] });
 /**
 * Sample Bernoulli random variables with given mean (0,1 categorical).
 *
@@ -5240,26 +5335,30 @@ function bernoulli(key$1, p = .5, shape$1 = []) {
 	p = fudgeArray(p);
 	return uniform(key$1, shape$1).less(p);
 }
-/** Sample exponential random values according to `p(x) = exp(-x)`. */
-function exponential(key$1, shape$1 = []) {
+/**
+* @function
+* Sample exponential random values according to `p(x) = exp(-x)`.
+*/
+const exponential = jit$1(function exponential$1(key$1, shape$1 = []) {
 	const u = uniform(key$1, shape$1);
 	return negative(log1p(negative(u)));
-}
+}, { staticArgnums: [1] });
 /**
+* @function
 * Sample random values according to `p(x) = 1/sqrt(2pi) * exp(-x^2/2)`.
 *
 * Unlike JAX, this uses the Box-Muller transform. JAX uses the erf_inv primitive instead and
 * directly inverts the CDF, but we don't have support for that yet. Outputs will not be
 * bitwise identical to JAX.
 */
-function normal(key$1, shape$1 = []) {
+const normal = jit$1(function normal$1(key$1, shape$1 = []) {
 	const [k1, k2] = split(key$1, 2);
 	const u1 = uniform(k1, shape$1);
 	const u2 = uniform(k2, shape$1);
 	const radius = sqrt(log1p(negative(u1)).mul(-2));
 	const theta = u2.mul(2 * Math.PI);
 	return radius.mul(cos(theta));
-}
+}, { staticArgnums: [1] });
 
 //#endregion
 //#region src/polyfills.ts