oarust 0.8.6

GPU-first semantic computing engine written in Rust
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
use std::path::Path;

use crate::{DType, Engine, Error, Matrix, Result};

use super::{
	CheckpointOptimizer, Module,
	model_file::{
		Config as PersistedConfig, ModelFile, Optimizer as PersistedOptimizer, Progress, ScalarType,
		Tensor, TensorEncoding,
	},
	optim::{OptimizerCheckpoint, OptimizerRestore},
};

mod manager;

pub use manager::{CheckpointManager, CheckpointManagerConfig};

pub(super) struct CheckpointProgress {
	pub(super) step: u64,
	pub(super) metric: f64,
	pub(super) metric_name: String,
	pub(super) lower_is_better: bool,
}

/// Private architecture metadata carried by an optimizer-free module artifact.
pub(crate) struct ModuleArtifactMetadata {
	pub(crate) architecture: String,
	pub(crate) config_version: u32,
	pub(crate) d_model: u32,
	pub(crate) n_layers: u32,
	pub(crate) d_vocab: u32,
	pub(crate) arch_config: Vec<u8>,
}

/// Validated, host-owned `.oam` artifact awaiting an exact module owner.
pub(crate) struct ModuleArtifact {
	file: ModelFile,
}

pub(crate) struct DenseArtifactTensor {
	pub(crate) name: String,
	pub(crate) shape: Vec<usize>,
	pub(crate) data: Vec<u8>,
}

impl ModuleArtifact {
	pub(crate) fn load(path: &Path) -> Result<Self> {
		Ok(Self {
			file: ModelFile::load(path)?,
		})
	}

	pub(crate) fn metadata(&self) -> ModuleArtifactMetadata {
		ModuleArtifactMetadata {
			architecture: self.file.config.architecture.clone(),
			config_version: self.file.config.config_version,
			d_model: self.file.config.d_model,
			n_layers: self.file.config.n_layers,
			d_vocab: self.file.config.d_vocab,
			arch_config: self.file.config.arch_config.clone(),
		}
	}

	pub(crate) fn restore(
		self,
		engine: &Engine,
		model: &dyn Module,
		artifact_name: impl Fn(&str) -> Result<String>,
	) -> Result<()> {
		let named = model.all_named_parameters()?;
		let buffers = model
			.all_named_buffers()?
			.into_iter()
			.filter(|buffer| buffer.persistent())
			.collect::<Vec<_>>();
		if self.file.weights.len() != named.len() || self.file.state.len() != buffers.len() {
			return Err(Error::checkpoint_corrupt(
				"module artifact tensor count does not match its architecture",
			));
		}
		let owner = engine.handle();
		if named
			.iter()
			.any(|entry| !entry.parameter().data().engine_handle().same_as(&owner))
			|| buffers
				.iter()
				.any(|entry| !entry.data().engine_handle().same_as(&owner))
		{
			return Err(Error::invalid_argument(
				"module artifact engine does not own the destination module",
			));
		}

		let mut loaded_parameters = Vec::with_capacity(named.len());
		for expected in &named {
			let path = artifact_name(expected.path())?;
			let tensor = self
				.file
				.weights
				.iter()
				.find(|tensor| tensor.name == path)
				.ok_or_else(|| Error::checkpoint_corrupt(format!("missing weight {path}")))?;
			let parameter = expected.parameter();
			validate_tensor_contract(tensor, &path, &parameter.data())?;
			loaded_parameters.push((parameter, matrix_from_tensor(engine, tensor)?));
		}
		let mut loaded_buffers = Vec::with_capacity(buffers.len());
		for expected in &buffers {
			let path = artifact_name(expected.path())?;
			let tensor = self
				.file
				.state
				.iter()
				.find(|tensor| tensor.name == path)
				.ok_or_else(|| Error::checkpoint_corrupt(format!("missing state {path}")))?;
			validate_tensor_contract(tensor, &path, &expected.data())?;
			loaded_buffers.push((expected, matrix_from_tensor(engine, tensor)?));
		}
		for (parameter, _) in &loaded_parameters {
			parameter.validate_can_update()?;
		}
		for (parameter, data) in loaded_parameters {
			parameter.replace_data(data)?;
			parameter.clear_gradient();
		}
		for (buffer, data) in loaded_buffers {
			buffer.replace_data(data)?;
		}
		Ok(())
	}
}

