Load
The requested GPUs clear the exact checkpoint tensor-byte lower bound. Runtime residency remains unverified.
PLANNING ENGINE / PUBLIC PREVIEW
Test an exact checkpoint against an explicit hardware topology with sourced bytes and inspectable integer math.
A baseline pass is a candidate—not a claim about runtime support or performance.
Deterministic registry engine
Test an exact, pinned artifact against advertised accelerator memory—then keep every unsupported conclusion visibly unknown.
02 · Fit decision
Qwen3-30B-A3B · 128 / top-8 experts · 32K context · 8 × NVIDIA H200 SXM · 13% reserve
The requested GPUs clear the exact checkpoint tensor-byte lower bound. Runtime residency remains unverified.
A baseline pass does not prove loader, kernel, quantization, sharding, or expert-parallel support.
No measured workload profile is attached, so throughput, latency, KV demand, and skew are not projected.
No dated provider, region, or utilization record is selected, so the engine emits no invented cost.
03 · Explainable topology
RequestedThe topology you asked the engine to test against the checkpoint baseline.
usable = floor(advertised bytes × (10,000 − reserve bps) / 10,000); minimum GPUs = ceil(checkpoint tensor bytes / usable bytes). A failure is conclusive for this no-offload baseline; a pass is only a candidate for runtime validation.
Artifact evidence: Qwen3-30B-A3B pinned tensor manifest ↗
Exact revision and Safetensors manifest—not parameter-count arithmetic.
Integer basis-point math preserves a visible memory assumption.
Runtime, KV, scale, and price stay unknown without attached evidence.
The same registry and calculation ship through the open CLI.