At the longest output cap the two engines did the same on code and math: code passed every hidden test in 7 of 8 replies on both with K3.25 and 8 of 8 with K4, math 8 of 8. At the 32K cap CuteAFD finished more code tasks (0 of 8 on the vLLM fork against 4 on CuteAFD with K3.25, 0 against 5 with K4), consistent with its shorter code replies (0.74x and 0.77x the vLLM fork's median length at the last cap). Descriptive: n = 8 per content type and stage.
Needles in very long prompts (exploratory)
Exploratory: one request per prompt and engine, not under a frozen protocol. tpurtell's two needle designs from his vLLM fork, a secret code near the start and six records spread from 5% to 99% of the prompt, at 256K, 512K and 1M tokens, on both engines with K3.25. Every reply finished on its own and found every needle on both engines.
Prompt
Prompt tokens
First token: vLLM fork
CuteAFD
Result: vLLM fork
CuteAFD
single-256k
262,156
62.5 s
58.0 s
found
found
six-256k
262,156
63.2 s
58.5 s
6/6 in order
6/6 in order
single-512k
524,300
132.2 s
123.2 s
found
found
six-512k
524,300
129.8 s
122.5 s
6/6 in order
6/6 in order
single-1m
1,000,012
270.5 s
255.4 s
found
found
six-1m
1,000,012
269.7 s
254.2 s
6/6 in order
6/6 in order
Receipts without reply text: results/2026-10-27-long-context-pilot. It shows that both engines accept and answer 1M-token prompts; it does not rank them.
Long output: replies up to 128K tokens
Four task types with machine checks: multi-file Python projects with hidden tests, MATH-500 level-5 problems, 10,000-12,000-word essays, and product catalogues as JSON. Each stage raises the output cap; L3s repeats one prompt per type one request at a time. K3.25 ran 8 requests in flight with caps of 8K, 32K and 128K tokens; K4 ran 2 in flight with caps of 8,192, 32,768 and 130,048, because K4's grid was common to its protocol's arms (Method). Math replies were short on both: median 566 (vLLM fork) and 634 (CuteAFD) tokens at the last cap on K3.25.
K3.25: long-output checks and reply length, both engines (more passing is better; descriptive, small n)
What this shows. Top: how many of the n replies passed their check, per stage and content type (8 requests in flight). Bottom: CuteAFD's median reply length divided by the vLLM fork's.
vLLM forkCuteAFDvLLM fork (length 1.0)
Passed, out of n
Median reply length, CuteAFD ÷ vLLM fork
How to use it. Read the long-cap rows (L3, L3s): where the two marks sit together the engines did the same; with n = 8, one or two replies apart is not evidence of a difference.
Table view: the exact numbers
Stage
Content
n per engine
vLLM: passed
CuteAFD: passed
vLLM: finished / at cap
CuteAFD: finished / at cap
vLLM median tokens
CuteAFD median tokens
Length ratio
L1
code
8
0/8
0/8
0 / 8
0 / 8
8,192
8,192
1.00x
L1
reasoning
8
8/8
8/8
8 / 0
8 / 0
626
596
0.95x
L1
prose
8
0/8
0/8
0 / 8
0 / 8
8,192
8,192
1.00x
L1
JSON
8
0/8
0/8
0 / 8
0 / 8
8,192
8,192
1.00x
L2
code
8
0/8
4/8
0 / 8
4 / 4
32,768
32,692
1.00x
L2
reasoning
8
8/8
8/8
8 / 0
8 / 0
802
614
0.77x
L2
prose
8
1/8
0/8
1 / 7
0 / 8
32,768
32,768
1.00x
L2
JSON
8
2/8
2/8
2 / 6
2 / 6
32,768
32,768
1.00x
L3
code
8
7/8
7/8
8 / 0
8 / 0
51,298
38,190
0.74x
L3
reasoning
8
8/8
8/8
8 / 0
8 / 0
566
634
1.12x
L3
prose
8
8/8
8/8
8 / 0
8 / 0
48,832
39,344
0.81x
L3
JSON
8
6/8
4/8
6 / 2
7 / 1
74,589
67,381
0.90x
L3s
code
1
1/1
1/1
1 / 0
1 / 0
85,441
56,847
0.67x
L3s
reasoning
1
1/1
1/1
1 / 0
1 / 0
675
629
0.93x
L3s
prose
1
1/1
1/1
1 / 0
1 / 0
30,382
33,168
1.09x
L3s
JSON
1
1/1
1/1
1 / 0
1 / 0
17,151
12,367
0.72x
Passed: code, every hidden test passes; reasoning, the correct MATH-500 answer; prose, the reply finished on its own; JSON, schema, count and ids valid. Descriptive: 4 prompts per content type, 2 seeds each (n = 8; 1 at L3s). No interval is published for these counts or for the length ratio. The code, JSON and prose tasks were sized for thinking off: at the first two caps, and for the 1,030-record JSON task at the last, the reasoning leaves too little room for the answer, so those cells measure finishing against the cap rather than task completion.
K4: long-output checks and reply length, both engines (more passing is better; descriptive, small n)
What this shows. Top: how many of the n replies passed their check, per stage and content type (2 requests in flight). Bottom: CuteAFD's median reply length divided by the vLLM fork's.
vLLM forkCuteAFDvLLM fork (length 1.0)
Passed, out of n
Median reply length, CuteAFD ÷ vLLM fork
How to use it. Read the long-cap rows (L3, L3s): where the two marks sit together the engines did the same; with n = 8, one or two replies apart is not evidence of a difference.
Table view: the exact numbers
Stage
Content
n per engine
vLLM: passed
CuteAFD: passed
vLLM: finished / at cap
CuteAFD: finished / at cap
vLLM median tokens
CuteAFD median tokens
Length ratio
L1
code
8
0/8
0/8
0 / 8
0 / 8
8,192
8,192
1.00x
L1
reasoning
8
8/8
8/8
8 / 0
8 / 0
536
631
1.18x
L1
prose
8
0/8
0/8
0 / 8
0 / 8
8,192
8,192
1.00x
L1
JSON
8
0/8
0/8
0 / 8
0 / 8
8,192
8,192
1.00x
L2
code
8
0/8
5/8
0 / 8
5 / 3
32,768
31,018
0.95x
L2
reasoning
8
8/8
8/8
8 / 0
8 / 0
599
624
1.04x
L2
prose
8
2/8
2/8
2 / 6
2 / 6
32,768
32,768
1.00x
L2
JSON
8
2/8
2/8
2 / 6
2 / 6
32,768
32,768
1.00x
L3
code
8
8/8
8/8
8 / 0
8 / 0
51,343
39,378
0.77x
L3
reasoning
8
8/8
8/8
8 / 0
8 / 0
706
558
0.79x
L3
prose
8
7/8
8/8
7 / 1
8 / 0
32,764
34,842
1.06x
L3
JSON
8
5/8
3/8
6 / 2
7 / 1
66,812
55,715
0.83x
L3s
code
1
0/1
1/1
1 / 0
1 / 0
55,168
64,335
1.17x
L3s
reasoning
1
1/1
1/1
1 / 0
1 / 0
639
638
1.00x
L3s
prose
1
1/1
1/1
1 / 0
1 / 0
29,505
33,344
1.13x
L3s
JSON
1
1/1
1/1
1 / 0
1 / 0
15,788
8,596
0.54x
Passed: code, every hidden test passes; reasoning, the correct MATH-500 answer; prose, the reply finished on its own; JSON, schema, count and ids valid. Descriptive: 4 prompts per content type, 2 seeds each (n = 8; 1 at L3s). No interval is published for these counts or for the length ratio. The code, JSON and prose tasks were sized for thinking off: at the first two caps, and for the 1,030-record JSON task at the last, the reasoning leaves too little room for the answer, so those cells measure finishing against the cap rather than task completion.