pub(crate) fn save_module_artifact(
	path: &Path,
	model: &dyn Module,
	metadata: ModuleArtifactMetadata,
	artifact_name: impl Fn(&str) -> Result<String>,
) -> Result<()> {
	let mut file = ModelFile::new();
	file.config = PersistedConfig {
		architecture: metadata.architecture,
		config_version: metadata.config_version,
		flags: 0,
		d_model: metadata.d_model,
		n_layers: metadata.n_layers,
		d_vocab: metadata.d_vocab,
		arch_config: metadata.arch_config,
		weight_dtype: ScalarType::F32,
		state_dtype: ScalarType::F32,
		compute_dtype: ScalarType::F32,
	};
	for entry in model.all_named_parameters()? {
		file.weights.push(matrix_tensor(
			&artifact_name(entry.path())?,
			&entry.parameter().data(),
		)?);
	}
	for entry in model
		.all_named_buffers()?
		.into_iter()
		.filter(|buffer| buffer.persistent())
	{
		file
			.state
			.push(matrix_tensor(&artifact_name(entry.path())?, &entry.data())?);
	}
	file.save(path)
}

pub(crate) fn save_dense_artifact(
	path: &Path,
	metadata: ModuleArtifactMetadata,
	tensors: Vec<DenseArtifactTensor>,
) -> Result<()> {
	let mut file = ModelFile::new();
	file.config = PersistedConfig {
		architecture: metadata.architecture,
		config_version: metadata.config_version,
		flags: 0,
		d_model: metadata.d_model,
		n_layers: metadata.n_layers,
		d_vocab: metadata.d_vocab,
		arch_config: metadata.arch_config,
		weight_dtype: ScalarType::F32,
		state_dtype: ScalarType::F32,
		compute_dtype: ScalarType::F32,
	};
	for tensor in tensors {
		let shape = tensor
			.shape
			.into_iter()
			.map(|extent| {
				u64::try_from(extent).map_err(|_| Error::resource_exhausted("artifact extent exceeds u64"))
			})
			.collect::<Result<Vec<_>>>()?;
		file
			.weights
			.push(Tensor::dense(tensor.name, DType::F32, shape, tensor.data)?);
	}
	file.save(path)
}

/// Save a module and its complete optimizer state in the native OA `.oam` format.
///
/// Registration-derived parameter paths become the Weights index. Persistent
/// module buffers become the State index; non-persistent buffers are excluded.
/// This is an explicit host-observation boundary. The completed file is
/// durably written to a sibling temporary path and atomically renamed.
///
/// # Errors
///
/// Returns an error for ambiguous module ownership, optimizer/model mismatch,
/// unsupported Matrix metadata, readback failure, arithmetic overflow, or a
/// filesystem failure.
pub fn save_checkpoint(
	path: impl AsRef<Path>,
	model: &dyn Module,
	optimizer: &dyn CheckpointOptimizer,
) -> Result<()> {
	save_checkpoint_with_progress(path.as_ref(), model, optimizer, None)
}

pub(super) fn save_checkpoint_with_progress(
	path: &Path,
	model: &dyn Module,
	optimizer: &dyn CheckpointOptimizer,
	progress: Option<CheckpointProgress>,
) -> Result<()> {
	let named = model.all_named_parameters()?;
	let buffers = model.all_named_buffers()?;
	let state_u32 = model.all_named_state_u32()?;
	let optimizer_state = optimizer.checkpoint_state()?;
	validate_optimizer_snapshot(&optimizer_state)?;
	if named.len() != optimizer_state.parameters.len() {
		return Err(Error::invalid_argument(
			"checkpoint optimizer does not cover the complete model parameter tree",
		));
	}

	let mut file = ModelFile::new();
	for entry in named {
		let parameter = entry.parameter();
		if !optimizer_state
			.parameters
			.iter()
			.any(|candidate| candidate.same_as(&parameter))
		{
			return Err(Error::invalid_argument(
				"checkpoint optimizer parameter does not match the model tree",
			));
		}
		file
			.weights
			.push(matrix_tensor(entry.path(), &parameter.data())?);
	}
	for buffer in buffers.into_iter().filter(|buffer| buffer.persistent()) {
		file
			.state
			.push(matrix_tensor(buffer.path(), &buffer.data())?);
	}
	for state in state_u32 {
		file.state.push(Tensor::dense(
			state.path(),
			DType::U32,
			Vec::new(),
			state.value().to_le_bytes().to_vec(),
		)?);
	}

	let mut first_moment = Vec::new();
	let mut second_moment = Vec::new();
	for first in &optimizer_state.first_state {
		first_moment.extend(first.read_f32()?);
	}
	for second in &optimizer_state.second_state {
		second_moment.extend(second.read_f32()?);
	}
	let step = i64::try_from(optimizer_state.step)
		.map_err(|_| Error::resource_exhausted("optimizer step exceeds .oam progress range"))?;
	file.optimizer = Some(PersistedOptimizer {
		kind: optimizer_state.kind.to_owned(),
		learning_rate: optimizer_state.learning_rate,
		beta1: optimizer_state.beta1,
		beta2: optimizer_state.beta2,
		epsilon: optimizer_state.epsilon,
		weight_decay: optimizer_state.weight_decay,
		step,
		first_moment,
		second_moment,
	});
	file.progress = match progress {
		Some(progress) => {
			if progress.step != optimizer_state.step || !progress.metric.is_finite() {
				return Err(Error::invalid_argument(
					"checkpoint progress does not match completed optimizer state",
				));
			}
			Progress {
				step,
				learning_rate: optimizer_state.learning_rate,
				best_metric: progress.metric as f32,
				lower_is_better: progress.lower_is_better,
				metric_name: progress.metric_name,
				..Progress::default()
			}
		}
		None => Progress {
			step,
			learning_rate: optimizer_state.learning_rate,
			..Progress::default()
		},
	};
	file.save(path)
}

