What will GPT-5's context size be? (2025)
16
963
2026
0.4%
0
0.4%
2k
0.4%
4k
0.4%
8k
0.4%
16k
1.6%
32k
3%
64k
5%
128k
16%
256k
24%
512k
35%
1024k
9%
2048k
4%
4096k

When OpenAI announces GPT-5, this market resolves to the largest context size measured in tokens that they announce support for.

GPT-3: 2048 tokens

GPT-3.5: 4096

GPT-4: 8k, 32k

GPT-5: ???

Anthropic's Claude announced a 100k variant, there are rumors of upcoming 1 million context size models, and surely OpenAI would want the most impressive-sounding model on release.

In the unexpected case they don't mention a specific context size or their architecture is changed so fixed context sizes no longer make sense, I'll wait until I have access and test its recall using very large documents.

If the largest context size isn't on this table, then this market resolves to a weighting of the surrounding entries. k is a multiplier of size 1024. GPT-4 would resolve "32k". Claude would resolve "log2(100k) = 16.61, so 2^16 = 64k would get weight 39% and 2^17 = 128k would get weight 61%".

Get แน€200 play money
Sort by:

There's now a standard test suite for the kind of recall test I was thinking of doing: How Long Can Open-Source LLMs Truly Promise on Context Length? | LMSYS Org

Leaving it as a comment here so I can remember to find it again in 2 years, if it's needed.

This should be a higher/lower market with a log scale IMO

@ShadowyZephyr This is an intentional choice because it allows higher leverage if you have a strong opinion on a narrow numerical range.

@Mira I heard from other people that the math of the multi-choice markets is not good for compensating people who make correct bets early on.

@ShadowyZephyr I would disagree with them, but I usually don't debate people. You can bet on @firstuserhere 's binary markets if you like, since I stole his market idea for this.

By testing recall, how would that work for an RNN, having theoretically infinite context

@dmayhem93 It would resolve to the largest entry if it can pass the test at any size without errors, in a single API call.

If it has an increasing error rate like RNNs often do, I'll resolve to the highest size I get at least 50% successful recall.

It will be a simple "locate a matching entry" task, so even if its performance degrades for more complex reasoning it's likely to be able to pass as having a high context size.