# OpenAI o1 - Core.Today AI API

> OpenAI's most advanced reasoning model. Uses extended thinking time to solve complex problems in science, coding, and math with exceptional accuracy.

- **Provider**: OpenAI
- **Model ID**: o1
- **Category**: LLM
- **Credits**: 15 per 1K tokens (avg)
- **Speed**: Slow
- **Quality**: Ultra

## Model Specifications
- **Context Window**: 200K tokens
- **Max Output**: 100K tokens
- **Training Cutoff**: 2023-10
- **Supported Formats**: text, json, markdown
- **Compatible SDK**: OpenAI

### Capabilities
- Vision (image input)
- Function Calling
- Streaming
- JSON Mode
- System Prompt

### Token Pricing (per 1M tokens)
- **Input Tokens**: 27,870 credits ($18.58)
- **Output Tokens**: 111,480 credits ($74.32)
- **Cached Tokens**: 13,935 credits ($9.29)

## Features
- Advanced chain-of-thought reasoning
- 200K context window
- 100K max output tokens
- Vision capabilities
- Function calling support
- Excels at complex problems

## Use Cases
- Scientific research
- Complex mathematics
- Advanced code generation
- Strategic planning
- Multi-step reasoning
- Research assistance

## API Endpoint

Base URL: https://api.core.today
Endpoint: POST /llm/openai/v1/chat/completions

## Authentication
Header: Authorization: Bearer YOUR_API_KEY

Note: LLM endpoints use OpenAI-compatible format with Authorization Bearer token.

## Input Parameters

### Required
- **messages**: array - Array of message objects

### Optional
- **max_completion_tokens**: integer - Maximum tokens for completion (includes reasoning tokens)
- **reasoning_effort**: string (default: medium) - Reasoning effort level: low, medium, high
  Options: low, medium, high

## Examples

### Complex Math
Solve advanced math problems
```json
{
  "model": "o1",
  "messages": [
    {
      "role": "user",
      "content": "Prove that there are infinitely many prime numbers using a proof by contradiction."
    }
  ],
  "reasoning_effort": "high"
}
```

### Algorithm Design
Design optimal algorithms
```json
{
  "model": "o1",
  "messages": [
    {
      "role": "user",
      "content": "Design an efficient algorithm to find the longest increasing subsequence in an array. Explain the time complexity and provide Python code."
    }
  ],
  "max_completion_tokens": 4000
}
```

## Response Format
```json
{
  "id": "chatcmpl-abc123",
  "object": "chat.completion",
  "choices": [
    {
      "index": 0,
      "message": {
        "role": "assistant",
        "content": "Response text here"
      },
      "finish_reason": "stop"
    }
  ],
  "usage": {
    "prompt_tokens": 100,
    "completion_tokens": 50,
    "total_tokens": 150
  }
}
```

## Tips
- Best for problems requiring deep reasoning
- Takes longer to respond due to internal reasoning
- Use reasoning_effort='high' for most complex problems
- Not optimized for simple tasks - use GPT-4o instead
- Great for step-by-step problem solving

## Documentation
https://platform.openai.com/docs/models/o1