/// Load a native OA `.oam` checkpoint into existing matching owners.
///
/// The complete file, section hashes, tensor metadata, module paths, shapes,
/// dtypes, and optimizer payload are validated before any live handle changes.
/// `engine` remains the sole owner of newly uploaded storage.
///
/// # Errors
///
/// Returns [`crate::ErrorKind::CheckpointCorrupt`] for malformed, truncated, or
/// integrity-invalid `.oam` data. Returns another error for a valid file that
/// does not match the destination model/optimizer, or for allocation/runtime
/// and filesystem failures.
pub fn load_checkpoint(
	engine: &Engine,
	path: impl AsRef<Path>,
	model: &dyn Module,
	optimizer: &mut dyn CheckpointOptimizer,
) -> Result<()> {
	load_checkpoint_impl(engine, path.as_ref(), model, optimizer, None)
}

pub(super) fn load_checkpoint_at_step(
	engine: &Engine,
	path: &Path,
	model: &dyn Module,
	optimizer: &mut dyn CheckpointOptimizer,
	expected_step: u64,
) -> Result<()> {
	load_checkpoint_impl(engine, path, model, optimizer, Some(expected_step))
}

fn load_checkpoint_impl(
	engine: &Engine,
	path: &Path,
	model: &dyn Module,
	optimizer: &mut dyn CheckpointOptimizer,
	expected_step: Option<u64>,
) -> Result<()> {
	let file = ModelFile::load(path)?;
	if let Some(expected_step) = expected_step {
		let progress_step = u64::try_from(file.progress.step)
			.map_err(|_| Error::invalid_argument(".oam progress step is negative"))?;
		if progress_step != expected_step {
			return Err(Error::invalid_argument(
				"checkpoint filename step does not match .oam progress",
			));
		}
	}
	let named = model.all_named_parameters()?;
	let buffers = model
		.all_named_buffers()?
		.into_iter()
		.filter(|buffer| buffer.persistent())
		.collect::<Vec<_>>();
	let state_u32 = model.all_named_state_u32()?;
	let optimizer_state = optimizer.checkpoint_state()?;
	validate_optimizer_snapshot(&optimizer_state)?;
	let expected_state_count = buffers
		.len()
		.checked_add(state_u32.len())
		.ok_or_else(|| Error::resource_exhausted("checkpoint state count overflows usize"))?;
	if file.weights.len() != named.len()
		|| file.state.len() != expected_state_count
		|| named.len() != optimizer_state.parameters.len()
	{
		return Err(Error::invalid_argument(
			".oam tensor count does not match the destination module",
		));
	}

	let engine_handle = engine.handle();
	if named.iter().any(|entry| {
		!entry
			.parameter()
			.data()
			.engine_handle()
			.same_as(&engine_handle)
	}) || buffers
		.iter()
		.any(|entry| !entry.data().engine_handle().same_as(&engine_handle))
	{
		return Err(Error::invalid_argument(
			"checkpoint engine does not own the destination module",
		));
	}

	let mut loaded_parameters = Vec::with_capacity(named.len());
	for (expected, tensor) in named.iter().zip(&file.weights) {
		let parameter = expected.parameter();
		let data = parameter.data();
		validate_tensor_contract(tensor, expected.path(), &data)?;
		loaded_parameters.push((parameter, matrix_from_tensor(engine, tensor)?));
	}
	let mut loaded_buffers = Vec::with_capacity(buffers.len());
	for (expected, tensor) in buffers.iter().zip(file.state.iter().take(buffers.len())) {
		let data = expected.data();
		validate_tensor_contract(tensor, expected.path(), &data)?;
		loaded_buffers.push((expected, matrix_from_tensor(engine, tensor)?));
	}
	let mut loaded_state_u32 = Vec::with_capacity(state_u32.len());
	for (expected, tensor) in state_u32.iter().zip(file.state.iter().skip(buffers.len())) {
		validate_state_u32_contract(tensor, expected.path())?;
		let value = u32::from_le_bytes(
			tensor
				.data
				.as_slice()
				.try_into()
				.map_err(|_| Error::invalid_argument(".oam u32 state has invalid byte count"))?,
		);
		loaded_state_u32.push((expected, value));
	}

	let persisted = file
		.optimizer
		.as_ref()
		.ok_or_else(|| Error::invalid_argument(".oam has no optimizer state"))?;
	if persisted.kind != optimizer_state.kind {
		return Err(Error::invalid_argument(format!(
			".oam optimizer {} cannot restore {}",
			persisted.kind, optimizer_state.kind
		)));
	}
	let step = u64::try_from(persisted.step)
		.map_err(|_| Error::invalid_argument(".oam optimizer step is negative"))?;
	let scalar_count = named.iter().try_fold(0_usize, |total, entry| {
		total
			.checked_add(entry.parameter().data().num_elements())
			.ok_or_else(|| Error::resource_exhausted("checkpoint parameter count overflow"))
	})?;
	let expected_first = if optimizer_state.first_state.is_empty() {
		0
	} else {
		scalar_count
	};
	let expected_second = if optimizer_state.second_state.is_empty() {
		0
	} else {
		scalar_count
	};
	if persisted.first_moment.len() != expected_first
		|| persisted.second_moment.len() != expected_second
	{
		return Err(Error::invalid_argument(
			".oam optimizer state does not cover the destination parameters",
		));
	}
	let first_state = matrices_from_flat(engine, &named, &persisted.first_moment)?;
	let second_state = matrices_from_flat(engine, &named, &persisted.second_moment)?;
	for (parameter, (loaded, _)) in optimizer_state.parameters.iter().zip(&loaded_parameters) {
		if !parameter.same_as(loaded) {
			return Err(Error::invalid_argument(
				"checkpoint optimizer order differs from module traversal",
			));
		}
	}
	for (parameter, _) in &loaded_parameters {
		parameter.validate_can_update()?;
	}
	let restore = OptimizerRestore {
		kind: persisted.kind.clone(),
		step,
		learning_rate: persisted.learning_rate,
		beta1: persisted.beta1,
		beta2: persisted.beta2,
		epsilon: persisted.epsilon,
		weight_decay: persisted.weight_decay,
		first_state,
		second_state,
	};
	optimizer.validate_checkpoint_state(&restore)?;

	// All fallible wire, ownership, shape, and allocation work has completed.
	for (parameter, data) in loaded_parameters {
		parameter.replace_data(data)?;
		parameter.clear_gradient();
	}
	for (buffer, data) in loaded_buffers {
		buffer.replace_data(data)?;
	}
	for (state, value) in loaded_state_u32 {
		state.replace_value(value);
	}
	optimizer.restore_checkpoint_state(restore)
}

