Skip to content

Compare models

Put up to 4 models beside each other — token prices, context windows, capabilities and provider, from the same catalogue the model pages read.

  1. mai-ds-r1:freeNot in the catalogueRemove
  2. GPT-6 LunaOpenAIRemove
  3. Claude Fable 5.1AnthropicRemove
mai-ds-r1:free vs gpt-6-luna vs claude-fable-5.1
Attributemai-ds-r1:freeNot in the catalogueGPT-6 Lunagpt-6-lunaClaude Fable 5.1claude-fable-5.1
Pricing
Input—$0.10 / 1M$10.00 / 1M
Output—$0.50 / 1M$50.00 / 1M
Cache Write (5m)—$0.10 / 1M$12.50 / 1M
Cache Write (1h)—$0.10 / 1M$20.00 / 1M
Cache Read—$0.10 / 1M$0.25 / 1M
Web Search—$0 / 1M$0 / 1M
Context
Max context—1.1M1M
Max output—N/AN/A
Capabilities
Vision—YesYes
Function Calling—YesYes
JSON Mode—YesYes
Streaming—YesYes
Catalogue
Provider—OpenAIAnthropic
Category—chatchat
Charge type—Pay As You GoPay As You Go
Released———
Description
Summary—GPT-6 Luna is the fast, cost-efficient model in OpenAI's GPT-6 series, optimized for high-volume and latency-sensitive workloads such as chat, classification, and lightweight agentic tasks. It combines low-cost, responsive inference with the GPT-6 family’s improvements in factual reliability and clear, concise communication. At higher reasoning effort, GPT-6 Luna can also handle complex software engineering and computer-use workflows that previously required a Sol-tier model, making it a versatile choice for scalable production applications that need to balance speed, cost, and capability.Claude Fable 5.1 is an upgraded version of Fable 5, delivering broad improvements with particularly strong gains in agentic coding, long-running workflows, and professional knowledge work. It excels at large code refactors, front-end and visual code generation, financial analysis, and complex analytical tasks. Compared with Fable 5, it also produces more concise plans and summaries while maintaining strong performance across extended tasks, making it a natural upgrade for existing Fable workflows and a strong option alongside Opus 5 for reasoning-intensive applications.