Exact minimum-cost set cover over at most 12 stations and 16 declared requirements. Enumerates at most 4,095 nonempty subsets; breaks equal costs by station count then sorted keys. Reports infeasible coverage explicitly. Coverage and costs are caller declarations, not field verification.

Paired finite-state replay of onset/dwell and hysteretic release settings over at most 512 labelled offline scores. Timers and state carry across contiguous trials. At equal timestamps score changes precede timers; no event fires at the final endpoint. Reports paired false-event, miss and latency metrics. No hardware or live control.

Compute earliest/latest starts and finishes and slack on a declared DAG of at most 48 tasks. Rejects cycles and unknown dependencies. Reports peak overlap of declared unit resource claims at the earliest schedule; does not optimize a resource-constrained schedule or verify physical resources.

Score up to 64 labelled time intervals and 128 command events: rest false activations, missed trials, wrong commands and first-correct response times. Public or synthetic event metadata only. No raw EEG, participant identifiers, live control, diagnosis or human-enhancement claim.

Compare up to 128 expected passage bindings with up to 128 retained descriptors by passage ID, parent document, version hash and chunk hash. Flags omissions, substitutions, repeats and ordering gaps. Public/synthetic metadata only; does not inspect prompts or prove what a model saw or used.

Compare up to 12 caller-supplied public committee-level totals and filing references at a declared assessment time. Preserves unknown totals, flags stale or amended snapshots and checks cash arithmetic. Caller must attest authorized commercial use and no individual-contributor information. No live FEC fetch, donor data, legal verdict or final-filing certification.

Compare complete, partial, and missed evidence recovery on one matched, hash-frozen cohort of up to 64 questions and papers. Report paired transitions and a caller-declared complete-recovery drop threshold. Descriptive evidence-ID overlap, not answer quality or causal inference.

Compare strict rank-prefix packing with rank-order greedy-fit and score-density greedy-fit for up to 64 passages under a 1–2048 token budget. Report evidence displacement and optional observed selection violations. Uses declared integer costs/scores; no tokenization or causal attribution.

Build a stable hashed manifest of bounded public/synthetic artifact contents, declared dependencies, algorithm version, seed, and parameters. Verify declared content hashes; reject duplicate/dangling dependencies and cycles. No artifact fetching, execution replay, signing, or authenticity guarantee.

Count DNA/RNA bases and ambiguities and calculate GC fraction on called bases only. Refuses mixed DNA/RNA alphabets; no sequence design or clinical inference.

Calculate composition, molecular mass and model-based charge descriptors from supplied protein sequences. For dataset analysis; not a folding or function prediction.

Compare structured benchmark protocol, workload, metric, noise and overhead declarations. Flags mismatches; labels are not independently validated.

Check supplied stabilizer generators for commutation, independence and inconsistent constraints before analysing a code. No logical-error or fault-tolerance guarantee.

Lint up to 128 declared gates on eight qubits for arity, target, angle and post-measurement errors. Returns scheduling depth; no simulation or equivalence proof.

Compare circuit durations with supplied T1/T2 values using an explicit relaxation/dephasing model. For scenario planning; not a measured device-fidelity guarantee.

Calculate X, Y and Z Pauli expectations for a supplied valid single-qubit density matrix. Returns basis conventions; not a hardware measurement.

Fit a bounded damped Rabi/Ramsey trace by frequency-decay grid search; report residuals, resolution, aliasing refusal and edge hits. No parameter confidence interval.

Check a supplied single-qubit complex density matrix for unit trace, Hermiticity and positive semidefiniteness with explicit tolerance; no hardware validation.

Check supplied FASTA records for malformed headers, duplicate identifiers and invalid sequence characters before dataset ingestion. No functional or safety inference.

Calculate a surface-code resource scenario under an explicitly named layout and supplied error assumptions. For planning; not a demonstrated physical implementation.