fn validate_optimizer_snapshot(state: &OptimizerCheckpoint) -> Result<()> {
	let parameter_count = state.parameters.len();
	if parameter_count == 0
		|| (!state.first_state.is_empty() && state.first_state.len() != parameter_count)
		|| (!state.second_state.is_empty() && state.second_state.len() != parameter_count)
	{
		return Err(Error::invalid_argument(
			"optimizer persistence state does not match its parameter set",
		));
	}
	Ok(())
}

fn matrices_from_flat(
	engine: &Engine,
	parameters: &[super::NamedParameter],
	values: &[f32],
) -> Result<Vec<Matrix>> {
	if values.is_empty() {
		return Ok(Vec::new());
	}
	let mut matrices = Vec::with_capacity(parameters.len());
	let mut offset = 0_usize;
	for entry in parameters {
		let data = entry.parameter().data();
		let end = offset
			.checked_add(data.num_elements())
			.ok_or_else(|| Error::resource_exhausted("optimizer state offset overflows usize"))?;
		matrices.push(Matrix::from_f32(
			engine,
			data.shape().to_vec(),
			&values[offset..end],
		)?);
		offset = end;
	}
	Ok(matrices)
}

fn matrix_tensor(name: &str, matrix: &Matrix) -> Result<Tensor> {
	let shape = matrix
		.shape()
		.iter()
		.map(|extent| {
			u64::try_from(*extent).map_err(|_| Error::resource_exhausted("checkpoint extent exceeds u64"))
		})
		.collect::<Result<Vec<_>>>()?;
	let data = match matrix.dtype() {
		DType::U8 => matrix.read::<u8>()?,
		DType::F32 => matrix
			.read::<f32>()?
			.into_iter()
			.flat_map(f32::to_le_bytes)
			.collect(),
		DType::I32 => matrix
			.read::<i32>()?
			.into_iter()
			.flat_map(i32::to_le_bytes)
			.collect(),
		DType::U32 => matrix
			.read::<u32>()?
			.into_iter()
			.flat_map(u32::to_le_bytes)
			.collect(),
	};
	Tensor::dense(name, matrix.dtype(), shape, data)
}

