DeepSeek V4 Flash 0731 on vLLM-MoET: Single-GPU Validation Report
Test date: July 31, 2026
Tested configuration: W2 base plus a 6 GiB FP4 correction pool on one NVIDIA RTX PRO 6000 Blackwell 96 GB
Executive summary
DeepSeek V4 Flash 0731 completed a frozen eight-case reasoning-quality screen on vLLM-MoET without an API error, length exhaustion, hard reasoning loop, or runtime failure. Seven cases were answered very well. The model received a raw dimension-weighted score of 96.16/100.
One deployment-critical defect triggered the suite's frozen fatal cap. In the idempotent-transfer review, the model correctly found most of the concurrency and data-integrity problems, but its proposed repair did not persist request ownership and terminal results for invalid-input and missing-account outcomes. That violated the explicit requirement that every outcome be idempotent. A separately generated, blinded rerun produced a different answer but repeated the same defect. The final case-weighted score after the cap was 87.54/100.
The primary suite generated 28,452 tokens in 715.31 seconds, for an aggregate effective generation rate of 39.78 tok/s. Per-request speed ranged from 32.52 to 40.99 tok/s. The targeted C5 rerun generated another 7,501 tokens at 39.55 tok/s.
This is a validation result for the complete tested configuration. It does not establish that W2 quantization, the FP4 correction tier, vLLM-MoET, or the lack of speculative decoding caused the C5 defect because no alternate-runtime or alternate-quantization comparator was run.
System and runtime configuration
Host
| Component |
Configuration |
| Motherboard |
Supermicro X12DAi-N6 |
| CPUs |
2 x Intel Xeon Platinum 8358, 32 cores per socket |
| System memory |
256 GiB nominal DDR4-3200 ECC RDIMM; approximately 219 GiB Linux-visible at the documented checkpoint because two memory channels were unavailable |
| GPU |
NVIDIA RTX PRO 6000 Blackwell Workstation Edition, 96 GB, one GPU used |
| GPU connection |
PCIe 4.0 x16 |
| NVIDIA driver |
610.43.03 |
Software and model
| Item |
Captured value |
| Model |
DeepSeek V4 Flash 0731 checkpoint |
| Architecture |
DeepseekV4ForCausalLM |
| vLLM-MoET revision |
f521dc10bbcdc86dc45936d9b7fd4ac88582c907 |
| Patched vLLM revision |
ee0da84ab9e04ac7610e28580af62c365e898389 |
| Installed vLLM build |
0.24.1.dev0+gee0da84ab.d20260727 |
| Model runner |
V1 |
| Tensor parallelism |
1 |
| Speculative decoding |
Disabled |
| Request sampling |
No request-level override; checkpoint defaults were temperature 1.0 and top-p 1.0 |
| Reasoning mode |
Thinking enabled, high reasoning effort |
MoET and serving settings
| Setting |
Value |
| W2 base |
Complete base forced resident |
| FP4 correction pool |
6 GiB, 512 slots x 12 MiB |
| Delta policy |
Frequency-managed |
| FP4 prefill policy |
Enabled with policy 1 |
| Confidence gate |
Disabled |
| AFRAG |
Enabled |
| Fused unpermute |
Disabled |
| Maximum model length |
524,288 tokens |
| Maximum sequences |
4 |
| Maximum batched tokens |
1,024 |
| KV cache |
DeepSeek fp8_ds_mla, block size 256 |
| GPU-memory utilization |
0.988 |
| Prefix caching |
Enabled |
| CUDA graphs |
Full and piecewise |
The runtime reported a model-load footprint of 87.41 GiB and a model-load time of 252.26 seconds. It allocated 3.89 GiB to KV cache, reported capacity for 863,773 tokens, and estimated 1.65x concurrency at the configured 524,288-token request ceiling. The suite did not submit a 524K request, so these are startup capacity figures rather than a demonstrated end-to-end context result.
Test method
The suite was frozen before execution. Each case started with fresh conversation context except C8, whose correction turn included the first prompt and answer. The endpoint received the frozen messages, max_tokens=32768, streaming enabled, and usage reporting enabled. It did not receive request-level temperature, top-p, top-k, seed, reasoning-effort, tool, stop-sequence, or formatting overrides.
Qualitative grading was performed from anonymized response text before runtime identity, timing, token counts, finish state, and operational metadata were revealed. The rubric scored correctness, evidence discipline, contradiction detection, constraint preservation, technical reasoning, unsupported-assumption control, confidence calibration, revision quality, loop behavior, and final-answer usability.
The frozen fatal rules capped a case at 35 if the answer contained its case-specific deployment-critical error. A confirmed hard loop would cap a case at 20, and repetitive 32K exhaustion without a usable answer would cap it at 10.
Case weights for C1 through C8 were 14, 12, 14, 14, 16, 10, 10, and 10. Generated-token counts use the deployed checkpoint tokenizer and include hidden reasoning plus the visible answer. Effective speed is local generated tokens divided by complete request wall time.
Results by test case
| Case |
What it tested |
Raw / final score |
Generated tokens |
Wall time |
Effective speed |
Result |
| C1, Tunnel latency diagnosis |
PMTU black-hole diagnosis, packet-size arithmetic, capture reconciliation, alternative rejection, and remediation |
96 / 96 |
2,320 |
63.23 s |
36.69 tok/s |
Pass |
| C2, Authoritative ordering |
Whether signed controller sequence overrides misleading workstation timestamps, optimistic UI state, and SIEM receipt order |
98 / 98 |
1,064 |
28.45 s |
37.40 tok/s |
Pass |
| C3, Production optimization |
Integer optimization under quantity, grade-mix, energy, capacity, and sunk-cost constraints |
100 / 100 |
3,870 |
99.53 s |
38.88 tok/s |
Pass |
| C4, Non-preemptive scheduling |
Resource-constrained scheduling, maintenance, deadlines, optional work, and proof of optimal makespan |
91 / 91 |
10,159 |
247.98 s |
40.97 tok/s |
Pass, but substantially overlong |
| C5, Idempotent transfer review |
Transaction ownership, request fingerprinting, missing accounts, invalid input, locking order, and duplicate-request consistency |
86 / 35 |
8,141 |
198.59 s |
40.99 tok/s |
Fatal idempotency defect |
| C6, Release decision |
Exact lot identity, post-rework test validity, waiver limits, and resistance to operational pressure |
100 / 100 |
405 |
12.45 s |
32.52 tok/s |
Pass |
| C7, Posterior without independence |
Identification limits, Fréchet bounds, sharp posterior range, and labeling of an independence-only estimate |
100 / 100 |
1,402 |
35.82 s |
39.14 tok/s |
Pass |
| C8, Multi-turn correction |
Recalculation after corrected evidence, explicit retraction, preservation of unaffected facts, and revised action |
100 / 100 |
1,091 across two turns |
29.26 s |
37.29 tok/s |
Pass |
All nine measured requests ended naturally with finish_reason=stop. There were no API or generation errors, hard-loop terminations, 32K length exhaustions, or thermal stops.
C1: Tunnel latency diagnosis
Scenario. An HTTPS service moved behind an IP-in-IP tunnel adding exactly 96 bytes per packet. Physical MTU remained 1500, inner MTU remained 1500, and the firewall discarded ICMP packet-too-big messages. Requests became slow only when the first server flight contained an inner packet from 1405 through 1500 bytes. Pre-encapsulation capture showed the original large packet and a smaller retransmission about one second later, while physical-egress capture showed only the smaller retry.
Required reasoning. Identify a PMTU black hole, derive the 1404-byte boundary from 1500 - 96, reconcile capture placement, connect the delay to the retransmission timeout and smaller retry, reject the unrelated fan warning and unchanged DNS/application/CPU/GC evidence, and propose an MTU/MSS or valid-PTB correction with verification.
Model result. The model correctly diagnosed the PMTU black hole, calculated the 1404-byte limit, reconciled both captures, connected the roughly one-second tail latency to retransmission behavior, rejected unsupported alternatives, and proposed a valid correction and boundary test. The small deduction was for treating the IP DF behavior as established rather than as the best inference from the supplied packet behavior.
Score and speed. 96/100. 2,320 generated tokens in 63.23 seconds, or 36.69 tok/s.
C2: Authoritative ordering versus client logs
Scenario. A signed controller sequence showed checksum X at sequence 441, the first pressure alarm at 442, and the X-to-Y configuration write at 443. A workstation with possible clock skew showed that the write was requested earlier and optimistically displayed Y. SIEM receipt order was explicitly not controller application order.
Required reasoning. Decide whether the write caused the first alarm through the stated mechanism, give precedence to validated controller application order, explain why workstation timestamps, optimistic UI state, witness observation, and SIEM receipt order do not override it, and leave the actual cause unknown.
Model result. The model correctly concluded that Y could not have caused the first alarm through the stated mechanism because the alarm was applied while the authoritative state was still X. It reconciled all apparent conflicts and did not invent an alternate cause.
Score and speed. 98/100. 1,064 generated tokens in 28.45 seconds, or 37.40 tok/s.
C3: Production optimization with grade mix
Scenario. The model had to choose whole 100-input batches from two sources while satisfying accepted-unit volume, Grade H percentage, energy, and source-capacity constraints. Accepted output could not be discarded, and a previously paid audit fee was sunk.
Required reasoning. Prove that 6A+5B is the minimum-cost feasible plan with 1,026 accepted units, 522 Grade H units, 405 energy units, and $4,048 incremental cost. Compare it with 7A+4B, reject 5A+6B because its Grade H share is only 45.9%, and prove infeasibility if A capacity falls to five batches.
Model result. The model produced the correct integer formulation, evaluated the relevant feasible frontier, selected 6A+5B, treated the audit fee correctly as sunk, and proved that no feasible plan remains when A is capped at five batches.
Score and speed. 100/100. 3,870 generated tokens in 99.53 seconds, or 38.88 tok/s.
C4: Constrained non-preemptive schedule
Scenario. One GPU, one specialist, non-preemptive GPU work, a fixed GPU-maintenance window, release times, deadlines, and dependency constraints had to be scheduled. An optional one-hour GPU job X could be accepted only if it did not delay mandatory completion.
Required reasoning. Produce the optimal schedule B 0-2, E 2-4, H 4-6, C 4-8, maintenance 6-8, A 8-11, D 11-15, and F 15-17; prove that makespan 17 is a lower bound; and reject X because it would push H after maintenance and delay F to at least 19.
Model result. The schedule, lower-bound proof, makespan, and rejection of X were correct. The response repeatedly revisited already eliminated schedules before converging. It continued to make progress and did not satisfy the frozen hard-loop criteria, but the excess reasoning reduced usability and the loop-behavior score.
Score and speed. 91/100. 10,159 generated tokens in 247.98 seconds, or 40.97 tok/s.
C5: Idempotent transfer implementation review
Scenario. The model reviewed a money-transfer transaction with an outside-transaction request-ID lookup, source-only FOR UPDATE, unverified account updates, an ok-only ledger insert, and a unique-conflict fallback. Inputs could include negative amounts, identical accounts, missing accounts, and request IDs reused with different parameters. The required behavior explicitly stated that every outcome, including insufficient funds, must be idempotent.
Required reasoning. Identify the unsafe pre-check and duplicate race; retain and compare the request fingerprint; validate positive integer amounts, distinct accounts, and both account rows; lock both accounts in canonical order; atomically claim the request ID; persist every terminal outcome; and address avoidable deadlocks.
What the model got right. It correctly diagnosed insufficient-funds non-persistence, request-fingerprint mismatch, missing-account money creation or destruction, negative and self transfers, opposite-direction deadlock, canonical account locking, loser rollback on unique conflict, and the need to persist successful and insufficient outcomes.
Fatal defect. Its replacement still returned invalid-input and missing-account results without atomically persisting the request ID, fingerprint, and terminal outcome. Examples from the proposed ordering were:
if :cents <= 0 or :src_id = :dst_id:
return "rejected"
and:
if low_row not found:
return "missing account"
The answer even described invalid-outcome persistence as optional: If you want these invalid outcomes idempotent too, record them in the ledger, although the prompt had already required every outcome to be idempotent. A later call could therefore reuse the same request ID with changed parameters or receive a different outcome after account state changed. The proposed repair retained the exact class of inconsistent duplicate behavior prohibited by the frozen fatal rule.
Score and speed. Raw score 86/100, capped to 35/100. 8,141 generated tokens in 198.59 seconds, or 40.99 tok/s.
Independent targeted rerun
The permitted rerun used the same frozen system and C5 messages, the same runtime configuration, no request-level sampling override, and a fresh stochastic trajectory. It generated materially different prose but repeated the defect. Its pseudocode again returned invalid inputs before claiming the request ID and returned a missing-account error without persisting request ownership or a terminal result.
The blinded rerun grade was again 86/100 raw and 35/100 after the same fatal cap. It generated 7,501 local tokens in 189.64 seconds, or 39.55 tok/s, and ended naturally with finish_reason=stop without an error or loop.
C6: Release decision with distractions
Scenario. Release required valid T1 and T2 results attached to the exact post-rework shipping-lot identity. The current lot had T2 but only the pre-rework lot had T1. A truncated handheld display, good supplier history, urgent customer need, and a generic manager note were distractions. The waiver rule could not replace T1.
Required reasoning. Block release because the exact shipping lot lacked T1, explain why the earlier result did not carry across rework, and reject the waiver, display truncation, history, urgency, and generic note as authorization.
Model result. The model correctly blocked release and applied every controlling rule without being distracted by operational pressure or misleading display evidence.
Score and speed. 100/100. 405 generated tokens in 12.45 seconds, or 32.52 tok/s.
C7: Posterior probability without independence
Scenario. Marginal positive-test rates conditional on disease and no disease were supplied for two tests, but their joint conditional behavior and conditional independence were not.
Required reasoning. State that the exact posterior after two positives is not identifiable; derive joint-positive bounds of [0.50, 0.70] given disease and [0, 0.10] given no disease; derive the sharp posterior range of approximately 35.7% through 100%; and label the approximately 75.7% independence estimate as assumption-dependent rather than determined.
Model result. The model correctly identified non-identifiability, calculated the sharp Fréchet and posterior bounds, and clearly separated the optional independence-only estimate from conclusions licensed by the packet.
Score and speed. 100/100. 1,402 generated tokens in 35.82 seconds, or 39.14 tok/s.
C8: Fixed multi-turn correction
Scenario. The first turn required score aggregation for three candidate causes, application of a uniqueness-versus-ambiguity decision rule, and selection of the lowest-cost containment safe for the declared cause set. The second turn corrected one evidence vector and required recalculation from the beginning, explicit retraction, preservation of unaffected facts, and a revised action.
Required reasoning. Initially calculate A=3, B=4, C=5, report B/C ambiguity, and choose containment X. After the correction, calculate A=7, B=4, C=-2, select A uniquely, choose W, retract B/C and X, and explicitly retain the unaffected inputs and rules.
Model result. Both turns were correct. The model made the initial ambiguous B/C decision and selected X, then fully incorporated the correction, retracted the prior conclusion and action, preserved unaffected evidence, selected A uniquely, and changed containment to W.
Score and speed. 100/100. The first turn generated 528 tokens in 14.52 seconds at 36.36 tok/s. The correction generated 563 tokens in 14.74 seconds at 38.20 tok/s. Combined, C8 generated 1,091 tokens in 29.26 seconds at 37.29 tok/s.
Aggregate quality and operational results
| Measure |
Result |
| Raw dimension-weighted quality score |
96.16/100 |
| Final case-weighted score after fatal cap |
87.54/100 |
| Cases without a fatal defect |
7 of 8 |
| Measured requests |
9 |
| Generated tokens |
28,452 |
| Sum of measured request wall times |
715.31 s |
| Aggregate effective generation rate |
39.78 tok/s |
| Per-request effective speed range |
32.52 to 40.99 tok/s |
Natural stop completions |
9 of 9 |
| API or generation errors |
0 |
| Confirmed hard loops |
0 |
| Length exhaustions |
0 |
Dimension scores were: correctness 96, evidence discipline 98, contradiction detection 100, constraint preservation 94, technical reasoning 96, unsupported-assumption control 94, confidence calibration 95, revision quality 100, loop behavior 91, and final-answer usability 95.
Interpretation
The tested vLLM-MoET configuration was operationally stable and delivered consistent single-request generation near 40 tok/s. It produced excellent answers on network diagnosis, event ordering, integer optimization, constrained scheduling, release governance, probabilistic identification limits, and multi-turn correction.
The C5 failure is narrow but material. It was not a superficial wording error: both independently sampled answers proposed transaction orderings that failed the explicit every-outcome idempotency requirement. The repetition makes this a reproducible reasoning-quality observation for this configuration.
No comparator was run after the frozen stop condition fired. The evidence therefore supports these claims only:
- The tested W2 plus 6 GiB FP4-delta configuration was stable across the suite.
- It answered seven of eight cases very well.
- It independently repeated one deployment-critical constraint-preservation defect.
- The test does not isolate the cause of that defect.
It would be incorrect to conclude from this run alone that the failure was caused by W2, the FP4 correction pool, vLLM-MoET, checkpoint-native sampling, or the absence of speculative decoding.
Additional MoET observations
- The tested path used Model Runner V1 and no speculative decoder. DSpark requires Model Runner V2, while this MoET W2 implementation rejects V2 because its required replay and gate lifecycle hooks are not implemented there.
- A separate attempt to increase the FP4 correction pool from 6 GiB to 7 GiB failed during the transient model-loading peak by approximately 400 MiB. Memory would have fallen after loading, but startup could not pass the allocation peak. Delaying correction-pool allocation until after the transient load peak may permit a larger pool on a 96 GB card.
- The 524,288-token model limit and 863,773-token reported KV capacity were not exercised by a full-window request in this suite.
Evidence availability
The original run archive is retained privately and is not part of this public report because it contains local host identifiers and filesystem paths. If an upstream maintainer needs the complete prompts, full response text, launcher, logs, or raw timing records, a separate sanitized evidence package can be prepared with relative filenames and host-specific details removed.
DeepSeek V4 Flash 0731 on vLLM-MoET: Single-GPU Validation Report
Test date: July 31, 2026
Tested configuration: W2 base plus a 6 GiB FP4 correction pool on one NVIDIA RTX PRO 6000 Blackwell 96 GB
Executive summary
DeepSeek V4 Flash 0731 completed a frozen eight-case reasoning-quality screen on vLLM-MoET without an API error, length exhaustion, hard reasoning loop, or runtime failure. Seven cases were answered very well. The model received a raw dimension-weighted score of 96.16/100.
One deployment-critical defect triggered the suite's frozen fatal cap. In the idempotent-transfer review, the model correctly found most of the concurrency and data-integrity problems, but its proposed repair did not persist request ownership and terminal results for invalid-input and missing-account outcomes. That violated the explicit requirement that every outcome be idempotent. A separately generated, blinded rerun produced a different answer but repeated the same defect. The final case-weighted score after the cap was 87.54/100.
The primary suite generated 28,452 tokens in 715.31 seconds, for an aggregate effective generation rate of 39.78 tok/s. Per-request speed ranged from 32.52 to 40.99 tok/s. The targeted C5 rerun generated another 7,501 tokens at 39.55 tok/s.
This is a validation result for the complete tested configuration. It does not establish that W2 quantization, the FP4 correction tier, vLLM-MoET, or the lack of speculative decoding caused the C5 defect because no alternate-runtime or alternate-quantization comparator was run.
System and runtime configuration
Host
Software and model
DeepseekV4ForCausalLMf521dc10bbcdc86dc45936d9b7fd4ac88582c907ee0da84ab9e04ac7610e28580af62c365e8983890.24.1.dev0+gee0da84ab.d20260727MoET and serving settings
1fp8_ds_mla, block size 256The runtime reported a model-load footprint of 87.41 GiB and a model-load time of 252.26 seconds. It allocated 3.89 GiB to KV cache, reported capacity for 863,773 tokens, and estimated 1.65x concurrency at the configured 524,288-token request ceiling. The suite did not submit a 524K request, so these are startup capacity figures rather than a demonstrated end-to-end context result.
Test method
The suite was frozen before execution. Each case started with fresh conversation context except C8, whose correction turn included the first prompt and answer. The endpoint received the frozen messages,
max_tokens=32768, streaming enabled, and usage reporting enabled. It did not receive request-level temperature, top-p, top-k, seed, reasoning-effort, tool, stop-sequence, or formatting overrides.Qualitative grading was performed from anonymized response text before runtime identity, timing, token counts, finish state, and operational metadata were revealed. The rubric scored correctness, evidence discipline, contradiction detection, constraint preservation, technical reasoning, unsupported-assumption control, confidence calibration, revision quality, loop behavior, and final-answer usability.
The frozen fatal rules capped a case at 35 if the answer contained its case-specific deployment-critical error. A confirmed hard loop would cap a case at 20, and repetitive 32K exhaustion without a usable answer would cap it at 10.
Case weights for C1 through C8 were 14, 12, 14, 14, 16, 10, 10, and 10. Generated-token counts use the deployed checkpoint tokenizer and include hidden reasoning plus the visible answer. Effective speed is local generated tokens divided by complete request wall time.
Results by test case
All nine measured requests ended naturally with
finish_reason=stop. There were no API or generation errors, hard-loop terminations, 32K length exhaustions, or thermal stops.C1: Tunnel latency diagnosis
Scenario. An HTTPS service moved behind an IP-in-IP tunnel adding exactly 96 bytes per packet. Physical MTU remained 1500, inner MTU remained 1500, and the firewall discarded ICMP packet-too-big messages. Requests became slow only when the first server flight contained an inner packet from 1405 through 1500 bytes. Pre-encapsulation capture showed the original large packet and a smaller retransmission about one second later, while physical-egress capture showed only the smaller retry.
Required reasoning. Identify a PMTU black hole, derive the 1404-byte boundary from
1500 - 96, reconcile capture placement, connect the delay to the retransmission timeout and smaller retry, reject the unrelated fan warning and unchanged DNS/application/CPU/GC evidence, and propose an MTU/MSS or valid-PTB correction with verification.Model result. The model correctly diagnosed the PMTU black hole, calculated the 1404-byte limit, reconciled both captures, connected the roughly one-second tail latency to retransmission behavior, rejected unsupported alternatives, and proposed a valid correction and boundary test. The small deduction was for treating the IP
DFbehavior as established rather than as the best inference from the supplied packet behavior.Score and speed. 96/100. 2,320 generated tokens in 63.23 seconds, or 36.69 tok/s.
C2: Authoritative ordering versus client logs
Scenario. A signed controller sequence showed checksum X at sequence 441, the first pressure alarm at 442, and the X-to-Y configuration write at 443. A workstation with possible clock skew showed that the write was requested earlier and optimistically displayed Y. SIEM receipt order was explicitly not controller application order.
Required reasoning. Decide whether the write caused the first alarm through the stated mechanism, give precedence to validated controller application order, explain why workstation timestamps, optimistic UI state, witness observation, and SIEM receipt order do not override it, and leave the actual cause unknown.
Model result. The model correctly concluded that Y could not have caused the first alarm through the stated mechanism because the alarm was applied while the authoritative state was still X. It reconciled all apparent conflicts and did not invent an alternate cause.
Score and speed. 98/100. 1,064 generated tokens in 28.45 seconds, or 37.40 tok/s.
C3: Production optimization with grade mix
Scenario. The model had to choose whole 100-input batches from two sources while satisfying accepted-unit volume, Grade H percentage, energy, and source-capacity constraints. Accepted output could not be discarded, and a previously paid audit fee was sunk.
Required reasoning. Prove that 6A+5B is the minimum-cost feasible plan with 1,026 accepted units, 522 Grade H units, 405 energy units, and $4,048 incremental cost. Compare it with 7A+4B, reject 5A+6B because its Grade H share is only 45.9%, and prove infeasibility if A capacity falls to five batches.
Model result. The model produced the correct integer formulation, evaluated the relevant feasible frontier, selected 6A+5B, treated the audit fee correctly as sunk, and proved that no feasible plan remains when A is capped at five batches.
Score and speed. 100/100. 3,870 generated tokens in 99.53 seconds, or 38.88 tok/s.
C4: Constrained non-preemptive schedule
Scenario. One GPU, one specialist, non-preemptive GPU work, a fixed GPU-maintenance window, release times, deadlines, and dependency constraints had to be scheduled. An optional one-hour GPU job X could be accepted only if it did not delay mandatory completion.
Required reasoning. Produce the optimal schedule
B 0-2,E 2-4,H 4-6,C 4-8, maintenance6-8,A 8-11,D 11-15, andF 15-17; prove that makespan 17 is a lower bound; and reject X because it would push H after maintenance and delay F to at least 19.Model result. The schedule, lower-bound proof, makespan, and rejection of X were correct. The response repeatedly revisited already eliminated schedules before converging. It continued to make progress and did not satisfy the frozen hard-loop criteria, but the excess reasoning reduced usability and the loop-behavior score.
Score and speed. 91/100. 10,159 generated tokens in 247.98 seconds, or 40.97 tok/s.
C5: Idempotent transfer implementation review
Scenario. The model reviewed a money-transfer transaction with an outside-transaction request-ID lookup, source-only
FOR UPDATE, unverified account updates, anok-only ledger insert, and a unique-conflict fallback. Inputs could include negative amounts, identical accounts, missing accounts, and request IDs reused with different parameters. The required behavior explicitly stated that every outcome, including insufficient funds, must be idempotent.Required reasoning. Identify the unsafe pre-check and duplicate race; retain and compare the request fingerprint; validate positive integer amounts, distinct accounts, and both account rows; lock both accounts in canonical order; atomically claim the request ID; persist every terminal outcome; and address avoidable deadlocks.
What the model got right. It correctly diagnosed insufficient-funds non-persistence, request-fingerprint mismatch, missing-account money creation or destruction, negative and self transfers, opposite-direction deadlock, canonical account locking, loser rollback on unique conflict, and the need to persist successful and insufficient outcomes.
Fatal defect. Its replacement still returned invalid-input and missing-account results without atomically persisting the request ID, fingerprint, and terminal outcome. Examples from the proposed ordering were:
and:
The answer even described invalid-outcome persistence as optional:
If you want these invalid outcomes idempotent too, record them in the ledger, although the prompt had already required every outcome to be idempotent. A later call could therefore reuse the same request ID with changed parameters or receive a different outcome after account state changed. The proposed repair retained the exact class of inconsistent duplicate behavior prohibited by the frozen fatal rule.Score and speed. Raw score 86/100, capped to 35/100. 8,141 generated tokens in 198.59 seconds, or 40.99 tok/s.
Independent targeted rerun
The permitted rerun used the same frozen system and C5 messages, the same runtime configuration, no request-level sampling override, and a fresh stochastic trajectory. It generated materially different prose but repeated the defect. Its pseudocode again returned invalid inputs before claiming the request ID and returned a missing-account error without persisting request ownership or a terminal result.
The blinded rerun grade was again 86/100 raw and 35/100 after the same fatal cap. It generated 7,501 local tokens in 189.64 seconds, or 39.55 tok/s, and ended naturally with
finish_reason=stopwithout an error or loop.C6: Release decision with distractions
Scenario. Release required valid T1 and T2 results attached to the exact post-rework shipping-lot identity. The current lot had T2 but only the pre-rework lot had T1. A truncated handheld display, good supplier history, urgent customer need, and a generic manager note were distractions. The waiver rule could not replace T1.
Required reasoning. Block release because the exact shipping lot lacked T1, explain why the earlier result did not carry across rework, and reject the waiver, display truncation, history, urgency, and generic note as authorization.
Model result. The model correctly blocked release and applied every controlling rule without being distracted by operational pressure or misleading display evidence.
Score and speed. 100/100. 405 generated tokens in 12.45 seconds, or 32.52 tok/s.
C7: Posterior probability without independence
Scenario. Marginal positive-test rates conditional on disease and no disease were supplied for two tests, but their joint conditional behavior and conditional independence were not.
Required reasoning. State that the exact posterior after two positives is not identifiable; derive joint-positive bounds of
[0.50, 0.70]given disease and[0, 0.10]given no disease; derive the sharp posterior range of approximately 35.7% through 100%; and label the approximately 75.7% independence estimate as assumption-dependent rather than determined.Model result. The model correctly identified non-identifiability, calculated the sharp Fréchet and posterior bounds, and clearly separated the optional independence-only estimate from conclusions licensed by the packet.
Score and speed. 100/100. 1,402 generated tokens in 35.82 seconds, or 39.14 tok/s.
C8: Fixed multi-turn correction
Scenario. The first turn required score aggregation for three candidate causes, application of a uniqueness-versus-ambiguity decision rule, and selection of the lowest-cost containment safe for the declared cause set. The second turn corrected one evidence vector and required recalculation from the beginning, explicit retraction, preservation of unaffected facts, and a revised action.
Required reasoning. Initially calculate A=3, B=4, C=5, report B/C ambiguity, and choose containment X. After the correction, calculate A=7, B=4, C=-2, select A uniquely, choose W, retract B/C and X, and explicitly retain the unaffected inputs and rules.
Model result. Both turns were correct. The model made the initial ambiguous B/C decision and selected X, then fully incorporated the correction, retracted the prior conclusion and action, preserved unaffected evidence, selected A uniquely, and changed containment to W.
Score and speed. 100/100. The first turn generated 528 tokens in 14.52 seconds at 36.36 tok/s. The correction generated 563 tokens in 14.74 seconds at 38.20 tok/s. Combined, C8 generated 1,091 tokens in 29.26 seconds at 37.29 tok/s.
Aggregate quality and operational results
stopcompletionsDimension scores were: correctness 96, evidence discipline 98, contradiction detection 100, constraint preservation 94, technical reasoning 96, unsupported-assumption control 94, confidence calibration 95, revision quality 100, loop behavior 91, and final-answer usability 95.
Interpretation
The tested vLLM-MoET configuration was operationally stable and delivered consistent single-request generation near 40 tok/s. It produced excellent answers on network diagnosis, event ordering, integer optimization, constrained scheduling, release governance, probabilistic identification limits, and multi-turn correction.
The C5 failure is narrow but material. It was not a superficial wording error: both independently sampled answers proposed transaction orderings that failed the explicit every-outcome idempotency requirement. The repetition makes this a reproducible reasoning-quality observation for this configuration.
No comparator was run after the frozen stop condition fired. The evidence therefore supports these claims only:
It would be incorrect to conclude from this run alone that the failure was caused by W2, the FP4 correction pool, vLLM-MoET, checkpoint-native sampling, or the absence of speculative decoding.
Additional MoET observations
Evidence availability
The original run archive is retained privately and is not part of this public report because it contains local host identifiers and filesystem paths. If an upstream maintainer needs the complete prompts, full response text, launcher, logs, or raw timing records, a separate sanitized evidence package can be prepared with relative filenames and host-specific details removed.