fn validate_tensor_contract(tensor: &Tensor, path: &str, matrix: &Matrix) -> Result<()> {
	let dtype = tensor_dtype(tensor)?;
	let shape = tensor_shape(tensor)?;
	if tensor.name != path || dtype != matrix.dtype() || shape != matrix.shape() {
		return Err(Error::invalid_argument(format!(
			".oam tensor {} does not match destination {path}",
			tensor.name
		)));
	}
	if tensor.encoding != TensorEncoding::Dense || tensor.block_size != 0 {
		return Err(Error::invalid_argument(format!(
			"checkpoint restore requires dense tensor {path}"
		)));
	}
	Ok(())
}

fn validate_state_u32_contract(tensor: &Tensor, path: &str) -> Result<()> {
	if tensor.name != path
		|| tensor.dtype != ScalarType::U32
		|| !tensor.shape.is_empty()
		|| tensor.encoding != TensorEncoding::Dense
		|| tensor.block_size != 0
		|| tensor.data.len() != size_of::<u32>()
	{
		return Err(Error::invalid_argument(format!(
			".oam scalar state {} does not match destination {path}",
			tensor.name
		)));
	}
	Ok(())
}

fn matrix_from_tensor(engine: &Engine, tensor: &Tensor) -> Result<Matrix> {
	let shape = tensor_shape(tensor)?;
	match tensor_dtype(tensor)? {
		DType::U8 => Matrix::from_slice(engine, shape, &tensor.data),
		DType::F32 => Matrix::from_slice(engine, shape, &decode_f32(&tensor.data)?),
		DType::I32 => Matrix::from_slice(engine, shape, &decode_i32(&tensor.data)?),
		DType::U32 => Matrix::from_slice(engine, shape, &decode_u32(&tensor.data)?),
	}
}

fn tensor_dtype(tensor: &Tensor) -> Result<DType> {
	match tensor.dtype {
		ScalarType::U8 => Ok(DType::U8),
		ScalarType::F32 => Ok(DType::F32),
		ScalarType::I32 => Ok(DType::I32),
		ScalarType::U32 => Ok(DType::U32),
		_ => Err(Error::invalid_argument(format!(
			"checkpoint restore does not support persisted dtype for {}",
			tensor.name
		))),
	}
}

fn tensor_shape(tensor: &Tensor) -> Result<Vec<usize>> {
	tensor
		.shape
		.iter()
		.map(|extent| {
			usize::try_from(*extent).map_err(|_| Error::invalid_argument(".oam extent exceeds usize"))
		})
		.collect()
}

fn decode_f32(bytes: &[u8]) -> Result<Vec<f32>> {
	decode_words(bytes, f32::from_le_bytes)
}

fn decode_i32(bytes: &[u8]) -> Result<Vec<i32>> {
	decode_words(bytes, i32::from_le_bytes)
}

fn decode_u32(bytes: &[u8]) -> Result<Vec<u32>> {
	decode_words(bytes, u32::from_le_bytes)
}

fn decode_words<T>(bytes: &[u8], decode: impl Fn([u8; 4]) -> T) -> Result<Vec<T>> {
	let (chunks, remainder) = bytes.as_chunks::<4>();
	let values = chunks.iter().copied().map(decode).collect::<Vec<_>>();
	if !remainder.is_empty() {
		return Err(Error::checkpoint_corrupt(
			"dense tensor byte count is not word aligned",
		));
	}
	Ok(values)
}